aboutsummaryrefslogtreecommitdiffstats
path: root/Godeps/_workspace/src/github.com/syndtr/goleveldb/leveldb/iterator/indexed_iter_test.go
blob: 6a89b3830db37f3d15646ee67117d53e8d5c74f9 (plain) (blame)
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
// Copyright (c) 2014, Suryandaru Triandana <syndtr@gmail.com>
// All rights reserved.
//
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

package iterator_test

import (
    "sort"

    . "github.com/onsi/ginkgo"

    "github.com/syndtr/goleveldb/leveldb/comparer"
    . "github.com/syndtr/goleveldb/leveldb/iterator"
    "github.com/syndtr/goleveldb/leveldb/testutil"
)

type keyValue struct {
    key []byte
    testutil.KeyValue
}

type keyValueIndex []keyValue

func (x keyValueIndex) Search(key []byte) int {
    return sort.Search(x.Len(), func(i int) bool {
        return comparer.DefaultComparer.Compare(x[i].key, key) >= 0
    })
}

func (x keyValueIndex) Len() int                        { return len(x) }
func (x keyValueIndex) Index(i int) (key, value []byte) { return x[i].key, nil }
func (x keyValueIndex) Get(i int) Iterator              { return NewArrayIterator(x[i]) }

var _ = testutil.Defer(func() {
    Describe("Indexed iterator", func() {
        Test := func(n ...int) func() {
            if len(n) == 0 {
                rnd := testutil.NewRand()
                n = make([]int, rnd.Intn(17)+3)
                for i := range n {
                    n[i] = rnd.Intn(19) + 1
                }
            }

            return func() {
                It("Should iterates and seeks correctly", func(done Done) {
                    // Build key/value.
                    index := make(keyValueIndex, len(n))
                    sum := 0
                    for _, x := range n {
                        sum += x
                    }
                    kv := testutil.KeyValue_Generate(nil, sum, 1, 10, 4, 4)
                    for i, j := 0, 0; i < len(n); i++ {
                        for x := n[i]; x > 0; x-- {
                            key, value := kv.Index(j)
                            index[i].key = key
                            index[i].Put(key, value)
                            j++
                        }
                    }

                    // Test the iterator.
                    t := testutil.IteratorTesting{
                        KeyValue: kv.Clone(),
                        Iter:     NewIndexedIterator(NewArrayIndexer(index), true, true),
                    }
                    testutil.DoIteratorTesting(&t)
                    done <- true
                }, 1.5)
            }
        }

        Describe("with 100 keys", Test(100))
        Describe("with 50-50 keys", Test(50, 50))
        Describe("with 50-1 keys", Test(50, 1))
        Describe("with 50-1-50 keys", Test(50, 1, 50))
        Describe("with 1-50 keys", Test(1, 50))
        Describe("with random N-keys", Test())
    })
})