Cross Reference: /external/guava/guava/src/com/google/common/collect/Maps.java

Lines Matching refs:entrySet
361     for (Entry<? extends K, ? extends V> entry : left.entrySet()) {
550     for (Entry<? extends K, ? extends V> entry : left.entrySet()) {
730    * @param entrySet the entries for which to return an unmodifiable view
734       Set<Entry<K, V>> entrySet) {
736         Collections.unmodifiableSet(entrySet));
1202     Set<Entry<K, V2>> entrySet;
1204     @Override public Set<Entry<K, V2>> entrySet() {
1205       Set<Entry<K, V2>> result = entrySet;
1207         entrySet = result = new EntrySet<K, V2>() {
1214                 fromMap.entrySet().iterator();
1289    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1336    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1381    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1426    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1471    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1511    * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
1583       for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
1599       return entrySet().isEmpty();
1615         final Iterator<Entry<K, V>> entryIterator = entrySet().iterator();
1630         return entrySet().size();
1634         entrySet().clear();
1638         return entrySet().isEmpty();
1642         Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1656         Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1670         Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1761     Set<Entry<K, V>> entrySet;
1763     @Override public Set<Entry<K, V>> entrySet() {
1764       Set<Entry<K, V>> result = entrySet;
1766           ? entrySet = Sets.filter(unfiltered.entrySet(), predicate)
1798       filteredEntrySet = Sets.filter(unfiltered.entrySet(), predicate);
1801     Set<Entry<K, V>> entrySet;
1803     @Override public Set<Entry<K, V>> entrySet() {
1804       Set<Entry<K, V>> result = entrySet;
1805       return (result == null) ? entrySet = new EntrySet() : result;
1894         Iterator<Entry<K, V>> iterator = unfiltered.entrySet().iterator();
1918    * entrySet().isEmpty()} instead of {@code size() == 0} to speed up
1926      * Creates the entry set to be returned by {@link #entrySet()}. This method
1927      * is invoked at most once on a given map, at the time when {@code entrySet}
1932     private Set<Entry<K, V>> entrySet;
1934     @Override public Set<Entry<K, V>> entrySet() {
1935       Set<Entry<K, V>> result = entrySet;
1937         entrySet = result = createEntrySet();
1973      * <p>The implementation returns {@code entrySet().isEmpty()}.
1978       return entrySet().isEmpty();
2058       return map.entrySet().equals(o.entrySet());
2067     return Sets.hashCodeImpl(map.entrySet());
2085     for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) {
2094     for (Entry<?, ?> entry : map.entrySet()) {
2106     for (Entry<?, ?> entry : map.entrySet()) {
2118       return Iterators.transform(map().entrySet().iterator(),
2161       return Iterators.transform(map().entrySet().iterator(),
2173         for (Entry<K, V> entry : map().entrySet()) {
2188         for (Entry<K, V> entry : map().entrySet()) {
2202         for (Entry<K, V> entry : map().entrySet()) {