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 dexon-consensus Authors
// This file is part of the dexon-consensus library.
//
// The dexon-consensus 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 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 library. If not, see
// <http://www.gnu.org/licenses/>.
package integration
import (
"testing"
"github.com/stretchr/testify/suite"
)
type UtilsTestSuite struct {
suite.Suite
}
func (s *UtilsTestSuite) TestDecideOwnChains() {
// Basic test for each node index.
s.Empty(decideOwnChains(1, 1, 1))
s.Equal(decideOwnChains(1, 1, 0), []uint32{0})
s.Equal(decideOwnChains(30, 7, 4), []uint32{4, 11, 18, 25})
// Make sure every chain is covered.
isAllCovered := func(numChains uint32, numNodes int) bool {
if numNodes == 0 {
decideOwnChains(numChains, numNodes, 0)
return false
}
covered := make(map[uint32]struct{})
for i := 0; i < numNodes; i++ {
for _, chainID := range decideOwnChains(numChains, numNodes, i) {
s.Require().True(chainID < numChains)
covered[chainID] = struct{}{}
}
}
return uint32(len(covered)) == numChains
}
s.True(isAllCovered(100, 33))
s.True(isAllCovered(100, 200))
s.True(isAllCovered(100, 50))
s.True(isAllCovered(100, 1))
s.Panics(func() {
isAllCovered(100, 0)
})
}
func TestUtils(t *testing.T) {
suite.Run(t, new(UtilsTestSuite))
}
|
