Comarison with Trove and other primitive collections libs: http://java.dzone.com/articles/time-memory-tradeoff-example http://java.dzone.com/articles/time-memor

Comarison with Trove and other primitive collections libs: http://java.dzone.com/articles/time-memory-tradeoff-example http://java.dzone.com/articles/time-memory-tradeoff-example Why faster: - no supplemental "states" array in open adressing implementation - keys and values are stored "in parallel" in the single array, whenever possible: https://github.com/OpenHFT/hftc/issues/23 https://github.com/OpenHFT/hftc/issues/23 - generally, attention to the finest detail in implementation There is no "actual storage code" - it is 95% generated. Thank you.