mirror of
https://github.com/notohh/rustlings.git
synced 2024-11-29 16:44:18 -05:00
9b6c629397
The previous test would stop comparing elements in array a and vec v upon reaching the last element of either. This resulted in the test passing even if v did not contain all the elements in a. This change to the test fixes that bug and should only pass if all the elements in a and v are present and equal. |
||
|---|---|---|
| .. | ||
| hashmap1.rs | ||
| hashmap2.rs | ||
| README.md | ||
| vec1.rs | ||
| vec2.rs | ||
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. You may also know this by the names map in C++, dictionary in Python or an associative array in other languages.