/external/chromium/net/base/ |
D | host_cache_unittest.cc | 23 HostCache::Key Key(const std::string& hostname) { in Key() function 24 return HostCache::Key(hostname, ADDRESS_FAMILY_UNSPECIFIED, 0); in Key() 41 EXPECT_TRUE(cache.Lookup(Key("foobar.com"), base::TimeTicks()) == NULL); in TEST() 42 cache.Set(Key("foobar.com"), OK, AddressList(), now); in TEST() 43 entry1 = cache.Lookup(Key("foobar.com"), base::TimeTicks()); in TEST() 51 EXPECT_TRUE(cache.Lookup(Key("foobar2.com"), base::TimeTicks()) == NULL); in TEST() 52 cache.Set(Key("foobar2.com"), OK, AddressList(), now); in TEST() 53 entry2 = cache.Lookup(Key("foobar2.com"), base::TimeTicks()); in TEST() 61 EXPECT_EQ(entry1, cache.Lookup(Key("foobar.com"), now)); in TEST() 62 EXPECT_EQ(entry2, cache.Lookup(Key("foobar2.com"), now)); in TEST() [all …]
|
D | host_cache.h | 41 struct Key { struct 42 Key(const std::string& hostname, AddressFamily address_family, in Key() function 48 bool operator==(const Key& other) const { 57 bool operator<(const Key& other) const { 73 typedef std::map<Key, scoped_refptr<Entry> > EntryMap; argument 86 const Entry* Lookup(const Key& key, base::TimeTicks now) const; 92 Entry* Set(const Key& key,
|
/external/protobuf/src/google/protobuf/stubs/ |
D | hash.h | 62 template <typename Key> 65 int operator()(const Key& key) { in operator() 70 inline bool operator()(const Key& a, const Key& b) const { in operator() 89 template <typename Key, typename Data, 90 typename HashFcn = hash<Key>, 92 class hash_map : public std::map<Key, Data, HashFcn> { 95 template <typename Key, 96 typename HashFcn = hash<Key>, 98 class hash_set : public std::set<Key, HashFcn> { 103 template <typename Key> [all …]
|
/external/skia/gpu/include/ |
D | GrTHashCache.h | 32 template <typename T, typename Key, size_t kHashBits> class GrTHashTable { 38 T* find(const Key&) const; 40 bool insert(const Key&, T*); 41 void remove(const Key&, const T*); 77 int searchArray(const Key&) const; 82 template <typename T, typename Key, size_t kHashBits> 83 int GrTHashTable<T, Key, kHashBits>::searchArray(const Key& key) const { in searchArray() 95 if (Key::LT(*array[index], key)) { in searchArray() 103 if (Key::EQ(*array[high], key)) { in searchArray() 106 GrAssert(0 == high || Key::LT(*array[high - 1], key)); in searchArray() [all …]
|
/external/webkit/Source/JavaScriptCore/wtf/ |
D | HashTable.h | 67 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 69 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 71 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 74 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 75 void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*, 76 HashTableConstIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*); 78 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 79 …void removeIterator(HashTableConstIterator<Key, Value, Extractor, HashFunctions, Traits, KeyTraits… 83 …template<typename Key, typename Value, typename Extractor, typename HashFunctions, typename Traits… 84 … inline void addIterator(const HashTable<Key, Value, Extractor, HashFunctions, Traits, KeyTraits>*, in addIterator() argument [all …]
|
/external/v8/src/ |
D | splay-tree.h | 54 typedef typename Config::Key Key; typedef 70 bool Insert(const Key& key, Locator* locator); 75 bool Find(const Key& key, Locator* locator); 79 bool FindGreatestLessThan(const Key& key, Locator* locator); 86 bool FindLeastGreaterThan(const Key& key, Locator* locator); 92 bool Move(const Key& old_key, const Key& new_key); 95 bool Remove(const Key& key); 103 void Splay(const Key& key); 107 Node(const Key& key, const Value& value) in Node() 120 Key key() { return key_; } in key() [all …]
|
D | heap-profiler.h | 176 typedef JSObjectsCluster Key; typedef 178 static const Key kNoKey; 180 static int Compare(const Key& a, const Key& b) { in Compare() 181 return Key::Compare(a, b); in Compare() 219 typedef JSObjectsCluster Key; typedef 221 static const Key kNoKey; 223 static int Compare(const Key& a, const Key& b) { in Compare() 224 return Key::Compare(a, b); in Compare() 267 typedef JSObjectsCluster Key; typedef 269 static const Key kNoKey; [all …]
|
/external/bison/src/ |
D | muscle_tab.h | 35 #define MUSCLE_INSERT_BOOL(Key, Value) \ argument 38 MUSCLE_INSERT_INT (Key, v); \ 41 #define MUSCLE_INSERT_INT(Key, Value) \ argument 45 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 48 #define MUSCLE_INSERT_LONG_INT(Key, Value) \ argument 52 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 55 #define MUSCLE_INSERT_STRING(Key, Value) \ argument 59 muscle_insert (Key, obstack_finish (&muscle_obstack)); \ 76 #define MUSCLE_INSERT_C_STRING(Key, Value) \ argument 82 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
|
/external/chromium/chrome/browser/resources/keyboard/ |
D | main.js | 154 function Key(key, shift, num, symbol) { class 166 Key.prototype = { 511 new Key(C('q'), C('Q'), C('1'), C('`')), 512 new Key(C('w'), C('W'), C('2'), C('~')), 513 new Key(C('e'), C('E'), C('3'), new Character('<', 'LessThan')), 514 new Key(C('r'), C('R'), C('4'), new Character('>', 'GreaterThan')), 515 new Key(C('t'), C('T'), C('5'), C('[')), 516 new Key(C('y'), C('Y'), C('6'), C(']')), 517 new Key(C('u'), C('U'), C('7'), C('{')), 518 new Key(C('i'), C('I'), C('8'), C('}')), [all …]
|
/external/llvm/include/llvm/ADT/ |
D | StringMap.h | 88 unsigned LookupBucketFor(StringRef Key); 93 int FindKey(StringRef Key) const; 101 StringMapEntryBase *RemoveKey(StringRef Key); 289 iterator find(StringRef Key) { in find() argument 290 int Bucket = FindKey(Key); in find() 295 const_iterator find(StringRef Key) const { in find() argument 296 int Bucket = FindKey(Key); in find() 303 ValueTy lookup(StringRef Key) const { in lookup() argument 304 const_iterator it = find(Key); in lookup() 310 ValueTy &operator[](StringRef Key) { [all …]
|
D | ScopedHashTable.h | 47 K Key; variable 49 ScopedHashTableVal(const K &key, const V &val) : Key(key), Val(val) {} in ScopedHashTableVal() 52 const K &getKey() const { return Key; } in getKey() 175 bool count(const K &Key) const { in count() argument 176 return TopLevelMap.count(Key); in count() 179 V lookup(const K &Key) { in lookup() argument 180 typename DenseMap<K, ValTy*, KInfo>::iterator I = TopLevelMap.find(Key); in lookup() 187 void insert(const K &Key, const V &Val) { in insert() argument 188 insertIntoScope(CurScope, Key, Val); in insert() 195 iterator begin(const K &Key) { in begin() argument [all …]
|
/external/skia/gpu/src/ |
D | GrTextStrike_impl.h | 21 class GrFontCache::Key { 23 Key(GrFontScaler* scaler) { in Key() function 29 static bool LT(const GrTextStrike& strike, const Key& key) { in LT() 32 static bool EQ(const GrTextStrike& strike, const Key& key) { in EQ() 61 Key key(scaler); in getStrike() 86 class GrTextStrike::Key { 88 Key(GrGlyph::PackedID id) : fPackedID(id) {} in Key() function 92 static bool LT(const GrGlyph& glyph, const Key& key) { in LT() 95 static bool EQ(const GrGlyph& glyph, const Key& key) { in EQ()
|
/external/stlport/test/unit/ |
D | map_test.cpp | 303 struct Key struct 305 Key() : m_data(0) {} in Key() function 306 explicit Key(int data) : m_data(data) {} in Key() argument 313 bool operator () (Key lhs, Key rhs) const in operator ()() argument 316 bool operator () (Key lhs, int rhs) const in operator ()() 319 bool operator () (int lhs, Key rhs) const in operator ()() 325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const in operator ()() 328 bool operator () (Key const volatile *lhs, int rhs) const in operator ()() 331 bool operator () (int lhs, Key const volatile *rhs) const in operator ()() 339 typedef map<Key, int, KeyCmp> Container; in template_methods() [all …]
|
D | set_test.cpp | 360 struct Key struct 362 Key() : m_data(0) {} in Key() function 363 explicit Key(int data) : m_data(data) {} in Key() function 370 bool operator () (Key lhs, Key rhs) const in operator ()() argument 373 bool operator () (Key lhs, int rhs) const in operator ()() 376 bool operator () (int lhs, Key rhs) const in operator ()() 382 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const in operator ()() 385 bool operator () (Key const volatile *lhs, int rhs) const in operator ()() 388 bool operator () (int lhs, Key const volatile *rhs) const in operator ()() 396 typedef set<Key, KeyCmp> KeySet; in template_methods() [all …]
|
D | unordered_test.cpp | 514 struct Key struct 516 Key() : m_data(0) {} in Key() argument 517 explicit Key(int data) : m_data(data) {} in Key() function 522 bool operator==(const Key&) const; argument 528 size_t operator () (Key key) const in operator ()() 537 bool operator () (Key lhs, Key rhs) const in operator ()() 540 bool operator () (Key lhs, int rhs) const in operator ()() 543 bool operator () (int lhs, Key rhs) const in operator ()() 549 size_t operator () (Key const volatile *key) const in operator ()() 558 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const in operator ()() [all …]
|
/external/clang/lib/Lex/ |
D | HeaderMap.cpp | 38 uint32_t Key; // Offset (into strings) of key. member 140 Result.Key = HMAP_EmptyBucketKey; in getBucket() 154 Result.Key = getEndianAdjustedWord(BucketPtr->Key); in getBucket() 191 if (B.Key == HMAP_EmptyBucketKey) continue; in dump() 193 const char *Key = getString(B.Key); in dump() local 196 fprintf(stderr, " %d. %s -> '%s' '%s'\n", i, Key, Prefix, Suffix); in dump() 215 if (B.Key == HMAP_EmptyBucketKey) return 0; // Hash miss. in LookupFile() 218 if (!Filename.equals_lower(getString(B.Key))) in LookupFile()
|
/external/llvm/include/llvm/MC/ |
D | SubtargetFeature.h | 35 const char *Key; // K-V key string member 42 return strcmp(Key, S.Key) < 0; 52 const char *Key; // K-V key string member 57 return strcmp(Key, S.Key) < 0;
|
/external/chromium/base/ |
D | global_descriptors_posix.h | 39 typedef uint32_t Key; typedef 40 typedef std::vector<std::pair<Key, int> > Mapping; 50 int Get(Key key) const; 53 int MaybeGet(Key key) const; 56 void Set(Key key, int fd);
|
/external/webkit/Source/JavaScriptCore/runtime/ |
D | StructureTransitionTable.h | 44 typedef std::pair<RefPtr<StringImpl>, unsigned> Key; typedef 45 static unsigned hash(const Key& p) in hash() 50 static bool equal(const Key& a, const Key& b) in equal() 73 static void* finalizerContextFor(Hash::Key) in finalizerContextFor() 78 static inline Hash::Key keyForFinalizer(void* context, Structure* structure) in keyForFinalizer() 84 …typedef WeakGCMap<Hash::Key, Structure, WeakGCMapFinalizerCallback, Hash, HashTraits> TransitionMa… 86 static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);
|
/external/clang/test/SemaCXX/ |
D | flexible-array-test.cpp | 4 template <class Key, class T> struct QMap 6 void insert(const Key &, const T &); 11 template <class Key, class T> 12 void QMap<Key, T>::insert(const Key &, const T &avalue) in insert() argument
|
/external/llvm/lib/MC/ |
D | SubtargetFeature.cpp | 125 KV.Key = S.data(); in Find() 131 if (F == Hi || StringRef(F->Key) != S) return NULL; in Find() 142 MaxLen = std::max(MaxLen, std::strlen(Table[i].Key)); in getLongestEntryLength() 157 errs() << " " << CPUTable[i].Key in Help() 158 << std::string(MaxCPULen - std::strlen(CPUTable[i].Key), ' ') in Help() 165 errs() << " " << FeatTable[i].Key in Help() 166 << std::string(MaxFeatLen - std::strlen(FeatTable[i].Key), ' ') in Help() 271 assert(strcmp(CPUTable[i - 1].Key, CPUTable[i].Key) < 0 && in getFeatureBits() 275 assert(strcmp(FeatureTable[i - 1].Key, FeatureTable[i].Key) < 0 && in getFeatureBits() 348 assert(strcmp(Table[i - 1].Key, Table[i].Key) < 0 && "Table is not sorted"); in getItinerary()
|
/external/apache-harmony/crypto/src/test/support/common/java/org/apache/harmony/crypto/tests/support/ |
D | MyExemptionMechanismSpi.java | 27 import java.security.Key; 65 protected void engineInit(Key key) throws InvalidKeyException, in engineInit() 76 protected void engineInit(Key key, AlgorithmParameters params) in engineInit() 88 protected void engineInit(Key key, AlgorithmParameterSpec params) in engineInit() 100 public class tmpKey implements Key { 118 public class tmp1Key implements Key {
|
D | MyKeyAgreementSpi.java | 26 import java.security.Key; 44 protected Key engineDoPhase(Key key, boolean lastPhase) in engineDoPhase() 74 protected void engineInit(Key key, SecureRandom random) in engineInit() 80 protected void engineInit(Key key, AlgorithmParameterSpec params, in engineInit()
|
/external/dropbear/libtomcrypt/notes/ |
D | cipher_tv.txt | 7 Key Size: 16 bytes 59 Key Size: 24 bytes 111 Key Size: 32 bytes 165 Key Size: 8 bytes 217 Key Size: 32 bytes 269 Key Size: 56 bytes 323 Key Size: 16 bytes 377 Key Size: 8 bytes 429 Key Size: 68 bytes 481 Key Size: 128 bytes [all …]
|
/external/clang/lib/Driver/ |
D | ToolChains.cpp | 205 Action::ActionClass Key; in SelectTool() local 214 Key = JA.getKind(); in SelectTool() 216 Key = Action::AnalyzeJobClass; in SelectTool() 218 Key = JA.getKind(); in SelectTool() 230 Tool *&T = Tools[Key]; in SelectTool() 232 switch (Key) { in SelectTool() 970 Action::ActionClass Key; in SelectTool() local 972 Key = Action::AnalyzeJobClass; in SelectTool() 974 Key = JA.getKind(); in SelectTool() 976 Tool *&T = Tools[Key]; in SelectTool() [all …]
|