|
|
1.1 root 1: .nr _0 \n(c.
2: .\" @(#)index.me 2.10 (Berkeley) 5/21/88
3: .\"
4: .\" Copyright (c) 1988 Regents of the University of California.
5: .\" All rights reserved.
6: .\"
7: .\" Redistribution and use in source and binary forms are permitted
8: .\" provided that this notice is preserved and that due credit is given
9: .\" to the University of California at Berkeley. The name of the University
10: .\" may not be used to endorse or promote products derived from this
11: .\" software without specific prior written permission. This software
12: .\" is provided ``as is'' without express or implied warranty.
13: .\" %beginstrip%
14: .\"
15: .de (x \" *** begin index entry
16: .if \n@>4 .tm >> (x, .z=\\n(.z
17: .ds |X x
18: .if \\n(.$>0 \
19: . ds |X \\$1
20: .\" please note these cases MUST be in this order
21: .ie !"\\n(.z"" \
22: \{\
23: . ev 2 \" if in a diversion, save & process later
24: \!.(x \\*(|X
25: .rm |X
26: .\}
27: .el \
28: \{\
29: . am %\\*(|X )x
30: . sp \\n(xsu
31: . ti -\\n(piu
32: .\}
33: ..
34: .de )x \" *** end index entry
35: .if \n@>4 .tm >> )x, .z=\\n(.z
36: .ie "\\n(.z"" \
37: \{\
38: . ds |x \\n%
39: . if \\n(.$>0 \
40: . ds |x \\$1
41: . if "\\*(|x"_" \
42: . ig ..
43: . am %\\*(|X ..
44: . if \w"\\$2">(\\n(.l-\\n(.i-\\n(.k) \
45: . ti +\\n(xuu
46: \\\\a\\\\t\\$2\\*(|x
47: ...
48: . rm |x
49: . rm |X
50: .\}
51: .el \
52: \{\
53: \!.)x \\$1 \\$2
54: . br \" if in a diversion, save & process later
55: . ev
56: .\}
57: ..
58: .de xp \" *** print the index
59: .br
60: .@C 2
61: .ls 1
62: .vs \\n(.su*\\n($Ru
63: .fi
64: .in +\\n(piu
65: .ds |X x
66: .if \\n(.$>0 \
67: . ds |X \\$1
68: .xl -(\\n(xuu+\w'...'u)
69: .di |x
70: .%\\*(|X
71: .br
72: .di
73: .rm %\\*(|X
74: .xl \\n($lu
75: .rm |X
76: .ev
77: .nf
78: .in 0
79: .ta \\n(.lu-\\n(xuuR \\n(.luR
80: .|x
81: .fi
82: .in
83: .rm |x
84: ..
85: .if \n(xu<=0 \
86: . nr xu 0.5i \" index undent
87: .nr c. \n(_0
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.