Add ensures the given nodes are present in the set.
(nodes ...*enode.Node)
| 89 | |
| 90 | // Add ensures the given nodes are present in the set. |
| 91 | func (ns NodeSet) Add(nodes ...*enode.Node) { |
| 92 | for _, n := range nodes { |
| 93 | v := ns[n.ID()] |
| 94 | v.N = n |
| 95 | v.Seq = n.Seq() |
| 96 | ns[n.ID()] = v |
| 97 | } |
| 98 | } |
| 99 | |
| 100 | // TopN returns the top n nodes by score as a new set. |
| 101 | func (ns NodeSet) TopN(n int) NodeSet { |
no outgoing calls
no test coverage detected