f1641af802
* storage: add monkit task to missing places Change-Id: I9e17a6b14f7c25bbf698eeecf32785e9add3f26e * fix tests Change-Id: Id078276fa3de61a28eb3d01d4e751732ecbb173f * import order Change-Id: I814e33755b9f10b5219af37cd828cd75eb3da1a4 * remove part of other commit Change-Id: Idaa4c95cd65e97567fb466de49718db8203cfbe1
80 lines
2.1 KiB
Go
80 lines
2.1 KiB
Go
// Copyright (C) 2019 Storj Labs, Inc.
|
|
// See LICENSE for copying information.
|
|
|
|
package testsuite
|
|
|
|
import (
|
|
"math/rand"
|
|
"testing"
|
|
|
|
"storj.io/storj/storage"
|
|
)
|
|
|
|
func testPrefix(t *testing.T, store storage.KeyValueStore) {
|
|
items := storage.Items{
|
|
newItem("x-a", "a", false),
|
|
newItem("x-b/1", "b/1", false),
|
|
newItem("x-b/2", "b/2", false),
|
|
newItem("x-b/3", "b/3", false),
|
|
newItem("y-c", "c", false),
|
|
newItem("y-c/", "c/", false),
|
|
newItem("y-c//", "c//", false),
|
|
newItem("y-c/1", "c/1", false),
|
|
newItem("y-g", "g", false),
|
|
newItem("y-h", "h", false),
|
|
}
|
|
rand.Shuffle(len(items), items.Swap)
|
|
defer cleanupItems(store, items)
|
|
if err := storage.PutAll(ctx, store, items...); err != nil {
|
|
t.Fatalf("failed to setup: %v", err)
|
|
}
|
|
|
|
testIterations(t, store, []iterationTest{
|
|
{"prefix x dash b slash",
|
|
storage.IterateOptions{
|
|
Prefix: storage.Key("x-"), First: storage.Key("x-b"),
|
|
Recurse: true,
|
|
}, storage.Items{
|
|
newItem("x-b/1", "b/1", false),
|
|
newItem("x-b/2", "b/2", false),
|
|
newItem("x-b/3", "b/3", false),
|
|
}},
|
|
{"reverse prefix x dash b slash",
|
|
storage.IterateOptions{
|
|
Prefix: storage.Key("x-"), First: storage.Key("x-b/3"),
|
|
Recurse: true, Reverse: true,
|
|
}, storage.Items{
|
|
newItem("x-b/3", "b/3", false),
|
|
newItem("x-b/2", "b/2", false),
|
|
newItem("x-b/1", "b/1", false),
|
|
newItem("x-a", "a", false),
|
|
}},
|
|
{"prefix x dash b slash",
|
|
storage.IterateOptions{
|
|
Prefix: storage.Key("x-"), First: storage.Key("x-b"),
|
|
}, storage.Items{
|
|
newItem("x-b/", "", true),
|
|
}},
|
|
{"reverse x dash b slash",
|
|
storage.IterateOptions{
|
|
Prefix: storage.Key("x-"), First: storage.Key("x-b/2"),
|
|
Reverse: true,
|
|
}, storage.Items{
|
|
newItem("x-b/", "", true),
|
|
newItem("x-a", "a", false),
|
|
}},
|
|
{"prefix y- slash",
|
|
storage.IterateOptions{
|
|
Prefix: storage.Key("y-"),
|
|
Recurse: true,
|
|
}, storage.Items{
|
|
newItem("y-c", "c", false),
|
|
newItem("y-c/", "c/", false),
|
|
newItem("y-c//", "c//", false),
|
|
newItem("y-c/1", "c/1", false),
|
|
newItem("y-g", "g", false),
|
|
newItem("y-h", "h", false),
|
|
}},
|
|
})
|
|
}
|