From 1d438f5d23d940d95b9e398f7d1ad416c08f20da Mon Sep 17 00:00:00 2001 From: Jack Robison Date: Wed, 14 Nov 2018 15:35:59 -0500 Subject: [PATCH] fixes https://github.com/lbryio/lbry/issues/1638 --- lbrynet/dht/iterativefind.py | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/lbrynet/dht/iterativefind.py b/lbrynet/dht/iterativefind.py index a2be6b09b..076bd1a3d 100644 --- a/lbrynet/dht/iterativefind.py +++ b/lbrynet/dht/iterativefind.py @@ -67,7 +67,7 @@ class _IterativeFind: def getContactTriples(self, result): if self.is_find_value_request: - contact_triples = result['contacts'] + contact_triples = result[b'contacts'] else: contact_triples = result 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 # - mark it as the closest "empty" node, if it is # 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): - self.find_value_result['closestNodeNoValue'] = contact + self.find_value_result[b'closestNodeNoValue'] = contact else: - self.find_value_result['closestNodeNoValue'] = contact + self.find_value_result[b'closestNodeNoValue'] = contact contactTriples = self.getContactTriples(result) for contactTriple in contactTriples: if (contactTriple[1], contactTriple[2]) in ((c.address, c.port) for c in self.already_contacted):