sorting

package

v0.0.0-...-a5a1c7b Latest Latest Go to latest Published: Jan 31, 2024 License: GPL-3.0 Imports: 3 Imported by: 0

Documentation ¶

This section is empty.

This section is empty.

This section is empty.

type PeerDistance struct {
	peer.ID
	Distance *big.Int
}

PeerDistance is a composite struct on top of a peer ID that also contains the kad distance measured against the current peer and held as a big.Int

type PeerDistances []*PeerDistance

PeerDistances represents a sortable peerDistance slice

func (pd PeerDistances) Len() int

Len returns the length of this slice

func (pd PeerDistances) Less(i, j int) bool

Less is used in sorting and returns if i-th element is less than j-th element

func (pd PeerDistances) Swap(i, j int)

Swap is used in sorting and swaps the values between the i-th position with the one found on j-th position

type SortedID struct {
	ID       peer.ID
	Key      []byte
	Shard    uint32
	Distance *big.Int
}

SortedID contains the peer data

type SortedList struct {
	Ref   SortedID
	Peers []SortedID
}

SortedList holds a sorted list of elements in respect with the reference value

func (sl *SortedList) Len() int

Len is the number of elements in the collection.

func (sl *SortedList) Less(i int, j int) bool

Less reports whether the element with index i should sort before the element with index j.

func (sl *SortedList) SortedPeers() []peer.ID

SortedPeers get the orted list of peers

func (sl *SortedList) Swap(i int, j int)

Swap swaps the elements with indexes i and j.