Simple anigram finder in Haskell. Aiming to be functional equivalent to anigramer. Broken lets you find the longest 5 words you can type with a partiuclar set of keys.

margarine/
├── broken.hs
├── margarine
├── margarine.hs
└── README.md

0 directories, 4 files

Compiled with GHC not external modules.

By default ghc will build a statically linked binary which weighs in at about 2.2MB, this is how the pre-built binary is made.

$ ghc --make -O2 margarine.hs

To get a smaller dynamically linked one about 25KB use the -dynamic flag.

$ ghc --make -O2 -dynamic margarine.hs

./margarine word_list

Where word_list is the path to a newline seperated list of words.

./margarine /usr/share/dict/american-english
Enter letters: anigramer
margarine

1. Handle not getting any arguments
2. Merge broken into margarine