ABSTRACT
Strengths: Open addressing is applicable even when only an extremely small fraction of U will be held in the collection and still guarantees expected constant time performance for all primary methods. If space utilization is of primary importance and less than half of U is expected to be held in the set then open addressing is an excellent choice, especially if removing elements from the set is relatively rare. Also, both remove and retainAll are critical mutators only if they cause the hash table to resize, which can be avoided by an appropriate call to ensureCapacity.
