/external/guava/guava-tests/test/com/google/common/collect/ |
WellBehavedMapTest.java | 39 assertTrue(map.entrySet().contains(Maps.immutableEntry(Foo.X, 1))); 40 assertTrue(map.entrySet().contains(Maps.immutableEntry(Foo.Y, new Integer(2)))); 43 assertFalse(map.entrySet().contains(Maps.immutableEntry(Foo.X, 5))); 46 assertFalse(map.entrySet().contains(Maps.immutableEntry(Foo.T, 0))); 54 for (Map.Entry<Foo, Integer> entry : map.entrySet()) { 66 Map.Entry<Foo, Integer> entry1 = Iterables.getOnlyElement(map.entrySet()); 67 Map.Entry<Foo, Integer> entry2 = Iterables.getOnlyElement(map.entrySet()); 72 Set<Map.Entry<Foo, Integer>> entrySet = map.entrySet(); 74 assertTrue(entrySet.contains(entry1)) [all...] |
ForwardingMapTest.java | 95 @Override public Set<Entry<K, V>> entrySet() { 100 .entrySet() 228 forward().entrySet(); 229 assertEquals("[entrySet]", getCalls()); 251 final Set<Map.Entry<String, Boolean>> entrySet = createMock(Set.class); 257 expect(entrySet.iterator()) 263 replay(map, entrySet); 270 @Override public Set<Entry<String, Boolean>> entrySet() { 274 return entrySet.iterator(); 279 callAllPublicMethods(Set.class, forward.entrySet()); [all...] |
AbstractBiMapTest.java | 45 protected Set<Entry<Integer, String>> entrySet; 51 entrySet = bimap.entrySet(); 255 entrySet.add(Maps.immutableEntry(1, "one")); 263 entrySet.addAll(Collections.singleton(Maps.immutableEntry(1, "one"))); 270 entrySet.clear(); 271 assertTrue(entrySet.isEmpty()); 274 entrySet.clear(); 275 assertTrue(entrySet.isEmpty()); 280 assertFalse(entrySet.contains(Maps.immutableEntry(1, "one"))) [all...] |
TreeBasedTableTest.java | 387 Set<Map.Entry<Integer, Character>> entrySet = row.entrySet(); 388 assertTrue(entrySet.contains(Maps.immutableEntry(10, 'X'))); 389 assertTrue(entrySet.contains(Maps.immutableEntry(20, 'X'))); 390 assertFalse(entrySet.contains(Maps.immutableEntry(15, 'X'))); 391 entrySet = row.tailMap(15).entrySet(); 392 assertFalse(entrySet.contains(Maps.immutableEntry(10, 'X'))); 393 assertTrue(entrySet.contains(Maps.immutableEntry(20, 'X'))); 394 assertFalse(entrySet.contains(Maps.immutableEntry(15, 'X'))) [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
MapInterfaceTest.java | 181 Set<Entry<K, V>> entrySet = map.entrySet(); 196 assertTrue(entrySet.contains(mapEntry(key, value))); 210 assertEquals(map.size(), entrySet.size()); 211 assertEquals(entrySet.size() == 0, entrySet.isEmpty()); 212 assertEquals(!entrySet.isEmpty(), entrySet.iterator().hasNext()); 213 assertFalse(entrySet.contains("foo")); 218 for (Entry<K, V> entry : entrySet) { [all...] |
SortedMapInterfaceTest.java | 102 final Set<Entry<K, V>> entrySet; 110 entrySet = map.entrySet(); 119 assertFalse(entrySet.contains(entry)); 197 List<Entry<K, V>> list = toList(map.entrySet()); 201 assertEquals(expected, toList(headMap.entrySet())); 212 List<Entry<K, V>> list = toList(map.entrySet()); 216 assertEquals(expected, toList(tailMap.entrySet())); 227 List<Entry<K, V>> list = toList(map.entrySet()); 233 assertEquals(expected, toList(subMap.entrySet())); [all...] |
/external/guava/guava-tests/test/com/google/common/cache/ |
EmptyCachesTest.java | 270 Set<Entry<Object, Object>> entries = cache.asMap().entrySet(); 284 cache.asMap().entrySet().add(entryOf(1, 1)); 303 Set<Entry<Object, Object>> entrySet = cache.asMap().entrySet(); 304 entrySet.clear(); 305 checkEmpty(entrySet); 312 Set<Entry<Object, Object>> entrySet = cache.asMap().entrySet(); 313 assertFalse(entrySet.remove(null)); 314 assertFalse(entrySet.remove(entryOf(6, 6))) [all...] |
/external/apache-harmony/support/src/test/java/tests/support/ |
Support_MapTest2.java | 42 assertTrue("Should not have entries", !map.entrySet().iterator() 56 assertTrue("Should not have entries", !map.entrySet().iterator()
|
/external/guava/guava/src/com/google/common/collect/ |
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; 168 return (result == null) ? entrySet = createEntrySet() : result; 171 class EntrySet extends Multisets.EntrySet<E> [all...] |
WellBehavedMap.java | 28 * intention of using its {@code entrySet()} method, you should 36 private Set<Entry<K, V>> entrySet; 44 * intercepts its {@code entrySet()} method by taking the 56 @Override public Set<Entry<K, V>> entrySet() { 57 Set<Entry<K, V>> es = entrySet; 61 return entrySet = Sets.transform(
|
ForwardingMap.java | 124 public Set<Entry<K, V>> entrySet() { 125 return delegate().entrySet(); 150 * the {@code iterator} method of {@link #entrySet}. If you override {@link 151 * #entrySet}, you may wish to override {@link #remove} to forward to this 161 Iterator<Entry<K, V>> entryIterator = entrySet().iterator(); 175 * method of {@link #entrySet}. In many cases, you may wish to override 181 Iterator<Entry<K, V>> entryIterator = entrySet().iterator(); 193 * ForwardingMap#entrySet}. In many cases, you may wish to override {@link 211 * of the {@code iterator} method of {@link #entrySet}. If you override {@link 212 * #entrySet}, you may wish to override {@link #containsKey} to forward t [all...] |
ForwardingMultiset.java | 81 public Set<Entry<E>> entrySet() { 82 return delegate().entrySet(); 116 * method of {@link #entrySet}. If you override {@link #entrySet}, you may 122 Iterator<Entry<E>> entryIterator = entrySet().iterator(); 131 * {@link #entrySet}. If you override {@link #entrySet}, you may wish to 137 for (Entry<?> entry : this.entrySet()) { 211 * int)}. {@link #entrySet()}. If you override any of these methods, you may 240 * ForwardingMultiset#entrySet}, and {@link ForwardingMultiset#remove(Object [all...] |
SortedMultisets.java | 157 private transient Set<Entry<E>> entrySet; 159 @Override public Set<Entry<E>> entrySet() { 160 Set<Entry<E>> result = entrySet; 161 return (result == null) ? entrySet = createEntrySet() : result; 165 return new Multisets.EntrySet<E>() { 175 return forwardMultiset().entrySet().size(); 193 return entrySet().toString();
|
SingletonImmutableMap.java | 82 private transient ImmutableSet<Entry<K, V>> entrySet; 84 @Override public ImmutableSet<Entry<K, V>> entrySet() { 85 ImmutableSet<Entry<K, V>> es = entrySet; 86 return (es == null) ? (entrySet = ImmutableSet.of(entry())) : es; 142 Entry<?, ?> entry = that.entrySet().iterator().next();
|
/libcore/support/src/test/java/tests/support/ |
Support_MapTest2.java | 42 assertTrue("Should not have entries", !map.entrySet().iterator() 56 assertTrue("Should not have entries", !map.entrySet().iterator()
|
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
TreeMapExtendTest.java | 150 assertEquals(tm.entrySet(), treeMap.entrySet()); 159 assertEquals(subMap_default.entrySet(), treeMap.entrySet()); 325 Set entrySet = subMap_default.entrySet(); 326 assertFalse(entrySet.isEmpty()); 327 assertEquals(9, entrySet.size()); 329 entrySet = subMap_startExcluded_endExcluded.entrySet(); [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
MultisetWritesTester.java | 121 getMultiset().entrySet().clear(); 122 assertTrue("multiset not empty after entrySet().clear()", 129 Iterator<Multiset.Entry<E>> iterator = getMultiset().entrySet().iterator(); 131 "non-empty multiset.entrySet() iterator.hasNext() returned false", 133 assertEquals("multiset.entrySet() iterator.next() returned incorrect entry", 136 "size 1 multiset.entrySet() iterator.hasNext() returned true " 141 "multiset isn't empty after multiset.entrySet() iterator.remove()", 148 Iterator<Multiset.Entry<E>> iterator = getMultiset().entrySet().iterator(); 150 "non-empty multiset.entrySet() iterator.hasNext() returned false", 154 fail("multiset.entrySet() iterator.remove() didn't throw an exception") [all...] |
MultisetReadsTester.java | 79 assertTrue("multiset.entrySet() didn't contain [present, 1]", 80 getMultiset().entrySet().contains( 85 assertFalse("multiset.entrySet() contains [missing, 0]", 86 getMultiset().entrySet().contains( 91 assertFalse("multiset.entrySet() contains a non-entry", 92 getMultiset().entrySet().contains(samples.e0)); 96 assertEquals("calling multiset.entrySet() twice returned unequal sets", 97 getMultiset().entrySet(), getMultiset().entrySet()); 102 assertEquals("multiset.entrySet() has incorrect hash code" [all...] |
MultisetNavigationTester.java | 175 assertEquals(Arrays.asList(b, c), copyToList(sortedMultiset.entrySet())); 229 assertEquals(Arrays.asList(a, b), copyToList(sortedMultiset.entrySet())); 244 Iterators.addAll(ascending, sortedMultiset.entrySet().iterator()); 246 Iterators.addAll(descending, sortedMultiset.descendingMultiset().entrySet().iterator()); 442 assertTrue(multiset.entrySet().isEmpty()); 444 assertEquals(0, multiset.entrySet().size()); 445 assertEquals(0, multiset.entrySet().toArray().length); 446 assertFalse(multiset.entrySet().iterator().hasNext()); 520 List<Entry<E>> entries = copyToList(sortedMultiset.entrySet()); 524 assertEquals(expected, copyToList(subMultiset.entrySet())); [all...] |
/libcore/luni/src/main/java/java/util/ |
AbstractMap.java | 177 * <p>This implementation calls {@code entrySet().clear()}. 180 entrySet().clear(); 190 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); 214 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); 231 public abstract Set<Map.Entry<K, V>> entrySet(); 253 for (Entry<K, V> entry : entrySet()) { 282 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); 309 Iterator<Map.Entry<K, V>> it = entrySet().iterator(); 344 Iterator<Map.Entry<K, V>> setIterator = entrySet().iterator(); 380 for (Map.Entry<? extends K, ? extends V> entry : map.entrySet()) { [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/ |
CostAllocator.h | 100 typedef std::set<PoolEntry*, EntryComparator> EntrySet; 102 EntrySet entrySet; 104 void removeEntry(PoolEntry *p) { entrySet.erase(p); } 110 typename EntrySet::iterator itr = 111 std::lower_bound(entrySet.begin(), entrySet.end(), costKey, 114 if (itr != entrySet.end() && costKey == (*itr)->getCost()) 118 entrySet.insert(itr, p);
|
/frameworks/ex/common/tests/src/com/android/common/ |
Rfc822ValidatorTest.java | 98 for (Map.Entry<String, String> e : fixes.entrySet()) { 113 for (Map.Entry<String, String> e : fixes.entrySet()) { 129 for (Map.Entry<String, String> e : fixes.entrySet()) {
|
/external/smack/src/org/apache/qpid/management/common/sasl/ |
JCAProvider.java | 50 for (Map.Entry<String, Class<? extends SaslClientFactory>> me : providerMap.entrySet())
|
/frameworks/base/tools/layoutlib/create/src/com/android/tools/layoutlib/java/ |
LinkedHashMap_Delegate.java | 33 Iterator<Entry<K, V>> iterator = map.entrySet().iterator();
|
/external/guava/guava-gwt/src/com/google/common/collect/ |
Multiset_CustomFieldSerializerBase.java | 60 int entryCount = instance.entrySet().size(); 62 for (Multiset.Entry<?> entry : instance.entrySet()) {
|