v0.3.1

• When searching for an empty bucket trough linear probing, limit the search to 4096 buckets before rehash.
• Add some space for the neighbours of the last few buckets.

v0.3.0

• Store std::pair<Key, T> instead of std::pair<const Key, T> allowing us to move keys on rehash or when displacements occur on insert.
• Backward incompatibility: iterators now return const std::pair<Key, T> reference instead of std::pair<const Key, T>. To modify the value of a key-value pair in a map you have to call the value() method of the iterator to get a mutable reference to T.

v0.2.2

• Add try_emplace method.
• Add load factor support.
• Bug fix: pass custom hash and equal object to new map on rehash.

v0.2.1

• Bug fix: the strong exception guarantee was not valid on insert and rehash, it's now fixes.
• Optimization: on rehash, unnecessary calls to find were done

v0.2.0

Add comment

First version, v0.1.0

First release