diff options
| author | Pascal H <hpwxf@haveneer.com> | 2021-03-15 09:14:12 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2021-03-15 09:14:12 +0100 |
| commit | 3bce2ef8d6a613f6601328b3679ec18256cefec9 (patch) | |
| tree | 7f476338d28445e32d044afd84c1d9e4dfc9f9cd /exercises/collections/README.md | |
| parent | ebdb66c7bfb6d687a14cc511a559a222e6fc5de4 (diff) | |
chore: clarify collections documentation
C++ `map` is more like BTreeMap.
`unordered_map` in C++(11) is the equivalent of `HashMap` in Rust.
(+ additional like for references).
Diffstat (limited to 'exercises/collections/README.md')
| -rw-r--r-- | exercises/collections/README.md | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/exercises/collections/README.md b/exercises/collections/README.md index 9ded29a..af87863 100644 --- a/exercises/collections/README.md +++ b/exercises/collections/README.md @@ -14,7 +14,7 @@ structures that are used very often in Rust programs: * A *vector* allows you to store a variable number of values next to each other. * A *hash map* allows you to associate a value with a particular key. - You may also know this by the names *map* in C++, *dictionary* in - Python or an *associative array* in other languages. + You may also know this by the names [*unordered map* in C++](https://en.cppreference.com/w/cpp/container/unordered_map), + [*dictionary* in Python](https://docs.python.org/3/tutorial/datastructures.html#dictionaries) or an *associative array* in other languages. [Rust book chapter](https://doc.rust-lang.org/stable/book/ch08-01-vectors.html) |