def test_find_close_nodes_in_correct_order(self):
"""
Ensures that the nearest nodes are returned in the correct order: from
the node closest to the target key to the node furthest away.
"""
parent_node_id = '0xdeadbeef'
r = RoutingTable(parent_node_id)
# Fill up the bucket and replacement cache
for i in range(512):
contact = PeerNode(PUBLIC_KEY, "192.168.0.%d" % i, 9999,
self.version, 0)
contact.network_id = hex(2 ** i)
r.add_contact(contact)
target_key = hex(2 ** 256)
result = r.find_close_nodes(target_key)
self.assertEqual(constants.K, len(result))
# Ensure results are in the correct order.
def key(node):
return distance(node.network_id, target_key)
sorted_nodes = sorted(result, key=key)
self.assertEqual(sorted_nodes, result)
# Ensure the order is from lowest to highest in terms of distance
distances = [distance(x.network_id, target_key) for x in result]
self.assertEqual(sorted(distances), distances)
def test_distance(self):
"""
Sanity check to ensure the XOR'd values return the correct distance.
"""
key1 = '0xdeadbeef'
key2 = '0xbeefdead'
expected = int(key1, 0) ^ int(key2, 0)
actual = distance(key1, key2)
self.assertEqual(expected, actual)
def test_sort_peer_nodes(self):
"""
Ensures that the sort_peer_nodes function returns the list ordered in
such a way that the contacts closest to the target key are at the head
of the list.
"""
contacts = []
for i in range(512):
contact = PeerNode(PUBLIC_KEY, "192.168.0.%d" % i, 9999,
self.version, 0)
contact.network_id = hex(2 ** i)
contacts.append(contact)
target_key = hex(2 ** 256)
result = sort_peer_nodes(contacts, target_key)
# Ensure results are in the correct order.
def key(node):
return distance(node.network_id, target_key)
sorted_nodes = sorted(result, key=key)
self.assertEqual(sorted_nodes, result)
# Ensure the order is from lowest to highest in terms of distance
distances = [distance(x.network_id, target_key) for x in result]
self.assertEqual(sorted(distances), distances)
def key(node):
return distance(node.network_id, target_key)
