This is a Data Structures course assignment of Hash Table with AVL Trees as nodes and double Hashing implementation in Java The project's concept is as a spell-inventory (in video games for example), ...

Summary: This is the most egregious scenario showing that linearProbing pales in comparison to doubleHashing. The efficency is by a factor of 100 when you look at the loadFactors approaching 1.

This section documents the functions for hash tables, which use objects as keys and associate other objects with them. Another valuable use of equalp hash tables is case-insensitive comparison of keys ...