Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 3 of 3 for AbstractMultiset (0.37 seconds)

  1. android/guava/src/com/google/common/collect/Multimaps.java

          builder.put(keyFunction.apply(value), value);
        }
        return builder.build();
      }
    
      static class Keys<K extends @Nullable Object, V extends @Nullable Object>
          extends AbstractMultiset<K> {
        @Weak final Multimap<K, V> multimap;
    
        Keys(Multimap<K, V> multimap) {
          this.multimap = multimap;
        }
    
        @Override
        Iterator<Multiset.Entry<K>> entryIterator() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86K bytes
    - Click Count (0)
  2. guava/src/com/google/common/collect/Multimaps.java

          builder.put(keyFunction.apply(value), value);
        }
        return builder.build();
      }
    
      static class Keys<K extends @Nullable Object, V extends @Nullable Object>
          extends AbstractMultiset<K> {
        @Weak final Multimap<K, V> multimap;
    
        Keys(Multimap<K, V> multimap) {
          this.multimap = multimap;
        }
    
        @Override
        Iterator<Multiset.Entry<K>> entryIterator() {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 86.3K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/collect/TreeMultiset.java

        successor(b, c);
      }
    
      /*
       * TODO(jlevy): Decide whether entrySet() should return entries with an equals() method that
       * calls the comparator to compare the two keys. If that change is made,
       * AbstractMultiset.equals() can simply check whether two multisets have equal entry sets.
       */
    
      /**
       * @serialData the comparator, the number of distinct elements, the first element, its count, the
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
Back to Top