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

remove unused last_accessed

Browse source
This commit is contained in:
Victor Shyba 2022-08-11 20:39:51 -03:00
parent c3e4f0b988
commit e887453aa5
1 changed files with 2 additions and 4 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

6
lbry/dht/protocol/routing_table.py
View file

@ -37,7 +37,6 @@ class KBucket:
covered by this k-bucket covered by this k-bucket
""" """
self._peer_manager = peer_manager self._peer_manager = peer_manager
self.last_accessed = 0
self.range_min = range_min self.range_min = range_min
self.range_max = range_max self.range_max = range_max
self.peers: typing.List['KademliaPeer'] = [] self.peers: typing.List['KademliaPeer'] = []
@ -240,9 +239,8 @@ class TreeRoutingTable:
refresh_ids = [] refresh_ids = []
now = int(self._loop.time()) now = int(self._loop.time())
for bucket in self.buckets[start_index:]: for bucket in self.buckets[start_index:]:
if force or now - bucket.last_accessed >= constants.REFRESH_INTERVAL: to_search = self._midpoint_id_in_bucket_range(bucket_index)
to_search = self._midpoint_id_in_bucket_range(bucket_index) refresh_ids.append(to_search)
refresh_ids.append(to_search)
bucket_index += 1 bucket_index += 1
# if we have 3 or fewer populated buckets get two random ids in the range of each to try and # if we have 3 or fewer populated buckets get two random ids in the range of each to try and
# populate/split the buckets further # populate/split the buckets further