Lines Matching full:bucket
133 ANTLR3_UINT32 bucket; // Used to traverse the buckets
153 // Modulo of the table, (bucket count).
161 for (bucket = 0; bucket < sizeHint; bucket++)
163 table->buckets[bucket].entries = NULL;
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */
208 for (bucket = 0; bucket < table->modulo; bucket++)
210 thisBucket = &(table->buckets[bucket]);
218 /* Search all entries in the bucket and free them up
254 /* Now we can free the bucket memory
277 pANTLR3_HASH_BUCKET bucket;
285 /* Knowing the hash, we can find the bucket
287 bucket = table->buckets + hash;
289 /* Now, we traverse the entries in the bucket until
290 * we find the key or the end of the entries in the bucket.
295 entry = bucket->entries; /* Entry to examine */
296 nextPointer = & bucket->entries; /* Where to put the next pointer of the deleted entry */
320 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) */
334 pANTLR3_HASH_BUCKET bucket;
342 /* Knowing the hash, we can find the bucket
344 bucket = table->buckets + (hash % table->modulo);
346 /* Now, we traverse the entries in the bucket until
347 * we find the key or the end of the entires in the bucket.
352 entry = bucket->entries; /* Entry to examine */
353 nextPointer = & bucket->entries; /* Where to put the next pointer of the deleted entry */
385 entry = entry->nextEntry; /* Address of the next element in the bucket (if any) */
447 pANTLR3_HASH_BUCKET bucket;
454 /* Knowing the hash, we can find the bucket
456 bucket = table->buckets + hash;
458 /* Now we can inspect the key at each entry in the bucket
461 entry = bucket->entries;
486 pANTLR3_HASH_BUCKET bucket;
494 /* Knowing the hash, we can find the bucket
496 bucket = table->buckets + (hash % table->modulo);
498 /* Now we can inspect the key at each entry in the bucket
501 entry = bucket->entries;
526 pANTLR3_HASH_BUCKET bucket;
534 /* Knowing the hash, we can find the bucket
536 bucket = table->buckets + hash;
538 /* Knowing the bucket, we can traverse the entries until we
542 newPointer = &bucket->entries;
582 *newPointer = entry; /* Install the next entry in this bucket */
597 pANTLR3_HASH_BUCKET bucket;
605 /* Knowing the hash, we can find the bucket
607 bucket = table->buckets + (hash % table->modulo);
609 /* Knowign the bucket, we can traverse the entries until we
613 newPointer = &bucket->entries;
660 *newPointer = entry; /* Install the next entry in this bucket */
691 en->bucket = 0; /* First bucket */
694 /* Special case in that the first bucket may not have anything in it
733 if (en->bucket >= en->table->modulo)
767 pANTLR3_HASH_BUCKET bucket;
786 /* There were no more entries in the current bucket, if there are
789 en->bucket++;
791 while (en->bucket < en->table->modulo)
793 /* There was one more bucket, see if it has any elements in it
795 bucket = en->table->buckets + en->bucket;
797 if (bucket->entries != NULL)
799 /* There was an entry in this bucket, so we can use it
802 en->entry = bucket->entries;
806 /* There was nothing in the bucket we just examined, move to the
809 en->bucket++;
813 * have its bucket count = table->modulo which signifies that we are done.
1817 /** Search the int Trie and return a pointer to the first bucket indexed
1905 * we add the supplied data in a new chained bucket to that data node. If it does
1959 /* We have located an exact match, but we will only append to the bucket chain
2231 /* Now free the data for this bucket entry
2237 /* The bucket entry is now gone, so we can free the memory for
