Benchmark results of the Rust implementations `HashMap` and `PhfMap`

gistfile1.txt

# without optimizations
running 4 tests
test hashmap_find_existing    ... bench:      2247 ns/iter (+/- 190)
test hashmap_find_nonexisting ... bench:      1399 ns/iter (+/- 145)
test phf_find_existing        ... bench:      1891 ns/iter (+/- 128)
test phf_find_nonexisting     ... bench:      1614 ns/iter (+/- 99)

test result: ok. 0 passed; 0 failed; 0 ignored; 4 measured


# with -O
running 4 tests
test hashmap_find_existing    ... bench:       272 ns/iter (+/- 15)
test hashmap_find_nonexisting ... bench:       221 ns/iter (+/- 18)
test phf_find_existing        ... bench:       988 ns/iter (+/- 31)
test phf_find_nonexisting     ... bench:       883 ns/iter (+/- 95)

test result: ok. 0 passed; 0 failed; 0 ignored; 4 measured