/
db_test.go
289 lines (248 loc) · 6.39 KB
/
db_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
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
package sopp
import (
"bytes"
"io/ioutil"
"math/rand"
"os"
"sort"
"testing"
"testing/quick"
"github.com/boutros/sopp/rdf"
)
type testDB struct {
*DB
}
func newTestDB() *testDB {
db, err := Open(tempfile(), "http://test.org/")
if err != nil {
panic("cannot open db: " + err.Error())
}
return &testDB{db}
}
func (db *testDB) Close() {
defer os.Remove(db.kv.Path())
db.DB.Close()
}
// tempfile returns a temporary file path.
func tempfile() string {
f, _ := ioutil.TempFile("", "sopp-")
f.Close()
os.Remove(f.Name())
return f.Name()
}
// Verify that triples can be stored in DB, and reported as stored.
func TestInsert_Quick(t *testing.T) {
f := func(items testdata) bool {
db := newTestDB()
defer db.Close()
RemoveDuplicates(&items)
for _, item := range items {
// Verify that triple is not present in graph
// (Technically it is possible that the same triple was generated twice, but
// so unlikely that we can forget about it)
present, err := db.Has(item.Triple)
if present {
t.Logf("DB.Has(%v) => true before insert", item.Triple)
t.FailNow()
}
if err != nil {
t.Logf("DB.Has(%v) failed: %v", item.Triple, err)
t.FailNow()
}
if err := db.Insert(item.Triple); err != nil {
t.Logf("DB.Insert(%v) failed: %v", item.Triple, err)
t.FailNow()
}
// Verify triple is now present in graph
present, err = db.Has(item.Triple)
if !present {
t.Logf("DB.Has(%v) => false after insert", item.Triple)
t.FailNow()
}
if err != nil {
t.Logf("DB.Has(%v) failed: %v", item.Triple, err)
t.FailNow()
}
}
print(".")
return true
}
if err := quick.Check(f, qconfig()); err != nil {
t.Error(err)
}
}
// Verify that triples can be deleted and reported as not stored.
func TestDelete_Quick(t *testing.T) {
f := func(items testdata) bool {
db := newTestDB()
defer db.Close()
for _, item := range items {
if err := db.Insert(item.Triple); err != nil {
t.Logf("DB.Insert(%v) failed: %v", item.Triple, err)
t.FailNow()
}
if err := db.Delete(item.Triple); err != nil {
t.Logf("DB.Delete(%v) failed: %v", item.Triple, err)
t.FailNow()
}
// Verify triple is not present in graph
present, err := db.Has(item.Triple)
if present {
t.Logf("DB.Has(%v) => true after delete", item.Triple)
t.FailNow()
}
if err != nil {
t.Logf("DB.Has(%v) failed: %v", item.Triple, err)
t.FailNow()
}
// Verify that triple can't be deleted agin
if err := db.Delete(item.Triple); err != ErrNotFound {
t.Logf("DB.Delete(%v) => %v; want ErrNotFound", item.Triple, err)
t.FailNow()
}
}
// Verify that all Terms are now deleted (by removeOrphanedTerms)
stats, err := db.Stats()
if err != nil {
t.Logf("DB.Stats() failed: %v", err)
t.FailNow()
}
if stats.NumTerms != 0 {
t.Logf("Terms in DB after deleting all triples: %d (removeOrhpanTerms fail)", stats.NumTerms)
t.FailNow()
}
print(".")
return true
}
if err := quick.Check(f, qconfig()); err != nil {
t.Error(err)
}
}
// Verify the encode/decode roundtrip of a triple.
func TestEncodeDecode_Quick(t *testing.T) {
f := func(items testdata) bool {
db := newTestDB()
defer db.Close()
RemoveDuplicates(&items)
for _, item := range items {
if err := db.Insert(item.Triple); err != nil {
t.Logf("DB.Insert(%v) failed: %v", item.Triple, err)
t.FailNow()
}
}
result := make(testdata, 0, len(items))
if err := db.forEach(func(tr rdf.Triple) error {
var item testdataitem
item.Triple = tr
result = append(result, item)
return nil
}); err != nil {
t.Logf("DB.forEach() failed: %v", err)
t.FailNow()
}
if len(items) != len(result) {
t.Logf("inserted %d triples, got %d back from DB", len(items), len(result))
t.FailNow()
}
sort.Sort(result)
for i, item := range items {
if item.Triple != result[i].Triple {
t.Logf("got %v; wanted %v ", result[i].Triple, item.Triple)
t.FailNow()
}
}
print(".")
return true
}
if err := quick.Check(f, qconfig()); err != nil {
t.Error(err)
}
}
// Verify that Describe returns the same graph as rdf rdf.Graph reference implementation.
func TestDescribe_Quick(t *testing.T) {
f := func(items testdata) bool {
db := newTestDB()
defer db.Close()
// test against in-memory reference implementation
ref := rdf.NewGraph()
for _, item := range items {
if err := db.Insert(item.Triple); err != nil {
t.Logf("DB.Insert(%v) failed: %v", item.Triple, err)
t.FailNow()
}
ref.Insert(item.Triple)
}
for _, item := range items {
want := ref.Describe(item.Triple.Subj, false)
got, err := db.Describe(item.Triple.Subj, false)
if err != nil {
t.Logf("DB.Describe(%v, false) failed: %v", item.Triple.Subj, err)
t.FailNow()
}
if !got.Eq(want) {
t.Logf("DB.Describe(%v, false) =>\n%s\nwant:\n%s",
item.Triple.Subj, got.Serialize(rdf.Turtle, ""), want.Serialize(rdf.Turtle, ""))
t.FailNow()
}
want = ref.Describe(item.Triple.Subj, true)
got, err = db.Describe(item.Triple.Subj, true)
if err != nil {
t.Logf("DB.Describe(%v, true) failed: %v", item.Triple.Subj, err)
t.FailNow()
}
if !got.Eq(want) {
t.Logf("DB.Describe(%v, true) =>\n%s\nwant:\n%s",
item.Triple.Subj, got.Serialize(rdf.Turtle, ""), want.Serialize(rdf.Turtle, ""))
t.FailNow()
}
}
print(".")
return true
}
if err := quick.Check(f, qconfig()); err != nil {
t.Error(err)
}
}
func TestImportDumpGraph_Quick(t *testing.T) {
f := func(items testdata) bool {
db := newTestDB()
defer db.Close()
RemoveDuplicates(&items)
input := items.Graph().Serialize(rdf.Turtle, "http://test.org/")
n, err := db.Import(bytes.NewBufferString(input), rand.Intn(1000))
if err != nil {
t.Logf("DB.Import() failed: %v", err)
t.FailNow()
}
if n != len(items) {
t.Logf("DB.Import() => %d; want %d", n, len(items))
t.FailNow()
}
want := items.Graph()
var b bytes.Buffer
err = db.Dump(&b)
if err != nil {
t.Logf("DB.Dump() failed: %v", err)
t.FailNow()
}
dec := rdf.NewDecoder(&b)
got, err := dec.DecodeGraph()
if err != nil {
t.Logf("Decoding dump of DB failed: %v", err)
t.FailNow()
}
if !got.Eq(want) {
t.Log("Dump of graph not equal inserted graph")
t.Log("got:")
t.Log(got.Triples())
t.Log("want:")
t.Log(want.Triples())
t.FailNow()
}
print(".")
return true
}
if err := quick.Check(f, qconfig()); err != nil {
t.Error(err)
}
}