summaryrefslogtreecommitdiff
path: root/exercises/collections/README.md
diff options
context:
space:
mode:
authormarisa <mokou@fastmail.com>2021-04-24 11:45:37 +0200
committerGitHub <noreply@github.com>2021-04-24 11:45:37 +0200
commit2b2fbe918e28c8c19f110709e4a24cfa06c30989 (patch)
treedb25c5f51d76d10bc129dbcc8df2c56c75b13f2b /exercises/collections/README.md
parent54804e344d84bb620447b7975a5b8ec4f9de2671 (diff)
parent249ad44cc03974fd34708c23d9832b1729c6e844 (diff)
Merge pull request #723 from Zerotask/update-exercises-readme
docs(exercises): consistent excersises README.md files
Diffstat (limited to 'exercises/collections/README.md')
-rw-r--r--exercises/collections/README.md6
1 files changed, 4 insertions, 2 deletions
diff --git a/exercises/collections/README.md b/exercises/collections/README.md
index af87863..0291bc8 100644
--- a/exercises/collections/README.md
+++ b/exercises/collections/README.md
@@ -1,4 +1,4 @@
-### Collections
+# Collections
Rust’s standard library includes a number of very useful data
structures called collections. Most other data types represent one
@@ -17,4 +17,6 @@ structures that are used very often in Rust programs:
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)
+## Further information
+
+- [Storing Lists of Values with Vectors](https://doc.rust-lang.org/stable/book/ch08-01-vectors.html)