-
Notifications
You must be signed in to change notification settings - Fork 147
Expand file tree
/
Copy pathblockindex_test.go
More file actions
151 lines (124 loc) · 3.4 KB
/
blockindex_test.go
File metadata and controls
151 lines (124 loc) · 3.4 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
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
/*
* 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 sqlchain
import (
"testing"
"github.com/CovenantSQL/CovenantSQL/types"
)
var (
testBlocks []*types.Block
testBlockNumber = 50
)
func generateTestBlocks() (err error) {
testBlocks = make([]*types.Block, 0, testBlockNumber)
for i, prev := 0, genesisHash; i < testBlockNumber; i++ {
b, err := createRandomBlock(prev, false)
if err != nil {
return err
}
prev = *b.BlockHash()
testBlocks = append(testBlocks, b)
}
return
}
func init() {
if err := generateTestBlocks(); err != nil {
panic(err)
}
}
func TestNewBlockNode(t *testing.T) {
parent := newBlockNode(0, testBlocks[0], nil)
if parent == nil {
t.Fatal("unexpected result: nil")
} else if parent.parent != nil {
t.Fatalf("unexpected parent: %v", parent.parent)
} else if parent.count != 0 {
t.Fatalf("unexpected height: %d", parent.count)
}
child := newBlockNode(1, testBlocks[1], parent)
if child == nil {
t.Fatal("unexpected result: nil")
} else if child.parent != parent {
t.Fatalf("unexpected parent: %v", child.parent)
} else if child.count != parent.count+1 {
t.Fatalf("unexpected height: %d", child.count)
}
}
func TestInitBlockNode(t *testing.T) {
parent := newBlockNode(0, testBlocks[0], nil)
if parent == nil {
t.Fatal("unexpected result: nil")
} else if parent.parent != nil {
t.Fatalf("unexpected parent: %v", parent.parent)
} else if parent.count != 0 {
t.Fatalf("unexpected height: %d", parent.count)
}
child := newBlockNode(1, testBlocks[1], parent)
if child == nil {
t.Fatal("unexpected result: nil")
} else if child.parent != parent {
t.Fatalf("unexpected parent: %v", child.parent)
} else if child.count != parent.count+1 {
t.Fatalf("unexpected height: %d", child.count)
}
}
func TestAncestor(t *testing.T) {
index := newBlockIndex()
parent := (*blockNode)(nil)
for h, b := range testBlocks {
bn := newBlockNode(int32(h), b, parent)
index.addBlock(bn)
parent = bn
}
for i, b := range testBlocks {
bn := index.lookupNode(b.BlockHash())
if bn == nil {
t.Fatalf("unexpected loopup result: %v", bn)
}
for j := int32(i - 1); j < int32(i+1); j++ {
a := bn.ancestor(j)
if j < 0 || j > bn.count {
if a != nil {
t.Fatalf("unexpected ancestor: %v", a)
}
} else {
if a.count != j {
t.Fatalf("unexpected ancestor height: got %d while expecting %d", a.count, j)
}
}
}
}
}
func TestIndex(t *testing.T) {
index := newBlockIndex()
parent := (*blockNode)(nil)
for h, b := range testBlocks {
bn := newBlockNode(int32(h), b, parent)
index.addBlock(bn)
parent = bn
}
for _, b := range testBlocks {
if !index.hasBlock(b.BlockHash()) {
t.Fatalf("unexpected loopup result: %v", false)
}
}
for _, b := range testBlocks {
bn := index.lookupNode(b.BlockHash())
if bn == nil {
t.Fatalf("unexpected loopup result: %v", bn)
}
}
}