A family of header-only, very fast and memory-friendly hashmap and btree containers.
try_emplace_l
by @greg7mdp in https://github.com/greg7mdp/parallel-hashmap/pull/216
Upgrade
lock stuff. by @greg7mdp in https://github.com/greg7mdp/parallel-hashmap/pull/221
erase
using erase_if_impl
by @greg7mdp in https://github.com/greg7mdp/parallel-hashmap/pull/223
Full Changelog: https://github.com/greg7mdp/parallel-hashmap/compare/v1.3.11...v1.3.12
clang-tidy
warningsNo difference vs 1.3.9 except for version bump in conanfile.py
NDEBUG
is not defined.std::aligned_storage
.clang-15
warningsstd::*_error
types.AllocTraits
.mt_word_counter
std::hash<Foo*>
can be overridden.Nothing major, some minor fixes and updates in custom APIs for safe multi-thread use.
Nothing really major, mostly fix issues reported by users.
parallel
hash containers, which allow to operate under protection of the internal mutex.trivially_copyable
typesparallel_*_map
maps): if_contains
, modify_if
, lazy_emplace_l
, try_emplace_l
, `erase_if``container_internal
namespace to the shorter priv
The main change is the addition of a non-standard "if_contains" API to the parallel_hash_map, which allows to look up values in a thread-safe manner. Also fix error when using newly deprecated std::result_of
with latest Visual Studio 2019 compilers.