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
|
// Copyright 2018 The dexon-consensus-core Authors
// This file is part of the dexon-consensus-core library.
//
// The dexon-consensus-core library is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the License,
// or (at your option) any later version.
//
// The dexon-consensus-core library is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the dexon-consensus-core library. If not, see
// <http://www.gnu.org/licenses/>.
package core
import (
"testing"
/*
"github.com/dexon-foundation/dexon-consensus-core/common"
"github.com/dexon-foundation/dexon-consensus-core/core/types"
"github.com/dexon-foundation/dexon-consensus-core/crypto/eth"
*/
"github.com/stretchr/testify/suite"
)
type CompactionChainTestSuite struct {
suite.Suite
}
func (s *CompactionChainTestSuite) TestProcessBlock() {
/*
cc := newCompactionChain()
blocks := make([]*types.Block, 10)
for idx := range blocks {
blocks[idx] = &types.Block{
Hash: common.NewRandomHash(),
}
}
var prevBlock *types.Block
for _, block := range blocks {
s.Equal(cc.prevBlock, prevBlock)
cc.processBlock(block)
if prevBlock != nil {
s.Equal(block.Notary.Height, prevBlock.Notary.Height+1)
prevHash, err := hashNotary(prevBlock)
s.Require().Nil(err)
s.Equal(prevHash, block.NotaryParentHash)
}
prevBlock = block
}
*/
}
func (s *CompactionChainTestSuite) TestPrepareBlock() {
/*
cc := newCompactionChain()
blocks := make([]*types.Block, 10)
for idx := range blocks {
blocks[idx] = &types.Block{
Hash: common.NewRandomHash(),
Notary: types.Notary{
Height: uint64(idx),
},
}
if idx > 0 {
var err error
blocks[idx].NotaryParentHash, err = hashNotary(blocks[idx-1])
s.Require().Nil(err)
}
}
prv, err := eth.NewPrivateKey()
s.Require().Nil(err)
for _, block := range blocks {
cc.prepareBlock(block, prv)
if cc.prevBlock != nil {
s.True(verifyNotarySignature(
prv.PublicKey(),
cc.prevBlock,
block.NotaryAck.NotarySignature))
s.Equal(block.NotaryAck.NotaryBlockHash, cc.prevBlock.Hash)
}
cc.prevBlock = block
}
*/
}
func TestNotary(t *testing.T) {
suite.Run(t, new(CompactionChainTestSuite))
}
|
