| /external/guava/guava/src/com/google/common/collect/ |
| FilteredKeySetMultimap.java | 67 return new EntrySet();
70 class EntrySet extends Entries implements Set<Entry<K, V>> {
|
| WellBehavedMap.java | 29 * intention of using its {@code entrySet()} method, you should
39 private Set<Entry<K, V>> entrySet;
47 * intercepts its {@code entrySet()} method by taking the
59 @Override public Set<Entry<K, V>> entrySet() {
60 Set<Entry<K, V>> es = entrySet;
64 return entrySet = new EntrySet();
67 private final class EntrySet extends Maps.EntrySet<K, V> {
|
| RegularImmutableSortedMap.java | 51 return new EntrySet();
54 private class EntrySet extends ImmutableMapEntrySet<K, V> {
73 return EntrySet.this;
|
| AbstractMultiset.java | 34 * this class and implementing the {@link Multiset#entrySet()} method, plus
39 * the set returned by {@link Multiset#entrySet()}, as do many methods acting on
56 return entrySet().isEmpty();
69 for (Entry<E> entry : entrySet()) {
164 private transient Set<Entry<E>> entrySet;
166 @Override public Set<Entry<E>> entrySet() {
167 Set<Entry<E>> result = entrySet;
169 entrySet = result = createEntrySet();
174 class EntrySet extends Multisets.EntrySet<E>
[all...] |
| RegularImmutableMap.java | 185 return new EntrySet();
189 private class EntrySet extends ImmutableMapEntrySet<K, V> {
|
| AbstractMultimap.java | 113 return new EntrySet();
131 private class EntrySet extends Entries implements Set<Entry<K, V>> {
|
| ImmutableMultiset.java | 195 return copyFromEntries(multiset.entrySet());
239 final Iterator<Entry<E>> entryIterator = entrySet().iterator();
323 for (Multiset.Entry<E> entry : entrySet()) {
335 return Sets.hashCodeImpl(entrySet());
339 return entrySet().toString();
342 private transient ImmutableSet<Entry<E>> entrySet;
345 public ImmutableSet<Entry<E>> entrySet() {
346 ImmutableSet<Entry<E>> es = entrySet;
347 return (es == null) ? (entrySet = createEntrySet()) : es;
351 return isEmpty() ? ImmutableSet.<Entry<E>>of() : new EntrySet();
[all...] |
| AbstractBiMap.java | 161 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
211 return Maps.keyIterator(entrySet().iterator());
234 return Maps.valueIterator(entrySet().iterator());
250 private transient Set<Entry<K, V>> entrySet;
252 @Override public Set<Entry<K, V>> entrySet() {
253 Set<Entry<K, V>> result = entrySet;
254 return (result == null) ? entrySet = new EntrySet() : result;
257 private class EntrySet extends ForwardingSet<Entry<K, V>> {
258 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
[all...] |
| ImmutableSetMultimap.java | 228 : multimap.asMap().entrySet()) {
270 builderMultimap.asMap().entrySet());
323 : multimap.asMap().entrySet()) {
421 ? (entries = new EntrySet<K, V>(this))
425 private static final class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> {
428 EntrySet(ImmutableSetMultimap<K, V> multimap) {
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| CostAllocator.h | 91 EntrySetT EntrySet;
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); }
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey);
99 if (I != EntrySet.end())
103 EntrySet.insert(P.get());
|
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| ImmutableMultiset.java | 194 return copyFromEntries(multiset.entrySet());
238 final Iterator<Entry<E>> entryIterator = entrySet().iterator();
324 return Sets.hashCodeImpl(entrySet());
328 return entrySet().toString();
331 private transient ImmutableSet<Entry<E>> entrySet;
334 public ImmutableSet<Entry<E>> entrySet() {
335 ImmutableSet<Entry<E>> es = entrySet;
336 return (es == null) ? (entrySet = createEntrySet()) : es;
340 return isEmpty() ? ImmutableSet.<Entry<E>>of() : new EntrySet();
345 private final class EntrySet extends ImmutableSet<Entry<E>>
[all...] |
| ImmutableSetMultimap.java | 222 : multimap.asMap().entrySet()) {
264 builderMultimap.asMap().entrySet());
317 : multimap.asMap().entrySet()) {
415 ? (entries = new EntrySet<K, V>(this))
419 private static final class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> {
422 EntrySet(ImmutableSetMultimap<K, V> multimap) {
|
| AbstractBiMap.java | 157 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
207 return Maps.keyIterator(entrySet().iterator());
230 return Maps.valueIterator(entrySet().iterator());
246 private transient Set<Entry<K, V>> entrySet;
248 @Override public Set<Entry<K, V>> entrySet() {
249 Set<Entry<K, V>> result = entrySet;
250 return (result == null) ? entrySet = new EntrySet() : result;
253 private class EntrySet extends ForwardingSet<Entry<K, V>> {
254 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
[all...] |
| /libcore/ojluni/src/main/java/sun/misc/ |
| SoftCache.java | 224 return entrySet().size();
231 return entrySet().isEmpty();
391 private class EntrySet extends AbstractSet {
392 Set hashEntries = hash.entrySet();
449 private Set entrySet = null;
454 public Set entrySet() {
455 if (entrySet == null) entrySet = new EntrySet();
456 return entrySet;
[all...] |
| /external/protobuf/java/src/main/java/com/google/protobuf/ |
| SmallSortedMap.java | 64 * object returned by {@link #entrySet()} adheres to the same contract but is
144 // The EntrySet is a stateless view of the Map. It's initialized the first
146 private volatile EntrySet lazyEntrySet;
197 overflowEntries.entrySet();
302 getOverflowEntriesMutable().entrySet().iterator();
352 public Set<Map.Entry<K, V>> entrySet() {
354 lazyEntrySet = new EntrySet();
470 private class EntrySet extends AbstractSet<Map.Entry<K, V>> {
578 lazyOverflowIterator = overflowEntries.entrySet().iterator();
|
| /frameworks/base/core/java/android/util/ |
| MapCollections.java | 33 EntrySet mEntrySet;
165 final class EntrySet implements Set<Map.Entry<K, V>> {
531 mEntrySet = new EntrySet();
|
| /frameworks/support/compat/java/android/support/v4/util/ |
| MapCollections.java | 31 EntrySet mEntrySet;
163 final class EntrySet implements Set<Map.Entry<K, V>> {
530 mEntrySet = new EntrySet();
|
| /libcore/ojluni/src/main/java/java/util/ |
| EnumMap.java | 41 * {@link #entrySet()}, and {@link #values()}).
370 private transient Set<Map.Entry<K,V>> entrySet = null;
463 public Set<Map.Entry<K,V>> entrySet() {
464 Set<Map.Entry<K,V>> es = entrySet;
468 return entrySet = new EntrySet();
471 private class EntrySet extends AbstractSet<Map.Entry<K,V>> {
732 result.entrySet = null;
|
| Hashtable.java | 514 for (Map.Entry<? extends K, ? extends V> e : t.entrySet())
545 t.entrySet = null;
571 Iterator<Map.Entry<K,V>> it = entrySet().iterator();
613 private transient volatile Set<Map.Entry<K,V>> entrySet = null;
671 public Set<Map.Entry<K,V>> entrySet() {
672 if (entrySet==null)
673 entrySet = Collections.synchronizedSet(new EntrySet(), this);
674 return entrySet;
677 private class EntrySet extends AbstractSet<Map.Entry<K,V>>
[all...] |
| HashMap.java | 485 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
570 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
624 * Special version of remove for EntrySet using {@code Map.Entry.equals()}
720 result.entrySet = null;
[all...] |
| IdentityHashMap.java | 510 for (Entry<? extends K, ? extends V> e : m.entrySet())
633 * <tt>this.entrySet().equals(m.entrySet())</tt>.
662 return entrySet().equals(m.entrySet());
671 * <tt>entrySet()</tt> view. This ensures that <tt>m1.equals(m2)</tt>
678 * <tt>entrySet</tt> method, it is possible that the contractual
710 m.entrySet = null;
[all...] |
| WeakHashMap.java | 547 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
834 private transient Set<Map.Entry<K,V>> entrySet = null;
[all...] |
| TreeMap.java | 201 buildFromSorted(m.size(), m.entrySet().iterator(), null, null);
320 buildFromSorted(mapSize, map.entrySet().iterator(),
665 clone.entrySet = null;
671 clone.buildFromSorted(size, entrySet().iterator(), null, null);
812 private transient EntrySet entrySet = null;
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/ |
| LocalCache.java | 145 for (Map.Entry<? extends K, ? extends V> entry : m.entrySet()) {
153 for (Map.Entry<K, Timestamped<V>> entry : cachingHashMap.entrySet()) {
546 this.iterator = LocalCache.this.cachingHashMap.entrySet().iterator();
657 Set<Entry<K, V>> entrySet;
660 public Set<Entry<K, V>> entrySet() {
662 Set<Entry<K, V>> es = entrySet;
663 return (es != null) ? es : (entrySet = new EntrySet(this));
791 * Abstraction layer for the EntrySet, which redirects to cache methods.
793 private final class EntrySet extends AbstractCacheSet<Entry<K, V>>
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 351 private transient EntrySet<K,V> entrySet;
364 entrySet = null;
[all...] |
