/external/guava/src/com/google/common/collect/ |
EnumMultiset.java | 30 * Multiset implementation backed by an {@link EnumMap}. 46 * @param elements the elements that the multiset should contain 54 EnumMultiset<E> multiset local 56 Iterables.addAll(multiset, elements); 57 return multiset;
|
HashMultiset.java | 28 * Multiset implementation backed by a {@link HashMap}. 59 * @param elements the elements that the multiset should contain 62 HashMultiset<E> multiset = local 64 Iterables.addAll(multiset, elements); 65 return multiset;
|
LinkedHashMultiset.java | 28 * A {@code Multiset} implementation with predictable iteration order. Its 30 * element was added. When the multiset contains multiple instances of an 33 * the multiset, the element will appear at the end of the iteration. 65 * @param elements the elements that the multiset should contain 69 LinkedHashMultiset<E> multiset = local 71 Iterables.addAll(multiset, elements); 72 return multiset;
|
ConcurrentHashMultiset.java | 39 * A multiset that supports concurrent modifications and that provides atomic 40 * versions of most {@code Multiset} operations (exceptions where noted). Null 82 * @param elements the elements that the multiset should contain 86 ConcurrentHashMultiset<E> multiset = ConcurrentHashMultiset.create(); local 87 Iterables.addAll(multiset, elements); 88 return multiset; 98 * @param countMap backing map for storing the elements in the multiset and 111 * Returns the number of occurrences of {@code element} in this multiset. 129 * <p>If the data in the multiset is modified by any other threads during this 160 for (Multiset.Entry<E> entry : entrySet()) [all...] |
TreeMultiset.java | 35 * A multiset which maintains the ordering of its elements, according to either 43 * resulting multiset will violate the {@link Collection} contract, which it is 55 * Creates a new, empty multiset, sorted according to the elements' natural 56 * order. All elements inserted into the multiset must implement the 60 * the multiset. If the user attempts to add an element to the multiset that 75 * Creates a new, empty multiset, sorted according to the specified 76 * comparator. All elements inserted into the multiset must be <i>mutually 79 * e1} and {@code e2} in the multiset. If the user attempts to add an element 80 * to the multiset that violates this constraint, the {@code add(Object)} cal 102 TreeMultiset<E> multiset = create(); local [all...] |
ImmutableMultiset.java | 35 * An immutable hash-based multiset. Does not permit null elements. 39 * multiset contains multiple instances of an element, those instances are 47 implements Multiset<E> { 50 * Returns the empty immutable multiset. 60 * Returns an immutable multiset containing the given elements. 62 * <p>The multiset is ordered by the first occurrence of each element. For 63 * example, {@code ImmutableMultiset.of(2, 3, 1, 3)} yields a multiset with 73 * Returns an immutable multiset containing the given elements. 75 * <p>The multiset is ordered by the first occurrence of each element. For 77 * a multiset with elements in the order {@code 2, 3, 3, 1} 101 Multiset<? extends E> multiset = (elements instanceof Multiset) local 142 Multiset<E> multiset = LinkedHashMultiset.create(); local 284 final ImmutableMultiset<E> multiset; field in class:EntrySet [all...] |
Serialization.java | 42 * Reads a count corresponding to a serialized map, multiset, or multimap. It 45 * multiset serialized by {@link 46 * #writeMultiset(Multiset, ObjectOutputStream)}, or the number of distinct 105 * Stores the contents of a multiset in an output stream, as part of 114 Multiset<E> multiset, ObjectOutputStream stream) throws IOException { 115 int entryCount = multiset.entrySet().size(); 117 for (Multiset.Entry<E> entry : multiset.entrySet()) { 124 * Populates a multiset by reading an input stream, as part o [all...] |
Synchronized.java | 476 * Returns a synchronized (thread-safe) multiset backed by the specified 477 * multiset using the specified mutex. In order to guarantee serial access, it 478 * is critical that <b>all</b> access to the backing multiset is accomplished 479 * through the returned multiset. 482 * mutex when iterating over the returned multiset: <pre> {@code 484 * Multiset<E> s = Synchronized.multiset( 496 * @param multiset the multiset to be wrapped 497 * @return a synchronized view of the specified multiset 499 private static <E> Multiset<E> multiset( method in class:Synchronized [all...] |
AbstractMultimap.java | 940 private transient Multiset<K> multiset; typedefs 942 public Multiset<K> keys() { 943 Multiset<K> result = multiset; 944 return (result == null) ? multiset = new MultisetView() : result; 947 /** Multiset view that stays in sync with the multimap keys. */ 987 transient Set<Multiset.Entry<K>> entrySet; 989 @Override public Set<Multiset.Entry<K>> entrySet() { 990 Set<Multiset.Entry<K>> result = entrySet [all...] |