2020-10-26 02:54:32 -04:00
|
|
|
|
### Collections
|
|
|
|
|
|
|
|
|
|
|
|
Rust’s standard library includes a number of very useful data
|
|
|
|
|
|
structures called collections. Most other data types represent one
|
|
|
|
|
|
specific value, but collections can contain multiple values. Unlike
|
|
|
|
|
|
the built-in array and tuple types, the data these collections point
|
|
|
|
|
|
to is stored on the heap, which means the amount of data does not need
|
|
|
|
|
|
to be known at compile time and can grow or shrink as the program
|
|
|
|
|
|
runs.
|
|
|
|
|
|
|
|
|
|
|
|
This exercise will get you familiar with two fundamental data
|
|
|
|
|
|
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.
|
2021-03-15 04:14:12 -04:00
|
|
|
|
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.
|
2020-10-26 02:54:32 -04:00
|
|
|
|
|
|
|
|
|
|
[Rust book chapter](https://doc.rust-lang.org/stable/book/ch08-01-vectors.html)
|
