A lighter (on memory) hash map Advantages over HashMap:
Lower memory footprint
Everything is stored in a single array, this might improve cache performance (not verified)
Read-only operations on Key and Value iterators should be concurrency-safe (Entry iterators are not) but they might return null values unexpectedly under concurrent modification (not verified)
Disadvantages:
removal is implemented with thombstone-keys, this can significantly increase the lookup time if many values are removed. Use compactify() for scrubbing
entry set iterators and thus transfers to other maps are slower than compareable implementations
the map does not store hashcodes and relies on either the key-objects themselves caching them (such as strings) or a fast computation of hashcodes
concurrent modification detection is not as fail-fast as HashMap as no modification counter is used and only structural differences are noted
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.