hashSlot Struct Reference
#include <hashTable.h>
Collaboration diagram for hashSlot:
Data Fields | |
| struct aorToIndexStruct * | first |
| struct aorToIndexStruct * | last |
| int | numberOfElements |
Detailed Description
Definition at line 113 of file hashTable.h.
Field Documentation
struct aorToIndexStruct* first [read] |
First element in the list.
Definition at line 119 of file hashTable.h.
Referenced by deleteUser(), findHashRecord(), insertHashRecord(), and printHashSlot().
struct aorToIndexStruct* last [read] |
Last element in the list. This is here for optimization purposes. It stands to reason that things added later will need to be deleted later. So they should be added to the end of the list. This way, things that are to be deleted sooner will be at the front of the list.
Definition at line 126 of file hashTable.h.
Referenced by deleteUser(), and insertHashRecord().
| int numberOfElements |
Number of elements in this list.
Definition at line 116 of file hashTable.h.
The documentation for this struct was generated from the following file:
