tenyoung795 / bu2016-cs375-project Goto Github PK

Makes no sense to re-implement that for every hash table

So I found out gcc's default bucket size is 1, and it resizes the hashtable to a prime (including those close to powers of 2 and 10!) as a size. For the sake of a fair comparison, as well as a consistent way among our classes to resize the table, we should have a function to determine the next table size, shared among all the classes.

Since I already saw some of gcc's implementation, I shall assign this to myself; if anyone else wants to join in, feel free.

Read all lines from an input file into a hashtable. For each line in standard input, remove it from the hashtable if it exists.

Need to find a better name for this

For each line from standard input, print it only if it was never entered before. This would test lookup and insertion.