| /external/skia/src/pdf/ |
| D | SkPDFGradientShader.h | 25 struct Key { struct
37 uint32_t operator()(const Key& k) const { return k.fHash; } in operator() argument
|
| /external/skqp/src/pdf/ |
| D | SkPDFGradientShader.h | 25 struct Key { struct
37 uint32_t operator()(const Key& k) const { return k.fHash; } in operator() argument
|
| /external/guice/core/src/com/google/inject/ |
| D | Key.java | 55 public class Key<T> { class
76 protected Key(Class<? extends Annotation> annotationType) { in Key() method in Key
97 protected Key(Annotation annotation) { in Key() method in Key
118 protected Key() { in Key() method in Key
130 private Key(Type type, AnnotationStrategy annotationStrategy) { in Key() method in Key
138 private Key(TypeLiteral<T> typeLiteral, AnnotationStrategy annotationStrategy) { in Key() method in Key
|
| /external/skqp/src/core/ |
| D | SkResourceCache.h | 31 struct Key { struct
51 bool operator==(const Key& other) const { argument
75 typedef SkResourceCache::Key Key; argument
|
| /external/skia/src/core/ |
| D | SkResourceCache.h | 31 struct Key { struct
51 bool operator==(const Key& other) const { argument
75 typedef SkResourceCache::Key Key; argument
|
| /external/libmojo/mojo/public/cpp/bindings/ |
| D | map.h | 18 const std::map<Key, Value>& input) { in MapToUnorderedMap()
23 std::unordered_map<Key, Value> MapToUnorderedMap(std::map<Key, Value>&& input) { in MapToUnorderedMap()
30 const std::unordered_map<Key, Value>& input) { in UnorderedMapToMap()
35 std::map<Key, Value> UnorderedMapToMap(std::unordered_map<Key, Value>&& input) { in UnorderedMapToMap()
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| D | compare.pass.cpp | 22 struct Key { struct
23 template <typename T> Key(const T&) {} in Key() function
24 bool operator== (const Key&) const { return true; } in operator ==() argument
|
| /external/libcxx/test/std/containers/associative/map/ |
| D | compare.pass.cpp | 23 struct Key { struct
24 template <typename T> Key(const T&) {} in Key() argument
25 bool operator< (const Key&) const { return false; } in operator <() argument
|
| /external/v8/src/ |
| D | lookup-cache.h | 43 struct Key { struct
48 Key keys_[kLength]; argument
|
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| D | CodeGenRegisters.h | 191 struct Key { struct
196 Key(const Key &O) in Key() argument
204 Key(const CodeGenRegisterClass &RC) in Key() function
|
| /external/llvm/include/llvm/ADT/ |
| D | MapVector.h | 86 ValueT lookup(const KeyT &Key) const { in lookup()
103 size_type count(const KeyT &Key) const { in count()
108 iterator find(const KeyT &Key) { in find()
114 const_iterator find(const KeyT &Key) const { in find()
153 size_type erase(const KeyT &Key) { in erase()
|
| D | ScopedHashTable.h | 47 K Key; variable
175 size_type count(const K &Key) const { in count()
179 V lookup(const K &Key) { in lookup()
187 void insert(const K &Key, const V &Val) { in insert()
195 iterator begin(const K &Key) { in begin()
209 void insertIntoScope(ScopeTy *S, const K &Key, const V &Val) { in insertIntoScope()
|
| D | StringMap.h | 152 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, in Create()
178 static StringMapEntry *Create(StringRef Key, InitType &&... InitVal) { in Create()
183 static StringMapEntry *Create(StringRef Key) { in Create()
309 iterator find(StringRef Key) { in find()
315 const_iterator find(StringRef Key) const { in find()
323 ValueTy lookup(StringRef Key) const { in lookup()
337 size_type count(StringRef Key) const { in count()
373 std::pair<iterator, bool> emplace_second(StringRef Key, ArgsTy &&... Args) { in emplace_second()
420 bool erase(StringRef Key) { in erase()
|
| /external/v8/src/ast/ |
| D | context-slot-cache.h | 54 struct Key { struct
55 Object* data;
56 String* name;
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| D | ScopedHashTable.h | 47 K Key; variable
175 bool count(const K &Key) const { in count()
179 V lookup(const K &Key) { in lookup()
187 void insert(const K &Key, const V &Val) { in insert()
195 iterator begin(const K &Key) { in begin()
209 void insertIntoScope(ScopeTy *S, const K &Key, const V &Val) { in insertIntoScope()
|
| D | StringMap.h | 289 iterator find(StringRef Key) { in find()
295 const_iterator find(StringRef Key) const { in find()
303 ValueTy lookup(StringRef Key) const { in lookup()
314 size_type count(StringRef Key) const { in count()
358 MapEntryTy &GetOrCreateValue(StringRef Key, InitTy Val) { in GetOrCreateValue()
380 MapEntryTy &GetOrCreateValue(StringRef Key) { in GetOrCreateValue()
396 bool erase(StringRef Key) { in erase()
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| D | StringMap.h | 158 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, in Create()
184 static StringMapEntry *Create(StringRef Key, InitType &&... InitVal) { in Create()
189 static StringMapEntry *Create(StringRef Key) { in Create()
315 iterator find(StringRef Key) { in find()
321 const_iterator find(StringRef Key) const { in find()
329 ValueTy lookup(StringRef Key) const { in lookup()
341 size_type count(StringRef Key) const { in count()
377 std::pair<iterator, bool> try_emplace(StringRef Key, ArgsTy &&... Args) { in try_emplace()
424 bool erase(StringRef Key) { in erase()
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | BlotMapVector.h | 73 iterator find(const KeyT &Key) { in find()
80 const_iterator find(const KeyT &Key) const { in find()
90 void blot(const KeyT &Key) { in blot()
|
| /external/libchrome/base/ |
| D | stl_util.h | 226 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) { in EraseIf()
231 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container, in EraseIf()
237 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) { in EraseIf()
242 void EraseIf(std::multiset<Key, Compare, Allocator>& container, in EraseIf()
253 void EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container, in EraseIf()
265 std::unordered_multimap<Key, T, Hash, KeyEqual, Allocator>& container, in EraseIf()
275 void EraseIf(std::unordered_set<Key, Hash, KeyEqual, Allocator>& container, in EraseIf()
285 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container, in EraseIf()
|
| /external/perfetto/src/tracing/core/ |
| D | trace_buffer.h | 296 struct Key { struct
297 Key(ProducerID p, WriterID w, ChunkID c) in Key() function
300 explicit Key(const ChunkRecord& cr) in Key() function
340 using ChunkMap = std::map<ChunkMeta::Key, ChunkMeta>; argument
|
| /external/llvm/lib/IR/ |
| D | ProfileSummary.cpp | 29 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD()
39 static Metadata *getKeyValMD(LLVMContext &Context, const char *Key, in getKeyValMD()
88 static bool getVal(MDTuple *MD, const char *Key, uint64_t &Val) { in getVal()
104 static bool isKeyValuePair(MDTuple *MD, const char *Key, const char *Val) { in isKeyValuePair()
|
| /external/skia/src/gpu/ops/ |
| D | GrSmallPathRenderer.h | 62 Key() {} in Key() function
63 Key(const Key& that) { *this = that; } in Key() function
64 Key(const GrShape& shape, uint32_t dim) { this->set(shape, dim); } in Key() function
65 Key(const GrShape& shape, const SkMatrix& ctm) { this->set(shape, ctm); } in Key() function
|
| /external/skqp/src/gpu/ops/ |
| D | GrSmallPathRenderer.h | 58 Key() {} in Key() function
59 Key(const Key& that) { *this = that; } in Key() function
60 Key(const GrShape& shape, uint32_t dim) { this->set(shape, dim); } in Key() function
61 Key(const GrShape& shape, const SkMatrix& ctm) { this->set(shape, ctm); } in Key() function
|
| /external/swiftshader/third_party/LLVM/include/llvm/MC/ |
| D | SubtargetFeature.h | 35 const char *Key; // K-V key string member
52 const char *Key; // K-V key string member
|
| /external/giflib/ |
| D | gif_hash.c | 63 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code) in _InsertHashTable()
86 int _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key) in _ExistsHashTable()
|