My site is worth
$3.80 Million
Your website value?
My site is worth
$3.80 Million
Your website value?
| CONTENTS: |
<< Back |  Download astham.zip |
|
[62 kB] - ======================================================================== Astham ======================================================================== This application is used to make anagrams. Enter a string of your choice with "File->New Input". Rearrange letters to your hearts content. Use "Edit->Permutation" for a random reordering of the letters. Letter can be excluded from reordering by right-clicking. If you have access to a dictionary (a text file with words) you can use that file for generation ("Edit->Generation") of anagrams. Exclude letters from generation by right-clicking them. Open the dictionary with "File->Open Dictionary", wait a while, and save it with "File->Save Compiled Dictionary". You can use the name of the dictionary as a command line argument to the application ("astham.exe mydict.fzi"). There is an obscure check box in the Save As dialog. If you check that box you will get much smaller binaries, but much longer save times. The speed of the generations is marginally affected. The "syntax" of the text files is simple. The app treats everything but separators, newlines and number as words. Comments are denoted by '#'. Note that the combinations presented on the screen do not represent all possible combinations. If you find a word that you like, right-click the letters in that word to lock it, and continue to make generations of the unlocked letters. Source code compiled with MSVC 6.0 SP6 (will crash on realloc() unless you use SP6). Send an e-mail (see below) if you are interested in the source. History ------- 2005-01-12 1.0.001 Released 2005-01-16 1.0.002 Added dictionaries 2005-01-31 1.1.001 New database format, bug fixes, Clipboard support 2005-02-15 1.1.003 Cosmetics. Some fixes for non-Unicode platforms Todo & Issues ------------- The program works best for short to medium input strings. It may crash if the input data is long, or if there are at large number of possible words that can be constructed from the input. Comments & Contributions ------------------------ astham at esaro dot se | ||
| << Back | Download astham.zip | |