summaryrefslogtreecommitdiff
path: root/solutions/11_hashmaps/hashmaps1.rs
diff options
context:
space:
mode:
authormo8it <mo8it@proton.me>2024-07-05 13:39:50 +0200
committermo8it <mo8it@proton.me>2024-07-05 13:39:50 +0200
commit7123c7ae3a9605fbe962e4ef0a0f1424cd16fef8 (patch)
treec67f7e62bb9a179ae4fdbab492501cb6847e64c7 /solutions/11_hashmaps/hashmaps1.rs
parent77b687d501771c24bd83294d97b8e6f9ffa92d6b (diff)
parent4d9c346a173bb722b929f3ea3c00f84954483e24 (diff)
Merge remote-tracking branch 'upstream/main' into fix-enum-variant-inconsistency
Diffstat (limited to 'solutions/11_hashmaps/hashmaps1.rs')
-rw-r--r--solutions/11_hashmaps/hashmaps1.rs42
1 files changed, 42 insertions, 0 deletions
diff --git a/solutions/11_hashmaps/hashmaps1.rs b/solutions/11_hashmaps/hashmaps1.rs
new file mode 100644
index 0000000..3a787c4
--- /dev/null
+++ b/solutions/11_hashmaps/hashmaps1.rs
@@ -0,0 +1,42 @@
+// A basket of fruits in the form of a hash map needs to be defined. The key
+// represents the name of the fruit and the value represents how many of that
+// particular fruit is in the basket. You have to put at least 3 different
+// types of fruits (e.g apple, banana, mango) in the basket and the total count
+// of all the fruits should be at least 5.
+
+use std::collections::HashMap;
+
+fn fruit_basket() -> HashMap<String, u32> {
+ // Declare the hash map.
+ let mut basket = HashMap::new();
+
+ // Two bananas are already given for you :)
+ basket.insert(String::from("banana"), 2);
+
+ // Put more fruits in your basket.
+ basket.insert(String::from("apple"), 3);
+ basket.insert(String::from("mango"), 1);
+
+ basket
+}
+
+fn main() {
+ // You can optionally experiment here.
+}
+
+#[cfg(test)]
+mod tests {
+ use super::*;
+
+ #[test]
+ fn at_least_three_types_of_fruits() {
+ let basket = fruit_basket();
+ assert!(basket.len() >= 3);
+ }
+
+ #[test]
+ fn at_least_five_fruits() {
+ let basket = fruit_basket();
+ assert!(basket.values().sum::<u32>() >= 5);
+ }
+}