Lines Matching defs:index
43 While _Py_dict_lookup() does not give us the index into the array,
44 we make use of pointer arithmetic to get that index. An alternative would
45 be to refactor _Py_dict_lookup() to provide the index, explicitly exposing
528 /* Return the index into the hash table, regardless of a valid node. */
538 return keys->dk_nentries; /* index of new entry */
542 /* We use pointer arithmetic to get the entry's index into the table. */
584 /* Return the index into the hash table, regardless of a valid node. */
608 Py_ssize_t index;
612 index = _odict_get_index(od, key, hash);
613 if (index < 0)
616 return od->od_fast_nodes[index];
622 Py_ssize_t index;
630 index = _odict_get_index(od, key, hash);
631 if (index < 0)
634 return od->od_fast_nodes[index];
732 index in the hash table is occupied by B. If we remove B then for C
733 the dict's looknode func will give us the old index of B instead of
734 the index we got before deleting B. However, the node for C in
735 od_fast_nodes is still at the old dict index of C. Thus to be sure