aboutsummaryrefslogtreecommitdiffstats
path: root/consensus
diff options
context:
space:
mode:
authorhadv <dvietha@gmail.com>2018-07-19 18:06:13 +0800
committerhadv <dvietha@gmail.com>2018-07-24 15:56:53 +0800
commit49f63deb24beed8adc03a6fdf5d68ab793cc275f (patch)
tree7c37cde1a6bd9f0d2475721dd7f1d48563231438 /consensus
parentafd8b847060eed094cd7c6e0d133338a33cf4631 (diff)
downloaddexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar.gz
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar.bz2
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar.lz
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar.xz
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.tar.zst
dexon-49f63deb24beed8adc03a6fdf5d68ab793cc275f.zip
consensus/clique: replace bubble sort by golang stable sort
Diffstat (limited to 'consensus')
-rw-r--r--consensus/clique/snapshot.go24
1 files changed, 13 insertions, 11 deletions
diff --git a/consensus/clique/snapshot.go b/consensus/clique/snapshot.go
index 9ebdb8df1..2333d6924 100644
--- a/consensus/clique/snapshot.go
+++ b/consensus/clique/snapshot.go
@@ -19,6 +19,7 @@ package clique
import (
"bytes"
"encoding/json"
+ "sort"
"github.com/ethereum/go-ethereum/common"
"github.com/ethereum/go-ethereum/core/types"
@@ -56,6 +57,13 @@ type Snapshot struct {
Tally map[common.Address]Tally `json:"tally"` // Current vote tally to avoid recalculating
}
+// signers implements the sort interface to allow sorting a list of addresses
+type signers []common.Address
+
+func (s signers) Len() int { return len(s) }
+func (s signers) Less(i, j int) bool { return bytes.Compare(s[i][:], s[j][:]) < 0 }
+func (s signers) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
+
// newSnapshot creates a new snapshot with the specified startup parameters. This
// method does not initialize the set of recent signers, so only ever use if for
// the genesis block.
@@ -286,18 +294,12 @@ func (s *Snapshot) apply(headers []*types.Header) (*Snapshot, error) {
// signers retrieves the list of authorized signers in ascending order.
func (s *Snapshot) signers() []common.Address {
- signers := make([]common.Address, 0, len(s.Signers))
- for signer := range s.Signers {
- signers = append(signers, signer)
- }
- for i := 0; i < len(signers); i++ {
- for j := i + 1; j < len(signers); j++ {
- if bytes.Compare(signers[i][:], signers[j][:]) > 0 {
- signers[i], signers[j] = signers[j], signers[i]
- }
- }
+ sigs := make([]common.Address, 0, len(s.Signers))
+ for sig := range s.Signers {
+ sigs = append(sigs, sig)
}
- return signers
+ sort.Sort(signers(sigs))
+ return sigs
}
// inturn returns if a signer at a given block height is in-turn or not.