-
Notifications
You must be signed in to change notification settings - Fork 148
Expand file tree
/
Copy pathload_test.go
More file actions
61 lines (53 loc) · 1.81 KB
/
load_test.go
File metadata and controls
61 lines (53 loc) · 1.81 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
/*
* Copyright 2018 The CovenantSQL Authors.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package consistent
import (
"os"
"sort"
"testing"
. "github.com/smartystreets/goconvey/convey"
"github.com/CovenantSQL/CovenantSQL/crypto/kms"
"github.com/CovenantSQL/CovenantSQL/utils"
)
const testStorePath1 = "./test.store1"
const testStorePath2 = "./test.store2"
func TestSaveDHT(t *testing.T) {
kms.Unittest = true
os.Remove(testStorePath1)
os.Remove(testStorePath2)
//kms.ResetBucket()
Convey("save DHT", t, func() {
x, _ := InitConsistent(testStorePath1, new(KMSStorage), false)
x.Add(NewNodeFromString("111111"))
x.Add(NewNodeFromString(("3333")))
So(len(x.circle), ShouldEqual, x.NumberOfReplicas*2)
So(len(x.sortedHashes), ShouldEqual, x.NumberOfReplicas*2)
So(sort.IsSorted(x.sortedHashes), ShouldBeTrue)
utils.CopyFile(testStorePath1, testStorePath2)
})
}
func TestLoadDHT(t *testing.T) {
Convey("load existing DHT", t, func() {
kms.Unittest = true
x, _ := InitConsistent(testStorePath2, new(KMSStorage), false)
defer os.Remove(testStorePath1)
defer os.Remove(testStorePath2)
// with BP node, there should be 3 nodes
So(len(x.circle), ShouldEqual, x.NumberOfReplicas*2)
So(len(x.sortedHashes), ShouldEqual, x.NumberOfReplicas*2)
So(sort.IsSorted(x.sortedHashes), ShouldBeTrue)
})
}