-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsuperhash_test.go
More file actions
79 lines (71 loc) · 1.55 KB
/
superhash_test.go
File metadata and controls
79 lines (71 loc) · 1.55 KB
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
package superhash
import (
"testing"
)
func TestSuperHashSetGet(t *testing.T) {
hashmap := New()
k1, k2, k3, value := 1, true, 3, 4
hashmap.Set(k1, k2, k3, value)
if hashmap.Get(k1, k2, k3) != value {
t.Error("invalid value for keys")
}
}
func TestSuperHashSetGetExistingPath(t *testing.T) {
hashmap := New()
k1, k2, k3, v, v2 := 1, true, 3, 4, 5
hashmap.Set(k1, k2, k3, v)
hashmap.Set(k1, k2, v2)
if hashmap.Get(k1, k2) != v2 {
t.Error("invalid value for keys")
}
}
func TestSuperHashSetWithNoValue(t *testing.T) {
hashmap := New()
if hashmap.Set("test") != false {
t.Error("Set with no value should return false")
}
}
func TestSuperHashGetWithNoKeys(t *testing.T) {
hashmap := New()
k1, k2, k3, value := 1, true, 3, 4
hashmap.Set(k1, k2, k3, value)
hashmap.Get()
}
func TestSuperHashDelete(t *testing.T) {
hashmap := New()
k1, k2, k3, value := 1, true, 3, 4
hashmap.Set(k1, k2, k3, value)
hashmap.Delete(k1, k2, k3)
if hashmap.Get(k1, k2, k3) != nil {
t.Error("deleted keys still accessible")
}
}
func TestSuperHashDeleteWithNoKeys(t *testing.T) {
hashmap := New()
k1, k2, k3, value := 1, true, 3, 4
hashmap.Set(k1, k2, k3, value)
hashmap.Delete()
}
func TestSuperHashSetGetConcurrent(t *testing.T) {
hashmap := New()
k1, k2, k3 := 1, true, 3
count := 0
for count < 1000 {
go func() {
count++
hashmap.Set(k1, k2, k3, count)
}()
go func() {
count++
hashmap.Set(k1, k2, k3, count)
}()
go func() {
count++
hashmap.Set(k1, k2, k3, count)
}()
go func() {
count++
hashmap.Set(k1, k2, k3, count)
}()
}
}