def test_append_word_to_tree_single():
phrase_dict, phrase_len = utils.phrase_to_dict("apple of Eden")
root = LetterBranch(None, False, None, phrase_dict, {})
LetterBranch.append_word_to_letter_tree(root, "pale\n", phrase_dict)
assert root.children['p'] != None
assert root.children['p'].children['a'] != None
assert root.children['p'].children['a'].children['l'] != None
assert root.children['p'].children['a'].children['l'].children['e'] != None
def test_search_tree():
phrase = "appleandlamas"
HashProp.set_hash_obj(HashProp("plain", "data/sample-to-find-3.txt"))
phrase_dict, phrase_len = utils.phrase_to_dict(phrase)
letter_tree, words = LetterBranch.parse_words(phrase_dict, "data/sample")
LetterBranch.set_letter_tree(letter_tree)
word_tree, word_tree_children = WordBranch.get_word_tree_root(
phrase_len, phrase_dict, words)
# Check I got the 'apple' word_branch.
word = word_tree_children[2]
assert str(word.letter_branch) == 'apple'
def test_append_word_to_tree_multiple():
phrase_dict, phrase_len = utils.phrase_to_dict("apple of Edenmot kaes")
root = LetterBranch(None, False, None, phrase_dict, {})
remain_dict = phrase_dict
ret = LetterBranch.append_word_to_letter_tree(root, "pale\n", remain_dict)
assert ret != None # Check that word was added
ret = LetterBranch.append_word_to_letter_tree(root, "pakes\n", remain_dict)
assert ret != None
ret = LetterBranch.append_word_to_letter_tree(root, "tom\n", remain_dict)
assert ret != None
ret = LetterBranch.append_word_to_letter_tree(root, "applew",
remain_dict) # Invalid word
assert ret == None
# Check tree structure
assert root.children['p'] != None
assert root.children['p'].children['a'] != None
assert root.children['p'].children['a'].children['l'] != None
assert root.children['p'].children['a'].children['l'].children['e'] != None
assert root.children['p'].children['a'].children['k'] != None
assert root.children['p'].children['a'].children['k'].children['e'] != None
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'] != None
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'].is_word == True
assert root.children['t'] != None
assert root.children['t'].children['o'] != None
assert root.children['t'].children['o'].children['m'] != None
# Check is_word
assert root.children['p'].children['a'].children['l'].is_word == False
assert root.children['p'].children['a'].children['l'].children[
'e'].is_word == True
# Check local remain_dict
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'].remain_dict['a'] == 1
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'].remain_dict['p'] == 1
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'].remain_dict['k'] == 0
assert root.children['p'].children['a'].children['k'].children[
'e'].children['s'].remain_dict['E'] == 1
def test_complex_branching_3():
HashProp.set_hash_obj(HashProp("plain", "data/sample2-to-find-3.txt"))
phrase = "andlamasgroves"
phrase_dict, phrase_len = utils.phrase_to_dict(phrase)
print(phrase_dict)
print(phrase_len)
letter_tree, words = LetterBranch.parse_words(phrase_dict, "data/sample2")
LetterBranch.set_letter_tree(letter_tree)
word_tree, word_tree_children = WordBranch.get_word_tree_root(
phrase_len, phrase_dict, words)
construct_word_tree_start(word_tree, word_tree_children)
anagrams = search_solved_anagrams_start(word_tree, word_tree_children)
for anagram in anagrams:
print(anagram)
assert len(anagrams) == 7
def test_anagram_solutions_4():
HashProp.set_hash_obj(HashProp("plain", "data/sample-to-find-4.txt"))
phrase = "andapplegroveslamas"
phrase_dict, phrase_len = utils.phrase_to_dict(phrase)
print(phrase_dict)
print(phrase_len)
letter_tree, words = LetterBranch.parse_words(phrase_dict, "data/sample")
LetterBranch.set_letter_tree(letter_tree)
word_tree, word_tree_children = WordBranch.get_word_tree_root(
phrase_len, phrase_dict, words)
construct_word_tree_start(word_tree, word_tree_children)
''' Should produce 24 solutions:
'''
anagrams = search_solved_anagrams_start(word_tree, word_tree_children)
for anagram in anagrams:
print(anagram)
assert len(anagrams) == 24
def test_parse_word():
phrase_dict, phrase_len = utils.phrase_to_dict("poultry outwits ants")
tree, words = LetterBranch.parse_words(phrase_dict, "data/wordlist")
# Exclude invalid words.
assert ('z' in tree.children) == False
tree.children['t'].children['a'].children['i'].children[
'l'].is_word == True
for word in words:
assert word.is_word == True
def construct_word_tree(word_branch, phrase_dict):
'''Recursive function to construct WordBranch tree.
Args
word_branch (WordBranch) The root of WordBranch tree.
phrase_dict ({char => int}) The remaining letters of the phrase from this point in the tree.
'''
copy_dict = dict(phrase_dict)
if add_hash(copy_dict, word_branch):
letter_tree = LetterBranch.get_letter_tree()
search_letter_tree(word_branch, letter_tree, copy_dict,
word_branch.remain_char)
def test_returned_word():
phrase_dict, phrase_len = utils.phrase_to_dict("apple of Edenmot kaes")
root = LetterBranch(None, False, None, phrase_dict, {})
remain_dict = phrase_dict
ret = LetterBranch.append_word_to_letter_tree(root, "pale\n", remain_dict)
assert ret != None # Check that word was added
assert ret.is_word == True
assert ret.letter == 'e'
ret = LetterBranch.append_word_to_letter_tree(root, "pakes", remain_dict)
assert ret != None
assert ret.is_word == True
assert ret.letter == 's'
ret = LetterBranch.append_word_to_letter_tree(root, "tom\n", remain_dict)
assert ret != None
ret = LetterBranch.append_word_to_letter_tree(root, "applew",
remain_dict) # Invalid word
assert ret == None
'''Run'''
if __name__ == "__main__":
args = sys.argv
if len(args) == 5:
start_time = timeit.default_timer() # Time
phrase = args[1]
wordlist_filename = args[2]
hash_algo = args[3]
hash_filename = args[4]
phrase_dict, phrase_len = utils.phrase_to_dict(phrase)
hash_obj = HashProp(hash_algo, hash_filename)
HashProp.set_hash_obj(hash_obj)
letter_tree, words = LetterBranch.parse_words(phrase_dict,
wordlist_filename)
LetterBranch.set_letter_tree(letter_tree)
word_tree, word_tree_children = WordBranch.get_word_tree_root(
phrase_len, phrase_dict, words)
construct_word_tree_start(word_tree, word_tree_children)
anagrams = search_solved_anagrams_start(word_tree, word_tree_children)
elapsed = timeit.default_timer() - start_time # Time
print('Time elapsed --> ', elapsed, 'seconds')
else:
print(
'Invalid arguments, expecting: "phrase" word_file "hash algo" hashes_file'
)