Searched defs:Key (Results 26 - 50 of 145) sorted by relevance

123456

/external/chromium_org/net/dns/
H A Dmdns_cache.h28 // Key type for the record map. It is a 3-tuple of type, name and optional
32 class Key { class in class:net::MDnsCache
34 Key(unsigned type, const std::string& name, const std::string& optional);
35 Key(const Key&);
36 Key& operator=(const Key&);
37 ~Key();
38 bool operator<(const Key& key) const;
39 bool operator==(const Key
[all...]
H A Dhost_resolver_impl.h154 typedef HostCache::Key Key; typedef in class:net::HostResolverImpl
155 typedef std::map<Key, Job*> JobMap;
166 int ResolveHelper(const Key& key,
173 bool ResolveAsIP(const Key& key,
181 bool ServeFromCache(const Key& key,
188 bool ServeFromHosts(const Key& key,
198 Key GetEffectiveKeyForRequest(const RequestInfo& info,
202 void CacheResult(const Key& key,
245 // Map from HostCache::Key t
[all...]
/external/chromium_org/ui/base/
H A Dview_prop.cc99 const char* ViewProp::Key() const { function in class:ui::ViewProp
/external/clang/tools/diagtool/
H A DDiagnosticNames.cpp53 DiagnosticRecord Key = {nullptr, DiagID, 0}; local
58 Key, orderByID);
/external/eigen/demos/opengl/
H A Dicosphere.cpp63 typedef unsigned long long Key; typedef
64 std::map<Key,int> edgeMap;
81 Key edgeKey = Key(e0) | (Key(e1)<<32);
82 std::map<Key,int>::iterator it = edgeMap.find(edgeKey);
/external/openfst/src/include/fst/
H A Dgeneric-register.h43 typedef KeyType Key; typedef in class:fst::GenericRegister
141 // given RegisterType template parameter. This type must define types Key
148 typedef typename RegisterType::Key Key; typedef in class:fst::GenericRegisterer
151 GenericRegisterer(Key key, Entry entry) {
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/
H A DBuilderProtoPool.java59 ProtoKey key = new Key(parameters, returnType);
114 private static class Key implements ProtoKey { class in class:BuilderProtoPool
118 public Key(@Nonnull List<? extends CharSequence> parameters, @Nonnull String returnType) { method in class:BuilderProtoPool.Key
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/
H A DProtoPool.java37 import org.jf.dexlib2.writer.pool.ProtoPool.Key;
47 public class ProtoPool extends BaseIndexPool<Key>
48 implements ProtoSection<CharSequence, CharSequence, Key, TypeListPool.Key<? extends Collection<? extends CharSequence>>> {
63 Key key = new Key(method);
72 @Nonnull @Override public CharSequence getShorty(@Nonnull Key key) {
76 @Nonnull @Override public CharSequence getReturnType(@Nonnull Key key) {
80 @Nullable @Override public TypeListPool.Key<List<? extends CharSequence>> getParameters(@Nonnull Key ke
84 public static class Key implements Comparable<Key> { class in class:ProtoPool
87 public Key(@Nonnull MethodReference method) { method in class:ProtoPool.Key
[all...]
/external/chromium_org/third_party/WebKit/Source/bindings/core/v8/
H A DV8PersistentValueMap.h63 static KeyType Key(Iterator& iter) { return iter->key; } function in class:blink::V8PersistentValueMapTraits
/external/chromium_org/third_party/cld/encodings/compact_lang_det/
H A Dtote.h28 uint8 Key(int i) const {return key_[i];} function in class:Tote
66 uint8 Key(int i) const {return key_[i];} function in class:ToteWithReliability
/external/chromium_org/third_party/leveldatabase/src/db/
H A Dautocompact_test.cc36 std::string Key(int i) { function in class:leveldb::AutoCompactTest
64 ASSERT_OK(db_->Put(WriteOptions(), Key(i), value));
70 ASSERT_OK(db_->Delete(WriteOptions(), Key(i)));
75 const int64_t initial_size = Size(Key(0), Key(n));
76 const int64_t initial_other_size = Size(Key(n), Key(kCount));
79 std::string limit_key = Key(n);
91 uint64_t size = Size(Key(0), Key(
[all...]
/external/chromium_org/third_party/leveldatabase/src/util/
H A Dbloom_test.cc16 static Slice Key(int i, char* buffer) { function in namespace:leveldb
80 if (Matches(Key(i + 1000000000, buffer))) {
125 Add(Key(i, buffer));
134 ASSERT_TRUE(Matches(Key(i, buffer)))
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dhash.c53 GLuint Key; /**< the entry's key */ member in struct:HashEntry
138 if (entry->Key == key) {
194 if (entry->Key == key) {
210 entry->Key = key;
252 if (entry->Key == key) {
295 callback(entry->Key, entry->Data, userData);
334 callback(entry->Key, entry->Data, userData);
358 return table->Table[pos]->Key;
384 if (entry->Key == key) {
396 return entry->Next->Key;
[all...]
/external/chromium_org/third_party/skia/include/core/
H A DSkPicture.h50 typedef uint32_t Key; typedef in class:SkPicture::AccelData
52 AccelData(Key key) : fKey(key) { }
54 const Key& getKey() const { return fKey; }
60 Key fKey;
69 const AccelData* EXPERIMENTAL_getAccelData(AccelData::Key) const;
/external/chromium_org/third_party/skia/src/core/
H A DSkResourceCache.h28 struct Key { struct in class:SkResourceCache
39 bool operator==(const Key& other) const {
61 typedef SkResourceCache::Key Key; typedef in struct:SkResourceCache::Rec
68 virtual const Key& getKey() const = 0;
72 static uint32_t Hash(const Key& key) { return key.hash(); }
73 static const Key& GetKey(const Rec& rec) { return rec.getKey(); }
86 * specified Key, and will pass in the corresponding Rec, along with a caller-specified
108 * Returns true if the visitor was called on a matching Key, and the visitor returned true.
110 * Find() will search the cache for the specified Key
[all...]
/external/chromium_org/v8/src/
H A Dsplay-tree.h17 // typedef Key: the key type
19 // static const Key kNoKey: the dummy key used when no key is set
21 // static int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
33 typedef typename Config::Key Key; typedef in class:v8::internal::SplayTree
57 bool Contains(const Key& key);
62 bool Insert(const Key& key, Locator* locator);
67 bool Find(const Key& key, Locator* locator);
71 bool FindGreatestLessThan(const Key
[all...]
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DAttributeStrategy.java11 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>();
14 final Key key = keyPool.get(bitmap.getWidth(), bitmap.getHeight(), bitmap.getConfig());
21 final Key key = keyPool.get(width, height, config);
59 private static class KeyPool extends BaseKeyPool<Key> {
60 public Key get(int width, int height, Bitmap.Config config) {
61 Key result = get();
67 protected Key create() {
68 return new Key(this);
72 private static class Key implement class in class:AttributeStrategy
79 public Key(KeyPool pool) { method in class:AttributeStrategy.Key
[all...]
H A DSizeStrategy.java16 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>();
21 final Key key = keyPool.get(bitmap.getAllocationByteCount());
32 Key key = keyPool.get(size);
128 private static class KeyPool extends BaseKeyPool<Key> {
130 public Key get(int size) {
131 Key result = get();
137 protected Key create() {
138 return new Key(this);
142 private static class Key implement class in class:SizeStrategy
146 private Key(KeyPool pool) { method in class:SizeStrategy.Key
[all...]
/external/llvm/include/llvm/ADT/
H A DMapVector.h75 ValueT &operator[](const KeyT &Key) { argument
76 std::pair<KeyT, unsigned> Pair = std::make_pair(Key, 0);
80 Vector.push_back(std::make_pair(Key, ValueT()));
86 ValueT lookup(const KeyT &Key) const {
87 typename MapType::const_iterator Pos = Map.find(Key);
103 size_type count(const KeyT &Key) const {
104 typename MapType::const_iterator Pos = Map.find(Key);
108 iterator find(const KeyT &Key) { argument
109 typename MapType::const_iterator Pos = Map.find(Key);
114 const_iterator find(const KeyT &Key) cons
[all...]
/external/llvm/lib/Object/
H A DIRObjectFile.cpp94 StringRef Key = KV.first(); local
112 std::make_pair<std::string, uint32_t>(Key, std::move(Res)));
/external/llvm/lib/Support/
H A DStringMap.cpp116 int StringMapImpl::FindKey(StringRef Key) const {
119 unsigned FullHashValue = HashString(Key);
141 if (Key == StringRef(ItemStr, BucketItem->getKeyLength())) {
167 StringMapEntryBase *StringMapImpl::RemoveKey(StringRef Key) { argument
168 int Bucket = FindKey(Key);
/external/llvm/unittests/ADT/
H A DStringMapTest.cpp276 StringRef Key = "Test"; local
277 StringMapEntry<MoveOnly>::Create(Key, MoveOnly(42))
/external/mesa3d/src/mesa/main/
H A Dhash.c53 GLuint Key; /**< the entry's key */ member in struct:HashEntry
138 if (entry->Key == key) {
194 if (entry->Key == key) {
210 entry->Key = key;
252 if (entry->Key == key) {
295 callback(entry->Key, entry->Data, userData);
334 callback(entry->Key, entry->Data, userData);
358 return table->Table[pos]->Key;
384 if (entry->Key == key) {
396 return entry->Next->Key;
[all...]
/external/skia/include/core/
H A DSkPicture.h48 typedef uint32_t Key; typedef in class:SkPicture::AccelData
50 AccelData(Key key) : fKey(key) { }
52 const Key& getKey() const { return fKey; }
58 Key fKey;
74 const AccelData* EXPERIMENTAL_getAccelData(AccelData::Key key) const {
/external/stlport/test/unit/
H A Dfind_test.cpp51 struct Key struct
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);

Completed in 9453 milliseconds

123456