Интерактивная система просмотра системных руководств (man-ов)
>> gindxbib (1) ( Linux man: Команды и прикладные программы пользовательского уровня )
indxbib - make inverted index for bibliographic databases
[ -vw ]
[ -c file ]
[ -d dir ]
[ -f file ]
[ -h n ]
[ -i string ]
[ -k n ]
[ -l n ]
[ -n n ]
[ -o file ]
[ -t n ]
[ filename... ]
It is possible to have whitespace between a command line option and its
makes an inverted index for the bibliographic databases in
for use with
The index will be named
the index is written to a temporary file which is then renamed to this.
If no filenames are given on the command line because the
option has been used, and no
option is given, the index will be named
Bibliographic databases are divided into records by blank lines.
Within a record, each fields starts with a
character at the beginning of a line.
Fields have a one letter name which follows the
The values set by the
options are stored in the index;
when the index is searched, keys will be discarded and truncated in a
manner appropriate to these options;
the original keys will be used for verifying that any record
found using the index actually contains the keys.
This means that a user of an index need not know whether these
options were used in the creation of the index,
provided that not all the keys to be searched for
would have been discarded during indexing
and that the user supplies at least the part of each key
that would have remained after being truncated during indexing.
The value set by the
option is also stored in the index
and will be used in verifying records found using the index.
Print the version number.
Index whole files.
Each file is a separate record.
Read the list of common words from
as the pathname of the current working directory to store in the index,
instead of the path printed by
will be a symbolic link that points to the directory printed by
Read the files to be indexed from
files will be read from the standard input.
option can be given at most once.
Don't index the contents of fields whose names are in
Use the first prime greater than or equal to
for the size of the hash table.
Larger values of
will usually make searching faster,
but will make the index larger
use more memory.
Use at most
keys per input record.
Discard keys that are shorter than
most common words.