How to use

RegularImmutableMultiset

in

com.google.common.collect

Multisets.ImmutableEntry<E>[] entryArray = new Multisets.ImmutableEntry[distinct];
if (distinct == 0) {
 return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
return hashFloodingDetected(hashTable)
  ? JdkBackedImmutableMultiset.create(ImmutableList.asImmutableList(entryArray))
  : new RegularImmutableMultiset<E>(
    entryArray, hashTable, Ints.saturatedCast(size), hashCode, null);

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 if (entries.isEmpty()) {
  return of();
 } else {
  return RegularImmutableMultiset.create(entries);
 }
}

static <E> ImmutableMultiset<E> copyFromEntries(
    Collection<? extends Entry<? extends E>> entries) {
  if (entries.isEmpty()) {
    return of();
  } else {
    return new RegularImmutableMultiset<E>(entries);
  }
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

Multisets.ImmutableEntry<E>[] entryArray = new Multisets.ImmutableEntry[distinct];
if (distinct == 0) {
 return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
return hashFloodingDetected(hashTable)
  ? JdkBackedImmutableMultiset.create(ImmutableList.asImmutableList(entryArray))
  : new RegularImmutableMultiset<E>(
    entryArray, hashTable, Ints.saturatedCast(size), hashCode, null);

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 if (entries.isEmpty()) {
  return of();
 } else {
  return RegularImmutableMultiset.create(entries);
 }
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

Multisets.ImmutableEntry<E>[] entryArray = new Multisets.ImmutableEntry[distinct];
if (distinct == 0) {
 return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
return hashFloodingDetected(hashTable)
  ? JdkBackedImmutableMultiset.create(ImmutableList.asImmutableList(entryArray))
  : new RegularImmutableMultiset<E>(
    entryArray, hashTable, Ints.saturatedCast(size), hashCode, null);

class RegularImmutableMultiset<E> extends ImmutableMultiset<E> {
 static final RegularImmutableMultiset<Object> EMPTY =
   new RegularImmutableMultiset<>(ObjectCountHashMap.create());

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

Multisets.ImmutableEntry<E>[] entryArray = new Multisets.ImmutableEntry[distinct];
if (distinct == 0) {
 return new RegularImmutableMultiset<>(entryArray, null, 0, 0, ImmutableSet.of());
return hashFloodingDetected(hashTable)
  ? JdkBackedImmutableMultiset.create(ImmutableList.asImmutableList(entryArray))
  : new RegularImmutableMultiset<E>(
    entryArray, hashTable, Ints.saturatedCast(size), hashCode, null);

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 if (entries.isEmpty()) {
  return of();
 } else {
  return RegularImmutableMultiset.create(entries);
 }
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(builder.build(), Ints.saturatedCast(size));
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 if (entries.isEmpty()) {
  return of();
 } else {
  return RegularImmutableMultiset.create(entries);
 }
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}

static <E> ImmutableMultiset<E> copyFromEntries(
  Collection<? extends Entry<? extends E>> entries) {
 long size = 0;
 ImmutableMap.Builder<E, Integer> builder = ImmutableMap.builder();
 for (Entry<? extends E> entry : entries) {
  int count = entry.getCount();
  if (count > 0) {
   // Since ImmutableMap.Builder throws an NPE if an element is null, no
   // other null checks are needed.
   builder.put(entry.getElement(), count);
   size += count;
  }
 }
 if (size == 0) {
  return of();
 }
 return new RegularImmutableMultiset<E>(
   builder.build(), Ints.saturatedCast(size));
}