• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libantlr3c-3.2/src/

Lines Matching refs:entries

163 		table->buckets[bucket].entries = NULL;
166 /* Exclude duplicate entries by default
203 /* Free the table, all buckets and all entries, and all the
216 entry = thisBucket->entries;
218 /* Search all entries in the bucket and free them up
250 thisBucket->entries = NULL;
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 */
346 /* Now, we traverse the entries in the bucket until
352 entry = bucket->entries; /* Entry to examine */
353 nextPointer = & bucket->entries; /* Where to put the next pointer of the deleted entry */
461 entry = bucket->entries;
501 entry = bucket->entries;
538 /* Knowing the bucket, we can traverse the entries until we
542 newPointer = &bucket->entries;
609 /* Knowign the bucket, we can traverse the entries until we
613 newPointer = &bucket->entries;
692 en->entry = en->table->buckets->entries; /* First entry to return */
762 * no more entries in the table.
786 /* There were no more entries in the current bucket, if there are
797 if (bucket->entries != NULL)
802 en->entry = bucket->entries;
1110 vector->count = 0; // No entries yet of course
1111 vector->elementsSize = initialSize; // Available entries
1129 // Clear the entries in a vector.
1131 // it walks the entries first to see if any of them
1180 // The entries are freed, so free the element allocation
1319 // is part of the internal or external entries, so we copy the internal ones to the new space
2534 // entries to accomodate the sorted list and another to accomodate
2629 // We can only sort the entries that we have dude! The caller is
2635 // We need to know the locations of each of the entries
2638 // acording to where we moved it last. Then we can just swap vector entries until
2650 // Now we traverse the sorted array and moved the entries of
2684 // Having traversed all the entries, we have sorted the vector in place.