diff options
| author | Tyge Løvset <[email protected]> | 2021-02-23 08:57:03 +0100 |
|---|---|---|
| committer | GitHub <[email protected]> | 2021-02-23 08:57:03 +0100 |
| commit | c06dff4ad347b2dfe8388ab5fbac49f8b4d63dfb (patch) | |
| tree | deb2fae5846e91fd2027e4e5cac1e9fb99092888 | |
| parent | 446b906e740e960f1b4203a47d4793143db2e23f (diff) | |
| download | STC-modified-c06dff4ad347b2dfe8388ab5fbac49f8b4d63dfb.tar.gz STC-modified-c06dff4ad347b2dfe8388ab5fbac49f8b4d63dfb.zip | |
Update README.md
| -rw-r--r-- | README.md | 6 |
1 files changed, 3 insertions, 3 deletions
@@ -35,9 +35,9 @@ Performance 
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.
|