mirror/v
1
0
Fork 0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
Code Issues Projects Releases Wiki Activity

hashmap: new and fast hashmap with dynamic size

Browse Source
This commit is contained in:
ka-weihe
2020-01-24 20:13:17 +01:00
committed by Alexander Medvednikov
parent 219239eadc
commit 6fd175d9be
2 changed files with 229 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
vlib/builtin/hashmap/hashmap_test.v
View File

@ -3,7 +3,7 @@ module hashmap
import rand
fn test_random_strings() {
mut m := new_hashmap(1000)
mut m := new_hashmap()
for i in 0..1000 {
mut buf := []byte
for j in 0..10 {
@ -21,12 +21,11 @@ fn test_random_strings() {
fn test_large_hashmap() {
N := 300 * 1000
mut nums := new_hashmap(N)
mut nums := new_hashmap()
for i := 0; i < N; i++ {
key := i.str()
nums.set(key, i)
}
println('nr collisions: $nums.nr_collisions')
for i := 0; i < N; i++ {
key := i.str()
assert nums.get(key) == i