From c06dff4ad347b2dfe8388ab5fbac49f8b4d63dfb Mon Sep 17 00:00:00 2001
From: Tyge Løvset <60263450+tylov@users.noreply.github.com>
Date: Tue, 23 Feb 2021 08:57:03 +0100
Subject: Update README.md

---
 README.md | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/README.md b/README.md
index 7c4c16e7..310a38a8 100644
--- a/README.md
+++ b/README.md
@@ -35,9 +35,9 @@ Performance
 ![Benchmark](benchmarks/pics/benchmark.png)
 
 STC containers performs either about equal or better than the c++ std counterparts. **cmap** ***crushes*** *std::unordered_map* across the board. 
-**cdeq**, **cmap**, and **csmap** all have multiple times faster iteration of elements and destruction. **csmap** also has noticable faster lookup than
-*std::map*'s typical red-black tree implementation. It uses an AA-tree (Arne Andersson, 1993), which tends to create a flatter structure
-(more balanced) than red-black trees. **cvec** is only slightly slower than *std::vector*.
+**cdeq**, **cmap**, and **csmap** all have multiple times faster iteration of elements and destruction than the c++ equivalents. **csmap** also
+has noticable faster lookup than *std::map*'s typical red-black tree implementation. It uses an AA-tree (Arne Andersson, 1993), which tends to
+create a flatter structure (more balanced) than red-black trees. **cvec** is only slightly slower than *std::vector*.
 
 Notes:
 - The barchart shows average test times from three platforms: Win-Clang++ v11, Mingw64 g++ 9.20, VC19. CPU: Ryzen 7 2700X CPU @4Ghz.
-- 
cgit v1.2.3