• Bugfix on erase_prefix when erasing a full hash_node

• Force minimum max load factor for the htrie (fix #51)
• Add for_each_prefix_of methods to obtain path to longest prefix (#52)
• Fix erase_prefix issue #57, empty nodes were not correctly cleared
• Fix code example of for_each_prefix_of in comment (#53)
• Update cmake_minimum_required to 3.10

• Check that InputIt is an iterator to enable the insert functions with iterators. This prevents some potential overload conflicts between insert functions.
• We now use std::hash<std::basic_string_view<CharT>> as default hash function instead of FNV-1a if std::string_view is detected.
• Add support for efficient serialization (#19)
• Fix compilation error with GCC 9, the implicit copy/move constructor/operator of the iterator were not generated.

This release introduce a minor backward incompatibility by moving the headers files.

• Move the header files from tsl to include/tsl for more coherence with other C++ libraries.
• For CMake users, add an exported target tsl::hat_trie to be used with target_link_libraries.

• Add longest_prefix method to find the element in the trie which is the longest prefix of a given value (#14)
• Avoid the usage of recursion in the filter_prefix method of the iterator (#11)

• Add an erase_prefix method.
• Add a shrink_to_fit method.
• Fix the pair of iterators returned by equal_range, the second iterator was always equal to the first.
• The src/ directory was renamed tsl/ for coherence with other projects.
• Fix the iterator erase(const_iterator first, const_iterator last) method. The invalidation of the last iterator was not taken into account.
• Fix issue #6 where erase may leave a trie_node without a value_node nor any child. It can cause problems on iteration.

• Update the array-hash subtree which contains a bug correction in the default FNV-1a hash function which led to poor performance