docs:clarify instructions on hashmaps2.rs

This commit is contained in:
Ryan Whitehouse 2023-03-20 12:04:47 +01:00
parent 9acefe8b3a
commit 5687676014

View file

@ -1,11 +1,11 @@
// hashmaps2.rs // hashmaps2.rs
// A basket of fruits in the form of a hash map is given. The key // A basket of fruits in the form of a hash map is given. The key
// represents the name of the fruit and the value represents how many // represents the name of the fruit and the value represents how many
// of that particular fruit is in the basket. You have to put *MORE // of that particular fruit is in the basket.
// THAN 11* fruits in the basket. Three types of fruits - Apple (4), // Three types of fruits - Apple (4), Mango (2) and Lychee (5) are already given in the basket.
// Mango (2) and Lychee (5) are already given in the basket. You are // You must add fruit to the basket so that there is at least
// not allowed to insert any more of these fruits! // one of each kind and more than 11 in total.
// You are not allowed to insert any more of these fruits!
// //
// Make me pass the tests! // Make me pass the tests!
// //
@ -34,8 +34,8 @@ fn fruit_basket(basket: &mut HashMap<Fruit, u32>) {
]; ];
for fruit in fruit_kinds { for fruit in fruit_kinds {
// TODO: Put new fruits if not already present. Note that you // TODO: Insert new fruits if they are not already present in the basket.
// are not allowed to put any type of fruit that's already // Note that you are not allowed to put any type of fruit that's already
// present! // present!
} }
} }
@ -44,6 +44,7 @@ fn fruit_basket(basket: &mut HashMap<Fruit, u32>) {
mod tests { mod tests {
use super::*; use super::*;
// Don't modify this function!
fn get_fruit_basket() -> HashMap<Fruit, u32> { fn get_fruit_basket() -> HashMap<Fruit, u32> {
let mut basket = HashMap::<Fruit, u32>::new(); let mut basket = HashMap::<Fruit, u32>::new();
basket.insert(Fruit::Apple, 4); basket.insert(Fruit::Apple, 4);