From d1b6714bb3216a66aef0538a59141ce3470528b1 Mon Sep 17 00:00:00 2001 From: Jeff Epler Date: Sun, 15 May 2016 12:24:13 -0500 Subject: [PATCH] manpage: document -L --- ana.1 | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/ana.1 b/ana.1 index e4b6dd8..ac01f27 100644 --- a/ana.1 +++ b/ana.1 @@ -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.