1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198
|
BIBLOOK(1) BIBLOOK(1)
NAME
biblook - lookup entries in a bibliography file
SYNOPSIS
biblook basename [savefile]
DESCRIPTION
biblook permits rapid lookup in a BibTeX bibliography
database, using a compact binary index file prepared by
bibindex(1).
At the prompt, the user can enter any of the following
commands:
? or h[elp]
Display a brief help message.
f[ind] [not] <field> <words>
Find the entries containing the given words in any
field with a prefix matching the <field> argument.
For example, `a' matches both `author' and
`address', and `au' matches `author' only. If the
<field> argument is `-' (or any string with no let
ters or numbers), match any field.
If `not' appears before the <field>, the sense of
the search is reversed. The symbols `~' and `!'
can be used in place of `not'.
Each word is a contiguous sequence of letters and
digits. Case is ignored; accents should be omit
ted; apostrophes are not required. Single charac
ters and a few common words are also ignored.
There is basic support for pattern matching using
the characters ? and *, which match respectively a
single character and a multi-character string,
including the null string. Thus, `algorithm??'
matches `algorithmic', `algorithmes', and `Algo
rithmen'; and `*oint*' matches `point', `points',
`pointer', `endpoint', `disjoint', etc. However at
present patterns beginning with ? cannot be used,
as the parser mistakes them for a help request.
and [not] <field> <words>
or [not] <field> <words>
Intersect (resp. union) the results of the given
search with the previous search. Several of these
commands may be combined on a single line. Com
mands are handled in the order in which they
appear; there is no precedence. Unlike other com
mands, and like `not', these must be spelled out
Version 2.9 31 March 1998 1
BIBLOOK(1) BIBLOOK(1)
completely. `&' can be used in place of `and', and
`|' can be used in place of `or'.
d[isplay]
Display the results of the previous search.
s[ave] [<filename>]
Save the results of the previous results into the
specified file. If <filename> is omitted, the pre
vious save file is used. If no save file has ever
been specified, results are saved in the file spec
ified on the command line. If no such file is
specified, `save.bib' is used. If the save file
exists, results are appended to it.
w[hatis] <abbrev>
Display the definition of the abbreviation
<abbrev>.
q[uit]/EOF
Quit.
Several commands can be combined on a single line by sepa
rating them with semicolons. For example, the following
command displays all STOC papers cowritten by Erdo"s with
out `Voronoi diagrams' in the title:
f b stoc* | b symp* theory comp* & au erdos & ~t voronoi diagrams ; d
ENVIRONMENT
BIBLOOKPATH
Search path for BibTeX database files named on the
command line. If BIBLOOKPATH is not set, biblook
defaults to BIBINPUTS. If neither variable is set,
the files are assumed to be in the current direc
tory.
SEE ALSO
bibclean(1), bibindex(1), bibtex(1), latex(1), tex(1)
AUTHORS
Jeff Erickson <jeffe@cs.duke.edu>, Bill Jones
<jones@cs.usask.ca>, and Rafael Laboissiere
<rafael@laboissiere.net> with significant contributions
from Nelson Beebe, Sariel Har-Peled, and Erik Schoen
felder.
The most current version of biblook and bibindex is
archived at the URL
Version 2.9 31 March 1998 2
BIBLOOK(1) BIBLOOK(1)
"http://www.cs.duke.edu/~jeffe/biblook.html".
Version 2.9 31 March 1998 3
|