saberbud/parallel-hashmap
1
0
Fork 0
mirror of https://github.com/greg7mdp/parallel-hashmap.git synced 2026-08-29 08:34:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update README.md

Browse Source
This commit is contained in:
greg
2019-03-18 21:19:38 -04:00
parent 9f7852ee7f
commit 58ef3f7350
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
Vendored
+6
View File
@@ -10,11 +10,17 @@ This repository should be construed as an independent work, with no guarantees o
# Work in progress - please do not use yet - should be ready before the end of March 2019
This repository aims to provide an set of excellent hash map implementations, with the following charecteristics:
- **header only**: nothing to build, just copy the `parallel_hashmap` directory to your project and you are good to go.
- compiler with **C++11 support** required, **C++14 and C++17 APIs are provided**
- **Very efficient**, significantly faster than your compiler's unordered map/set or Boost's, or than [sparsepp](https://github.com/greg7mdp/sparsepp)
- **Memory friendly**: low memory usage, although higher that [sparsepp](https://github.com/greg7mdp/sparsepp)
- support heterogeneous lookup
- Not yet **Tested** ~~on Windows (vs2010-2015, g++), linux (g++, clang++) and MacOS (clang++)~~.