Lines Matching refs:buckets
30 * will end up in different buckets. The hash function was taken
87 tablePtr->buckets = tablePtr->staticBuckets;
181 hPtr = tablePtr->buckets[i];
193 if (tablePtr->buckets != tablePtr->staticBuckets) {
194 ckfree((char *) tablePtr->buckets);
275 searchPtr->tablePtr->buckets[searchPtr->nextIndex];
290 * in its hash buckets.
324 for (hPtr = tablePtr->buckets[i]; hPtr != NULL; hPtr = hPtr->nextPtr) {
341 sprintf(result, "%d entries in table, %d buckets\n",
345 sprintf(p, "number of buckets with %d entries: %d\n",
349 sprintf(p, "number of buckets with %d or more entries: %d\n",
444 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
498 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
519 hPtr->bucketPtr = &(tablePtr->buckets[index]);
528 * more buckets.
570 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
618 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
633 hPtr->bucketPtr = &(tablePtr->buckets[index]);
642 * more buckets.
690 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
750 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
772 hPtr->bucketPtr = &(tablePtr->buckets[index]);
784 * more buckets.
861 * buckets becomes too large. It creates a new table with a
870 * buckets.
885 oldBuckets = tablePtr->buckets;
893 tablePtr->buckets = (Tcl_HashEntry **) ckalloc((unsigned)
895 for (count = tablePtr->numBuckets, newChainPtr = tablePtr->buckets;
924 hPtr->bucketPtr = &(tablePtr->buckets[index]);