def test_remove_contact_with_cached_replacement(self): """ Ensures that the removed contact is replaced by the most up-to-date contact in the affected k-bucket's cache. """ parent_node_id = hex((2 ** 512) + 1)[2:] r = RoutingTable(parent_node_id) cache_key = (r._buckets[0].range_min, r._buckets[0].range_max) contact1 = PeerNode(PUBLIC_KEY, self.version, 'netstring://192.168.0.1:9999/', 0) contact2 = PeerNode(BAD_PUBLIC_KEY, self.version, 'netstring://192.168.0.1:9999/', 0) r.add_contact(contact1) r.add_contact(contact2) contact2.failed_RPCs = constants.ALLOWED_RPC_FAILS # Add something into the cache. contact3 = PeerNode(PUBLIC_KEY + 'foo', self.version, 'netstring://192.168.0.1:9999/', 0) contact3.network_id = '3' r._replacement_cache[cache_key] = [contact3, ] # Sanity check self.assertEqual(len(r._buckets[0]), 2) self.assertEqual(len(r._replacement_cache[cache_key]), 1) r.remove_contact(BAD_PUBLIC_KEY) self.assertEqual(len(r._buckets[0]), 2) self.assertEqual(contact1, r._buckets[0]._contacts[0]) self.assertEqual(contact3, r._buckets[0]._contacts[1]) self.assertEqual(len(r._replacement_cache[cache_key]), 0)
def test_remove_contact(self): """ Ensures that a contact is removed, given that it's failedRPCs counter exceeds or is equal to constants.ALLOWED_RPC_FAILS """ parent_node_id = 'deadbeef' r = RoutingTable(parent_node_id) contact1 = PeerNode(PUBLIC_KEY, self.version, 'netstring://192.168.0.1:9999/', 0) contact2 = PeerNode(BAD_PUBLIC_KEY, self.version, 'netstring://192.168.0.1:9999/', 0) r.add_contact(contact1) # contact2 will have the wrong number of failedRPCs r.add_contact(contact2) contact2.failed_RPCs = constants.ALLOWED_RPC_FAILS # Sanity check self.assertEqual(len(r._buckets[0]), 2) r.remove_contact(BAD_PUBLIC_KEY) self.assertEqual(len(r._buckets[0]), 1) self.assertEqual(contact1, r._buckets[0]._contacts[0])