| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| D | CostAllocator.h | 90 EntrySetT EntrySet; variable
92 void removeEntry(PoolEntry *P) { EntrySet.erase(P); } in removeEntry()
96 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey); in getValue()
98 if (I != EntrySet.end()) in getValue()
102 EntrySet.insert(P.get()); in getValue()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | CostAllocator.h | 91 EntrySetT EntrySet; variable
93 void removeEntry(PoolEntry *P) { EntrySet.erase(P); } in removeEntry()
97 typename EntrySetT::iterator I = EntrySet.find_as(ValueKey); in getValue()
99 if (I != EntrySet.end()) in getValue()
103 EntrySet.insert(P.get()); in getValue()
|
| /external/cronet/net/disk_cache/simple/ |
| D | simple_index_file_unittest.cc | 203 SimpleIndex::EntrySet entries; in TEST_F()
232 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries; in TEST_F()
243 SimpleIndex::EntrySet entries; in TEST_F()
272 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries; in TEST_F()
296 SimpleIndex::EntrySet entries; in TEST_F()
316 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries; in TEST_F()
338 SimpleIndex::EntrySet entries; in TEST_F()
358 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries; in TEST_F()
381 SimpleIndex::EntrySet entries; in TEST_F()
404 const SimpleIndex::EntrySet& new_entries = deserialize_result.entries; in TEST_F()
[all …]
|
| D | simple_index.h | 171 using EntrySet = std::unordered_map<uint64_t, EntryMetadata>; variable
177 EntrySet* entry_set);
252 bool UpdateEntryIteratorSize(EntrySet::iterator* it,
272 EntrySet entries_set_;
|
| D | simple_index.cc | 414 std::vector<std::pair<uint64_t, const EntrySet::value_type*>> entries; in StartEvictionIfNeeded()
417 for (EntrySet::const_iterator i = entries_set_.begin(); in StartEvictionIfNeeded()
504 EntrySet* entry_set) { in InsertInEntrySet()
528 EntrySet::iterator* it, in UpdateEntryIteratorSize()
547 EntrySet* index_file_entries = &load_result->entries; in MergeInitializingSet()
556 std::pair<EntrySet::iterator, bool> insert_result = in MergeInitializingSet()
557 index_file_entries->insert(EntrySet::value_type(entry_hash, in MergeInitializingSet()
559 EntrySet::iterator& possibly_inserted_entry = insert_result.first; in MergeInitializingSet()
|
| D | simple_index_file.h | 37 SimpleIndex::EntrySet entries;
112 const SimpleIndex::EntrySet& entry_set,
155 const SimpleIndex::EntrySet& entries);
|
| D | simple_index_file.cc | 132 SimpleIndex::EntrySet* entries, in ProcessEntryFile()
378 const SimpleIndex::EntrySet& entry_set, in WriteToDisk()
435 SimpleIndex::EntrySet entries_from_stale_index; in SyncLoadIndexEntries()
517 const SimpleIndex::EntrySet& entries) { in Serialize()
537 SimpleIndex::EntrySet* entries = &out_result->entries; in Deserialize()
605 SimpleIndex::EntrySet* entries = &out_result->entries; in SyncRestoreFromDisk()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | AbstractMultiset.java | 176 class EntrySet extends Multisets.EntrySet<E> { class in AbstractMultiset
194 return new EntrySet(); in createEntrySet()
|
| D | FilteredKeySetMultimap.java | 67 return new EntrySet(); in createEntries()
70 class EntrySet extends Entries implements Set<Entry<K, V>> { class in FilteredKeySetMultimap
|
| D | ConcurrentHashMultiset.java | 489 return new EntrySet();
561 private class EntrySet extends AbstractMultiset<E>.EntrySet {
|
| /external/guava/android/guava/src/com/google/common/collect/ |
| D | AbstractMultiset.java | 176 class EntrySet extends Multisets.EntrySet<E> { class in AbstractMultiset
194 return new EntrySet(); in createEntrySet()
|
| D | FilteredKeySetMultimap.java | 67 return new EntrySet(); in createEntries()
70 class EntrySet extends Entries implements Set<Entry<K, V>> { class in FilteredKeySetMultimap
|
| D | ConcurrentHashMultiset.java | 489 return new EntrySet();
561 private class EntrySet extends AbstractMultiset<E>.EntrySet {
|
| D | RegularImmutableMap.java | 381 return new EntrySet<>(this, alternatingKeysAndValues, 0, size); in createEntrySet()
384 static class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> { class in RegularImmutableMap
390 EntrySet( in EntrySet() method in RegularImmutableMap.EntrySet
|
| D | ImmutableSetMultimap.java | 439 return result == null ? (entries = new EntrySet<>(this)) : result; in entries()
442 private static final class EntrySet<K, V> extends ImmutableSet<Entry<K, V>> { class in ImmutableSetMultimap
445 EntrySet(ImmutableSetMultimap<K, V> multimap) { in EntrySet() method in ImmutableSetMultimap.EntrySet
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | ConcurrentHashMultisetBenchmark.java | 446 private transient EntrySet entrySet;
450 EntrySet result = entrySet;
452 entrySet = result = new EntrySet();
499 private class EntrySet extends AbstractMultiset<E>.EntrySet {
|
| /external/guava/android/guava-tests/benchmark/com/google/common/collect/ |
| D | ConcurrentHashMultisetBenchmark.java | 446 private transient EntrySet entrySet;
450 EntrySet result = entrySet;
452 entrySet = result = new EntrySet();
499 private class EntrySet extends AbstractMultiset<E>.EntrySet {
|
| /external/cronet/third_party/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | SmallSortedMap.java | 138 private volatile EntrySet lazyEntrySet;
354 lazyEntrySet = new EntrySet(); in entrySet()
464 private class EntrySet extends AbstractSet<Map.Entry<K, V>> { class in SmallSortedMap
521 private class DescendingEntrySet extends EntrySet {
|
| /external/protobuf/java/core/src/main/java/com/google/protobuf/ |
| D | SmallSortedMap.java | 138 private volatile EntrySet lazyEntrySet;
354 lazyEntrySet = new EntrySet(); in entrySet()
464 private class EntrySet extends AbstractSet<Map.Entry<K, V>> { class in SmallSortedMap
521 private class DescendingEntrySet extends EntrySet {
|
| /external/turbine/javatests/com/google/turbine/lower/testdata/ |
| D | filteredkeysetmultimap.test | 13 class EntrySet extends Entries {
|
| D | lexical4.test | 9 private abstract class EntrySet implements Set<Entry<K, V>> {
|
| /external/guava/ |
| D | cycle_suppress_list.txt | 25 …om.google.common.collect.AbstractBiMap.EntrySet.iterator.$.entry com.google.common.collect.Abstrac…
|
| /external/gson/gson/src/main/java/com/google/gson/internal/ |
| D | LinkedTreeMap.java | 448 private EntrySet entrySet;
452 EntrySet result = entrySet; in entrySet()
453 return result != null ? result : (entrySet = new EntrySet()); in entrySet()
587 class EntrySet extends AbstractSet<Entry<K, V>> { class in LinkedTreeMap
|
| /external/dagger2/java/dagger/internal/codegen/kythe/ |
| D | DaggerKythePlugin.java | 30 import com.google.devtools.kythe.analyzers.base.EntrySet;
177 s -> target.ifPresent(t -> new EntrySet.Builder(s, edgeName, t).build().emit(emitter))); in emitEdge()
|
| /external/guava/android/guava-testlib/test/com/google/common/collect/testing/ |
| D | MapTestSuiteBuilderTests.java | 132 return new EntrySet();
155 class EntrySet extends AbstractSet<Map.Entry<String, String>> {
|