Rust
HashMap
Learn HashMap<K, V> and storing key-value pairs.
HashMap
HashMap<K, V> is a table mapping keys to values, with lookups in O(1) on average. The key type must be Eq + Hash:
use std::collections::HashMap;
let mut stok = HashMap::new();
stok.insert("elma", 10);
stok.insert("armut", 4);
stok.insert("elma", 12); // overwrites
println!("{:?}", stok.get("elma")); // Some(12)
println!("{:?}", stok.get("kivi")); // None
Because a key might be missing, get returns Option<&V>. stok["elma"] can be written too, but it panics if the key is missing.
Ownership and removal
insert takes ownership of the key and value; String keys are moved into the map. remove gives the value back, contains_key checks presence:
let mut renk: HashMap<String, u8> = HashMap::new();
let ad = String::from("kırmızı");
renk.insert(ad, 1); // ad was moved
println!("{}", renk.contains_key("kırmızı")); // true: searchable with &str
println!("{:?}", renk.remove("kırmızı")); // Some(1)
A map with String keys can be searched with &str, because String: Borrow<str>.
Exercise Stock table
Insert ("elma", 10), ("armut", 4) and again ("elma", 12) into a HashMap. Print the results of get("elma"), get("kivi") and len() on one line.
Show example solution
use std::collections::HashMap;
fn main() {
let mut stok = HashMap::new();
stok.insert("elma", 10);
stok.insert("armut", 4);
stok.insert("elma", 12);
println!("{:?} {:?} {}", stok.get("elma"), stok.get("kivi"), stok.len());
}
Test yourself
-
In what order do keys come when iterating a HashMap with <code>for</code>?
- By value
- Undefined; it may differ on every run
- In insertion order
- Alphabetically
Show answer
Undefined; it may differ on every run — Rust uses a randomly seeded hash per process against attacks. If you need an order, use a BTreeMap or a sorted Vec.
-
Safe read
let n = stok.____("elma"); // Option<&i32>
Show answer
let n = stok.get("elma"); // Option<&i32>
-
Operation and result
- insert("elma", 12) (existed)
- Some(old value)
- get("kivi")
- None
- stok["kivi"]
- Panic
- remove("armut")
- Some(4)
Next lesson: BTreeMap
