From ff94ae77bbc98b4abef65183e5e54fe512594782 Mon Sep 17 00:00:00 2001
From: Tyge Løvset <60263450+tylov@users.noreply.github.com>
Date: Sun, 16 Aug 2020 14:10:25 +0200
Subject: Update README.md

---
 README.md | 8 +++++++-
 1 file changed, 7 insertions(+), 1 deletion(-)

diff --git a/README.md b/README.md
index e8a2d4ce..23bfa97f 100644
--- a/README.md
+++ b/README.md
@@ -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):
 
-- 
cgit v1.2.3