/usr/lib/python2.7/dist-packages/pymemcache/test/test_rendezvous.py is in python-pymemcache 1.3.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 | from pymemcache.client.rendezvous import RendezvousHash
import pytest
@pytest.mark.unit()
def test_init_no_options():
rendezvous = RendezvousHash()
assert 0 == len(rendezvous.nodes)
assert 1361238019 == rendezvous.hash_function('6666')
@pytest.mark.unit()
def test_init():
nodes = ['0', '1', '2']
rendezvous = RendezvousHash(nodes=nodes)
assert 3 == len(rendezvous.nodes)
assert 1361238019 == rendezvous.hash_function('6666')
@pytest.mark.unit()
def test_seed():
rendezvous = RendezvousHash(seed=10)
assert 2981722772 == rendezvous.hash_function('6666')
@pytest.mark.unit()
def test_add_node():
rendezvous = RendezvousHash()
rendezvous.add_node('1')
assert 1 == len(rendezvous.nodes)
rendezvous.add_node('1')
assert 1 == len(rendezvous.nodes)
rendezvous.add_node('2')
assert 2 == len(rendezvous.nodes)
rendezvous.add_node('1')
assert 2 == len(rendezvous.nodes)
@pytest.mark.unit()
def test_remove_node():
nodes = ['0', '1', '2']
rendezvous = RendezvousHash(nodes=nodes)
rendezvous.remove_node('2')
assert 2 == len(rendezvous.nodes)
with pytest.raises(ValueError):
rendezvous.remove_node('2')
assert 2 == len(rendezvous.nodes)
rendezvous.remove_node('1')
assert 1 == len(rendezvous.nodes)
rendezvous.remove_node('0')
assert 0 == len(rendezvous.nodes)
@pytest.mark.unit()
def test_get_node():
nodes = ['0', '1', '2']
rendezvous = RendezvousHash(nodes=nodes)
assert '0' == rendezvous.get_node('ok')
assert '1' == rendezvous.get_node('mykey')
assert '2' == rendezvous.get_node('wat')
@pytest.mark.unit()
def test_get_node_after_removal():
nodes = ['0', '1', '2']
rendezvous = RendezvousHash(nodes=nodes)
rendezvous.remove_node('1')
assert '0' == rendezvous.get_node('ok')
assert '0' == rendezvous.get_node('mykey')
assert '2' == rendezvous.get_node('wat')
@pytest.mark.unit()
def test_get_node_after_addition():
nodes = ['0', '1', '2']
rendezvous = RendezvousHash(nodes=nodes)
assert '0' == rendezvous.get_node('ok')
assert '1' == rendezvous.get_node('mykey')
assert '2' == rendezvous.get_node('wat')
assert '2' == rendezvous.get_node('lol')
rendezvous.add_node('3')
assert '0' == rendezvous.get_node('ok')
assert '1' == rendezvous.get_node('mykey')
assert '2' == rendezvous.get_node('wat')
assert '3' == rendezvous.get_node('lol')
@pytest.mark.unit()
def test_grow():
rendezvous = RendezvousHash()
placements = {}
for i in range(10):
rendezvous.add_node(str(i))
placements[str(i)] = []
for i in range(1000):
node = rendezvous.get_node(str(i))
placements[node].append(i)
new_placements = {}
for i in range(20):
rendezvous.add_node(str(i))
new_placements[str(i)] = []
for i in range(1000):
node = rendezvous.get_node(str(i))
new_placements[node].append(i)
keys = [k for sublist in placements.values() for k in sublist]
new_keys = [k for sublist in new_placements.values() for k in sublist]
assert sorted(keys) == sorted(new_keys)
added = 0
removed = 0
for node, assignments in new_placements.items():
after = set(assignments)
before = set(placements.get(node, []))
removed += len(before.difference(after))
added += len(after.difference(before))
assert added == removed
assert 1062 == (added + removed)
@pytest.mark.unit()
def test_shrink():
rendezvous = RendezvousHash()
placements = {}
for i in range(10):
rendezvous.add_node(str(i))
placements[str(i)] = []
for i in range(1000):
node = rendezvous.get_node(str(i))
placements[node].append(i)
rendezvous.remove_node('9')
new_placements = {}
for i in range(9):
new_placements[str(i)] = []
for i in range(1000):
node = rendezvous.get_node(str(i))
new_placements[node].append(i)
keys = [k for sublist in placements.values() for k in sublist]
new_keys = [k for sublist in new_placements.values() for k in sublist]
assert sorted(keys) == sorted(new_keys)
added = 0
removed = 0
for node, assignments in placements.items():
after = set(assignments)
before = set(new_placements.get(node, []))
removed += len(before.difference(after))
added += len(after.difference(before))
assert added == removed
assert 202 == (added + removed)
def collide(key, seed):
return 1337
@pytest.mark.unit()
def test_rendezvous_collision():
nodes = ['c', 'b', 'a']
rendezvous = RendezvousHash(nodes, hash_function=collide)
for i in range(1000):
assert 'c' == rendezvous.get_node(i)
@pytest.mark.unit()
def test_rendezvous_names():
nodes = [1, 2, 3, 'a', 'b', 'lol.wat.com']
rendezvous = RendezvousHash(nodes, hash_function=collide)
for i in range(10):
assert 'lol.wat.com' == rendezvous.get_node(i)
nodes = [1, 'a', '0']
rendezvous = RendezvousHash(nodes, hash_function=collide)
for i in range(10):
assert 'a' == rendezvous.get_node(i)
|