|
|
1.1 root 1: .nr _0 \n(c.
2: .\" @(#)float.me 2.4 (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 (z \" *** begin floating keep
16: .if \n@>4 .tm >> (z, .z=\n(.z
17: .@D 4 \\$1 \\$2
18: .@(
19: .nr ?T 0
20: ..
21: .de )z \" *** end floating keep
22: .if \n@>4 .tm >> )z, .z=\n(.z
23: .sp \\n(zsu
24: .@)
25: .if \n@>4 .tm -- )z << @), .z=\n(.z
26: .rr _0
27: .if !\\n(?b \
28: . nr dn +(\\n(ppu*\\n($ru)/2u+\\n(zsu
29: .nr dl -\n(.H \" fudge factor necessary to make it work
30: .ie ((\\n(dn+\n(.V)>=\\n(.t):(\\n(?a):((\\n(dl>\\n($l)&(\\n($c>1)) \
31: \{\
32: . nr ?a 1
33: . if (\\n(dl>\\n($l)&(\\n($m>1) \
34: . nr ?w 1 \" mark wider than one column (top)
35: . ds |x |t
36: .\}
37: .el \
38: \{\
39: . nr ?b 1
40: . if (\\n(dl>\\n($l)&(\\n($m>1) \
41: . nr ?W 1 \" mark wider than one column (bottom)
42: . nr _b +\\n(dnu
43: . ch @f -\\n(_bu
44: . ds |x |b
45: .\}
46: .da \\*(|x \" copy to save macro
47: .nf
48: .ls 1
49: .nr ?k 1
50: .if \n@>4 .tm -- )z >> \\*(|x
51: \!.if \\\\n(nl>(\\\\n(tm+2v) .ne \\n(dnu-\\n(zsu
52: .|k\" \" and the body
53: .ec
54: .if \n@>4 .tm -- )z << \\*(|x, .z=\\n(.z
55: .nr ?k 0
56: .rm |k\" \" remove the temp macro
57: .da
58: .in 0
59: .ls 1
60: .xl \\n($lu
61: .ev
62: .if \n@>4 .tm << )z, .z=\\n(.z
63: ..
64: .de @k \" --- output floating keep
65: .if \n@>4 .tm >> @k, $1=\\$1, .z=\\n(.z
66: .ev 1
67: .nf
68: .ls 1
69: .in 0
70: .sp \\n(zsu
71: .\\$1
72: .ec
73: .br
74: .rm \\$1
75: .ev
76: .nr ?T 0
77: ..
78: .nr c. \n(_0
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.