com.google.common.collect.RegularImmutableMultiset java code examples

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 Charset c =String charsetName;Charset.forName(charsetName)
Charset.defaultCharset()
ContentType contentType;contentType.getCharset()
Smart code suggestions by Tabnine
}

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));
}

Javadoc

Implementation of ImmutableMultiset with zero or more elements.

Most used methods

Popular in Java

Finding current android device location
setContentView (Activity)
orElseThrow (Optional)
Return the contained value, if present, otherwise throw an exception to be created by the provided s
scheduleAtFixedRate (ScheduledExecutorService)
FileWriter (java.io)
A specialized Writer that writes to a file in the file system. All write requests made by calling me
GregorianCalendar (java.util)
GregorianCalendar is a concrete subclass of Calendarand provides the standard calendar used by most
ConcurrentHashMap (java.util.concurrent)
A plug-in replacement for JDK1.5 java.util.concurrent.ConcurrentHashMap. This version is based on or
Semaphore (java.util.concurrent)
A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
ZipFile (java.util.zip)
This class provides random read access to a zip file. You pay more to read the zip file's central di
DateTimeFormat (org.joda.time.format)
Factory that creates instances of DateTimeFormatter from patterns and styles. Datetime formatting i
Top 12 Jupyter Notebook Extensions

How to useRegularImmutableMultiset in com.google.common.collect

Best Java code snippets using com.google.common.collect.RegularImmutableMultiset (Showing top 18 results out of 315)

How to use
RegularImmutableMultiset
in
com.google.common.collect