hashbrown 0.17.1

A Rust port of Google's SwissTable hash map
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

//! Compare `insert` and `insert_unique_unchecked` operations performance.
use criterion::Criterion;
use hashbrown::HashMap;
use std::hint::black_box;

pub(crate) fn register_benches(c: &mut Criterion) {
    let keys: Vec<String> = (0..1000).map(|i| format!("xxxx{i}yyyy")).collect();

    c.bench_function("insert", |b| {
        let mut m = HashMap::with_capacity(1000);
        b.iter(|| {
            m.clear();
            for k in &keys {
                m.insert(k, k);
            }
            black_box(m.len())
        });
    });

    c.bench_function("insert_unique_unchecked", |b| {
        let mut m = HashMap::with_capacity(1000);
        b.iter(|| {
            m.clear();
            for k in &keys {
                unsafe {
                    m.insert_unique_unchecked(k, k);
                }
            }
            black_box(m.len())
        });
    });
}