Hash Tables

Group by Key

Build buckets keyed by a shared field, preserving the first-seen key order.

Algorithm

Canonical pairs (a,1), (b,2), (a,3), (c,4), (b,5) print {a: [1, 3], b: [2, 5], c: [4]}. The replay uses the same input in every language, so this Rust DSA implementation can be compared directly with the rest of the DSA track.

bucket map Each key owns a list. A new key creates a bucket; a repeated key appends to the existing bucket.

Basic Implementation

basic.rs
Replay: real traced execution (multi-file project)
use std::collections::HashMap;

fn main() {
    let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];
    let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();
    let mut order: Vec<&str> = Vec::new();
    for (key, value) in pairs {
        if !groups.contains_key(key) {
            order.push(key);
        }
        groups.entry(key).or_insert_with(Vec::new).push(value);
    }
    let parts: Vec<String> = order.iter()
        .map(|key| {
            let values = &groups[key];
            let rendered = values.iter().map(|v| v.to_string()).collect::<Vec<_>>().join(", ");
            format!("{}: [{}]", key, rendered)
        })
        .collect();
    println!("{{{}}}", parts.join(", "));
}

  1. pairs ← [(a, 1), (b, 2), (a, 3), (c, 4), (b, 5)]

    1use std::collections::HashMap;
    values this step[(a, 1), (b, 2), (a, 3), (c, 4), (b, 5)]pairs

  2. groups ← {}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{}groups

  3. groups ← {a: [1]}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{} → {a: [1]}groupsakey1value

  4. groups ← {a: [1], b: [2]}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{a: [1]} → {a: [1], b: [2]}groupsbkey2value

  5. groups ← {a: [1, 3], b: [2]}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{a: [1], b: [2]} → {a: [1, 3], b: [2]}groupsakey3value

  6. groups ← {a: [1, 3], b: [2], c: [4]}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{a: [1, 3], b: [2]} → {a: [1, 3], b: [2], c: [4]}groupsckey4value

  7. groups ← {a: [1, 3], b: [2, 5], c: [4]}

    4let pairs = [("a", 1), ("b", 2), ("a", 3), ("c", 4), ("b", 5)];5let mut groups: HashMap<&str, Vec<i32>> = HashMap::new();6let mut order: Vec<&str> = Vec::new();
    values this step{a: [1, 3], b: [2], c: [4]} → {a: [1, 3], b: [2, 5], c: [4]}groupsbkey5value

  8. stdout ← {a: [1, 3], b: [2, 5], c: [4]}

    19        .collect();20    println!("{{{}}}", parts.join(", "));21}
    values this step{a: [1, 3], b: [2, 5], c: [4]}stdout{a: [1, 3], b: [2, 5], c: [4]}groups

  9. bucket 1 after collision ← c -> a, degradation risk ← long chains can degrade lookup toward O(n)

    19        .collect();20    println!("{{{}}}", parts.join(", "));21}
    values this stepa → c -> abucket 1 after collisionlong chains can degrade lookup toward O(n)degradation riskresize or rehash when load factor growsmitigationcnew key

Complexity

  • Time: O(n) average
  • Space: O(k + n) for buckets and values

Implementation notes

  • Keep output formatting deterministic. Do not rely on unordered hash-map printing when the lesson needs cross-language comparison.
  • The trace highlights the hash table state after each write and includes a collision contrast where one bucket chain grows, showing why long chains can degrade lookup and why real tables resize or rehash.