forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-08-20 10:52:25 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

p2p/enode: fix comment typos

Browse source
This commit is contained in:
Felix Lange 2019-10-18 12:23:16 +02:00
parent d85ee4d5d4
commit 497220ec4a
1 changed files with 5 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
p2p/enode/iter.go
View file

@ -32,7 +32,7 @@ type Iterator interface {
// ReadNodes reads at most n nodes from the given iterator. The return value contains no // ReadNodes reads at most n nodes from the given iterator. The return value contains no
// duplicates and no nil values. To prevent looping indefinitely for small repeating node // duplicates and no nil values. To prevent looping indefinitely for small repeating node
// sequences, this function calls NextNode at most n times. // sequences, this function calls Next at most n times.
func ReadNodes(it Iterator, n int) []*Node { func ReadNodes(it Iterator, n int) []*Node {
seen := make(map[ID]*Node, n) seen := make(map[ID]*Node, n)
for i := 0; i < n && it.Next(); i++ { for i := 0; i < n && it.Next(); i++ {
@ -101,7 +101,7 @@ func (it *sliceIter) Close() {
it.nodes = nil it.nodes = nil
} }
// Filter wraps an iterator such that NextNode only returns nodes for which // Filter wraps an iterator such that Next only returns nodes for which
// the 'check' function returns true. // the 'check' function returns true.
func Filter(it Iterator, check func(*Node) bool) Iterator { func Filter(it Iterator, check func(*Node) bool) Iterator {
return &filterIter{it, check} return &filterIter{it, check}
@ -125,12 +125,12 @@ func (f *filterIter) Next() bool {
// only when Close is called. Source iterators added via AddSource are removed from the // only when Close is called. Source iterators added via AddSource are removed from the
// mix when they end. // mix when they end.
// //
// The distribution of nodes returned by NextNode is approximately fair, i.e. FairMix // The distribution of nodes returned by Next is approximately fair, i.e. FairMix
// attempts to draw from all sources equally often. However, if a certain source is slow // attempts to draw from all sources equally often. However, if a certain source is slow
// and doesn't return a node within the configured timeout, a node from any other source // and doesn't return a node within the configured timeout, a node from any other source
// will be returned. // will be returned.
// //
// It's safe to call AddSource and Close concurrently with NextNode. // It's safe to call AddSource and Close concurrently with Next.
type FairMix struct { type FairMix struct {
wg sync.WaitGroup wg sync.WaitGroup
fromAny chan *Node fromAny chan *Node
@ -196,7 +196,7 @@ func (m *FairMix) Close() {
m.closed = nil m.closed = nil
} }
// NextNode returns a node from a random source. // Next returns a node from a random source.
func (m *FairMix) Next() bool { func (m *FairMix) Next() bool {
m.cur = nil m.cur = nil