Commit b086f25e authored by Steven Allen's avatar Steven Allen

chore: remove some dead code

parent d5f86f30
package datastore package datastore
type verb int
type op struct { type op struct {
delete bool delete bool
value []byte value []byte
......
...@@ -2,7 +2,6 @@ package datastore_test ...@@ -2,7 +2,6 @@ package datastore_test
import ( import (
"bytes" "bytes"
"math/rand"
"path" "path"
"strings" "strings"
"testing" "testing"
...@@ -14,16 +13,6 @@ import ( ...@@ -14,16 +13,6 @@ import (
// Hook up gocheck into the "go test" runner. // Hook up gocheck into the "go test" runner.
func Test(t *testing.T) { TestingT(t) } func Test(t *testing.T) { TestingT(t) }
func randomString() string {
chars := "abcdefghijklmnopqrstuvwxyz1234567890"
var buf bytes.Buffer
l := rand.Intn(50)
for j := 0; j < l; j++ {
buf.WriteByte(chars[rand.Intn(len(chars))])
}
return buf.String()
}
type KeySuite struct{} type KeySuite struct{}
var _ = Suite(&KeySuite{}) var _ = Suite(&KeySuite{})
......
...@@ -5,12 +5,6 @@ import ( ...@@ -5,12 +5,6 @@ import (
"testing" "testing"
) )
type filterTestCase struct {
filter Filter
keys []string
expect []string
}
func testKeyFilter(t *testing.T, f Filter, keys []string, expect []string) { func testKeyFilter(t *testing.T, f Filter, keys []string, expect []string) {
e := make([]Entry, len(keys)) e := make([]Entry, len(keys))
for i, k := range keys { for i, k := range keys {
......
...@@ -5,12 +5,6 @@ import ( ...@@ -5,12 +5,6 @@ import (
"testing" "testing"
) )
type orderTestCase struct {
order Order
keys []string
expect []string
}
func testKeyOrder(t *testing.T, f Order, keys []string, expect []string) { func testKeyOrder(t *testing.T, f Order, keys []string, expect []string) {
e := make([]Entry, len(keys)) e := make([]Entry, len(keys))
for i, k := range keys { for i, k := range keys {
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment