diff options
| author | Tyge Løvset <[email protected]> | 2020-06-22 08:53:46 +0200 |
|---|---|---|
| committer | GitHub <[email protected]> | 2020-06-22 08:53:46 +0200 |
| commit | 310dc2f67df981a34c5e8afa64faa7d7ca6c3035 (patch) | |
| tree | 2b755f6622bae1109f2eaa4f35c99a992072a678 | |
| parent | b945b15ec55fbfb936513d35f7bc7ef4b728c60d (diff) | |
| download | STC-modified-310dc2f67df981a34c5e8afa64faa7d7ca6c3035.tar.gz STC-modified-310dc2f67df981a34c5e8afa64faa7d7ca6c3035.zip | |
Update README.md
| -rw-r--r-- | README.md | 2 |
1 files changed, 1 insertions, 1 deletions
@@ -58,7 +58,7 @@ Performance This library is very efficent. Containers have templated intrusive elements. One of the most performance critical containers is the **CHash map / CHash set**. Thankfully, is it among the fastest C / C++ map implementations: **examples/benchmark.c** compiled with g++ v9.2.0 -O3 on windows (the results are similar with VC++ and g++ on linux):
-**CMAP=this**, KMAP=khash, UMAP=std::unordered_map, BMAP=ska::bytell_hash_map, FMAP=ska::flat_hash_map, RMAP=robin_hood::unordered_map
+**CMAP**=*CHash map*, KMAP=*khash*, UMAP=*std::unordered_map*, BMAP=*ska::bytell_hash_map*, FMAP=*ska::flat_hash_map*, RMAP=*robin_hood::unordered_map*
```
Random keys are in range [0, 2^20):
map<uint64_t, uint64_t>: 7000000 repeats of Insert random key + (try to) remove a different random key:
|