Research V7 development
[unix-history] / usr / src / cmd / tbl / ti.c
CommitLineData
67305323
ML
1 /* ti.c: classify line intersections */
2# include "t..c"
3/* determine local environment for intersections */
4interv(i,c)
5{
6int ku, kl;
7if (c>=ncol || c == 0)
8 {
9 if (dboxflg)
10 {
11 if (i==0) return(BOT);
12 if (i>=nlin) return(TOP);
13 return(THRU);
14 }
15 if (c>=ncol)
16 return(0);
17 }
18ku = i>0 ? lefdata(i-1,c) : 0;
19if (i+1 >= nlin)
20 kl=0;
21else
22kl = lefdata(allh(i) ? i+1 : i, c);
23if (ku==2 && kl==2) return(THRU);
24if (ku ==2) return(TOP);
25if (kl==BOT) return(2);
26return(0);
27}
28interh(i,c)
29{
30int kl, kr;
31if (fullbot[i]== '=' || (dboxflg && (i==0 || i>= nlin-1)))
32 {
33 if (c==ncol)
34 return(LEFT);
35 if (c==0)
36 return(RIGHT);
37 return(THRU);
38 }
39if (i>=nlin) return(0);
40kl = c>0 ? thish (i,c-1) : 0;
41if (kl<=1 && i>0 && allh(up1(i)))
42 kl = c>0 ? thish(up1(i),c-1) : 0;
43kr = thish(i,c);
44if (kr<=1 && i>0 && allh(up1(i)))
45 kr = c>0 ? thish(up1(i), c) : 0;
46if (kl== '=' && kr == '=') return(THRU);
47if (kl== '=') return(LEFT);
48if (kr== '=') return(RIGHT);
49return(0);
50}
51up1(i)
52{
53i--;
54while (instead[i] && i>0) i--;
55return(i);
56}