diff options
| author | Tyge Løvset <[email protected]> | 2021-01-20 23:41:18 +0100 |
|---|---|---|
| committer | GitHub <[email protected]> | 2021-01-20 23:41:18 +0100 |
| commit | 562c4a83f37b04a5507e90855b1ee9b75a14e4d7 (patch) | |
| tree | 4f91edab766e9d617760ea9ee7fcaef706a22c84 | |
| parent | cbfbdcc7bff425e19a1a36666ac9eba3a829d544 (diff) | |
| download | STC-modified-562c4a83f37b04a5507e90855b1ee9b75a14e4d7.tar.gz STC-modified-562c4a83f37b04a5507e90855b1ee9b75a14e4d7.zip | |
Update cmap_api.md
| -rw-r--r-- | docs/cmap_api.md | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/docs/cmap_api.md b/docs/cmap_api.md index d9b69961..2de13ac6 100644 --- a/docs/cmap_api.md +++ b/docs/cmap_api.md @@ -3,7 +3,8 @@ A **cmap** is an associative container that contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constant-time complexity. Elements are pairs of keys and mapped values. Implemented as open hashing with linear probing and without storing tombstones. Very fast, see performance comparisons. -See [std::unordered_map](https://en.cppreference.com/w/cpp/container/unordered_map) for a similar c++ class. + +Please refer to the documentation of the c++ class [std::unordered_map](https://en.cppreference.com/w/cpp/container/unordered_map) for a functional description. ## Declaration |
