HashMap<K, V> — key-value storage.
Basic usage:
1use std::collections::HashMap;23let mut scores = HashMap::new();4scores.insert("Blue", 10);5scores.insert("Red", 50);67let score = scores.get("Blue").copied().unwrap_or(0);
Update patterns:
1// Overwrite2scores.insert("Blue", 25);34// Entry API5scores.entry("Yellow").or_insert(50);6scores.entry("Blue").and_modify(|e| *e += 5).or_insert(0);
Iteration:
1for (key, value) in &scores {2 println!("{}: {}", key, value);3}
Key: insert for adding, get for reading, entry for conditional.