aboutsummaryrefslogtreecommitdiffstats
path: root/core/types/nodeset_test.go
blob: 2780ed230788a6b11aa4d847f39eedddb44695ad (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
// 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 types

import (
    "testing"

    "github.com/dexon-foundation/dexon-consensus/common"
    "github.com/stretchr/testify/suite"
)

type NodeSetTestSuite struct {
    suite.Suite
}

func (s *NodeSetTestSuite) TestGetSubSet() {
    total := 10
    crs := common.NewRandomHash()
    nodes := NewNodeSet()
    for len(nodes.IDs) < total {
        nodes.IDs[NodeID{common.NewRandomHash()}] = struct{}{}
    }
    target := NewNotarySetTarget(crs, 0)
    ranks := make(map[NodeID]*nodeRank, len(nodes.IDs))
    for nID := range nodes.IDs {
        ranks[nID] = newNodeRank(nID, target)
    }
    size := 4
    notarySet := nodes.GetSubSet(size, target)
    for notary := range notarySet {
        win := 0
        rank := ranks[notary].rank
        for node := range nodes.IDs {
            if rank.Cmp(ranks[node].rank) < 0 {
                win++
            }
        }
        s.True(win >= total-size)
    }
}

func (s *NodeSetTestSuite) TestGetSubSetZeroSize() {
    total := 10
    nodes := NewNodeSet()
    for len(nodes.IDs) < total {
        nodes.IDs[NodeID{common.NewRandomHash()}] = struct{}{}
    }
    // Passing nil should not crash.
    emptySet := nodes.GetSubSet(0, nil)
    s.Len(emptySet, 0)
}

func TestNodeSet(t *testing.T) {
    suite.Run(t, new(NodeSetTestSuite))
}