LBRYCommunity/lbry-sdk
1
0
Fork 1
Code Issues Pull requests Packages Projects Releases 282 Wiki Activity

changelog

Browse source
This commit is contained in:
Jack Robison 2017-10-27 21:46:55 -04:00
parent e89f3db31b
commit fdaaa0e678
No known key found for this signature in database
GPG key ID: 284699E7404E3CFF
2 changed files with 3 additions and 9 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

10
CHANGELOG.md
View file

@ -13,16 +13,8 @@ at anytime.
* *
### Fixed ### Fixed
* Fixed amount of close nodes to add to list in case of extension to neighbouring k-buckets
* *
*
* Fixed slow startup for nodes with many lbry files
* Fixed setting the external ip on startup
* Fixed session startup not blocking on joining the dht
* Fixed several parsing bugs that prevented replacing dead dht contacts
* Fixed lbryid length validation
* Fixed an old print statement that polluted logs
* Fixed rpc id length for dht requests
* Fixed amount of closed nodes to add to list in case of extension to neighbouring k-buckets
### Deprecated ### Deprecated
* *

2
lbrynet/dht/routingtable.py
View file

@ -142,6 +142,8 @@ class TreeRoutingTable(object):
# Fill up the node list to k nodes, starting with the closest neighbouring nodes known # Fill up the node list to k nodes, starting with the closest neighbouring nodes known
while len(closestNodes) < min(count, constants.k) and (canGoLower or canGoHigher): while len(closestNodes) < min(count, constants.k) and (canGoLower or canGoHigher):
# TODO: this may need to be optimized # TODO: this may need to be optimized
# TODO: add "key" kwarg to getContacts() to sort contacts returned by xor distance
# to the key
if canGoLower and len(closestNodes) < min(count, constants.k): if canGoLower and len(closestNodes) < min(count, constants.k):
closestNodes.extend( closestNodes.extend(
self._buckets[bucketIndex - i].getContacts(get_remain(closestNodes), self._buckets[bucketIndex - i].getContacts(get_remain(closestNodes),