lengthwill cache the possible word lengths. This is useful when new lengths will not be added to the dictionary while the program is running.
wordwill cache the words in the dictionary, as they are read in by length.
patternwill cache the results of a pattern match on the dictionary words.
trigramwill cache the results of a valid trigram determination. Enabling the caches will consume more memory in exchange for faster dictionary lookups. Caching will not provide any benefit for programs that make a only a single pass through the dictionary.
Dictionary::availableLengths ?minimum? ?maximum?
maximumlengths are specified then the return values are guaranteed to lie within the min/max limits. This procedure is use in conjunction with
Dictionary::lookupByLengthto iterate through all words in the dictionary. If the
lengthcache is enabled then this procedure will only search the dictionary files the first time it is called.
Dictionary::lookupByLength length ?pattern?
patterncan be used to limit the If the
wordcache is enabled then this procedure will load the words from the appropriate dictionary file only once. If the
patterncache is enabled then the result will be stored in the
Dictionary::clearCache cache1 ?cache2 ...?
wordis in the dictionary. Returns 1 if the word is in the dictionary, 0 if not.
valis a valid number. Valid numbers contain only the digits 0-9.
wordcache is enabled then the word is also added to the cache.
trigramcan be formed from words in the dictionary. If two or more words can not be joined to form the trigram then this procedure returns 0. Otherwise it returns 1. If the
trigramcache is enabled then the result is stored in the cache. Any necessary word and pattern lookups will also be cached if the
patterncaches are enabled.
Dictionary::isIllegalTrigramon all 3-character substrings composed of only the letters from a to z.
string. Spaces in
stringare treated as wildcard characters. For example, the string
a. And the string
"i qr"would match
wordtreescoring table of the