(addr []byte, cidr uint8, peer *Peer)
| 41 | } |
| 42 | |
| 43 | func (r SlowRouter) Insert(addr []byte, cidr uint8, peer *Peer) SlowRouter { |
| 44 | for _, t := range r { |
| 45 | if t.cidr == cidr && commonBits(t.bits, addr) >= cidr { |
| 46 | t.peer = peer |
| 47 | t.bits = addr |
| 48 | return r |
| 49 | } |
| 50 | } |
| 51 | r = append(r, &SlowNode{ |
| 52 | cidr: cidr, |
| 53 | bits: addr, |
| 54 | peer: peer, |
| 55 | }) |
| 56 | sort.Sort(r) |
| 57 | return r |
| 58 | } |
| 59 | |
| 60 | func (r SlowRouter) Lookup(addr []byte) *Peer { |
| 61 | for _, t := range r { |
no test coverage detected