in reply to Simple regex wordlist question
My solution would be to pre-process the dictionary list and make it into a "key = value" list. The key is the sorted order of the value: so "Apache" becomes: "aacehp = Apache". Splitting and sorting the words in your dictionary file is as easy as sort split '', lc $word where $word contains a word in your file.
The problem then becomes as easy as splitting and sorting your input in the same way and checking your pre-processed list for a match: if ($guess eq $try_this){...}.
If the list itself is sorted a binary search would be blindingly fast even on huge dictionaries.
Granted the pre-processing takes some time but it is a one time investment only and can of course be saved on persistent storage for a next time use.
Update: Zaxo beat me to the punch. I blame our new kitten Hobbes which badly needed some petting.
CountZero
A program should be light and agile, its subroutines connected like a string of pearls. The spirit and intent of the program should be retained throughout. There should be neither too little or too much, neither needless loops nor useless variables, neither lack of structure nor overwhelming rigidity." - The Tao of Programming, 4.1 - Geoffrey James
|
|---|