/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/irc/ |
H A D | ircbot.py | 253 Dictionary keys a and b are considered equal if and only if 261 self.canon_keys = {} # Canonical keys 296 def keys(self): member in class:IRCDict 297 return self.data.keys() 325 return self.userdict.keys() 329 return self.operdict.keys() 334 return self.voiceddict.keys()
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | treemixin.py | 64 * keys([reverse]) -> generator for keys of T, O(n) 72 slicing by keys 75 * keyslice(s, e) -> generator for keys of T for s <= key < e, O(n) 77 * T[s:e] -> TreeSlice object, with keys in range s <= key < e, O(n) 89 * TreeSlice[s1:e1] -> TreeSlice object, with keys in range s1 <= key < e1 97 * keys() -> generator for keys of T, O(n) 99 * __iter__ <==> keys() 127 * intersection(t1, t2, ...) -> Tree with keys *commo 205 def keys(self, reverse=False): member in class:TreeMixin [all...] |
/external/chromium_org/third_party/jinja2/ |
H A D | runtime.py | 104 `keys`, `values`, `items`, `iterkeys`, `itervalues`, `iteritems`, 214 keys = _all('keys') variable in class:Context
|
H A D | utils.py | 450 def keys(self): member in class:LRUCache 451 """Return a list of all keys ordered by most recent usage.""" 455 """Iterate over all keys in the cache dict, ordered by
|
/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | skiplist_test.cc | 51 std::set<Key> keys; local 57 if (keys.insert(key).second) { 64 ASSERT_EQ(keys.count(i), 1); 66 ASSERT_EQ(keys.count(i), 0); 77 ASSERT_EQ(*(keys.begin()), iter.key()); 81 ASSERT_EQ(*(keys.begin()), iter.key()); 85 ASSERT_EQ(*(keys.rbegin()), iter.key()); 94 std::set<Key>::iterator model_iter = keys.lower_bound(i); 96 if (model_iter == keys.end()) { 114 for (std::set<Key>::reverse_iterator model_iter = keys [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/genperf/ |
H A D | perfect.c | 11 set of n keys, this determines a hash function that maps each of 12 those keys into a value in 0..n-1 with no collisions. 16 keys, then it computes a^scramble[tab[b]] to get the final perfect hash. 18 2-byte or 4-byte values. If there are n keys, the length of tab[] is a 39 This leaves m unmapped keys and m values that something could hash to. 40 If you treat unmapped keys as lefthand nodes and unused hash values 44 determined a perfect hash for the whole set of keys. 46 *scramble* is used because (a^tab[i]) clusters keys around *a*. 125 fprintf(stderr, "perfect.c: Duplicates keys! %.*s\n", 133 fprintf(stderr, "perfect.c: Duplicate keys! 154 inittab( bstuff *tabb, ub4 blen, key *keys, hashform *form, int complete) argument 194 initnorm( key *keys, ub4 alen, ub4 blen, ub4 smax, ub4 salt, gencode *final) argument 260 initinl( key *keys, ub4 alen, ub4 blen, ub4 smax, ub4 salt, gencode *final) argument 311 initkey( key *keys, ub4 nkeys, bstuff *tabb, ub4 alen, ub4 blen, ub4 smax, ub4 salt, hashform *form, gencode *final) argument 354 duplicates( bstuff *tabb, ub4 blen, key *keys, hashform *form) argument 579 hash_ab( bstuff **tabb, ub4 *alen, ub4 *blen, ub4 *salt, gencode *final, ub4 *scramble, ub4 *smax, key *keys, ub4 nkeys, hashform *form) argument 813 findhash( bstuff **tabb, hstuff **tabh, ub4 *alen, ub4 *blen, ub4 *salt, gencode *final, ub4 *scramble, ub4 *smax, key *keys, ub4 nkeys, hashform *form) argument [all...] |
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree_unittest.cc | 78 // Given an unordered list of matching keys, verifies that it contains all 80 void VerifyAllKeys(const RT::Matches& keys) { argument 81 for (size_t i = 1; i <= keys.size(); ++i) 82 EXPECT_EQ(1U, keys.count(i)); 230 // Lastly the 2 nodes we should have gotten back are keys 9 and 11, as their
|
/external/chromium_org/v8/src/ |
H A D | array.js | 18 // Gets a sorted array of array keys. Useful for operations on sparse 21 var keys = new InternalArray(); 28 keys.push(i); 38 keys.push(key); 42 %_CallFunction(keys, function(a, b) { return a - b; }, ArraySort); 44 return keys; 49 var keys = GetSortedArrayKeys(array, %GetArrayKeys(array, len)); 51 var elements = new InternalArray(keys.length * 2); 53 for (var i = 0; i < keys.length; i++) { 54 var key = keys[ [all...] |
/external/clang/tools/scan-view/ |
H A D | ScanView.py | 247 keys = {} 250 keys[k] = v 251 return keys 403 keys = self.load_report(report) 407 file = keys.get('FILE') 476 keys = self.load_report(report) variable in class:ScanViewRequestHandler.get_report_context.Context 478 c.title = keys.get('DESC','clang error (unrecognized') 485 """%(c.title, keys.get('FILE','<unknown>'), keys.get('LINE', '<unknown>'))
|
/external/fonttools/Lib/fontTools/ttLib/ |
H A D | __init__.py | 198 tags = list(self.keys()) 240 tables = list(self.keys()) 355 def keys(self): member in class:TTFont 356 keys = list(self.tables.keys()) 358 for key in list(self.reader.keys()): 359 if key not in keys: 360 keys.append(key) 362 if "GlyphOrder" in keys: 363 keys 679 def keys(self): member in class:_TTGlyphSet [all...] |
/external/fonttools/Tools/fontTools/ttLib/ |
H A D | __init__.py | 198 tags = list(self.keys()) 240 tables = list(self.keys()) 355 def keys(self): member in class:TTFont 356 keys = list(self.tables.keys()) 358 for key in list(self.reader.keys()): 359 if key not in keys: 360 keys.append(key) 362 if "GlyphOrder" in keys: 363 keys 679 def keys(self): member in class:_TTGlyphSet [all...] |
/external/google-tv-pairing-protocol/java/src/com/google/polo/json/ |
H A D | JSONObject.java | 154 * An array of strings is used to identify the keys that should be copied. 155 * Missing keys are ignored. 387 * public members. The resulting JSONObject's keys will be the strings 389 * with those keys in the object. If a key is not found or not visible, 645 Iterator i = jo.keys(); 714 * Get an enumeration of the keys of the JSONObject. 716 * @return An iterator of the keys. 718 public Iterator keys() { method in class:JSONObject 724 * Get the number of keys stored in the JSONObject. 726 * @return The number of keys i [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ImmutableMultimap.java | 39 * An immutable {@link Multimap}. Does not permit null keys or values. 224 * of the {@code multimap.asMap()} view, with new keys and values following 225 * any existing keys and values. 239 * Specifies the ordering of the generated multimap's keys. 470 * Returns an immutable set of the distinct keys in this multimap. These keys 558 private transient ImmutableMultiset<K> keys; field in class:ImmutableMultimap 561 * Returns a collection, which may contain duplicates, of all keys. The number 563 * mappings the key has in the multimap. Duplicate keys appear consecutively 567 public ImmutableMultiset<K> keys() { method in class:ImmutableMultimap [all...] |
H A D | LinkedListMultimap.java | 51 * iteration order for both keys and values. The iteration order is preserved 60 * ... the iteration order for {@link #keys()} is {@code [key1, key2, key1]}, 62 * iteration order is kept consistent between keys, entries and values. For 73 * through the keys in the order they were first added to the multimap. 76 * added. The collections generated by {@link #entries()}, {@link #keys()}, and 84 * <p>The methods {@link #get}, {@link #keySet()}, {@link #keys()}, 129 private transient Node<K, V> head; // the head for all keys 130 private transient Node<K, V> tail; // the tail for all keys 145 * the specified number of keys without rehashing. 147 * @param expectedKeys the expected number of distinct keys 699 private transient Multiset<K> keys; field in class:LinkedListMultimap 702 public Multiset<K> keys() { method in class:LinkedListMultimap [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | LinkedListMultimap.java | 47 * iteration order for both keys and values. The iteration order is preserved 56 * ... the iteration order for {@link #keys()} is {@code [key1, key2, key1]}, 58 * iteration order is kept consistent between keys, entries and values. For 69 * through the keys in the order they were first added to the multimap. 72 * added. The collections generated by {@link #entries()}, {@link #keys()}, and 80 * <p>The methods {@link #get}, {@link #keySet()}, {@link #keys()}, 125 private transient Node<K, V> head; // the head for all keys 126 private transient Node<K, V> tail; // the tail for all keys 141 * the specified number of keys without rehashing. 143 * @param expectedKeys the expected number of distinct keys 695 private transient Multiset<K> keys; field in class:LinkedListMultimap 698 public Multiset<K> keys() { method in class:LinkedListMultimap [all...] |
/external/mockito/cglib-and-asm/src/org/mockito/asm/tree/ |
H A D | MethodNode.java | 309 final int[] keys,
313 keys,
307 visitLookupSwitchInsn( final Label dflt, final int[] keys, final Label[] labels) argument
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/util/ |
H A D | TraceMethodVisitor.java | 75 * The label names. This map associate String values to Label keys.
382 final int[] keys,
388 buf.append(tab3).append(keys[i]).append(": ");
398 mv.visitLookupSwitchInsn(dflt, keys, labels);
380 visitLookupSwitchInsn( final Label dflt, final int[] keys, final Label[] labels) argument
|
/external/openssl/ssl/ |
H A D | s3_lib.c | 3666 unsigned char *keys = parg; local 3667 if (!keys) 3676 memcpy(ctx->tlsext_tick_key_name, keys, 16); 3677 memcpy(ctx->tlsext_tick_hmac_key, keys + 16, 16); 3678 memcpy(ctx->tlsext_tick_aes_key, keys + 32, 16); 3682 memcpy(keys, ctx->tlsext_tick_key_name, 16); 3683 memcpy(keys + 16, ctx->tlsext_tick_hmac_key, 16); 3684 memcpy(keys + 32, ctx->tlsext_tick_aes_key, 16);
|
/external/srec/tools/test_g2g/ |
H A D | test_g2g.c | 418 LCHAR* keys[MAX_KEYS]; /* array of pointers to strings */ local 423 rc = result->getKeyList(result, (LCHAR**) &keys, &size); /* get the key list */ 429 if ((rc = result->getValue(result,keys[i],value,&len)) == ESR_SUCCESS) 430 pfprintf(fout,"{%s : %s}\n",keys[i],value);
|
/external/stlport/test/eh/ |
H A D | test_insert.h | 84 key_list keys; local 91 keys.reserve( dist ); 93 keys.push_back( keyOfValue(*x) ); 95 EH_STD::sort( keys.begin(), keys.end() ); 96 key_iterator last = EH_STD::unique( keys.begin(), keys.end() ); 99 for ( key_iterator tmp = keys.begin(); tmp != last; ++tmp )
|
/external/wpa_supplicant_8/hostapd/src/ap/ |
H A D | ap_config.c | 387 static void hostapd_config_free_wep(struct hostapd_wep_keys *keys) argument 391 bin_clear_free(keys->key[i], keys->len[i]); 392 keys->key[i] = NULL; 868 /* individual keys are not use; can use key idx0 for 869 * broadcast keys */
|
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | tls_internal.c | 312 struct tls_keys *keys) 316 return tlsv1_client_get_keys(conn->client, keys); 320 return tlsv1_server_get_keys(conn->server, keys); 311 tls_connection_get_keys(void *tls_ctx, struct tls_connection *conn, struct tls_keys *keys) argument
|
/external/wpa_supplicant_8/hostapd/src/eap_peer/ |
H A D | eap_tls_common.c | 297 * @label: Label string for deriving the keys, e.g., "client EAP encryption" 311 struct tls_keys keys; local 330 if (tls_connection_get_keys(data->ssl_ctx, data->conn, &keys)) 333 if (keys.client_random == NULL || keys.server_random == NULL || 334 keys.master_key == NULL) 337 rnd = os_malloc(keys.client_random_len + keys.server_random_len); 340 os_memcpy(rnd, keys.client_random, keys 377 struct tls_keys keys; local [all...] |
/external/wpa_supplicant_8/hostapd/src/tls/ |
H A D | tlsv1_client.c | 686 * @keys: Structure of key/random data (filled on success) 689 int tlsv1_client_get_keys(struct tlsv1_client *conn, struct tls_keys *keys) argument 691 os_memset(keys, 0, sizeof(*keys)); 695 keys->client_random = conn->client_random; 696 keys->client_random_len = TLS_RANDOM_LEN; 699 keys->server_random = conn->server_random; 700 keys->server_random_len = TLS_RANDOM_LEN; 701 keys->master_key = conn->master_secret; 702 keys [all...] |
H A D | tlsv1_server.c | 573 * @keys: Structure of key/random data (filled on success) 576 int tlsv1_server_get_keys(struct tlsv1_server *conn, struct tls_keys *keys) argument 578 os_memset(keys, 0, sizeof(*keys)); 582 keys->client_random = conn->client_random; 583 keys->client_random_len = TLS_RANDOM_LEN; 586 keys->server_random = conn->server_random; 587 keys->server_random_len = TLS_RANDOM_LEN; 588 keys->master_key = conn->master_secret; 589 keys [all...] |