| /external/vixl/test/ |
| test-invalset.cc | 40 // We test with an object for which the key and the value are distinct.
44 Obj(KeyType key, ValType val) : key_(key), val_(val) {}
83 kReclaimFactor>::Key(const Obj& obj) {
92 kReclaimFactor>::SetKey(Obj* obj, KeyType key) {
93 obj->key_ = key;
|
| /frameworks/native/include/input/ |
| KeyLayoutMap.h | 59 * Describes a mapping from keyboard scan codes and joystick axes to Android key codes and axes.
79 struct Key {
89 KeyedVector<int32_t, Key> mKeysByScanCode;
90 KeyedVector<int32_t, Key> mKeysByUsageCode;
97 const Key* getKey(int32_t scanCode, int32_t usageCode) const;
|
| /external/clang/lib/Lex/ |
| HeaderMap.cpp | 38 uint32_t Key; // Offset (into strings) of key.
133 /// this return a bucket with an empty key (0).
136 Result.Key = HMAP_EmptyBucketKey;
150 Result.Key = getEndianAdjustedWord(BucketPtr->Key);
187 if (B.Key == HMAP_EmptyBucketKey) continue;
189 const char *Key = getString(B.Key);
192 fprintf(stderr, " %d. %s -> '%s' '%s'\n", i, Key, Prefix, Suffix)
[all...] |
| /external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
| AttributeStrategy.java | 12 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>();
15 final Key key = keyPool.get(bitmap.getWidth(), bitmap.getHeight(), bitmap.getConfig()); local
17 groupedMap.put(key, bitmap);
22 final Key key = keyPool.get(width, height, config); local
24 return groupedMap.get(key);
61 static class KeyPool extends BaseKeyPool<Key> {
62 public Key get(int width, int height, Bitmap.Config config)
[all...] |
| SizeStrategy.java | 19 private final GroupedLinkedMap<Key, Bitmap> groupedMap = new GroupedLinkedMap<Key, Bitmap>();
25 final Key key = keyPool.get(size); local
27 groupedMap.put(key, bitmap);
29 Integer current = sortedSizes.get(key.size);
30 sortedSizes.put(key.size, current == null ? 1 : current + 1);
36 Key key = keyPool.get(size); local
40 keyPool.offer(key);
[all...] |
| /external/llvm/lib/Object/ |
| IRObjectFile.cpp | 93 StringRef Key = KV.first();
111 std::make_pair<std::string, uint32_t>(Key, std::move(Res)));
|
| /external/llvm/unittests/ADT/ |
| StringMapTest.cpp | 71 const char StringMapTest::testKey[] = "key";
232 // the particular key, and the implementation of StringMap and HashString.
282 StringRef Key = "Test";
283 StringMapEntry<MoveOnly>::Create(Key, MoveOnly(42))
288 StringRef Key = "Test";
289 StringMapEntry<MoveOnly>::Create(Key, Immovable())
|
| /external/lzma/CS/7zip/Compress/LzmaAlone/ |
| LzmaAlone.cs | 62 enum Key
156 if (parser[(int)Key.Help1].ThereIs || parser[(int)Key.Help2].ThereIs)
172 if (parser[(int)Key.Dictionary].ThereIs)
175 if (!GetNumber((string)parser[(int)Key.Dictionary].PostStrings[0], out dicLog))
181 if (parser[(int)Key.MatchFinder].ThereIs)
182 mf = (string)parser[(int)Key.MatchFinder].PostStrings[0];
196 if (parser[(int)Key.Train].ThereIs)
197 train = (string)parser[(int)Key.Train].PostStrings[0];
207 bool stdInMode = parser[(int)Key.StdIn].ThereIs;
[all...] |
| /external/mesa3d/src/mesa/main/ |
| hash.c | 8 * \note key=0 is illegal.
53 GLuint Key; /**< the entry's key */
64 GLuint MaxKey; /**< highest key inserted so far */
127 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key)
133 assert(key);
135 pos = HASH_FUNC(key);
138 if (entry->Key == key) {
151 * \param key the key
460 GLuint key; local
[all...] |
| /external/skia/include/core/ |
| SkPicture.h | 49 typedef uint32_t Key;
51 AccelData(Key key) : fKey(key) { }
53 const Key& getKey() const { return fKey; }
59 Key fKey;
63 const AccelData* EXPERIMENTAL_getAccelData(AccelData::Key) const;
|
| /external/skia/src/gpu/effects/ |
| GrTextureStripAtlas.h | 25 * Descriptor struct which we'll use as a hash table key
75 // Key to indicate an atlas row without any meaningful data stored in it
115 * Searches the key table for a key and returns the index if found; if not found, it returns
116 * the bitwise not of the index at which we could insert the key to maintain a sorted list.
118 int searchByKey(uint32_t key);
121 * Compare two atlas rows by key, so we can sort/search by key
141 class Key : public GrMurmur3HashKey<sizeof(GrTextureStripAtlas::Desc)> {};
142 static const Key& GetKey(const AtlasEntry& entry) { return entry.fKey;
[all...] |
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/ |
| ProtoPool.java | 37 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); local
64 Integer prev = internedItems.put(key, 0);
66 stringPool.intern(key.getShorty());
72 @Nonnull @Override public CharSequence getShorty(@Nonnull Key key)
[all...] |
| /external/v8/src/ |
| scopeinfo.h | 55 struct Key {
103 Key keys_[kLength];
|
| splay-tree.h | 17 // 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;
56 // Checks if there is a mapping for the key
120 Key key() { return key_; } function in class:v8::internal::SplayTree::Node
140 const Key& key() { return node_->key_; } function in class:v8::internal::SplayTree::BASE_EMBEDDED
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-gap-resolver.cc | 36 typedef std::pair<InstructionOperand::Kind, int> Key;
37 typedef Key Value;
38 typedef std::map<Key, Value> OperandMap;
53 static Key KeyFor(const InstructionOperand* op) {
54 return Key(op->kind(), op->index());
|
| /frameworks/base/packages/SystemUI/src/com/android/systemui/ |
| Prefs.java | 33 Key.SEARCH_APP_WIDGET_ID,
34 Key.DEBUG_MODE_ENABLED,
35 Key.HOTSPOT_TILE_LAST_USED,
36 Key.COLOR_INVERSION_TILE_LAST_USED,
37 Key.DND_TILE_VISIBLE,
38 Key.DND_TILE_COMBINED_ICON,
39 Key.DND_CONFIRMED_PRIORITY_INTRODUCTION,
40 Key.DND_CONFIRMED_SILENCE_INTRODUCTION,
41 Key.DND_FAVORITE_BUCKET_INDEX,
42 Key.DND_NONE_SELECTED
[all...] |
| /frameworks/base/tools/split-select/ |
| Rule.h | 48 enum Key {
59 Key key; member in struct:split::Rule
74 , key(NONE)
|
| /frameworks/native/services/surfaceflinger/RenderEngine/ |
| ProgramCache.h | 43 * Key is used to retrieve a Program in the cache.
44 * A Key is generated from a Description.
46 class Key {
74 inline Key() : mKey(0) { }
75 inline Key(const Key& rhs) : mKey(rhs.mKey) { }
77 inline Key& set(key_t mask, key_t value) {
102 friend inline int strictly_order_type(const Key& lhs, const Key& rhs) {
117 // compute a cache Key from a Descriptio
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| find_test.cpp | 51 struct Key
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
|
| /ndk/tests/device/test-stlport/unit/ |
| find_test.cpp | 51 struct Key
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| PagedViewIconCache.java | 34 public static class Key {
43 public Key(ApplicationInfo info) {
47 public Key(ResolveInfo info) {
53 public Key(AppWidgetProviderInfo info) {
67 if (o instanceof Key) {
68 Key k = (Key) o;
79 private final HashMap<Key, Bitmap> mIconOutlineCache = new HashMap<Key, Bitmap>();
82 for (Key key : mIconOutlineCache.keySet())
[all...] |
| /frameworks/native/libs/input/ |
| KeyCharacterMap.cpp | 98 mKeys.add(other.mKeys.keyAt(i), new Key(*other.mKeys.valueAt(i)));
104 Key* key = mKeys.editValueAt(i); local
105 delete key;
116 ALOGE("Error %d opening key character map file %s.", status, filename.string());
131 ALOGE("Error %d opening key character map.", status);
144 ALOGE("Error allocating key character map.");
154 ALOGD("Parsed key character map file '%s' %d lines in %0.3fms.",
177 Key* key = overlay->mKeys.valueAt(i) local
209 const Key* key; local
221 const Key* key; local
233 const Key* key; local
250 const Key* key; local
271 const Key* key; local
373 const Key* key; local
425 const Key* key = mKeys.valueAt(i); local
577 Key* key = new Key(); local
617 const Key* key = mKeys.valueAt(i); local
877 Key* key = mMap->mKeys.valueFor(mKeyCode); local
[all...] |
| /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Collections/ |
| HashList.cs | 58 Key,
94 public object Key
154 if (_mode == EnumerationMode.Key)
273 return new HashListEnumerator(_hashList, HashListEnumerator.EnumerationMode.Key);
388 public object this[object key]
390 get { return _dictionary[key]; }
393 bool isNewEntry = !_dictionary.Contains(key);
394 _dictionary[key] = value;
396 _insertionOrderList.Add(key);
401 public void Remove(object key)
[all...] |
| /external/clang/lib/CodeGen/ |
| CodeGenTypes.cpp | 121 const Type *Key = CGT.getContext().getTagDeclType(RD).getTypePtr();
124 if (CGT.isRecordLayoutComplete(Key)) return true;
127 if (CGT.isRecordBeingLaidOut(Key))
636 const Type *Key = Context.getTagDeclType(RD).getTypePtr();
638 llvm::StructType *&Entry = RecordDeclTypes[Key];
660 bool InsertResult = RecordsBeingLaidOut.insert(Key).second;
675 CGRecordLayouts[Key] = Layout;
678 bool EraseResult = RecordsBeingLaidOut.erase(Key); (void)EraseResult;
699 const Type *Key = Context.getTagDeclType(RD).getTypePtr();
701 const CGRecordLayout *Layout = CGRecordLayouts.lookup(Key);
[all...] |
| /external/clang/test/CodeGen/ |
| 2008-03-24-BitField-And-Alloca.c | 61 } key; member in union:_Key
63 } Key;
65 static void foo(const Key iospec, int* ret)
86 __attribute__ ((unused)) Key iospec = (Key) key_token2;
|
