diff options
| author | Adam Brewer <adamhb321@gmail.com> | 2023-10-16 07:37:12 -0400 |
|---|---|---|
| committer | Adam Brewer <adamhb321@gmail.com> | 2023-10-16 07:37:12 -0400 |
| commit | 64d95837e9813541cf5b357de13865ce687ae98d (patch) | |
| tree | f022c5d5ba01128811c0b77618a7adb843ee876b /exercises/hashmaps/README.md | |
| parent | c3941323e2c0b9ee286494327de92e00f23b9e3a (diff) | |
Update Exercises Directory Names to Reflect Order
Diffstat (limited to 'exercises/hashmaps/README.md')
| -rw-r--r-- | exercises/hashmaps/README.md | 12 |
1 files changed, 0 insertions, 12 deletions
diff --git a/exercises/hashmaps/README.md b/exercises/hashmaps/README.md deleted file mode 100644 index 80ec144..0000000 --- a/exercises/hashmaps/README.md +++ /dev/null @@ -1,12 +0,0 @@ -# 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) |