From 324367dd86067f7d12ddfbcf02c3ee5ab94c4104 Mon Sep 17 00:00:00 2001 From: Tyge Løvset <60263450+tylov@users.noreply.github.com> Date: Sun, 3 Jan 2021 21:53:45 +0100 Subject: Update README.md --- README.md | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index d99f8bff..bb6c664a 100644 --- a/README.md +++ b/README.md @@ -50,7 +50,7 @@ Container with elements of structs: #include typedef struct { - cstr_t name; // dynamic string + cstr name; // dynamic string int id; } User; @@ -115,7 +115,7 @@ using_clist(v3, Vec3); 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** +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 **benchmarks/cmap_benchmark.c** Compiled with clang.exe -O3 -x c++, v10.0 on windows, Ryzen 7 2700X CPU. Similar results with VC and g++. @@ -168,7 +168,7 @@ BMAP: time: 0.60, size: 13971002, sum 1344701724191145 FMAP: time: 0.56, size: 13971002, sum 1344701724191145 HMAP: time: 0.51, size: 13971002, sum 1344701724191145 ``` -From these tests *cmap*, *robin_hood* and *khash* are almost equally fast. std::unordered_map is horrible. With random numbers in 0 - 2^20 range, khash performs worse, though: +From these tests *cmap*, *robin_hood* and *khash* are almost equally fast. std::unordered_map is bad. With random numbers in 0 - 2^20 range, khash performs slightly worse: ``` Unordered maps: 30000000 repeats of Insert random key + try to remove a random key: CMAP: time: 1.93, sum: 450000015000000, size: 524809, erased 14738434 -- cgit v1.2.3