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 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586
|
#!/usr/bin/python
"""trie module unit tests."""
__author__ = 'Michal Nazarewicz <mina86@mina86.com>'
__copyright__ = 'Copyright 2014 Google Inc.'
import array
import collections
import pickle
import unittest
import pygtrie
# pylint: disable=missing-docstring
def _update_trie_factory(trie_cls, *args, **kw):
t = trie_cls()
t.update(*args, **kw)
return t
def _setter_trie_factory(trie_cls, d): # pylint: disable=invalid-name
t = trie_cls()
for k, v in d.items():
t[k] = v
return t
_TRIE_FACTORIES = ((
'TrieFromNamedArgs',
lambda trie_cls, d: trie_cls(**d)
), (
'TrieFromTuples',
lambda trie_cls, d: trie_cls(d.items())
), (
'TrieFromDict',
lambda trie_cls, d: trie_cls(d)
), (
'TrieFromTrie',
lambda trie_cls, d: trie_cls(trie_cls(d))
), (
'CopyOfTrie',
lambda trie_cls, d: trie_cls(d).copy()
), (
'UpdateWithNamedArgs',
lambda trie_cls, d: _update_trie_factory(trie_cls, **d)
), (
'UpdateWithTuples',
lambda trie_cls, d: _update_trie_factory(trie_cls, d.items())
), (
'UpdateWithDict',
_update_trie_factory
), (
'Setters',
_setter_trie_factory
))
class TrieTestCase(unittest.TestCase):
# The below need to be overwritten by subclasses
# A Trie class being tested
_TRIE_CLS = pygtrie.Trie
# A key to set
_SHORT_KEY = 'foo'
# Another key to set such that _SHORT_KEY is it's prefix
_LONG_KEY = _SHORT_KEY + 'bar'
# A key that is not set but _LONG_KEY is it's prefix
_VERY_LONG_KEY = _LONG_KEY + 'baz'
# A key that is not set and has no relation to other keys
_OTHER_KEY = 'qux'
# A list of prefixes of _SHORT_KEY
_SHORT_PREFIXES = ('', 'f', 'fo')
# A list of prefixes of _LONG_KEY which are not prefixes of _SHORT_KEY nor
# _SHORT_KEY itself
_LONG_PREFIXES = ('foob', 'fooba')
@classmethod
def path_from_key(cls, key):
"""Turns key into a path as used by Trie class being tested."""
return key
@classmethod
def key_from_path(cls, path):
"""Turns path as used by Trie class being tested into a key."""
return tuple(path)
# End of stuff that needs to be overwritten by subclasses
def key_from_key(self, key):
"""Turns a key into a form that the Trie will return e.g. in keys()."""
return self.key_from_path(self.path_from_key(key))
# pylint: disable=invalid-name
def assertNodeState(self, t, key, prefix=False, value=None):
"""Asserts a state of given node in a trie.
Args:
t: Trie to check the node in.
key: A key for the node.
prefix: Whether the node is a prefix of a longer key that is in the
trie.
value: If given, value associated with the key. If missing, node
has no value associated with it.
Raises:
AssertionError: If any assumption is not met.
"""
if prefix:
self.assertTrue(t.has_subtrie(key))
self.assertTrue(bool(t.has_node(key) & pygtrie.Trie.HAS_SUBTRIE))
else:
self.assertFalse(t.has_subtrie(key))
self.assertFalse(bool(t.has_node(key) & pygtrie.Trie.HAS_SUBTRIE))
if value is None:
o = object()
self.assertNotIn(key, t)
key_error_exception = pygtrie.ShortKeyError if prefix else KeyError
self.assertRaises(key_error_exception, lambda: t[key])
self.assertRaises(key_error_exception, t.pop, key)
self.assertIsNone(t.get(key))
self.assertIs(o, t.get(key, o))
self.assertIs(o, t.pop(key, o))
self.assertFalse(t.has_key(key))
self.assertNotIn(self.key_from_key(key), list(t.iterkeys()))
self.assertNotIn(self.key_from_key(key), t.keys())
self.assertEqual(pygtrie.Trie.HAS_SUBTRIE if prefix else 0,
t.has_node(key))
else:
self.assertIn(key, t)
self.assertEqual(value, t[key])
self.assertEqual(value, t.get(key))
self.assertEqual(value, t.get(key, object()))
self.assertTrue(t.has_key(key))
self.assertTrue(bool(t.has_node(key) & pygtrie.Trie.HAS_VALUE))
self.assertIn(self.key_from_key(key), list(t.iterkeys()))
self.assertIn(self.key_from_key(key), t.keys())
def assertFullTrie(self, t, value=42):
"""Asserts a trie has _SHORT_KEY and _LONG_KEY set to value."""
self.assertEqual(2, len(t))
for prefix in self._SHORT_PREFIXES + self._LONG_PREFIXES:
self.assertNodeState(t, prefix, prefix=True)
self.assertNodeState(t, self._SHORT_KEY, prefix=True, value=value)
self.assertNodeState(t, self._LONG_KEY, value=value)
self.assertNodeState(t, self._VERY_LONG_KEY)
self.assertNodeState(t, self._OTHER_KEY)
def assertShortTrie(self, t, value=42):
"""Asserts a trie has only _SHORT_KEY set to value."""
self.assertEqual(1, len(t))
for prefix in self._SHORT_PREFIXES:
self.assertNodeState(t, prefix, prefix=True)
for key in self._LONG_PREFIXES + (
self._LONG_KEY, self._VERY_LONG_KEY, self._OTHER_KEY):
self.assertNodeState(t, key)
self.assertNodeState(t, self._SHORT_KEY, value=value)
def assertEmptyTrie(self, t):
"""Asserts a trie is empty."""
self.assertEqual(0, len(t), '%r should be empty: %d' % (t, len(t)))
for key in self._SHORT_PREFIXES + self._LONG_PREFIXES + (
self._SHORT_KEY, self._LONG_KEY, self._VERY_LONG_KEY,
self._OTHER_KEY):
self.assertNodeState(t, key)
self.assertRaises(KeyError, t.popitem)
self.assertEqual('Trie()', str(t))
self.assertEqual('Trie()', repr(t))
# pylint: enable=invalid-name
def _do_test_basics(self, trie_factory):
"""Basic trie tests."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
self.assertFullTrie(t)
self.assertEqual(42, t.pop(self._LONG_KEY))
self.assertShortTrie(t)
self.assertEqual(42, t.setdefault(self._SHORT_KEY, 24))
self.assertShortTrie(t)
t[self._SHORT_KEY] = 24
self.assertShortTrie(t, 24)
self.assertEqual(24, t.setdefault(self._LONG_KEY, 24))
self.assertFullTrie(t, 24)
del t[self._LONG_KEY]
self.assertShortTrie(t, 24)
self.assertEqual((self.key_from_key(self._SHORT_KEY), 24), t.popitem())
self.assertEmptyTrie(t)
def _do_test_iterator(self, trie_factory):
"""Trie iterator tests."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
self.assertEqual([42, 42], t.values())
self.assertEqual([42, 42], list(t.itervalues()))
short_key = self.key_from_key(self._SHORT_KEY)
long_key = self.key_from_key(self._LONG_KEY)
expected_items = [(short_key, 42), (long_key, 42)]
self.assertEqual(expected_items, sorted(t.items()))
self.assertEqual(expected_items, sorted(t.iteritems()))
self.assertEqual([short_key, long_key], sorted(t))
self.assertEqual([short_key, long_key], sorted(t.keys()))
self.assertEqual([short_key, long_key], sorted(t.iterkeys()))
def _do_test_subtrie_iterator(self, trie_factory):
"""Subtrie iterator tests."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
long_key = self.key_from_key(self._LONG_KEY)
prefix = self._LONG_PREFIXES[0]
self.assertEqual([42, 42], t.values(prefix=self._SHORT_KEY))
self.assertEqual([42, 42], list(t.itervalues(prefix=self._SHORT_KEY)))
self.assertEqual([42], t.values(prefix=prefix))
self.assertEqual([42], list(t.itervalues(prefix=prefix)))
expected_items = [(long_key, 42)]
self.assertEqual(expected_items, sorted(t.items(prefix=prefix)))
self.assertEqual(expected_items, sorted(t.iteritems(prefix=prefix)))
self.assertEqual([long_key], sorted(t.keys(prefix=prefix)))
self.assertEqual([long_key], sorted(t.iterkeys(prefix=prefix)))
def _do_test_shallow_iterator(self, trie_factory):
"""Shallow iterator test."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
self.assertEqual([42], t.values(shallow=True))
self.assertEqual([42], list(t.itervalues(shallow=True)))
short_key = self.key_from_key(self._SHORT_KEY)
expected_items = [(short_key, 42)]
self.assertEqual(expected_items, sorted(t.items(shallow=True)))
self.assertEqual(expected_items, sorted(t.iteritems(shallow=True)))
self.assertEqual([short_key], sorted(t.keys(shallow=True)))
self.assertEqual([short_key], sorted(t.iterkeys(shallow=True)))
def _do_test_splice_operations(self, trie_factory):
"""Splice trie operations tests."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
self.assertEqual([42, 42], list(t[self._SHORT_KEY:]))
self.assertEqual([42], list(t[self._LONG_PREFIXES[0]:]))
t[self._SHORT_KEY:] = 24
self.assertShortTrie(t, 24)
self.assertEqual([24], list(t[self._SHORT_KEY:]))
self.assertRaises(KeyError, lambda: list(t[self._LONG_PREFIXES[0]:]))
t[self._LONG_KEY:] = 24
self.assertFullTrie(t, 24)
del t[self._SHORT_KEY:]
self.assertEmptyTrie(t)
def _do_test_find_prefix(self, trie_factory):
"""Prefix finding methods tests."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
short_pair = (self.key_from_key(self._SHORT_KEY), 42)
long_pair = (self.key_from_key(self._LONG_KEY), 42)
none_pair = (None, None)
def assert_pair(expected, got):
self.assertEqual(expected, got)
if expected[0]:
self.assertTrue(got)
else:
self.assertFalse(got)
assert_pair(short_pair, t.shortest_prefix(self._VERY_LONG_KEY))
assert_pair(short_pair, t.shortest_prefix(self._LONG_KEY))
assert_pair(short_pair, t.shortest_prefix(self._VERY_LONG_KEY))
assert_pair(short_pair, t.shortest_prefix(self._LONG_PREFIXES[-1]))
assert_pair(short_pair, t.shortest_prefix(self._SHORT_KEY))
assert_pair(none_pair, t.shortest_prefix(self._SHORT_PREFIXES[-1]))
assert_pair(long_pair, t.longest_prefix(self._VERY_LONG_KEY))
assert_pair(long_pair, t.longest_prefix(self._LONG_KEY))
assert_pair(long_pair, t.longest_prefix(self._VERY_LONG_KEY))
assert_pair(short_pair, t.shortest_prefix(self._LONG_PREFIXES[-1]))
assert_pair(short_pair, t.longest_prefix(self._SHORT_KEY))
assert_pair(none_pair, t.shortest_prefix(self._SHORT_PREFIXES[-1]))
self.assertEqual([], list(t.prefixes(self._SHORT_PREFIXES[-1])))
self.assertEqual([short_pair], list(t.prefixes(self._SHORT_KEY)))
self.assertEqual([short_pair],
list(t.prefixes(self._LONG_PREFIXES[-1])))
self.assertEqual([short_pair, long_pair],
list(t.prefixes(self._LONG_KEY)))
self.assertEqual([short_pair, long_pair],
list(t.prefixes(self._VERY_LONG_KEY)))
def _do_test_pickle(self, trie_factory):
"""https://github.com/google/pygtrie/issues/7"""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY, self._VERY_LONG_KEY,
self._OTHER_KEY), 42)
t = trie_factory(self._TRIE_CLS, d)
pickled = pickle.dumps(t)
u = pickle.loads(pickled)
self.assertEqual(t, u)
def test_prefix_set(self):
"""PrefixSet test."""
ps = pygtrie.PrefixSet(factory=self._TRIE_CLS)
short_key = self.key_from_key(self._SHORT_KEY)
long_key = self.key_from_key(self._LONG_KEY)
very_long_key = self.key_from_key(self._VERY_LONG_KEY)
other_key = self.key_from_key(self._OTHER_KEY)
for key in (self._LONG_KEY, self._VERY_LONG_KEY):
ps.add(key)
self.assertEqual(1, len(ps))
self.assertEqual([long_key], list(ps.iter()))
self.assertEqual([long_key], list(iter(ps)))
self.assertEqual([long_key], list(ps.iter(self._SHORT_KEY)))
self.assertEqual([long_key], list(ps.iter(self._LONG_KEY)))
self.assertEqual([very_long_key],
list(ps.iter(self._VERY_LONG_KEY)))
self.assertEqual([], list(ps.iter(self._OTHER_KEY)))
ps.add(self._SHORT_KEY)
self.assertEqual(1, len(ps))
self.assertEqual([short_key], list(ps.iter()))
self.assertEqual([short_key], list(iter(ps)))
self.assertEqual([short_key], list(ps.iter(self._SHORT_KEY)))
self.assertEqual([long_key], list(ps.iter(self._LONG_KEY)))
self.assertEqual([], list(ps.iter(self._OTHER_KEY)))
ps.add(self._OTHER_KEY)
self.assertEqual(2, len(ps))
self.assertEqual(sorted((short_key, other_key)),
sorted(ps.iter()))
self.assertEqual([short_key], list(ps.iter(self._SHORT_KEY)))
self.assertEqual([long_key], list(ps.iter(self._LONG_KEY)))
self.assertEqual([other_key], list(ps.iter(self._OTHER_KEY)))
def test_equality(self):
"""Tests equality comparison."""
d = dict.fromkeys((self._SHORT_KEY, self._LONG_KEY), 42)
# pylint: disable=redefined-outer-name
tries = [factory(self._TRIE_CLS, d) for _, factory in _TRIE_FACTORIES]
for i in range(1, len(tries)):
self.assertEqual(tries[i-1], tries[i],
'%r (factory: %s) should equal %r (factory: %s)' %
(tries[i-1], _TRIE_FACTORIES[i-1][0],
tries[i], _TRIE_FACTORIES[i][0]))
for i in range(1, len(tries)):
tries[i-1][self._OTHER_KEY] = 42
self.assertNotEqual(
tries[i-1], tries[i],
'%r (factory: %s) should not be equal %r (factory: %s)' %
(tries[i-1], _TRIE_FACTORIES[i-1][0],
tries[i], _TRIE_FACTORIES[i][0]))
def _construct_trie_test_cases():
def make_test_method(method, factory):
return lambda self: method(self, trie_factory=factory)
for name in list(TrieTestCase.__dict__.keys()):
if not name.startswith('_do_test_'):
continue
orig = getattr(TrieTestCase, name)
for factory_name, factory in _TRIE_FACTORIES:
method = make_test_method(orig, factory)
method.__doc__ = '%s using %s trie factory.' % (
orig.__doc__[:-2], factory_name)
setattr(TrieTestCase, '%s_%s' % (name[4:], factory_name), method)
_construct_trie_test_cases()
class CharTrieTestCase(TrieTestCase):
_TRIE_CLS = pygtrie.CharTrie
@classmethod
def key_from_path(cls, path):
return ''.join(path)
class StringTrieTestCase(TrieTestCase):
_TRIE_CLS = pygtrie.StringTrie
_SHORT_KEY = '/home/foo'
_LONG_KEY = _SHORT_KEY + '/bar/baz'
_VERY_LONG_KEY = _LONG_KEY + '/qux'
_OTHER_KEY = '/hom'
_SHORT_PREFIXES = ('', '/home')
_LONG_PREFIXES = ('/home/foo/bar',)
@classmethod
def path_from_key(cls, key):
return key.split('/')
@classmethod
def key_from_path(cls, path):
return '/'.join(path)
class SortTest(unittest.TestCase):
def test_enable_sorting(self):
keys = sorted(chr(x) for x in range(32, 128) if x != ord('/'))
t = pygtrie.StringTrie.fromkeys(keys)
# Unless dict's hash function is weird, trie's keys should not be
# returned in order.
self.assertNotEqual(keys, t.keys())
self.assertEqual(keys, sorted(t.keys()))
t.enable_sorting()
self.assertEqual(keys, t.keys())
t.enable_sorting(False)
self.assertNotEqual(keys, t.keys())
class TraverseTest(unittest.TestCase):
_SENTINEL = object()
_TestNode = collections.namedtuple('TestNode', 'key children value')
@classmethod
def _make_test_node(cls, path_conv, path, children, value=_SENTINEL):
return cls._TestNode(path_conv(path), sorted(children), value)
def assertNode(self, node, key, children=0, value=_SENTINEL): # pylint: disable=invalid-name
self.assertTrue(node)
self.assertEqual(key, node.key)
self.assertEqual(children, len(node.children))
self.assertEqual(value, node.value)
return node
def test_traverse_empty_tree(self):
t = pygtrie.CharTrie()
r = t.traverse(self._make_test_node)
self.assertNode(r, '', 0)
def test_traverse_singleton_tree(self):
t = pygtrie.CharTrie()
t.update({'a': 10})
r = t.traverse(self._make_test_node)
self.assertNode(r, '', 1)
self.assertNode(r.children[0], 'a', 0, 10)
def test_traverse(self):
t = pygtrie.CharTrie()
t.update({'aaa': 1, 'aab': 2, 'aac': 3, 'bb': 4})
r = t.traverse(self._make_test_node)
# Result:
# <>
# a
# aa
# aaa:1
# aab:2
# aac:3
# b
# bb:4
self.assertNode(r, '', 2)
# For some reason pylint thinks a_node et al. are strings.
# pylint: disable=no-member
a_node = self.assertNode(r.children[0], 'a', 1)
aa_node = self.assertNode(a_node.children[0], 'aa', 3)
self.assertNode(aa_node.children[0], 'aaa', 0, 1)
self.assertNode(aa_node.children[2], 'aac', 0, 3)
b_node = self.assertNode(r.children[1], 'b', 1)
self.assertNode(b_node.children[0], 'bb', 0, 4)
def test_traverse_compressing(self):
t = pygtrie.CharTrie()
t.update({'aaa': 1, 'aab': 2, 'aac': 3, 'bb': 4})
def make(path_conv, path, children, value=self._SENTINEL):
children = sorted(children)
if value is self._SENTINEL and len(children) == 1:
# There is only one prefix.
return children[0]
else:
return self._TestNode(path_conv(path), children, value)
r = t.traverse(make)
# Result:
# <>
# aa
# aaa:1
# aab:2
# aac:3
# bb:4
self.assertNode(r, '', 2)
# For some reason pylint thinks a_node et al. are strings.
# pylint: disable=no-member
aa_node = self.assertNode(r.children[0], 'aa', 3)
self.assertNode(aa_node.children[0], 'aaa', 0, 1)
self.assertNode(aa_node.children[1], 'aab', 0, 2)
self.assertNode(aa_node.children[2], 'aac', 0, 3)
self.assertNode(r.children[1], 'bb', 0, 4)
def test_traverse_ignore_subtrie(self):
t = pygtrie.CharTrie()
t.update({'aaa': 1, 'aab': 2, 'aac': 3, 'b': 4})
cnt = [0]
def make(path_conv, path, children, value=self._SENTINEL):
cnt[0] += 1
if path and path[0] == 'a':
return None
else:
children = [ch for ch in children if ch is not None]
return self._TestNode(path_conv(path), children, value)
r = t.traverse(make)
# Result:
# <>
# b:4
self.assertNode(r, '', 1)
self.assertNode(r.children[0], 'b', 0, 4)
self.assertEqual(3, cnt[0])
class RecursionTest(unittest.TestCase):
"""Test for deep recursion.
https://github.com/google/pygtrie/issues/8
"""
@staticmethod
def create_trie():
tostring = (getattr(array.array, 'tobytes', None) or # Python 3
getattr(array.array, 'tostring')) # Python 3
trie = pygtrie.Trie()
for x in range(100):
y = tostring(array.array('h', range(x, 1000)))
trie.update([(y, x)])
return trie
def test_iterator(self):
for _ in self.create_trie().iteritems():
pass
def test_copy(self):
self.create_trie().copy()
if __name__ == '__main__':
unittest.main()
|