blob: 2c90f65c89d63848bf9c510a59cb3015de287150 (
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
|
// 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 (
"bytes"
"github.com/dexon-foundation/dexon-consensus/common"
"github.com/dexon-foundation/dexon-consensus/core/crypto"
)
// NodeID is the ID type for nodes.
type NodeID struct {
common.Hash
}
// NewNodeID returns a NodeID with Hash set to the hash value of
// public key.
func NewNodeID(pubKey crypto.PublicKey) NodeID {
return NodeID{Hash: crypto.Keccak256Hash(pubKey.Bytes()[1:])}
}
// Equal checks if the hash representation is the same NodeID.
func (v NodeID) Equal(v2 NodeID) bool {
return v.Hash == v2.Hash
}
// NodeIDs implements sort.Interface for NodeID.
type NodeIDs []NodeID
func (v NodeIDs) Len() int {
return len(v)
}
func (v NodeIDs) Less(i int, j int) bool {
return bytes.Compare([]byte(v[i].Hash[:]), []byte(v[j].Hash[:])) == -1
}
func (v NodeIDs) Swap(i int, j int) {
v[i], v[j] = v[j], v[i]
}
|