Lines Matching refs:entries
34 dk_indices is actual hashtable. It holds index in entries, or DKIX_EMPTY(-1)
106 * 8 allows dicts with no more than 5 active entries; experiments suggested
180 j += 1, or j -= 1, on each loop trip), it scans the table entries in a fixed
428 * This can be used to reserve enough size to insert n entries without
537 PyDictKeyEntry *entries = DK_ENTRIES(keys);
539 PyDictKeyEntry *entry = &entries[i];
555 PyDictUnicodeEntry *entries = DK_UNICODE_ENTRIES(keys);
557 PyDictUnicodeEntry *entry = &entries[i];
660 PyDictUnicodeEntry *entries = DK_UNICODE_ENTRIES(keys);
663 Py_XDECREF(entries[i].me_key);
664 Py_XDECREF(entries[i].me_value);
668 PyDictKeyEntry *entries = DK_ENTRIES(keys);
671 Py_XDECREF(entries[i].me_key);
672 Py_XDECREF(entries[i].me_value);
1357 Internal routine used by dictresize() to build a hashtable of entries.
1392 items again. When entries have been deleted, the new table may
3157 /* can't be equal if # of entries differ */
3159 /* Same # of entries -- check all of 'em. Exit early on any diff. */
3545 PyDictUnicodeEntry *entries = DK_UNICODE_ENTRIES(keys);
3547 Py_VISIT(entries[i].me_value);
3552 PyDictKeyEntry *entries = DK_ENTRIES(keys);
3554 if (entries[i].me_value != NULL) {
3555 Py_VISIT(entries[i].me_value);
3556 Py_VISIT(entries[i].me_key);