-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcmap_test.go
More file actions
193 lines (178 loc) · 4.21 KB
/
Copy pathcmap_test.go
File metadata and controls
193 lines (178 loc) · 4.21 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
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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
package cmap
import (
"bytes"
"errors"
"testing"
"github.com/holmberd/go-cmap/internal/buffer"
)
func TestCMapInsertAndGet(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
testCases := []struct {
name string
key []byte
val []byte
expectedErr error
}{
{"Valid entry", []byte("1"), []byte("dag"), nil},
{"Key too large", make([]byte, buffer.MaxKeySize+1), []byte("dag"), ErrKeyTooLarge},
{"Value too large", []byte("1"), make([]byte, buffer.MaxValueSize+1), ErrValueTooLarge},
{"Empty key ", []byte{}, []byte("dag"), ErrKeyEmpty},
{"Nil key ", []byte{}, []byte("dag"), ErrKeyEmpty},
{"Empty value", []byte("1"), []byte{}, nil},
{"Nil value", []byte("1"), nil, nil},
}
for _, tc := range testCases {
t.Run(tc.name, func(t *testing.T) {
if _, err := c.Insert(tc.key, tc.val); err != nil {
if tc.expectedErr != nil {
if !errors.Is(err, tc.expectedErr) {
t.Errorf("expected error %q, got %q", tc.expectedErr, err)
}
return
} else {
t.Fatalf("failed to insert: %v", err)
}
}
got, ok, err := c.Get(tc.key)
if err != nil {
t.Fatalf("failed to get: %v", err)
}
if !ok {
t.Errorf("expected key %q to exist", tc.key)
}
if !bytes.Equal(got, tc.val) {
t.Errorf("expected %q, got %q", tc.val, got)
}
})
}
}
func TestCMapInsertAndUpdate(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
key := []byte("1")
val1 := []byte("v1")
val2 := []byte("v2")
updated, err := c.Insert(key, val1)
if err != nil {
t.Fatalf("failed to insert: %v", err)
}
if updated {
t.Fatal("expected insert not to update")
}
updated, err = c.Insert(key, val2)
if err != nil {
t.Fatalf("failed to insert: %v", err)
}
if !updated {
t.Fatal("expected insert to be update")
}
got, ok, err := c.Get(key)
if err != nil || !ok {
t.Fatalf("failed to get: %v", err)
}
if !bytes.Equal(got, val2) {
t.Errorf("expcted %q, got %q, after update", val2, got)
}
}
func TestCMapGetMissing(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
v, ok, err := c.Get([]byte("\xde\xad\xbe\xef"))
if err != nil {
t.Fatalf("failed to get: %v", err)
}
if ok || v != nil {
t.Error("expected key to not exist")
}
}
func TestCMapDelete(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
key := []byte("1")
val := []byte("bye")
if c.Len() != 0 {
t.Errorf("expected len to be 0 before insert, got %d", c.Len())
}
if _, err = c.Insert(key, val); err != nil {
t.Fatalf("failed to insert: %v", err)
}
if c.Len() != 1 {
t.Errorf("expected len to be 1 after insert, got %d", c.Len())
}
existed, err := c.Delete(key)
if err != nil {
t.Fatalf("failed to delete: %v", err)
}
if !existed {
t.Error("expected key to exist during delete")
}
if found := c.Has(key); found {
t.Error("expected key to not exist after delete")
}
if existed, err := c.Delete(key); existed || err != nil {
t.Error("expected deleting missing key to return false")
}
if c.Len() != 0 {
t.Errorf("expected len to be 0, got %d", c.Len())
}
}
func TestCMapDeleteMissing(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
existed, err := c.Delete([]byte("\xde\xad\xbe\xef"))
if err != nil {
t.Fatalf("failed to delete: %v", err)
}
if existed {
t.Error("expected key to not exist during delete")
}
}
func TestCMapLen(t *testing.T) {
c, err := New()
if err != nil {
t.Fatal(err)
}
defer c.Clear()
if got := c.Len(); got != 0 {
t.Errorf("expcted len = 0, got %d", got)
}
key1 := []byte("1")
key2 := []byte("2")
if _, err := c.Insert(key1, []byte("1")); err != nil {
t.Fatalf("failed to insert: %v", err)
}
if _, err := c.Insert(key2, []byte("2")); err != nil {
t.Fatalf("failed to insert: %v", err)
}
if got := c.Len(); got != 2 {
t.Errorf("expected len = 2, got %d", got)
}
if _, err := c.Delete(key1); err != nil {
t.Fatalf("failed to delete: %v", err)
}
if got := c.Len(); got != 1 {
t.Errorf("expected len = 1, got %d", got)
}
if _, err := c.Delete(key2); err != nil {
t.Fatalf("failed to delete: %v", err)
}
if got := c.Len(); got != 0 {
t.Errorf("expected len = 0, got %d", got)
}
}