sorted_hashmap.re

sorted_hashmap.rs

use std::collections::HashMap;

fn main() {
    let mut hashmap: HashMap<i32, (i32, i32)> = HashMap::new();

    for count in 0..1000 {
        hashmap.insert(count, (count, count % 13));
    }

    let mut sorted_vec: Vec<(&i32, &(i32, i32))> = hashmap.iter().collect();
    sorted_vec.sort_by_key(|(key, _value)| *key);

    for vec in sorted_vec {
    println!("{:?}", vec);
    }
}