v1.3.2

• Use 'Empty Base Optimization' for Hash, KeyEqual and GrowthPolicy to reduce a bit the sizeof(hopsoctch_map).
• Bug correction (#26), make count() works for tsl::set.

v1.3.1

• Bug fix #22: restore copy/move operator for the map/set.
• Add the possibility to pass a precalculated hash to the lookup functions (#21).

v1.3.0

• Add tsl::prime_growth_policy which keeps the size of the map/set to a prime number.
• Bug fix #18: resolve compilation issue tsl::mod_growth_policy

v1.2.1

• Bug fix #17: restore the copy constructor of hopscotch_map/set and hopscotch_sc_map/set.
• Bug fix: only allow StoreHash if a power of two size is used.

v1.2.0

• Allow the hash to be stored alongside the neighborhood bitmap.
• Add a more flexible growth policy.
• DoS resistant version of hopscotch_map/set: hopscotch_sc_map/set.
• Split hopscotch_map.h into hopscotch_hash.h, hopscotch_map.h and hopscotch_set.h.
• Minor bugfixes.

v1.1.0

• Add support for heterogeneous lookup.
• Add insert_or_assign method.
• Add template<class P> std::pair<iterator,bool> insert(P&& value) method.
• Add T& operator[](Key&& key) method.
• Add methods taking a hint in parameter.

v1.0.1

• Fix compilation on MacOS
• Fix the usage of operator=(std::initializer_list) on a moved object
• Other minors modifications

v1.0.0

• Add tsl namespace.
• Add tsl::unordered_set class.

v0.4.1

• Speed-up erase operations

v0.4.0

• Add support for custom allocators
• Add support for custom growth factor