table of contents
- unstable 0.9.18-13
NBIBFIND(1) | General Commands Manual | NBIBFIND(1) |
NAME¶
nbibfind - find bibliography entries for BibTeX or NbibTeX
SYNOPSIS¶
nbibfind [-terse|-full|-bib] query [bibname...]
DESCRIPTION¶
nbibfind searches for BibTeX entries using the same query algorithm as NbibTeX. If the optional list of bibnames is given, it searches only those bibliographies; otherwise, it searches all bibliographies on the user's BIBINPUTS (or on the standard system path). The language of query is that of nbibtex(1).
OPTIONS¶
EXAMPLES¶
nbibfind author=knuth:series=art-programming:volume=2
nbibfind knuth:seminumerical personal.bib
nbibfind harper-moggi:phase
nbibfind :essence-algol
nbibfind :essence-functional
QUERY LANGUAGE¶
The query language is that of nbibtex(1).
A query consists of a sequence of one or more constraints separated by colons. A constraint may be empty.
A nonempty constraint is of the form key=words, where key is the name of a field in the NbibTeX entry and words is a sequence of one or more words separated by dashes. The contraint is satisfied if every word in words is found in the field named by key. (The key may also be [type], which matches against the type of the entry, or *, which looks for words in any field.)
As a convenience, keys may be defaulted in up to three constraints. In the first constraint, the default key is author. In the second constraint, the default key is year if words is all digits, and is title otherwise. In the third constraint, the default key is year if words is all digits, and is [type] otherwise.
To match a word in words, nbibfind uses the Boyer-Moore string-matching algorithm, so longer words are usually faster.
ENVIRONMENT¶
For .bib files, nbibfind uses the BIBINPUTS environment variable if that is set, otherwise the default. For details of the searching, see tex(1) and kpsewhich(1).
SEE ALSO¶
nbibtex(1), latex(1), tex(1),
kpsewhich(1), bibtex(1).
Leslie Lamport, LaTeX - A Document Preparation System, Addison-Wesley,
1985, ISBN 0-201-15790-X.
AUTHOR¶
Norman Ramsey, Harvard University.
4 May 2006 |