| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| MultimapSizeTester.java | 30 import java.util.Map.Entry;
46 for (Entry<K, V> entry : multimap.entries()) {
47 assertTrue(multimap.containsEntry(entry.getKey(), entry.getValue()));
53 for (Entry<K, Collection<V>> entry2 : multimap.asMap().entrySet()) {
|
| SetMultimapPutTester.java | 29 import java.util.Map.Entry;
51 List<Entry<K, V>> entries = copyToList(multimap().entries());
53 for (Entry<K, V> entry : entries) {
55 K k = entry.getKey();
56 V v = entry.getValue();
|
| SortedSetMultimapTestSuiteBuilder.java | 33 import java.util.Map.Entry;
67 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>>> parentBuilder) {
80 OneSizeTestContainerGenerator<SetMultimap<K, V>, Entry<K, V>>> parentBuilder) {
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| ConcurrentHashMultisetBenchmark.java | 227 for (Multiset.Entry<E> entry : entrySet()) {
228 E element = entry.getElement();
229 for (int i = entry.getCount(); i > 0; i--) {
433 @Override public Set<Multiset.Entry<E>> entrySet() {
449 @Override Iterator<Entry<E>> entryIterator() {
450 final Iterator<Map.Entry<E, Integer>> backingIterator =
452 return new Iterator<Entry<E>>() {
457 @Override public Multiset.Entry<E> next() {
458 Map.Entry<E, Integer> backingEntry = backingIterator.next()
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| ConstrainedMapTest.java | 35 import java.util.Map.Entry;
106 protected Map<String, String> create(Entry<String, String>[] entries) {
110 for (Entry<String, String> entry : entries) {
111 map.put(entry.getKey(), entry.getValue());
|
| HashMultimapTest.java | 31 import java.util.Map.Entry;
46 protected SetMultimap<String, String> create(Entry<String, String>[] entries) {
48 for (Entry<String, String> entry : entries) {
49 multimap.put(entry.getKey(), entry.getValue());
|
| ImmutableEnumMapTest.java | 35 import java.util.Map.Entry;
46 protected Map<AnEnum, String> create(Entry<AnEnum, String>[] entries) {
48 for (Entry<AnEnum, String> entry : entries) {
49 map.put(entry.getKey(), entry.getValue());
|
| /external/oauth/core/src/main/java/net/oauth/client/ |
| URLConnectionClient.java | 48 final Collection<Map.Entry<String, String>> addHeaders = request.headers;
65 for (Map.Entry<String, List<String>> header : connection
74 for (Map.Entry<String, String> header : addHeaders) {
|
| /external/sl4a/Common/src/com/googlecode/android_scripting/facade/ |
| WakeLockFacade.java | 28 import java.util.Map.Entry;
67 for (Entry<WakeLockType, WakeLock> entry : mmLocks.entrySet()) {
68 if (entry.getKey() != type) {
69 entry.getValue().release();
75 for (Entry<WakeLockType, WakeLock> entry : mmLocks.entrySet()) {
76 entry.getValue().release();
|
| /external/v8/src/ |
| cancelable-task.cc | 46 HashMap::Entry* entry = local
48 entry->value = task;
64 HashMap::Entry* entry = local
66 if (entry != nullptr) {
67 Cancelable* value = reinterpret_cast<Cancelable*>(entry->value);
95 for (HashMap::Entry* p = cancelable_tasks_.Start(); p != nullptr;
|
| /frameworks/base/libs/hwui/ |
| AssetAtlas.cpp | 64 AssetAtlas::Entry* AssetAtlas::getEntry(const SkPixelRef* pixelRef) const {
122 std::unique_ptr<Entry> entry(new Entry(pixelRef, texture, mapper, *this));
123 texture->uvMapper = &entry->uvMapper;
125 mEntries.emplace(entry->pixelRef, std::move(entry));
|
| /frameworks/volley/src/test/java/com/android/volley/ |
| CacheDispatcherTest.java | 83 Cache.Entry entry = CacheTestUtils.makeRandomCacheEntry(null, false, false); local
84 mCache.setEntryToReturn(entry);
93 Cache.Entry entry = CacheTestUtils.makeRandomCacheEntry(null, false, true); local
94 mCache.setEntryToReturn(entry);
101 assertSame(entry, request.getCacheEntry());
106 Cache.Entry entry = CacheTestUtils.makeRandomCacheEntry(null, true, true); local
107 mCache.setEntryToReturn(entry);
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| RefSortedMap.java | 41 private static final class MapEntry<K, V> implements Map.Entry<K, V> {
74 if (object instanceof Map.Entry) {
75 Map.Entry<?, ?> entry = (Map.Entry<?, ?>) object; local
76 return (getKey() == null ? entry.getKey() == null : getKey().equals(entry
78 && (getValue() == null ? entry.getValue() == null : getValue()
79 .equals(entry.getValue()));
107 public Set<java.util.Map.Entry<K, V>> entrySet()
[all...] |
| /packages/apps/Calculator/src/com/android/calculator2/ |
| CalculatorExpressionTokenizer.java | 27 import java.util.Map.Entry;
67 for (Entry<String, String> replacementEntry : mReplacementMap.entrySet()) {
74 for (Entry<String, String> replacementEntry : mReplacementMap.entrySet()) {
|
| /external/clang/include/clang/Basic/ |
| SourceManager.h | 102 /// \brief Reference to the file entry representing this ContentCache.
112 /// Can be different from 'Entry' if we overridden the contents of one file
130 /// When true, the original entry may be a virtual file that does not
139 /// exist at some later point in time when this content entry is used,
444 /// \brief Read the source location entry with index ID, which will always be
448 /// entry from being loaded.
605 /// Positive FileIDs are indexes into this table. Entry 0 indicates an invalid
617 /// This is LocalSLocEntryTable.back().Offset + the size of that entry.
622 /// This is LoadedSLocEntryTable.back().Offset, except that that entry might
639 /// \brief A one-entry cache to speed up getFileID
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| IdentityHashMap.java | 510 for (Entry<? extends K, ? extends V> e : m.entrySet())
670 * defined to be the sum of the hash codes of each entry in the map's
677 * <tt>Map.Entry</tt> instances in the set returned by this map's
843 extends IdentityHashMapIterator<Map.Entry<K,V>>
845 private Entry lastReturnedEntry = null;
847 public Map.Entry<K,V> next() {
848 lastReturnedEntry = new Entry(nextIndex());
860 private class Entry implements Map.Entry<K,V> {
863 private Entry(int index)
[all...] |
| HashMap.java | 348 Entry<K,V> entry = getEntry(key);
350 return null == entry ? null : entry.getValue();
384 * Returns the entry associated with the specified key in the
388 final Entry<K,V> getEntry(Object key) {
468 * Look for preexisting entry for key. This will never happen for
485 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
570 for (Map.Entry<? extends K, ? extends V> e : m.entrySet())
584 Entry<K,V> e = removeEntryForKey(key)
[all...] |
| TreeMap.java | 89 * <p>All {@code Map.Entry} pairs returned by methods in this class
91 * produced. They do <strong>not</strong> support the {@code Entry.setValue}
332 * Returns this map's entry for the given key, or {@code null} if the map
333 * does not contain an entry for the key.
335 * @return this map's entry for the given key, or {@code null} if the map
336 * does not contain an entry for the key
390 * Gets the entry corresponding to the specified key; if no such entry
391 * exists, returns the entry for the least key greater than the specified
392 * key; if no such entry exists (i.e., the greatest key in the Tree is les
2605 Map.Entry<K,V> entry = (Map.Entry<K,V>)it.next(); local
[all...] |
| /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/ |
| HeadsUpManager.java | 98 private HashSet<NotificationData.Entry> mEntriesToRemoveAfterExpand = new HashSet<>();
171 public void showNotification(NotificationData.Entry headsUp) {
181 public void updateNotification(NotificationData.Entry headsUp, boolean alert) {
189 // the entry was released before this update (i.e by a listener) This can happen
198 private void addHeadsUpEntry(NotificationData.Entry entry) {
201 // This will also add the entry to the sortedList
202 headsUpEntry.setEntry(entry);
203 mHeadsUpEntries.put(entry.key, headsUpEntry);
204 entry.row.setHeadsUp(true)
331 HeadsUpEntry entry = mHeadsUpEntries.get(key); local
376 HeadsUpEntry entry = mHeadsUpEntries.get(key); local
437 HeadsUpEntry entry = mHeadsUpEntries.get(key); local
456 HeadsUpEntry entry = mHeadsUpEntries.get(key); local
610 public NotificationData.Entry entry; field in class:HeadsUpManager.HeadsUpEntry
[all...] |
| /bionic/libc/dns/resolv/ |
| res_cache.c | 988 /* cache entry. for simplicity, 'hash' and 'hlink' are inlined in this
993 typedef struct Entry {
995 struct Entry* hlink; /* next in collision chain */
996 struct Entry* mru_prev;
997 struct Entry* mru_next;
1003 time_t expires; /* time_t when the entry isn't valid any more */
1005 } Entry;
1105 entry_free( Entry* e )
1114 entry_mru_remove( Entry* e )
1121 entry_mru_add( Entry* e, Entry* list
[all...] |
| /external/clang/lib/Basic/ |
| VirtualFileSystem.cpp | 467 for (const auto &Entry : Entries) {
468 Result += Entry.second->toString(Indent + 2);
676 class Entry {
681 virtual ~Entry();
682 Entry(EntryKind K, StringRef Name) : Kind(K), Name(Name) {}
687 class RedirectingDirectoryEntry : public Entry {
688 std::vector<std::unique_ptr<Entry>> Contents;
693 std::vector<std::unique_ptr<Entry>> Contents,
695 : Entry(EK_Directory, Name), Contents(std::move(Contents)),
701 static bool classof(const Entry *E) { return E->getKind() == EK_Directory;
[all...] |
| /art/test/062-character-encodings/src/ |
| Main.java | 19 for (Map.Entry<String, Charset> e : all.entrySet()) {
|
| /art/test/063-process-manager/src/ |
| Main.java | 29 for (Map.Entry<Thread, StackTraceElement[]> entry :
31 Thread t = entry.getKey();
|
| /cts/tools/cts-api-coverage/src/com/android/cts/apicoverage/ |
| ApiCoverage.java | 44 for (Map.Entry<String, ApiPackage> entry : mPackages.entrySet()) {
45 ApiPackage pkg = entry.getValue();
|
| /external/guava/guava/src/com/google/common/collect/ |
| RangeMap.java | 52 Map.Entry<Range<K>, V> getEntry(K key);
|
