-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsyncmap_smoke_test.go
More file actions
108 lines (98 loc) · 2.29 KB
/
Copy pathsyncmap_smoke_test.go
File metadata and controls
108 lines (98 loc) · 2.29 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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
package syncmap
import (
"fmt"
"math/rand"
"strconv"
"sync"
"testing"
"time"
)
// Some basic smoke tests, not very comprehensive
func TestSyncMapGeneric(t *testing.T) {
sm := &SyncMap[string, string]{}
var wg sync.WaitGroup
// Run 11 goroutines in parallel each adding 10 items
for i := 0; i <= 100; i += 10 {
wg.Add(1)
go func(offset int) {
for v := offset; v < offset+10; v++ {
sm.Store(fmt.Sprintf("key %d", v), fmt.Sprintf("value %d", v))
}
wg.Done()
}(i)
}
wg.Wait()
// Display and verify the contents of the map
seenNums := make(map[int]struct{})
realLen := 0
sm.Range(func(k string, v string) bool {
fmt.Printf("%s : %s\n", k, v)
n, _ := strconv.Atoi(k[4:])
if n < 0 || n >= 110 {
t.Errorf("Unexpected number in map: %d", n)
}
seenNums[n] = struct{}{}
realLen++
return true
})
expectedLen := 110
smLen := sm.Len()
if smLen != expectedLen {
t.Errorf("Len() does not match expected length. Expected=%d, Actual=%d", expectedLen, smLen)
}
if realLen != expectedLen {
t.Errorf("Counted length does not match expected length. Expected=%d, Actual=%d", expectedLen, realLen)
}
for i := 0; i < 110; i++ {
_, ok := seenNums[i]
if !ok {
t.Errorf("Number %d not found in the map", i)
}
}
fmt.Printf("Total values: %d\n", sm.Len())
}
// Concurrent read and write test
func TestSyncMapReadWrite(t *testing.T) {
sm := &SyncMap[string, string]{}
var wg sync.WaitGroup
// Writers
for i := 0; i <= 100; i += 10 {
wg.Add(1)
go func(offset int) {
defer wg.Done()
for k := 0; k < 10; k++ {
v := k + offset
ks := fmt.Sprintf("key %d", k)
vs := fmt.Sprintf("value %d", v)
sm.Store(ks, vs)
//fmt.Printf("writer %d set %s = %s\n", offset, ks, vs)
time.Sleep(time.Millisecond)
}
}(i)
}
// Readers
for i := 0; i < 5; i++ {
wg.Add(1)
go func(id int) {
defer wg.Done()
for n := 0; n < 10; n++ {
//l := sm.Len()
k := fmt.Sprintf("key %d", rand.Intn(10))
v, ok := sm.Load(k)
if ok {
fmt.Printf("Reader %d: %s = %s\n", id, k, v)
} else {
fmt.Printf("Reader %d: %s not set\n", id, k)
}
time.Sleep(time.Millisecond)
}
}(i)
}
wg.Wait()
fmt.Println()
sm.Range(func(k string, v string) bool {
fmt.Printf("%s : %s\n", k, v)
return true
})
fmt.Printf("Total values: %d\n", sm.Len())
}