diff options
| author | Tyge Løvset <[email protected]> | 2020-08-16 14:10:25 +0200 |
|---|---|---|
| committer | GitHub <[email protected]> | 2020-08-16 14:10:25 +0200 |
| commit | ff94ae77bbc98b4abef65183e5e54fe512594782 (patch) | |
| tree | 89523aac143649ef2eacdb79795a1a19ccbe61f2 | |
| parent | 7ce1059a5161e9cc59226b16b3d2fa186088625a (diff) | |
| download | STC-modified-ff94ae77bbc98b4abef65183e5e54fe512594782.tar.gz STC-modified-ff94ae77bbc98b4abef65183e5e54fe512594782.zip | |
Update README.md
| -rw-r--r-- | README.md | 8 |
1 files changed, 7 insertions, 1 deletions
@@ -65,7 +65,13 @@ Performance The library is very efficent. Containers have templated intrusive elements. One of the most performance critical containers is the **cmap / cset**. Luckily, cmap is among the fastest C/C++ map implementations available, see **examples/benchmark.c**
Compiled with g++ v9.2.0 -O3 on windows, Ryzen 7 2700X CPU. Similar results with VC and clang.
-**CMAP**=*cmap*, KMAP=*khash*, **UMAP**=*std::unordered_map*, BMAP=*ska::bytell_hash_map*, FMAP=*ska::flat_hash_map*, RMAP=*robin_hood::unordered_map*
+
+- **CMAP**=stc/*cmap*
+- KMAP=klib/*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):
|