Ada implementation of hash tables. Useful if you want to
store items associated with keys and later look them up in constant time,
O(1).
Features
• Generic to allow all kinds of content.
• String hash tables provided (wrapper for
Unbounded_String).
• Private implementation: can't mess around with this.
• Variable size (always prime).