added NOTE on inefficiency.
This commit is contained in:
parent
14161ea39c
commit
513decfc5a
|
@ -181,6 +181,8 @@ func (bp *BlockPool) handleEvent(event_ interface{}) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// NOTE: This function is sufficient, but we should find pending blocks
|
||||||
|
// and sample the peers in one go rather than the current O(n^2) impl.
|
||||||
func (bp *BlockPool) requestBlocksFromRandomPeers(maxPeers int) {
|
func (bp *BlockPool) requestBlocksFromRandomPeers(maxPeers int) {
|
||||||
chosen := bp.pickAvailablePeers(maxPeers)
|
chosen := bp.pickAvailablePeers(maxPeers)
|
||||||
log.Debug("requestBlocksFromRandomPeers", "chosen", len(chosen))
|
log.Debug("requestBlocksFromRandomPeers", "chosen", len(chosen))
|
||||||
|
|
Loading…
Reference in New Issue