manpage: document -L

This commit is contained in:
Jeff Epler 2016-05-15 12:24:13 -05:00
parent 026662501a
commit d1b6714bb3

4
ana.1
View file

@ -13,6 +13,7 @@ makes it useful to invoke from long-lived programs.
.B ana \fR[\fB-d \fItext-dictionary\fR|\fB-D \fIbinary-dictionary\fR]
[\fB-l \fIlen1,...\fR] [\fB-m \fIminlen\fR]
[\fB-M \fImaxlen\fR] [\fB-a\fR] [\fB-c\fR]
[\fB-L \fImatchlimit\fR]
\fIterms...\fR \fR[-- \fIrequired-terms...\fR]
.SS Make a binary dictionary from a text dictionary
.HP
@ -51,6 +52,9 @@ phrases are printed. If this mode is on, all words that can be spelled from
the input terms minus the required terms (and which match the first length
restriction, if specified) are printed.
.TP
-L \fImatchlimit
Limit number of anagrams or candidates printed to \fBmatchlimit\fR.
.TP
terms...
Alphabetic characters from these terms are added to the pool of letters to be
anagrammed.