mirror of
https://gitlab.com/pulsechaincom/prysm-pulse.git
synced 2024-12-23 20:07:17 +00:00
5569a68452
* Value assigned to a variable is never read before being overwritten * The result of append is not used anywhere * Suspicious assignment of range-loop vars detected * Unused method receiver detected * Revert "Auxiliary commit to revert individual files from 54edcb445484a2e5d79612e19af8e949b8861253" This reverts commit bbd1e1beabf7b0c5cfc4f514dcc820062ad6c063. * Method modifies receiver * Fix test * Duplicate imports detected * Incorrectly formatted error string * Types of function parameters can be combined * One more "Unused method receiver detected" * Unused parameter detected in function
78 lines
2.1 KiB
Go
78 lines
2.1 KiB
Go
package sync
|
|
|
|
import (
|
|
"errors"
|
|
"sort"
|
|
|
|
"github.com/prysmaticlabs/prysm/proto/prysm/v1alpha1/block"
|
|
)
|
|
|
|
// A type to represent beacon blocks and roots which have methods
|
|
// which satisfy the Interface in `Sort` so that this type can
|
|
// be sorted in ascending order.
|
|
type sortedObj struct {
|
|
blks []block.SignedBeaconBlock
|
|
roots [][32]byte
|
|
}
|
|
|
|
// Less reports whether the element with index i must sort before the element with index j.
|
|
func (s sortedObj) Less(i, j int) bool {
|
|
return s.blks[i].Block().Slot() < s.blks[j].Block().Slot()
|
|
}
|
|
|
|
// Swap swaps the elements with indexes i and j.
|
|
func (s sortedObj) Swap(i, j int) {
|
|
s.blks[i], s.blks[j] = s.blks[j], s.blks[i]
|
|
s.roots[i], s.roots[j] = s.roots[j], s.roots[i]
|
|
}
|
|
|
|
// Len is the number of elements in the collection.
|
|
func (s sortedObj) Len() int {
|
|
return len(s.blks)
|
|
}
|
|
|
|
// removes duplicates from provided blocks and roots.
|
|
func (_ *Service) dedupBlocksAndRoots(blks []block.SignedBeaconBlock, roots [][32]byte) ([]block.SignedBeaconBlock, [][32]byte, error) {
|
|
if len(blks) != len(roots) {
|
|
return nil, nil, errors.New("input blks and roots are diff lengths")
|
|
}
|
|
|
|
// Remove duplicate blocks received
|
|
rootMap := make(map[[32]byte]bool, len(blks))
|
|
newBlks := make([]block.SignedBeaconBlock, 0, len(blks))
|
|
newRoots := make([][32]byte, 0, len(roots))
|
|
for i, r := range roots {
|
|
if rootMap[r] {
|
|
continue
|
|
}
|
|
rootMap[r] = true
|
|
newRoots = append(newRoots, roots[i])
|
|
newBlks = append(newBlks, blks[i])
|
|
}
|
|
return newBlks, newRoots, nil
|
|
}
|
|
|
|
func (_ *Service) dedupRoots(roots [][32]byte) [][32]byte {
|
|
newRoots := make([][32]byte, 0, len(roots))
|
|
rootMap := make(map[[32]byte]bool, len(roots))
|
|
for i, r := range roots {
|
|
if rootMap[r] {
|
|
continue
|
|
}
|
|
rootMap[r] = true
|
|
newRoots = append(newRoots, roots[i])
|
|
}
|
|
return newRoots
|
|
}
|
|
|
|
// sort the provided blocks and roots in ascending order. This method assumes that the size of
|
|
// block slice and root slice is equal.
|
|
func (_ *Service) sortBlocksAndRoots(blks []block.SignedBeaconBlock, roots [][32]byte) ([]block.SignedBeaconBlock, [][32]byte) {
|
|
obj := sortedObj{
|
|
blks: blks,
|
|
roots: roots,
|
|
}
|
|
sort.Sort(obj)
|
|
return obj.blks, obj.roots
|
|
}
|