diff options
| author | Tyge Løvset <[email protected]> | 2021-03-03 07:21:51 +0100 |
|---|---|---|
| committer | Tyge Løvset <[email protected]> | 2021-03-03 07:21:51 +0100 |
| commit | 5d1c6c81a544eb4ca86ad26cff16298de38510e8 (patch) | |
| tree | 8959fba99f9965ea558a32ddd10f70cb77c63325 /docs | |
| parent | 0a949f2f34131da55d213ab2081bc9348d24f708 (diff) | |
| download | STC-modified-5d1c6c81a544eb4ca86ad26cff16298de38510e8.tar.gz STC-modified-5d1c6c81a544eb4ca86ad26cff16298de38510e8.zip | |
Toned down performance aspect in the docs.
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/csmap_api.md | 5 |
1 files changed, 4 insertions, 1 deletions
diff --git a/docs/csmap_api.md b/docs/csmap_api.md index 91562b9a..61362588 100644 --- a/docs/csmap_api.md +++ b/docs/csmap_api.md @@ -1,7 +1,10 @@ # STC [csmap](../stc/csmap.h): Sorted Map  -A **csmap** is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by using the comparison function *keyCompare*. Search, removal, and insertion operations have logarithmic complexity. **csmap** is implemented as an AA-tree. +A **csmap** is a sorted associative container that contains key-value pairs with unique keys. Keys are sorted by +using the comparison function *keyCompare*. Search, removal, and insertion operations have logarithmic complexity. +**csmap** is implemented as an AA-tree (Arne Andersson, 1993), which tends to create a flatter structure +(slightly more balanced) than red-black trees. See the c++ class [std::map](https://en.cppreference.com/w/cpp/container/map) for a functional description. |