def test_match(self):
t = SuffixTree()
t['what'] = 1
t['where'] = 1
t['when'] = 1
t['widget'] = 1
t['wizard'] = 1
t['wow'] = 1
t['wowo'] = 1
self.assertEquals(dict(t.find('e')), {'where':1,'when':1,'widget':1})
self.assertEquals(dict(t.find('h')), {'where':1,'when':1,'what':1})
self.assertEquals(dict(t.find('a')), {'wizard':1,'what':1})
self.assertEquals(dict(t.find('ow')), {'wow':1,'wowo':1})
def test_find_simple(self):
s = set()
l1 = list()
t = SuffixTree()
for x in xrange(100):
k = base64.b64encode(os.urandom(x%10 + 1)).rstrip('=')
if k in s: continue
l1.append(k)
t[k] = x
s.add(k)
l1.sort()
for x in l1:
assert bool(tuple(t.find(x)))
