fluencelabs/go-libp2p-kad-dht
1
0
Fork 0
mirror of https://github.com/fluencelabs/go-libp2p-kad-dht synced 2025-04-25 06:42:13 +00:00
Code Issues Projects Releases Wiki Activity

Capitalized NOTE, first letter of following word

Browse Source 
License: MIT
Signed-off-by: Richard Littauer <richard.littauer@gmail.com>
This commit is contained in:
Richard Littauer 2016-04-29 16:57:19 -04:00
parent 8cd54dd9d8
commit 761f5c277e
3 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
dht.go
View File

@ -154,7 +154,7 @@ var errInvalidRecord = errors.New("received invalid record")
// getValueOrPeers queries a particular peer p for the value for // getValueOrPeers queries a particular peer p for the value for
// key. It returns either the value or a list of closer peers. // key. It returns either the value or a list of closer peers.
// NOTE: it will update the dht's peerstore with any new addresses // NOTE: It will update the dht's peerstore with any new addresses
// it finds for the given peer. // it finds for the given peer.
func (dht *IpfsDHT) getValueOrPeers(ctx context.Context, p peer.ID, func (dht *IpfsDHT) getValueOrPeers(ctx context.Context, p peer.ID,
key key.Key) (*pb.Record, []peer.PeerInfo, error) { key key.Key) (*pb.Record, []peer.PeerInfo, error) {

2
handlers.go
View File

@ -127,7 +127,7 @@ func (dht *IpfsDHT) checkLocalDatastore(k key.Key) (*pb.Record, error) {
recordIsBad = true recordIsBad = true
} }
// NOTE: we do not verify the record here beyond checking these timestamps. // NOTE: We do not verify the record here beyond checking these timestamps.
// we put the burden of checking the records on the requester as checking a record // we put the burden of checking the records on the requester as checking a record
// may be computationally expensive // may be computationally expensive

2
routing.go
View File

@ -283,7 +283,7 @@ func (dht *IpfsDHT) findProvidersAsyncRoutine(ctx context.Context, key key.Key,
ps := pset.NewLimited(count) ps := pset.NewLimited(count)
provs := dht.providers.GetProviders(ctx, key) provs := dht.providers.GetProviders(ctx, key)
for _, p := range provs { for _, p := range provs {
// NOTE: assuming that this list of peers is unique // NOTE: Assuming that this list of peers is unique
if ps.TryAdd(p) { if ps.TryAdd(p) {
select { select {
case peerOut <- dht.peerstore.PeerInfo(p): case peerOut <- dht.peerstore.PeerInfo(p):