added README
This commit is contained in:
parent
ce8b258204
commit
bc6677a5fe
|
@ -0,0 +1,19 @@
|
||||||
|
Hashtable - Creates a hashtable of size 10
|
||||||
|
|
||||||
|
void insert(int id, T* n) - Insert or replace data with that key in the table
|
||||||
|
|
||||||
|
T* search(int id) - Return data pointer for that key
|
||||||
|
|
||||||
|
bool remove(int id) - Remove an element with that key
|
||||||
|
|
||||||
|
void restructure() - Doubles the hashtable size and inserts all existing elements
|
||||||
|
|
||||||
|
int getSize() - get hashtable size
|
||||||
|
|
||||||
|
int getElements() - get number of inserted elements
|
||||||
|
|
||||||
|
double getUtilization() - get the average number of elements per inner list
|
||||||
|
|
||||||
|
void print() - print all lists
|
||||||
|
|
||||||
|
int hash(int id) - returns hash value for key
|
|
@ -0,0 +1,19 @@
|
||||||
|
Hashtable - Creates a hashtable of size 10
|
||||||
|
|
||||||
|
void insert(int id, T* n) - Insert or replace data with that key in the table
|
||||||
|
|
||||||
|
T* search(int id) - Return data pointer for that key
|
||||||
|
|
||||||
|
bool remove(int id) - Remove an element with that key
|
||||||
|
|
||||||
|
void restructure() - Doubles the hashtable size and inserts all existing elements
|
||||||
|
|
||||||
|
int getSize() - get hashtable size
|
||||||
|
|
||||||
|
int getElements() - get number of inserted elements
|
||||||
|
|
||||||
|
double getUtilization() - get the average number of elements per inner list
|
||||||
|
|
||||||
|
void print() - print all lists
|
||||||
|
|
||||||
|
int hash(int id) - returns hash value for key
|
Loading…
Reference in New Issue