Home
last modified time | relevance | path

Searched refs:entrySet (Results 1 – 25 of 83) sorted by relevance

1234

/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
DTreeMapExtendTest.java152 assertEquals(tm.entrySet(), treeMap.entrySet()); in test_TreeMap_Constructor_Map()
161 assertEquals(subMap_default.entrySet(), treeMap.entrySet()); in test_TreeMap_Constructor_SortedMap()
327 Set entrySet = subMap_default.entrySet(); in test_SubMap_entrySet() local
328 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
329 assertEquals(9, entrySet.size()); in test_SubMap_entrySet()
331 entrySet = subMap_startExcluded_endExcluded.entrySet(); in test_SubMap_entrySet()
332 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
333 assertEquals(8, entrySet.size()); in test_SubMap_entrySet()
335 entrySet = subMap_startExcluded_endIncluded.entrySet(); in test_SubMap_entrySet()
336 assertFalse(entrySet.isEmpty()); in test_SubMap_entrySet()
[all …]
DWeakHashMapTest.java34 public Set entrySet() { in entrySet() method in WeakHashMapTest.MockMap
176 Set<Map.Entry<Object, Object>> entrySet = weakMap.entrySet(); in test_entrySet() local
178 entrySet.size()); in test_entrySet()
179 Iterator<Map.Entry<Object, Object>> it = entrySet.iterator(); in test_entrySet()
186 assertTrue("Assert 3: Entry not in entry set", entrySet in test_entrySet()
199 entrySet.size()); in test_entrySet()
200 assertSame("Assert 5: Entries not identical", entrySet.iterator() in test_entrySet()
201 .next(), entrySet.iterator().next()); in test_entrySet()
205 int size = entrySet.size(); in test_entrySet()
206 it = entrySet.iterator(); in test_entrySet()
[all …]
DSortedMapTestBase.java77 Set<Map.Entry<Integer,Integer>> refSet = ref.entrySet(); in testEntrySet()
78 Set<Map.Entry<Integer,Integer>> mapSet = map.entrySet(); in testEntrySet()
85 assertEquals(ref.entrySet(), map.entrySet()); in testEntrySet()
230 Map.Entry<Integer, Integer> refE = ref.entrySet().iterator().next(); in testSubMap()
231 Map.Entry<Integer, Integer> mapE = map.entrySet().iterator().next(); in testSubMap()
268 assertTrue("Should not have entries", !map.entrySet().iterator() in testIsEmpty2()
275 assertTrue("Should not have entries", !map.entrySet().iterator() in testIsEmpty2()
282 assertFalse(map.entrySet().iterator().hasNext()); in testIsEmpty2()
332 assertEquals(ref.entrySet(), map.entrySet()); in testViews()
333 compareIterators(ref.entrySet(), map.entrySet()); in testViews()
DAbstractMapTest.java68 public Set entrySet() { in entrySet() method in AbstractMapTest.MyMap
159 public Set entrySet() { in entrySet() method in AbstractMapTest.MocAbstractMap
258 public Set entrySet() { in test_clone() method in AbstractMapTest.MyMap
259 return map.entrySet(); in test_clone()
281 Map.Entry entry = (Map.Entry) map.entrySet().iterator().next(); in test_clone()
295 public Set entrySet() { in entrySet() method in AbstractMapTest.AMT
376 testNullsOnView(nullHostile.entrySet());
DHashMapTest.java40 public Set entrySet() { in entrySet() method in HashMapTest.MockMap
49 public Set entrySet() { in entrySet() method in HashMapTest.MockMapNull
295 Set s = hm.entrySet(); in test_entrySet()
377 Object[] entries = map.entrySet().toArray(); in test_proxies()
379 assertTrue("Failed to find proxy association", map.entrySet().contains(entry)); in test_proxies()
731 Set entrySet = map.entrySet(); in test_EntrySet() local
732 Iterator e = entrySet.iterator(); in test_EntrySet()
736 assertTrue(entrySet.contains(copyEntry)); in test_EntrySet()
738 entrySet.remove(copyEntry); in test_EntrySet()
739 assertFalse(entrySet.contains(copyEntry)); in test_EntrySet()
DSimpleEntryTest.java40 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_Constructor_LEntry()
46 entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_Constructor_LEntry()
86 Entry entryToPut = (Entry)map.entrySet().iterator().next(); in test_SimpleEntry_equals()
/external/guava/src/com/google/common/collect/
DAbstractMultiset.java53 public abstract Set<Entry<E>> entrySet(); in entrySet() method in AbstractMultiset
59 for (Entry<E> entry : entrySet()) { in size()
66 return entrySet().isEmpty(); in isEmpty()
87 this.entryIterator = entrySet().iterator(); in MultisetIterator()
121 for (Entry<E> entry : entrySet()) { in count()
169 for (Entry<? extends E> entry : that.entrySet()) { in addAll()
188 Iterator<Entry<E>> entries = entrySet().iterator(); in retainAll()
201 entrySet().clear(); in clear()
226 final Iterator<Entry<E>> entryIterator = entrySet().iterator(); in iterator()
240 return entrySet().size(); in size()
[all …]
DMultisets.java86 transient Set<Multiset.Entry<E>> entrySet; field in Multisets.UnmodifiableMultiset
89 @Override public Set<Multiset.Entry<E>> entrySet() { in entrySet() method in Multisets.UnmodifiableMultiset
90 Set<Multiset.Entry<E>> es = entrySet; in entrySet()
94 ? entrySet = (Set) Collections.unmodifiableSet(delegate.entrySet()) in entrySet()
224 transient Set<Entry<E>> entrySet;
226 public Set<Entry<E>> entrySet() {
227 Set<Entry<E>> es = entrySet;
228 return (es == null) ? entrySet = new EntrySet() : es;
355 @Override public Set<Entry<E>> entrySet() {
356 return entrySet;
[all …]
DMaps.java298 for (Entry<? extends K, ? extends V> entry : left.entrySet()) { in difference()
510 final Set<Entry<K, V>> entrySet) { in unmodifiableEntrySet() argument
512 entrySet)); in unmodifiableEntrySet()
775 EntrySet entrySet;
777 @Override public Set<Entry<K, V2>> entrySet() {
778 EntrySet result = entrySet;
780 entrySet = result = new EntrySet();
792 = fromMap.entrySet().iterator();
992 for (Entry<? extends K, ? extends V> entry : map.entrySet()) {
1008 return entrySet().isEmpty();
[all …]
DImmutableMultiset.java113 for (Entry<? extends E> entry : multiset.entrySet()) { in copyOfInternal()
174 = map.entrySet().iterator(); in iterator()
249 for (Entry<?> entry : that.entrySet()) { in equals()
265 return entrySet().toString(); in toString()
276 private transient ImmutableSet<Entry<E>> entrySet;
278 public Set<Entry<E>> entrySet() { in entrySet() method
279 ImmutableSet<Entry<E>> es = entrySet; in entrySet()
280 return (es == null) ? (entrySet = new EntrySet<E>(this)) : es; in entrySet()
292 = multiset.map.entrySet().iterator(); in iterator()
475 for (Entry<? extends E> entry : multiset.entrySet()) {
DConstrainedMap.java38 private volatile Set<Entry<K, V>> entrySet; field in ConstrainedMap
49 @Override public Set<Entry<K, V>> entrySet() { in entrySet() method in ConstrainedMap
50 if (entrySet == null) { in entrySet()
51 entrySet = constrainedEntrySet(delegate.entrySet(), constraint); in entrySet()
53 return entrySet; in entrySet()
60 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
DSingletonImmutableMap.java78 private transient ImmutableSet<Entry<K, V>> entrySet; field in SingletonImmutableMap
80 @Override public ImmutableSet<Entry<K, V>> entrySet() { in entrySet() method in SingletonImmutableMap
81 ImmutableSet<Entry<K, V>> es = entrySet; in entrySet()
82 return (es == null) ? (entrySet = ImmutableSet.of(entry())) : es; in entrySet()
133 Entry<?, ?> entry = that.entrySet().iterator().next(); in equals()
DImmutableMap.java184 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
239 Entry<K, V>[] entries = map.entrySet().toArray(new Entry[0]); in copyOf()
312 public abstract ImmutableSet<Entry<K, V>> entrySet(); in entrySet() method in ImmutableMap
332 return this.entrySet().equals(that.entrySet()); in equals()
340 return entrySet().hashCode(); in hashCode()
361 for (Entry<?, ?> entry : map.entrySet()) { in SerializedForm()
DSynchronized.java508 private transient Set<Entry<E>> entrySet; field in Synchronized.SynchronizedMultiset
557 public Set<Entry<E>> entrySet() { in entrySet() method in Synchronized.SynchronizedMultiset
559 if (entrySet == null) { in entrySet()
560 entrySet = typePreservingSet(delegate().entrySet(), mutex); in entrySet()
562 return entrySet; in entrySet()
835 transient Set<Map.Entry<K, V>> entrySet; field in Synchronized.SynchronizedSetMultimap
861 if (entrySet == null) { in entries()
862 entrySet = set(delegate().entries(), mutex); in entries()
864 return entrySet; in entries()
1110 private transient Set<Map.Entry<K, V>> entrySet;
[all …]
DAbstractMapBasedMultiset.java79 private transient EntrySet entrySet; field in AbstractMapBasedMultiset
88 @Override public Set<Multiset.Entry<E>> entrySet() { in entrySet() method in AbstractMapBasedMultiset
89 EntrySet result = entrySet; in entrySet()
91 entrySet = result = new EntrySet(); in entrySet()
99 = backingMap.entrySet().iterator(); in iterator()
194 this.entryIterator = backingMap.entrySet().iterator();
355 = map.entrySet().iterator();
DConcurrentHashMultiset.java160 for (Multiset.Entry<E> entry : entrySet()) { in snapshot()
364 private transient EntrySet entrySet;
366 @Override public Set<Multiset.Entry<E>> entrySet() {
367 EntrySet result = entrySet;
369 entrySet = result = new EntrySet();
395 = countMap.entrySet().iterator();
DAbstractBiMap.java141 for (Entry<? extends K, ? extends V> entry : map.entrySet()) { in putAll()
190 final Iterator<Entry<K, V>> iterator = delegate.entrySet().iterator(); in iterator()
262 private transient Set<Entry<K, V>> entrySet;
264 @Override public Set<Entry<K, V>> entrySet() {
265 Set<Entry<K, V>> result = entrySet;
266 return (result == null) ? entrySet = new EntrySet() : result;
270 final Set<Entry<K, V>> esDelegate = delegate.entrySet();
DRegularImmutableMap.java117 private transient ImmutableSet<Entry<K, V>> entrySet; field in RegularImmutableMap
119 @Override public ImmutableSet<Entry<K, V>> entrySet() { in entrySet() method in RegularImmutableMap
120 ImmutableSet<Entry<K, V>> es = entrySet; in entrySet()
121 return (es == null) ? (entrySet = new EntrySet<K, V>(this)) : es; in entrySet()
DSerialization.java70 for (Map.Entry<K, V> entry : map.entrySet()) { in writeMap()
115 int entryCount = multiset.entrySet().size(); in writeMultiset()
117 for (Multiset.Entry<E> entry : multiset.entrySet()) { in writeMultiset()
166 for (Map.Entry<K, Collection<V>> entry : multimap.asMap().entrySet()) { in writeMultimap()
DForwardingMultiset.java57 public Set<Entry<E>> entrySet() { in entrySet() method in ForwardingMultiset
58 return delegate().entrySet(); in entrySet()
/external/nist-sip/java/gov/nist/core/
DMultiValueMapImpl.java56 Set pairs = map.entrySet(); in containsValue()
72 Set pairs = map.entrySet(); in clear()
85 Set pairs = map.entrySet(); in values()
113 public Set entrySet() { in entrySet() method in MultiValueMapImpl
114 return map.entrySet(); in entrySet()
/external/apache-http/src/org/apache/commons/logging/impl/
DWeakHashtable.java156 public Set entrySet() { in entrySet() method in WeakHashtable
158 Set referencedEntries = super.entrySet(); in entrySet()
250 Set entrySet = t.entrySet();
251 for (Iterator it=entrySet.iterator(); it.hasNext();) {
/external/apache-harmony/support/src/test/java/tests/support/
DSupport_UnmodifiableMapTest.java61 Set<?> entrySet = map.entrySet(); in runTest() local
62 Iterator<?> entrySetIterator = entrySet.iterator(); in runTest()
DSupport_MapTest2.java42 assertTrue("Should not have entries", !map.entrySet().iterator() in runTest()
56 assertTrue("Should not have entries", !map.entrySet().iterator() in runTest()
/external/protobuf/java/src/main/java/com/google/protobuf/
DFieldSet.java109 fields.entrySet()) { in makeImmutable()
137 return fields.entrySet().iterator(); in iterator()
342 fields.entrySet()) { in isInitialized()
384 other.fields.entrySet()) { in mergeFrom()
472 fields.entrySet()) { in writeTo()
483 fields.entrySet()) { in writeMessageSetTo()
597 fields.entrySet()) { in getSerializedSize()
609 fields.entrySet()) { in getMessageSetSerializedSize()

1234