|
|
1.1 root 1: .\" Copyright (c) 1983, 1990 Regents of the University of California.
2: .\" All rights reserved.
3: .\"
4: .\" Redistribution and use in source and binary forms are permitted provided
5: .\" that: (1) source distributions retain this entire copyright notice and
6: .\" comment, and (2) distributions including binaries display the following
7: .\" acknowledgement: ``This product includes software developed by the
8: .\" University of California, Berkeley and its contributors'' in the
9: .\" documentation or other materials provided with the distribution and in
10: .\" all advertising materials mentioning features or use of this software.
11: .\" Neither the name of the University nor the names of its contributors may
12: .\" be used to endorse or promote products derived from this software without
13: .\" specific prior written permission.
14: .\" THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
15: .\" WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
16: .\" MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
17: .\"
18: .\" @(#)sortbib.1 6.2 (Berkeley) 6/24/90
19: .\"
20: .TH SORTBIB 1 "%Q"
21: .UC 5
22: sortbib \- sort bibliographic database
23: .SH SYNOPSIS
24: .B sortbib
25: [
26: .BR \-s KEYS
27: ] database ...
28: .SH DESCRIPTION
29: .I Sortbib
30: sorts files of records containing
31: .I refer
32: key-letters by user-specified keys.
33: Records may be separated by blank lines,
34: or by \&.[ and \&.] delimiters,
35: but the two styles may not be mixed together.
36: This program reads through each
37: .I database
38: and pulls out key fields, which are sorted separately.
39: The sorted key fields contain the file pointer,
40: byte offset, and length of corresponding records.
41: These records are delivered using disk seeks and reads, so
42: .I sortbib
43: may not be used in a pipeline to read standard input.
44: .PP
45: By default,
46: .I sortbib
47: alphabetizes by the first %A and the %D fields,
48: which contain the senior author and date.
49: The
50: .B \-s
51: option is used to specify new
52: .IR \s-1KEYS\s0 .
53: For instance,
54: .BR \-s ATD
55: will sort by author, title, and date,
56: while
57: .BR \-s A+D
58: will sort by all authors, and date.
59: Sort keys past the fourth are not meaningful.
60: No more than 16 databases may be sorted together at one time.
61: Records longer than 4096 characters will be truncated.
62: .PP
63: .I Sortbib
64: sorts on the last word on the %A line,
65: which is assumed to be the author's last name.
66: A word in the final position, such as ``jr.'' or ``ed.'',
67: will be ignored if the name beforehand ends with a comma.
68: Authors with two-word last names or unusual constructions
69: can be sorted correctly by using the
70: .I nroff
71: convention ``\e0'' in place of a blank.
72: A %Q field is considered to be the same as %A,
73: except sorting begins with the first, not the last, word.
74: .I Sortbib
75: sorts on the last word of the %D line, usually the year.
76: It also ignores leading articles (like ``A'' or ``The'')
77: when sorting by titles in the %T or %J fields;
78: it will ignore articles of any modern European language.
79: If a sort-significant field is absent from a record,
80: .I sortbib
81: places that record before other records containing that field.
82: .SH SEE ALSO
83: refer(1), addbib(1), roffbib(1), indxbib(1), lookbib(1)
84: .SH AUTHORS
85: Greg Shenaut, Bill Tuthill
86: .SH BUGS
87: Records with missing author fields
88: should probably be sorted by title.
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.