def anagrams (bag, dict):
rv = []
for words_processed in range (0, len (dict)):
entry = dict[words_processed]
key = entry[0]
words = entry[1]
smaller_bag = subtract_bags (bag, key)
if (not smaller_bag):
continue
if (bag_empty (smaller_bag)):
for w in words:
rv.append ([w])
continue
from_smaller_bag = anagrams (smaller_bag,
dict[words_processed:])
if (not len (from_smaller_bag)):
continue
rv.extend (combine (words, from_smaller_bag))
return rv
def anagrams(bag, dict):
rv = []
for words_processed in range(0, len(dict)):
entry = dict[words_processed]
key = entry[0]
words = entry[1]
smaller_bag = subtract_bags(bag, key)
if (not smaller_bag):
continue
if (bag_empty(smaller_bag)):
for w in words:
rv.append([w])
continue
from_smaller_bag = anagrams(smaller_bag, dict[words_processed:])
if (not len(from_smaller_bag)):
continue
rv.extend(combine(words, from_smaller_bag))
return rv
dict_hash_table = dict.snarf_dictionary (options.dict_fn)
the_phrase = bag (args[0])
print >> sys.stderr, "Pruning dictionary. Before:", len (dict_hash_table.keys ()), "bags ...",
# Now convert the hash table to a list, longest entries first. (This
# isn't necessary, but it makes the more interesting anagrams appear
# first.)
# While we're at it, prune the list, too. That _is_ necessary for the
# program to finish before you grow old and die.
the_dict_list = [[k, dict_hash_table[k]]
for k in dict_hash_table.keys ()
if (subtract_bags (the_phrase, k))]
# Note that sorting entries "alphabetically" only makes partial sense,
# since each entry is (at least potentially) more than one word (all
# the words in an entry are anagrams of each other).
def biggest_first_then_alphabetically (a, b):
a = a[1][0]
b = b[1][0]
result = cmp (len (b), len (a))
if (not result):
result = cmp (a, b)
return result
the_dict_list.sort (biggest_first_then_alphabetically)
dict_hash_table = snarf_dictionary(options.dict_fn)
the_phrase = bag(args[0])
print "Pruning dictionary. Before:", len(
dict_hash_table.keys()), "bags ...",
# Now convert the hash table to a list, longest entries first. (This
# isn't necessary, but it makes the more interesting anagrams appear
# first.)
# While we're at it, prune the list, too. That _is_ necessary for the
# program to finish before you grow old and die.
the_dict_list = [[k, dict_hash_table[k]] for k in dict_hash_table.keys()
if (subtract_bags(the_phrase, k))]
the_dict_list.sort(biggest_first_then_alphabetically)
print "Pruned dictionary. After:", len(the_dict_list), "bags."
profile.Profile.bias = 8e-06 # measured on dell optiplex, Ubuntu 8.04 ("Hoary Hedgehog")
result = anagrams(the_phrase, the_dict_list)
for a in result:
sys.stdout.write("(")
for i, w in enumerate(a):
if (i):
sys.stdout.write(" ")
sys.stdout.write(w)
sys.stdout.write(")")
print