This commit is contained in:
parent
3840f19869
commit
1d438f5d23
1 changed files with 4 additions and 4 deletions
|
@ -67,7 +67,7 @@ class _IterativeFind:
|
||||||
|
|
||||||
def getContactTriples(self, result):
|
def getContactTriples(self, result):
|
||||||
if self.is_find_value_request:
|
if self.is_find_value_request:
|
||||||
contact_triples = result['contacts']
|
contact_triples = result[b'contacts']
|
||||||
else:
|
else:
|
||||||
contact_triples = result
|
contact_triples = result
|
||||||
for contact_tup in contact_triples:
|
for contact_tup in contact_triples:
|
||||||
|
@ -112,11 +112,11 @@ class _IterativeFind:
|
||||||
# We are looking for a value, and the remote node didn't have it
|
# We are looking for a value, and the remote node didn't have it
|
||||||
# - mark it as the closest "empty" node, if it is
|
# - mark it as the closest "empty" node, if it is
|
||||||
# TODO: store to this peer after finding the value as per the kademlia spec
|
# TODO: store to this peer after finding the value as per the kademlia spec
|
||||||
if 'closestNodeNoValue' in self.find_value_result:
|
if b'closestNodeNoValue' in self.find_value_result:
|
||||||
if self.is_closer(contact):
|
if self.is_closer(contact):
|
||||||
self.find_value_result['closestNodeNoValue'] = contact
|
self.find_value_result[b'closestNodeNoValue'] = contact
|
||||||
else:
|
else:
|
||||||
self.find_value_result['closestNodeNoValue'] = contact
|
self.find_value_result[b'closestNodeNoValue'] = contact
|
||||||
contactTriples = self.getContactTriples(result)
|
contactTriples = self.getContactTriples(result)
|
||||||
for contactTriple in contactTriples:
|
for contactTriple in contactTriples:
|
||||||
if (contactTriple[1], contactTriple[2]) in ((c.address, c.port) for c in self.already_contacted):
|
if (contactTriple[1], contactTriple[2]) in ((c.address, c.port) for c in self.already_contacted):
|
||||||
|
|
Loading…
Reference in a new issue