6 "github.com/anacrolix/multiless"
7 "github.com/google/btree"
10 // Peers are stored with their priority at insertion. Their priority may
11 // change if our apparent IP changes, we don't currently handle that.
12 type prioritizedPeersItem struct {
17 var hashSeed = maphash.MakeSeed()
19 func (me prioritizedPeersItem) addrHash() int64 {
22 h.WriteString(me.p.Addr.String())
23 return int64(h.Sum64())
26 func (me prioritizedPeersItem) Less(than btree.Item) bool {
27 other := than.(prioritizedPeersItem)
28 return multiless.New().Bool(
29 me.p.Trusted, other.p.Trusted).Uint32(
30 me.prio, other.prio).Int64(
31 me.addrHash(), other.addrHash(),
35 type prioritizedPeers struct {
37 getPrio func(PeerInfo) peerPriority
40 func (me *prioritizedPeers) Each(f func(PeerInfo)) {
41 me.om.Ascend(func(i btree.Item) bool {
42 f(i.(prioritizedPeersItem).p)
47 func (me *prioritizedPeers) Len() int {
51 // Returns true if a peer is replaced.
52 func (me *prioritizedPeers) Add(p PeerInfo) bool {
53 return me.om.ReplaceOrInsert(prioritizedPeersItem{me.getPrio(p), p}) != nil
56 // Returns true if a peer is replaced.
57 func (me *prioritizedPeers) AddReturningReplacedPeer(p PeerInfo) (ret PeerInfo, ok bool) {
58 item := me.om.ReplaceOrInsert(prioritizedPeersItem{me.getPrio(p), p})
62 ret = item.(prioritizedPeersItem).p
67 func (me *prioritizedPeers) DeleteMin() (ret prioritizedPeersItem, ok bool) {
68 i := me.om.DeleteMin()
72 ret = i.(prioritizedPeersItem)
77 func (me *prioritizedPeers) PopMax() PeerInfo {
78 return me.om.DeleteMax().(prioritizedPeersItem).p