| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/ |
| BaseLocale.java | 58 Key key = new Key(language, script, region, variant); local
59 BaseLocale baseLocale = CACHE.get(key);
145 private static class Key implements Comparable<Key> {
153 public Key(String language, String script, String region, String variant) {
171 (obj instanceof Key)
172 && AsciiUtil.caseIgnoreMatch(((Key)obj)._lang, this._lang)
173 && AsciiUtil.caseIgnoreMatch(((Key)obj)._scrt, this._scrt
[all...] |
| /external/llvm/include/llvm/ADT/ |
| ScopedHashTable.h | 47 K Key;
49 ScopedHashTableVal(const K &key, const V &val) : Key(key), Val(val) {}
52 const K &getKey() const { return Key; }
63 const K &key, const V &val,
67 new (New) ScopedHashTableVal(key, val);
174 /// Return 1 if the specified key is in the table, 0 otherwise.
175 size_type count(const K &Key) const {
176 return TopLevelMap.count(Key);
[all...] |
| /external/llvm/lib/ExecutionEngine/ |
| GDBRegistrationListener.cpp | 172 const char *Key = Object.getMemoryBufferRef().getBufferStart();
174 assert(Key && "Attempt to register a null object with a debugger.");
176 assert(ObjectBufferMap.find(Key) == ObjectBufferMap.end() &&
187 ObjectBufferMap[Key] = RegisteredObjectInfo(Size, JITCodeEntry,
194 const char *Key = Object.getMemoryBufferRef().getBufferStart();
196 RegisteredObjectBufferMap::iterator I = ObjectBufferMap.find(Key);
|
| /external/llvm/lib/IR/ |
| Module.cpp | 304 MDString *Key = cast<MDString>(Flag->getOperand(1));
306 Flags.push_back(ModuleFlagEntry(MFB, Key, Val));
311 /// Return the corresponding value if Key appears in module flags, otherwise
313 Metadata *Module::getModuleFlag(StringRef Key) const {
317 if (Key == MFE.Key->getString())
340 void Module::addModuleFlag(ModFlagBehavior Behavior, StringRef Key,
345 MDString::get(Context, Key), Val};
348 void Module::addModuleFlag(ModFlagBehavior Behavior, StringRef Key,
350 addModuleFlag(Behavior, Key, ConstantAsMetadata::get(Val))
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SymbolRewriter.cpp | 276 yaml::ScalarNode *Key;
281 Key = dyn_cast<yaml::ScalarNode>(Entry.getKey());
282 if (!Key) {
293 RewriteType = Key->getValue(KeyStorage);
295 return parseRewriteFunctionDescriptor(YS, Key, Value, DL);
297 return parseRewriteGlobalVariableDescriptor(YS, Key, Value, DL);
299 return parseRewriteGlobalAliasDescriptor(YS, Key, Value, DL);
315 yaml::ScalarNode *Key;
321 Key = dyn_cast<yaml::ScalarNode>(Field.getKey());
322 if (!Key) {
[all...] |
| /external/marisa-trie/tools/ |
| marisa-benchmark.cc | 16 typedef std::pair<std::string, double> Key;
57 " -I, --predict-ids get key IDs in predictive searches (default)\n"
58 " -i, --predict-strs restore key strings in predictive searches\n"
60 " -s, --print-time print time [us/key]\n"
129 void read_keys(std::istream *input, std::vector<Key> *keys) {
130 Key key; local
136 key.second = std::strtod(&line[delim_pos + 1], &end_of_value);
140 key.second = 1.0;
143 key.second = 1.0
187 std::string key; local
[all...] |
| /external/marisa-trie/v0_1_5/tools/ |
| marisa_alpha-benchmark.cc | 16 typedef std::pair<std::string, double> Key;
57 " -I, --predict-ids get key IDs in predictive searches (default)\n"
58 " -i, --predict-strs restore key strings in predictive searches\n"
60 " -s, --print-time print time [us/key]\n"
129 void read_keys(std::istream *input, std::vector<Key> *keys) {
130 Key key; local
136 key.second = std::strtod(&line[delim_pos + 1], &end_of_value);
140 key.second = 1.0;
143 key.second = 1.0
187 std::string key; local
[all...] |
| /external/skia/src/core/ |
| SkResourceCache.h | 20 * Cache object for bitmaps (with possible scale in X Y as part of the key).
31 struct Key {
36 // nameSpace must be unique per Key subclass.
47 bool operator==(const Key& other) const {
71 typedef SkResourceCache::Key Key;
78 virtual const Key& getKey() const = 0;
82 static uint32_t Hash(const Key& key) { return key.hash();
[all...] |
| SkImageFilter.cpp | 44 struct SkImageFilter::Cache::Key {
45 Key(const uint32_t uniqueID, const SkMatrix& matrix, const SkIRect& clipBounds, uint32_t srcGenID)
47 // Assert that Key is tightly-packed, since it is hashed.
48 SK_COMPILE_ASSERT(sizeof(Key) == sizeof(uint32_t) + sizeof(SkMatrix) + sizeof(SkIRect) +
56 bool operator==(const Key& other) const {
178 Cache::Key key(fUniqueID, context.ctm(), context.clipBounds(), srcGenID);
180 if (context.cache()->get(key, result, offset)) {
191 context.cache()->set(key, *result, *offset);
424 SkTDynamicHash<Value, Key>::Iter iter(&fLookup)
[all...] |
| /external/v8/src/ |
| effects.h | 188 typedef Var Key;
|
| preparse-data.h | 126 struct Key {
|
| hydrogen-bce.cc | 17 // To do so we keep a dictionary of all checks where the key if the pair
19 // The class BoundsCheckKey represents this key.
84 // (the key is BoundsCheckKey).
88 // with the same key (the dictionary holds the head of the list).
98 BoundsCheckKey* Key() const { return key_; }
195 BoundsCheckBbData(BoundsCheckKey* key,
203 : key_(key),
307 BoundsCheckBbData** BoundsCheckTable::LookupOrInsert(BoundsCheckKey* key,
310 &(Lookup(key, key->Hash(), true, ZoneAllocationPolicy(zone))->value))
383 BoundsCheckKey* key = local
[all...] |
| interface-descriptors.h | 109 enum Key {
122 CallInterfaceDescriptor(Isolate* isolate, CallDescriptors::Key key)
123 : data_(isolate->call_descriptor_data(key)) {}
176 explicit name(Isolate* isolate) : base(isolate, key()) { \
178 Initialize(isolate->call_descriptor_data(key())); \
183 name(Isolate* isolate, CallDescriptors::Key key) : base(isolate, key) {} \
186 static inline CallDescriptors::Key key()
[all...] |
| /frameworks/base/services/core/java/com/android/server/accounts/ |
| TokenCache.java | 48 private static class Key {
54 public Key(Account account, String tokenType, String packageName, byte[] sigDigest) {
63 if (o != null && o instanceof Key) {
64 Key cacheKey = (Key) o;
83 private static class TokenLruCache extends LruCache<Key, Value> {
86 private final List<Key> mKeys;
92 public void add(Key k) {
97 for (Key k : mKeys) {
116 protected int sizeOf(Key k, Value v)
[all...] |
| /frameworks/native/include/input/ |
| KeyCharacterMap.h | 37 * Describes a mapping from Android key codes to characters.
39 * and key modifier semantics.
65 // Substitute key code and meta state for fallback action.
71 /* Loads a key character map from a file. */
74 /* Loads a key character map from its string contents. */
78 /* Combines a base key character map and an overlay. */
82 /* Returns an empty key character map. */
88 /* Gets the primary character for this key as in the label physically printed on it.
92 /* Gets the Unicode character for the number or symbol generated by the key
98 /* Gets the Unicode character generated by the key and meta key modifiers
[all...] |
| /ndk/tests/device/test-gnustl-full/unit/ |
| map_test.cpp | 303 struct Key
305 Key() : m_data(0) {}
306 explicit Key(int data) : m_data(data) {}
313 bool operator () (Key lhs, Key rhs) const
316 bool operator () (Key lhs, int rhs) const
319 bool operator () (int lhs, Key rhs) const
325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
328 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| set_test.cpp | 360 struct Key
362 Key() : m_data(0) {}
363 explicit Key(int data) : m_data(data) {}
370 bool operator () (Key lhs, Key rhs) const
373 bool operator () (Key lhs, int rhs) const
376 bool operator () (int lhs, Key rhs) const
382 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
385 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| /ndk/tests/device/test-stlport/unit/ |
| map_test.cpp | 303 struct Key
305 Key() : m_data(0) {}
306 explicit Key(int data) : m_data(data) {}
313 bool operator () (Key lhs, Key rhs) const
316 bool operator () (Key lhs, int rhs) const
319 bool operator () (int lhs, Key rhs) const
325 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
328 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| set_test.cpp | 360 struct Key
362 Key() : m_data(0) {}
363 explicit Key(int data) : m_data(data) {}
370 bool operator () (Key lhs, Key rhs) const
373 bool operator () (Key lhs, int rhs) const
376 bool operator () (int lhs, Key rhs) const
382 bool operator () (Key const volatile *lhs, Key const volatile *rhs) const
385 bool operator () (Key const volatile *lhs, int rhs) cons
[all...] |
| /development/tools/idegen/src/com/android/idegen/ |
| Module.java | 62 protected enum Key {
166 Iterable<String> values = makeFileParser.getValues(Key.LOCAL_SRC_FILES.name());
204 parseDirectDependencies(Key.LOCAL_STATIC_JAVA_LIBRARIES);
205 parseDirectDependencies(Key.LOCAL_JAVA_LIBRARIES);
209 private void parseDirectDependencies(Key key) {
210 Iterable<String> names = makeFileParser.getValues(key.name());
|
| /external/llvm/include/llvm/Support/ |
| OnDiskHashTable.h | 32 /// payload and computes the hash for a given key. This should provide the
45 /// /// Calculate the hash for Key
46 /// static hash_value_type ComputeHash(key_type_ref Key);
47 /// /// Return the lengths, in bytes, of the given Key/Data pair.
49 /// EmitKeyDataLength(raw_ostream &Out, key_type_ref Key, data_type_ref Data);
50 /// /// Write Key to Out. KeyLen is the length from EmitKeyDataLength.
51 /// static void EmitKey(raw_ostream &Out, key_type_ref Key,
54 /// static void EmitData(raw_ostream &Out, key_type_ref Key,
62 typename Info::key_type Key;
67 Item(typename Info::key_type_ref Key, typename Info::data_type_ref Data
[all...] |
| YAMLParser.h | 225 /// \brief A key and value pair. While not technically a Node under the YAML
237 : Node(NK_KeyValue, D, StringRef(), StringRef()), Key(nullptr),
240 /// \brief Parse and return the key.
244 /// \returns The key, or nullptr if failed() == true.
264 Node *Key;
349 MT_Inline ///< An inline mapping node is used for "[key: value]".
398 // key:
|
| /external/v8/include/ |
| v8-util.h | 47 static K Key(Iterator it) { return it->first; }
49 static PersistentContainerValue Set(Impl* impl, K key,
51 std::pair<Iterator, bool> res = impl->insert(std::make_pair(key, value));
59 static PersistentContainerValue Get(Impl* impl, K key) {
60 Iterator it = impl->find(key);
64 static PersistentContainerValue Remove(Impl* impl, K key) {
65 Iterator it = impl->find(key);
92 MapType* map, const K& key, Local<V> value) {
104 static void Dispose(Isolate* isolate, UniquePersistent<V> value, K key) { }
140 Local<V> Get(const K& key) {
300 K key = Traits::KeyFromWeakCallbackData(data); local
[all...] |
| /external/vixl/src/vixl/ |
| invalset.h | 50 // - A key must be available to represent invalid elements.
51 // - Elements with an invalid key must compare higher or equal to any other
58 // - Elements are (generally) inserted in order (sorted according to their key).
59 // - A key is available to mark elements as invalid (deleted).
64 // marked with the 'invalid' key. Other methods of the container take care of
70 // their key. The structure only reclaims memory when safe to do so, if the
113 // This returns the key of the minimum element in the set.
117 static KeyType Key(const ElementType& element);
118 static void SetKey(ElementType* element, KeyType key);
146 // Delete the elements that have an invalid key. The complexity is linea
[all...] |
| /frameworks/base/services/core/java/com/android/server/am/ |
| PendingIntentRecord.java | 45 final Key key; field in class:PendingIntentRecord
55 final static class Key {
72 Key(int _t, String _p, ActivityRecord _a, String _w,
115 Key other = (Key)otherObj;
172 return "Key{" + typeName() + " pkg=" + packageName
194 PendingIntentRecord(ActivityManagerService _owner, Key _k, int _u) {
196 key = _k;
221 if ((key.flags&PendingIntent.FLAG_ONE_SHOT) != 0)
[all...] |
