TheArchive/yggdrasil-go
1
0
Fork 0
mirror of https://github.com/yggdrasil-network/yggdrasil-go.git synced 2024-11-30 13:35:19 +00:00
Code Issues Packages Projects Releases Wiki Activity

cleanup

Browse Source
This commit is contained in:
Arceliar 2018-05-16 17:32:26 -05:00
parent fe712d24f8
commit 800ccaa3d4
1 changed files with 0 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
src/yggdrasil/dht.go
View File

@ -234,16 +234,6 @@ func (t *dht) insert(info *dhtInfo, isPeer bool) {
return return
} }
b.other = append(b.other, info) b.other = append(b.other, info)
/*
// Check if the next bucket is non-full and return early if it is
if bidx+1 == t.nBuckets() {
return
}
bnext := t.getBucket(bidx + 1)
if len(bnext.other) < dht_bucket_size {
return
}
//*/
// Shrink from the *front* to requied size // Shrink from the *front* to requied size
for len(b.other) > dht_bucket_size { for len(b.other) > dht_bucket_size {
b.other = b.other[1:] b.other = b.other[1:]
@ -480,15 +470,6 @@ func (t *dht) doMaintenance() {
} }
// This is a good spot to check if a node is worth pinging // This is a good spot to check if a node is worth pinging
add := len(b.other) < dht_bucket_size add := len(b.other) < dht_bucket_size
/*
if bidx+1 == t.nBuckets() {
add = true
}
bnext := t.getBucket(bidx + 1)
if len(bnext.other) < dht_bucket_size {
add = true
}
//*/
for _, info := range b.other { for _, info := range b.other {
if dht_firstCloserThanThird(rumor.info.getNodeID(), &t.nodeID, info.getNodeID()) { if dht_firstCloserThanThird(rumor.info.getNodeID(), &t.nodeID, info.getNodeID()) {
// Add the node if they are closer to us than someone in the same bucket // Add the node if they are closer to us than someone in the same bucket