optimize HashMap internals with iterators
hashmap: update tests
f
f
type safe
type safe?!
before removing into_size_ref
compiles
test hashmap::bench::find_existing    ... bench:     47108 ns/iter (+/- 1300)
test hashmap::bench::find_nonexisting ... bench:     48420 ns/iter (+/- 906)
test hashmap::bench::find_pop_insert  ... bench:       257 ns/iter (+/- 9)
test hashmap::bench::hashmap_as_queue ... bench:       282 ns/iter (+/- 181)
test hashmap::bench::insert           ... bench:       225 ns/iter (+/- 4)
test hashmap::bench::new_drop         ... bench:       116 ns/iter (+/- 1)
test hashmap::bench::new_insert_drop  ... bench:       251 ns/iter (+/- 14)
just doesn't pop
test hashmap::bench::find_existing    ... bench:     47680 ns/iter (+/- 1747)
test hashmap::bench::find_nonexisting ... bench:     49101 ns/iter (+/- 950)
test hashmap::bench::find_pop_insert  ... bench:       279 ns/iter (+/- 9)
test hashmap::bench::hashmap_as_queue ... bench:       164 ns/iter (+/- 3)
test hashmap::bench::insert           ... bench:       213 ns/iter (+/- 6)
test hashmap::bench::new_drop         ... bench:       116 ns/iter (+/- 5)
test hashmap::bench::new_insert_drop  ... bench:       235 ns/iter (+/- 1)
works better
all tests pass with safe
test hashmap::bench::find_existing    ... bench:     47830 ns/iter (+/- 2153)
test hashmap::bench::find_nonexisting ... bench:     48959 ns/iter (+/- 979)
test hashmap::bench::find_pop_insert  ... bench:       238 ns/iter (+/- 5)
test hashmap::bench::hashmap_as_queue ... bench:       140 ns/iter (+/- 3)
test hashmap::bench::insert           ... bench:       191 ns/iter (+/- 36)
test hashmap::bench::new_drop         ... bench:       117 ns/iter (+/- 3)
test hashmap::bench::new_insert_drop  ... bench:       236 ns/iter (+/- 12)
no warnings
cleanup
finished work