summaryrefslogtreecommitdiff
path: root/rustlings/exercises/11_hashmaps/README.md
diff options
context:
space:
mode:
authorHunter Kvalevog <hunter@kvog.sh>2026-10-02 21:53:51 -0500
committerHunter Kvalevog <hunter@kvog.sh>2026-10-02 21:53:51 -0500
commit4dfc11d74ab02ac5765ae5d08fb750c91f4744b4 (patch)
tree17ba62056d6b691dd0217b0e8f1b3a5826dce0f6 /rustlings/exercises/11_hashmaps/README.md
parent02d8f1c62896576e1266553a56980eddbc2a88d7 (diff)
rustlings: move to rust/
Diffstat (limited to 'rustlings/exercises/11_hashmaps/README.md')
-rw-r--r--rustlings/exercises/11_hashmaps/README.md12
1 files changed, 0 insertions, 12 deletions
diff --git a/rustlings/exercises/11_hashmaps/README.md b/rustlings/exercises/11_hashmaps/README.md
deleted file mode 100644
index 80ec144..0000000
--- a/rustlings/exercises/11_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)