-
Notifications
You must be signed in to change notification settings - Fork 8
/
insert_test.go
170 lines (140 loc) · 3.09 KB
/
insert_test.go
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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
package sortedmap
import (
"testing"
"github.com/umpc/go-sortedmap/asc"
)
func TestInsert(t *testing.T) {
const n = 3
records := randRecords(n)
sm := New(n, asc.Time)
for i := range records {
if !sm.Insert(records[i].Key, records[i].Val) {
t.Fatalf("Insert failed: %v", keyExistsErr)
}
}
func() {
iterCh, err := sm.IterCh()
if err != nil {
t.Fatal(err)
} else {
defer iterCh.Close()
if err := verifyRecords(iterCh.Records(), false); err != nil {
t.Fatal(err)
}
}
}()
for i := range records {
if sm.Insert(records[i].Key, records[i].Val) {
t.Fatalf("Insert failed: %v", notFoundErr)
}
}
func() {
iterCh, err := sm.IterCh()
if err != nil {
t.Fatal(err)
} else {
defer iterCh.Close()
if err := verifyRecords(iterCh.Records(), false); err != nil {
t.Fatal(err)
}
}
}()
}
func TestBatchInsert(t *testing.T) {
const n = 1000
records := randRecords(n)
sm := New(n, asc.Time)
for _, ok := range sm.BatchInsert(records) {
if !ok {
t.Fatalf("BatchInsert failed: %v", keyExistsErr)
}
}
func() {
iterCh, err := sm.IterCh()
if err != nil {
t.Fatal(err)
} else {
defer iterCh.Close()
if err := verifyRecords(iterCh.Records(), false); err != nil {
t.Fatal(err)
}
}
}()
}
func TestBatchInsertMapWithInterfaceKeys(t *testing.T) {
const n = 1000
records := randRecords(n)
sm := New(n, asc.Time)
i := 0
m := make(map[interface{}]interface{}, n)
for _, rec := range records {
m[rec.Key] = rec.Val
i++
}
if i == 0 {
t.Fatal("Records were not copied to the map.")
}
if err := sm.BatchInsertMap(m); err != nil {
t.Fatal(err)
}
}
func TestBatchInsertMapWithStringKeys(t *testing.T) {
const n = 1000
records := randRecords(n)
sm := New(n, asc.Time)
i := 0
m := make(map[string]interface{}, n)
for _, rec := range records {
m[rec.Key.(string)] = rec.Val
i++
}
if i == 0 {
t.Fatal("Records were not copied to the map.")
}
if err := sm.BatchInsertMap(m); err != nil {
t.Fatal(err)
}
}
func TestBatchInsertMapWithExistingInterfaceKeys(t *testing.T) {
const n = 1000
sm, records, err := newSortedMapFromRandRecords(1000)
if err != nil {
t.Fatal(err)
}
i := 0
m := make(map[interface{}]interface{}, n)
for _, rec := range records {
m[rec.Key] = rec.Val
i++
}
if i == 0 {
t.Fatal("Records were not copied to the map.")
}
if err := sm.BatchInsertMap(m); err == nil {
t.Fatal("Inserting existing keys should have caused an error.")
}
}
func TestBatchInsertMapWithExistingStringKeys(t *testing.T) {
const n = 1000
sm, records, err := newSortedMapFromRandRecords(1000)
if err != nil {
t.Fatal(err)
}
i := 0
m := make(map[string]interface{}, n)
for _, rec := range records {
m[rec.Key.(string)] = rec.Val
i++
}
if i == 0 {
t.Fatal("Records were not copied to the map.")
}
if err := sm.BatchInsertMap(m); err == nil {
t.Fatal("Inserting existing keys should have caused an error.")
}
}
func TestBatchInsertMapWithNilType(t *testing.T) {
if err := New(0, asc.Time).BatchInsertMap(nil); err == nil {
t.Fatal("a nil type was allowed where a supported map type is required.")
}
}