/external/dexmaker/src/dx/java/com/android/dx/io/instructions/ |
H A D | SparseSwitchPayloadDecodedInstruction.java | 26 private final int[] keys; field in class:SparseSwitchPayloadDecodedInstruction 38 int opcode, int[] keys, int[] targets) { 41 if (keys.length != targets.length) { 42 throw new IllegalArgumentException("keys/targets length mismatch"); 45 this.keys = keys; 55 return keys; 37 SparseSwitchPayloadDecodedInstruction(InstructionCodec format, int opcode, int[] keys, int[] targets) argument
|
/external/guava/guava/src/com/google/common/cache/ |
H A D | AbstractLoadingCache.java | 59 public ImmutableMap<K, V> getAll(Iterable<? extends K> keys) throws ExecutionException { argument 61 for (K key : keys) {
|
H A D | ForwardingLoadingCache.java | 57 public ImmutableMap<K, V> getAll(Iterable<? extends K> keys) throws ExecutionException { argument 58 return delegate().getAll(keys);
|
H A D | LoadingCache.java | 30 * A semi-persistent mapping from keys to values. Values are automatically loaded by the cache, 54 * multiple threads can concurrently load values for distinct keys. 80 * multiple threads can concurrently load values for distinct keys. 99 * Returns a map of the values associated with {@code keys}, creating or retrieving those values 101 * loaded entries; it will never contain null keys or values. 104 * {@link CacheLoader#loadAll} for all keys which are not already present in the cache. All 107 * {@link CacheLoader#loadAll} returns {@code null}, returns a map containing null keys or values, 110 * <p>Note that duplicate elements in {@code keys}, as determined by {@link Object#equals}, will 119 ImmutableMap<K, V> getAll(Iterable<? extends K> keys) throws ExecutionException; argument
|
/external/icu/icu4c/source/samples/legacy/ |
H A D | legacy.cpp | 25 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxLen, uint8_t keys[][32]); 26 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]); 49 void printKeys(const char *comment, uint8_t keys[][32], int32_t keySize) { argument 54 currentKey = keys[i]; 88 static uint8_t keys[4][32]; local 96 test_current(uTest, 4, 5, keys); 98 printKeys("Current keys", keys, 4); 104 test_legacy(uTest, 4, 5, keys); 106 printKeys("Legacy keys", key [all...] |
/external/jemalloc/test/unit/ |
H A D | rtree.c | 41 uintptr_t keys[] = {0, 1, local 45 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) { 46 rtree_set(rtree, keys[j], 1); 47 for (k = 0; k < sizeof(keys)/sizeof(uintptr_t); k++) { 48 assert_u_eq(rtree_get(rtree, keys[k]), 1, 52 "get key=%#"PRIxPTR, i, j, k, keys[j], local 53 keys[k]); local 59 rtree_set(rtree, keys[j], 0); 77 uintptr_t keys[NSET]; local 81 keys[ [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | LookupSwitchInsnNode.java | 54 * The values of the keys. This list is a list of {@link Integer} objects.
56 public List keys;
field in class:LookupSwitchInsnNode 68 * @param keys the values of the keys.
70 * the beginning of the handler block for the <tt>keys[i]</tt> key.
74 final int[] keys,
79 this.keys = new ArrayList(keys == null ? 0 : keys.length);
81 if (keys ! 72 LookupSwitchInsnNode( final LabelNode dflt, final int[] keys, final LabelNode[] labels) argument [all...] |
/external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/builder/ |
H A D | BuilderMapEntryCollection.java | 41 @Nonnull private final Collection<Key> keys; field in class:BuilderMapEntryCollection 43 public BuilderMapEntryCollection(@Nonnull Collection<Key> keys) { argument 44 this.keys = keys; 64 final Iterator<Key> iter = keys.iterator(); 84 return keys.size();
|
/external/wpa_supplicant_8/hs20/server/www/ |
H A D | spp.php | 30 $keys = implode('|', array_keys($needed)); variable 31 preg_match_all('@(' . $keys . ')=(?:([\'"])([^\2]+?)\2|([^\s,]+))@',
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | StringToIntTable.java | 25 * number strings being keys, and the odd number strings being values. 181 * Return array of keys in the table. 185 public final String[] keys() method in class:StringToIntTable
|
/external/chromium_org/base/debug/ |
H A D | crash_logging_unittest.cc | 48 base::debug::CrashKey keys[] = { { kTestKey, 255 } }; local 49 base::debug::InitCrashKeys(keys, arraysize(keys), 255); 63 base::debug::CrashKey keys[] = { { kTestKey, 15 } }; local 64 base::debug::InitCrashKeys(keys, arraysize(keys), 5); 108 base::debug::CrashKey keys[] = { { kTestKey, 255 } }; local 109 base::debug::InitCrashKeys(keys, arraysize(keys), 255); 123 base::debug::CrashKey keys[] local [all...] |
/external/chromium_org/chromeos/dbus/ |
H A D | shill_service_client_unittest.cc | 199 std::vector<std::string> keys; local 200 keys.push_back(shill::kPassphraseProperty); 201 keys.push_back(shill::kSignalStrengthProperty); 203 base::Bind(&ExpectArrayOfStringsArgument, keys), 209 keys, local
|
/external/chromium_org/extensions/browser/api/storage/ |
H A D | weak_unlimited_settings_storage.cc | 20 const std::vector<std::string>& keys) { 21 return delegate_->GetBytesInUse(keys); 35 const std::vector<std::string>& keys) { 36 return delegate_->Get(keys); 59 const std::vector<std::string>& keys) { 60 return delegate_->Remove(keys); 19 GetBytesInUse( const std::vector<std::string>& keys) argument 34 Get( const std::vector<std::string>& keys) argument 58 Remove( const std::vector<std::string>& keys) argument
|
/external/chromium_org/extensions/browser/value_store/ |
H A D | testing_value_store.cc | 27 const std::vector<std::string>& keys) { 44 const std::vector<std::string>& keys) { 50 for (std::vector<std::string>::const_iterator it = keys.begin(); 51 it != keys.end(); ++it) { 102 const std::vector<std::string>& keys) { 108 for (std::vector<std::string>::const_iterator it = keys.begin(); 109 it != keys.end(); ++it) { 119 std::vector<std::string> keys; local 122 keys.push_back(it.key()); 124 return Remove(keys); 26 GetBytesInUse( const std::vector<std::string>& keys) argument 43 Get( const std::vector<std::string>& keys) argument 101 Remove( const std::vector<std::string>& keys) argument [all...] |
/external/chromium_org/mojo/examples/keyboard/ |
H A D | keys.h | 47 const Key* keys; member in struct:mojo::examples::Row
|
/external/chromium_org/remoting/signaling/ |
H A D | server_log_entry_unittest.cc | 58 const std::set<std::string> keys, 74 if (keys.find(key) == keys.end()) { 86 int attr_count_expected = key_value_pairs.size() + keys.size(); 89 s << "stanza has " << attrCount << " keys: expected " 56 VerifyStanza( const std::map<std::string, std::string>& key_value_pairs, const std::set<std::string> keys, const XmlElement* elem, std::string* error) argument
|
/external/chromium_org/rlz/test/ |
H A D | rlz_test_helpers.cc | 43 std::map<base::string16, RegistryKeyData> keys; member in struct:__anon10536::RegistryKeyData 66 &data->keys[base::string16(i.Name())]); 82 data.keys.begin(); 83 iter != data.keys.end(); ++iter) {
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | dbformat_test.cc | 50 const char* keys[] = { "", "k", "hello", "longggggggggggggggggggggg" }; local 57 for (int k = 0; k < sizeof(keys) / sizeof(keys[0]); k++) { 59 TestKey(keys[k], seq[s], kTypeValue); 66 // When user keys are same 80 // When user keys are misordered 85 // When user keys are different, but correctly ordered
|
/external/chromium_org/third_party/leveldatabase/src/table/ |
H A D | filter_block_test.cc | 23 virtual void CreateFilter(const Slice* keys, int n, std::string* dst) const { argument 25 uint32_t h = Hash(keys[i].data(), keys[i].size(), 1);
|
/external/chromium_org/third_party/skia/platform_tools/android/gyp_gen/ |
H A D | vars_dict_lib.py | 103 Can also be treated as a dictionary with fixed keys. 115 def keys(self): member in class:VarsDict 151 for key in var_dict_a.keys():
|
/external/guava/guava-gwt/src-super/com/google/common/cache/super/com/google/common/cache/ |
H A D | CacheLoader.java | 53 * Computes or retrieves the values corresponding to {@code keys}. This method is called by 56 * <p>If the returned map doesn't contain all requested {@code keys} then the entries it does 58 * contains extra keys not present in {@code keys} then all returned entries will be cached, 59 * but only the entries for {@code keys} will be returned from {@code getAll}. 65 * @param keys the unique, non-null keys whose values should be loaded 66 * @return a map from each key in {@code keys} to the value associated with that key; 70 public Map<K, V> loadAll(Iterable<? extends K> keys) throws Exception { argument
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestMapEntrySetGenerator.java | 24 * Creates map entries using sample keys and sample values. 32 private final SampleElements<K> keys; field in class:TestMapEntrySetGenerator 36 SampleElements<K> keys, SampleElements<V> values) { 37 this.keys = keys; 43 return SampleElements.mapEntries(keys, values); 35 TestMapEntrySetGenerator( SampleElements<K> keys, SampleElements<V> values) argument
|
/external/iproute2/include/linux/tc_act/ |
H A D | tc_pedit.h | 30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
/external/kernel-headers/original/uapi/linux/tc_act/ |
H A D | tc_pedit.h | 30 struct tc_pedit_key keys[0]; member in struct:tc_pedit_sel
|
/external/ltrace/ |
H A D | dict.h | 31 struct vect keys; member in struct:dict 41 /* Initialize a dictionary DICT. The dictionary will hold keys of the 45 * EQ is a callback for comparing two keys. */ 53 * will hold keys of type KEY_TYPE and values of type VALUE_TYPE. 70 * cloning fails for any reason, already-cloned keys and values are 88 assert(_source_d->keys.elt_size == sizeof(KEY_TYPE)); \ 122 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))), \ 133 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))), \ 140 (assert((DICTP)->keys.elt_size == sizeof(*(KEYP))), \ 148 assert((DICTP)->keys [all...] |