Lines Matching defs:index

34 dk_indices is actual hashtable.  It holds index in entries, or DKIX_EMPTY(-1)
36 Size of indices is dk_size.  Type of each index in indices is vary on dk_size:
65 There are four kinds of slots in the table (slot is index, and
66 DK_ENTRIES(keys)[index] if index >= 0):
68 1. Unused.  index == DKIX_EMPTY
72 2. Active.  index >= 0, me_key != NULL and me_value != NULL
77 3. Dummy.  index == DKIX_DUMMY  (combined only)
84 4. Pending. index >= 0, key != NULL, and value == NULL  (split only)
101 and the index of the key is stored in the low 4 bits.
153 the low-order i bits as the initial table index is extremely fast, and there
163  of every hash code are all 0:  they *all* map to the same table index.
169 are solidly in our favor), then it makes best sense to keep the initial index
188 If two things come in at index 5, the first place we look after is index 2,
189 not 6, so if another comes in at index 6 the collision at 5 didn't hurt it.
201     use j % 2**i as the next table index;
206 the initial index.  Note that because perturb is unsigned, if the recurrence
225 if-tests were required inside the loop; computing "the next" index took about
228 above, and then shifting perturb can be done while the table index is being
580                 int index = get_index_from_order(mp, i);
581                 CHECK((duplicate_check & (1<<index)) == 0);
582                 duplicate_check |= (1<<index);
583                 CHECK(mp->ma_values->values[index] != NULL);
844 /* Search index of hash table from offset of entry table */
846 lookdict_index(PyDictKeysObject *k, Py_hash_t hash, Py_ssize_t index)
854         if (ix == index) {
1004  * If the keys is present then return the index of key.
1031 The initial probe index is computed as hash mod the table size. Subsequent
1260                 Py_ssize_t index = mp->ma_keys->dk_nentries;
1261                 _PyDictValues_AddToInsertionOrder(mp->ma_values, index);
1262                 assert (mp->ma_values->values[index] == NULL);
1263                 mp->ma_values->values[index] = value;
1449                 int index = get_index_from_order(mp, i);
1450                 PyDictUnicodeEntry *ep = &oldentries[index];
1451                 assert(oldvalues->values[index] != NULL);
1455                 newentries[i].me_value = oldvalues->values[index];
1463                 int index = get_index_from_order(mp, i);
1464                 PyDictUnicodeEntry *ep = &oldentries[index];
1465                 assert(oldvalues->values[index] != NULL);
1468                 newentries[i].me_value = oldvalues->values[index];
2135         int index = get_index_from_order(mp, i);
2136         value = mp->ma_values->values[index];
2138         key = DK_UNICODE_ENTRIES(mp->ma_keys)[index].me_key;
2734     Py_ssize_t i;       /* index into seq2 of current element */
3349                 Py_ssize_t index = (int)mp->ma_keys->dk_nentries;
3350                 assert(index < SHARED_KEYS_MAX_SIZE);
3351                 assert(mp->ma_values->values[index] == NULL);
3352                 mp->ma_values->values[index] = value;
3353                 _PyDictValues_AddToInsertionOrder(mp->ma_values, index);
4066         int index = get_index_from_order(d, i);
4067         key = DK_UNICODE_ENTRIES(k)[index].me_key;
4068         assert(d->ma_values->values[index] != NULL);
4166         int index = get_index_from_order(d, i);
4167         value = d->ma_values->values[index];
4266         int index = get_index_from_order(d, i);
4267         key = DK_UNICODE_ENTRIES(d->ma_keys)[index].me_key;
4268         value = d->ma_values->values[index];
4397         int index = get_index_from_order(d, i);
4398         key = DK_UNICODE_ENTRIES(k)[index].me_key;
4399         value = d->ma_values->values[index];