diff options
| author | mokou <mokou@fastmail.com> | 2022-07-12 15:18:05 +0200 |
|---|---|---|
| committer | mokou <mokou@fastmail.com> | 2022-07-12 15:18:05 +0200 |
| commit | 3c4c9c54c98142f114018bbbe4d0d96d63646a5b (patch) | |
| tree | 078f63daad5d9bfec1f526783aa2435a2596d8f2 /exercises/hashmaps/README.md | |
| parent | 2f7fd513041c7c6275552650881a79b9120aaacf (diff) | |
feat: remove collections to hashmaps
Diffstat (limited to 'exercises/hashmaps/README.md')
| -rw-r--r-- | exercises/hashmaps/README.md | 11 |
1 files changed, 11 insertions, 0 deletions
diff --git a/exercises/hashmaps/README.md b/exercises/hashmaps/README.md new file mode 100644 index 0000000..30471cf --- /dev/null +++ b/exercises/hashmaps/README.md @@ -0,0 +1,11 @@ +# Hashmaps +A *hash map* allows you to associate a value with a particular key. +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. + +This is the other data structure that we've been talking about before, when +talking about Vecs. + +## Further information + +- [Storing Keys with Associated Values in Hash Maps](https://doc.rust-lang.org/book/ch08-03-hash-maps.html) |