From a3ceca1b4c0d9bdb550dc23f06ffbb5a8e033bc7 Mon Sep 17 00:00:00 2001 From: root Date: Thu, 4 Jun 2026 16:24:49 -0500 Subject: Adding metadata --- dev-cpp/parallel-hashmap/metadata.xml | 37 ----------------------------------- 1 file changed, 37 deletions(-) delete mode 100644 dev-cpp/parallel-hashmap/metadata.xml (limited to 'dev-cpp/parallel-hashmap/metadata.xml') diff --git a/dev-cpp/parallel-hashmap/metadata.xml b/dev-cpp/parallel-hashmap/metadata.xml deleted file mode 100644 index ef53df07feb0..000000000000 --- a/dev-cpp/parallel-hashmap/metadata.xml +++ /dev/null @@ -1,37 +0,0 @@ - - - - - denis7774@gmail.com - Denis Reva - - -Overview - -This repository aims to provide a set of excellent hash map implementations, as well as a btree alternative to std::map and std::set, with the following characteristics: - -Header only: nothing to build, just copy the parallel_hashmap directory to your project and you are good to go. - -drop-in replacement for std::unordered_map, std::unordered_set, std::map and std::set - -Compiler with C++11 support required, C++14 and C++17 APIs are provided (such as try_emplace) - -Very efficient, significantly faster than your compiler's unordered map/set or Boost's, or than sparsepp - -Memory friendly: low memory usage, although a little higher than sparsepp - -Supports heterogeneous lookup - -Easy to forward declare: just include phmap_fwd_decl.h in your header files to forward declare Parallel Hashmap containers [note: this does not work currently for hash maps with pointer keys] - -Dump/load feature: when a flat hash map stores data that is std::trivially_copyable, the table can be dumped to disk and restored as a single array, very efficiently, and without requiring any hash computation. This is typically about 10 times faster than doing element-wise serialization to disk, but it will use 10% to 60% extra disk space. See examples/serialize.cc. (flat hash map/set only) - -Automatic support for boost's hash_value() method for providing the hash function (see examples/hash_value.h). Also default hash support for std::pair and std::tuple. - -natvis visualization support in Visual Studio (hash map/set only) - - - https://github.com/greg7mdp/parallel-hashmap/issues - greg7mdp/parallel-hashmap - - -- cgit v1.3.1