Home
last modified time | relevance | path

Searched defs:Key (Results 1 – 25 of 173) sorted by relevance

1234567

/external/skia/src/core/
DSkImageFilterCacheKey.h11 struct SkImageFilter::Cache::Key { struct
12 Key(const uint32_t uniqueID, const SkMatrix& matrix, in Key() function
32 bool operator==(const Key& other) const { argument
DSkResourceCache.h31 struct Key { struct
51 bool operator==(const Key& other) const { argument
75 typedef SkResourceCache::Key Key; argument
/external/guice/core/src/com/google/inject/
DKey.java55 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/bison/src/
Dmuscle-tab.h38 #define MUSCLE_INSERT_BOOL(Key, Value) \ argument
44 #define MUSCLE_INSERT_INT(Key, Value) \ argument
51 #define MUSCLE_INSERT_LONG_INT(Key, Value) \ argument
58 #define MUSCLE_INSERT_STRING_RAW(Key, Value) \ argument
65 #define MUSCLE_INSERT_STRING(Key, Value) \ argument
72 #define MUSCLE_INSERT_C_STRING(Key, Value) \ argument
/external/libcxx/test/std/containers/associative/map/
Dcompare.pass.cpp23 struct Key { struct
24 template <typename T> Key(const T&) {} in Key() function
25 bool operator< (const Key&) const { return false; } in operator <() argument
/external/libcxx/test/std/containers/unord/unord.map/
Dcompare.pass.cpp22 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/skia/src/gpu/
DGrLayerCache.h83 struct Key { struct
86 : fKeySize(keySize) in fKeySize()
105 ~Key() { in ~Key()
120 uint32_t pictureID() const { return fIDMatrix.fPictureID; } in pictureID()
123 const int* key() const { SkASSERT(fFreeKey); return fKey; } in key()
124 int keySize() const { SkASSERT(fFreeKey); return fKeySize; } in keySize()
126 uint32_t hash() const { in hash()
134 struct IDMatrix {
139 } fIDMatrix;
141 const int* fKey;
[all …]
/external/v8/test/cctest/compiler/
Dtest-gap-resolver.cc34 struct Key { struct in v8::internal::compiler::InterpreterState
35 bool is_constant;
36 bool is_float;
37 LocationOperand::LocationKind kind;
38 int index;
40 bool operator<(const Key& other) const { in operator <()
53 bool operator==(const Key& other) const { in operator ==()
/external/llvm/include/llvm/ADT/
DStringMap.h148 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator, in Create()
173 static StringMapEntry *Create(StringRef Key, AllocatorTy &Allocator) { in Create()
179 static StringMapEntry *Create(StringRef Key, InitType &&InitVal) { in Create()
184 static StringMapEntry *Create(StringRef Key) { in Create()
277 iterator find(StringRef Key) { in find()
283 const_iterator find(StringRef Key) const { in find()
291 ValueTy lookup(StringRef Key) const { in lookup()
303 size_type count(StringRef Key) const { in count()
378 bool erase(StringRef Key) { in erase()
DScopedHashTable.h47 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()
DMapVector.h86 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()
DSparseMultiSet.h371 iterator find(const KeyT &Key) { in find()
375 const_iterator find(const KeyT &Key) const { in find()
382 size_type count(const KeyT &Key) const { in count()
391 bool contains(const KeyT &Key) const { in contains()
396 iterator getHead(const KeyT &Key) { return find(Key); } in getHead()
397 iterator getTail(const KeyT &Key) { in getTail()
/external/llvm/lib/Transforms/ObjCARC/
DBlotMapVector.h73 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/giflib/
Dgif_hash.c63 void _InsertHashTable(GifHashTableType *HashTable, uint32_t Key, int Code) in _InsertHashTable()
86 int _ExistsHashTable(GifHashTableType *HashTable, uint32_t Key) in _ExistsHashTable()
/external/llvm/unittests/ADT/
DDenseMapTest.cpp215 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
220 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
233 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
256 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
261 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
267 for (int Key = 0; Key < 5; ++Key) in TYPED_TEST() local
/external/llvm/include/llvm/Support/
DOnDiskHashTable.h69 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data, in Item()
116 void insert(typename Info::key_type_ref Key, in insert()
125 void insert(typename Info::key_type_ref Key, in insert()
134 bool contains(typename Info::key_type_ref Key, Info &InfoObj) { in contains()
306 internal_key_type Key; variable
559 const internal_key_type &Key = InfoObj->ReadKey(LocalPtr, L.first); variable
/external/llvm/include/llvm/ExecutionEngine/Orc/
DIndirectionUtils.h274 auto Key = I->second.first; in findStub() local
289 auto Key = I->second.first; in findPointer() local
300 auto Key = I->second.first; in updatePointer() local
326 auto Key = FreeStubs.back(); in createStubInternal() local
/external/llvm/include/llvm/MC/
DSubtargetFeature.h53 const char *Key; // K-V key string member
70 const char *Key; // K-V key string member
/external/skia/src/gpu/text/
DGrAtlasTextBlob.h51 struct Key { struct
52 Key() { in Key() argument
65 bool operator==(const Key& other) const { argument
/external/clang/lib/Serialization/
DMultiOnDiskHashTable.h145 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first); in condense() local
221 internal_key_type Key = Info::GetInternalKey(EKey); in find() local
265 const internal_key_type &Key = InfoObj.ReadKey(LocalPtr, L.first); in findAll() local
285 void insert(typename WriterInfo::key_type_ref Key, in insert()
/external/v8/src/ast/
Dscopeinfo.h55 struct Key { struct
56 Object* data;
57 String* name;
/external/google-breakpad/src/processor/
Dmap_serializers-inl.h56 const std::map<Key, Value> &m) const { in SizeOf()
70 char *StdMapSerializer<Key, Value>::Write(const std::map<Key, Value> &m, in Write()
101 const std::map<Key, Value> &m, unsigned int *size) const { in Serialize()
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/
DTypeListPool.java80 public static class Key<TypeCollection extends Collection<? extends CharSequence>> class in TypeListPool
84 public Key(@Nonnull TypeCollection types) { in Key() method in TypeListPool.Key
/external/v8/src/parsing/
Dpreparse-data.h162 struct Key { struct
163 bool is_one_byte;
164 Vector<const byte> literal_bytes;
/external/llvm/utils/TableGen/
DCodeGenRegisters.h405 struct Key { struct
410 Key(const CodeGenRegister::Vec *M, unsigned S = 0, unsigned A = 0) argument
413 Key(const CodeGenRegisterClass &RC) in Key() argument

1234567