| /external/stlport/test/unit/ |
| set_test.cpp | 396 typedef set<Key, KeyCmp> KeySet;
397 KeySet keySet;
398 keySet.insert(Key(1));
399 keySet.insert(Key(2));
400 keySet.insert(Key(3));
401 keySet.insert(Key(4));
403 CPPUNIT_ASSERT( keySet.count(Key(1)) == 1 );
404 CPPUNIT_ASSERT( keySet.count(1) == 1 );
405 CPPUNIT_ASSERT( keySet.count(5) == 0 )
[all...] |
| /ndk/sources/android/stlport/test/unit/ |
| set_test.cpp | 396 typedef set<Key, KeyCmp> KeySet;
397 KeySet keySet;
398 keySet.insert(Key(1));
399 keySet.insert(Key(2));
400 keySet.insert(Key(3));
401 keySet.insert(Key(4));
403 CPPUNIT_ASSERT( keySet.count(Key(1)) == 1 );
404 CPPUNIT_ASSERT( keySet.count(1) == 1 );
405 CPPUNIT_ASSERT( keySet.count(5) == 0 )
[all...] |
| /external/guava/src/com/google/common/collect/ |
| RegularImmutableMap.java | 113 // deserialization should call entrySet(), keySet(), or values() on the
143 private transient ImmutableSet<K> keySet;
145 @Override public ImmutableSet<K> keySet() {
146 ImmutableSet<K> ks = keySet;
147 return (ks == null) ? (keySet = new KeySet<K, V>(this)) : ks;
151 private static class KeySet<K, V>
155 KeySet(RegularImmutableMap<K, V> map) {
|
| AbstractBiMap.java | 157 private transient Set<K> keySet;
159 @Override public Set<K> keySet() {
160 Set<K> result = keySet;
161 return (result == null) ? keySet = new KeySet() : result;
164 private class KeySet extends ForwardingSet<K> {
166 return delegate.keySet();
215 * We can almost reuse the inverse's keySet, except we have to fix the
223 final Set<V> valuesDelegate = inverse.keySet();
|
| AbstractMultimap.java | 824 private transient Set<K> keySet;
826 public Set<K> keySet() {
827 Set<K> result = keySet;
828 return (result == null) ? keySet = createKeySet() : result;
833 ? new SortedKeySet((SortedMap<K, Collection<V>>) map) : new KeySet(map);
836 private class KeySet extends AbstractSet<K> {
844 KeySet(final Map<K, Collection<V>> subMap) {
893 return subMap.keySet().containsAll(c);
897 return this == object || this.subMap.keySet().equals(object);
901 return subMap.keySet().hashCode()
[all...] |
| CustomConcurrentHashMap.java | [all...] |
| Maps.java | 253 * Set<Long> set = map.keySet(); // Needn't be in synchronized block
852 * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
890 * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
925 * <p>The resulting map's {@code keySet()}, {@code entrySet()}, and {@code
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentSkipListMap.java | 341 private transient KeySet keySet;
355 keySet = null;
[all...] |
| ConcurrentHashMap.java | 152 transient Set<K> keySet;
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| TreeMap.java | 161 map.keySet = null;
680 private KeySet keySet;
687 @Override public Set<K> keySet() {
688 KeySet result = keySet;
689 return result != null ? result : (keySet = new KeySet());
693 KeySet result = keySet;
[all...] |
| HashMap.java | 121 private transient Set<K> keySet;
248 result.keySet = null;
684 @Override public Set<K> keySet() {
685 Set<K> ks = keySet;
686 return (ks != null) ? ks : (keySet = new KeySet());
901 private final class KeySet extends AbstractSet<K> {
[all...] |
| Hashtable.java | 100 private transient Set<K> keySet;
225 result.keySet = null;
599 public synchronized Set<K> keySet() {
600 Set<K> ks = keySet;
601 return (ks != null) ? ks : (keySet = new KeySet());
906 private final class KeySet extends AbstractSet<K> {
[all...] |
