1*3e12c5d1SDavid du Colombier /* ti.c: classify line intersections */
2*3e12c5d1SDavid du Colombier # include "t.h"
3*3e12c5d1SDavid du Colombier /* determine local environment for intersections */
4*3e12c5d1SDavid du Colombier
5*3e12c5d1SDavid du Colombier int
interv(int i,int c)6*3e12c5d1SDavid du Colombier interv(int i, int c)
7*3e12c5d1SDavid du Colombier {
8*3e12c5d1SDavid du Colombier int ku, kl;
9*3e12c5d1SDavid du Colombier
10*3e12c5d1SDavid du Colombier if (c >= ncol || c == 0) {
11*3e12c5d1SDavid du Colombier if (dboxflg) {
12*3e12c5d1SDavid du Colombier if (i == 0)
13*3e12c5d1SDavid du Colombier return(BOT);
14*3e12c5d1SDavid du Colombier if (i >= nlin)
15*3e12c5d1SDavid du Colombier return(TOP);
16*3e12c5d1SDavid du Colombier return(THRU);
17*3e12c5d1SDavid du Colombier }
18*3e12c5d1SDavid du Colombier if (c >= ncol)
19*3e12c5d1SDavid du Colombier return(0);
20*3e12c5d1SDavid du Colombier }
21*3e12c5d1SDavid du Colombier ku = i > 0 ? lefdata(i - 1, c) : 0;
22*3e12c5d1SDavid du Colombier if (i + 1 >= nlin && allh(i))
23*3e12c5d1SDavid du Colombier kl = 0;
24*3e12c5d1SDavid du Colombier else
25*3e12c5d1SDavid du Colombier kl = lefdata(allh(i) ? i + 1 : i, c);
26*3e12c5d1SDavid du Colombier if (ku == 2 && kl == 2)
27*3e12c5d1SDavid du Colombier return(THRU);
28*3e12c5d1SDavid du Colombier if (ku == 2)
29*3e12c5d1SDavid du Colombier return(TOP);
30*3e12c5d1SDavid du Colombier if (kl == BOT)
31*3e12c5d1SDavid du Colombier return(2);
32*3e12c5d1SDavid du Colombier return(0);
33*3e12c5d1SDavid du Colombier }
34*3e12c5d1SDavid du Colombier
35*3e12c5d1SDavid du Colombier
36*3e12c5d1SDavid du Colombier int
interh(int i,int c)37*3e12c5d1SDavid du Colombier interh(int i, int c)
38*3e12c5d1SDavid du Colombier {
39*3e12c5d1SDavid du Colombier int kl, kr;
40*3e12c5d1SDavid du Colombier
41*3e12c5d1SDavid du Colombier if (fullbot[i] == '=' || (dboxflg && (i == 0 || i >= nlin - 1))) {
42*3e12c5d1SDavid du Colombier if (c == ncol)
43*3e12c5d1SDavid du Colombier return(LEFT);
44*3e12c5d1SDavid du Colombier if (c == 0)
45*3e12c5d1SDavid du Colombier return(RIGHT);
46*3e12c5d1SDavid du Colombier return(THRU);
47*3e12c5d1SDavid du Colombier }
48*3e12c5d1SDavid du Colombier if (i >= nlin)
49*3e12c5d1SDavid du Colombier return(0);
50*3e12c5d1SDavid du Colombier kl = c > 0 ? thish (i, c - 1) : 0;
51*3e12c5d1SDavid du Colombier if (kl <= 1 && i > 0 && allh(up1(i)))
52*3e12c5d1SDavid du Colombier kl = c > 0 ? thish(up1(i), c - 1) : 0;
53*3e12c5d1SDavid du Colombier kr = thish(i, c);
54*3e12c5d1SDavid du Colombier if (kr <= 1 && i > 0 && allh(up1(i)))
55*3e12c5d1SDavid du Colombier kr = c > 0 ? thish(up1(i), c) : 0;
56*3e12c5d1SDavid du Colombier if (kl == '=' && kr == '=')
57*3e12c5d1SDavid du Colombier return(THRU);
58*3e12c5d1SDavid du Colombier if (kl == '=')
59*3e12c5d1SDavid du Colombier return(LEFT);
60*3e12c5d1SDavid du Colombier if (kr == '=')
61*3e12c5d1SDavid du Colombier return(RIGHT);
62*3e12c5d1SDavid du Colombier return(0);
63*3e12c5d1SDavid du Colombier }
64*3e12c5d1SDavid du Colombier
65*3e12c5d1SDavid du Colombier
66*3e12c5d1SDavid du Colombier int
up1(int i)67*3e12c5d1SDavid du Colombier up1(int i)
68*3e12c5d1SDavid du Colombier {
69*3e12c5d1SDavid du Colombier i--;
70*3e12c5d1SDavid du Colombier while (instead[i] && i > 0)
71*3e12c5d1SDavid du Colombier i--;
72*3e12c5d1SDavid du Colombier return(i);
73*3e12c5d1SDavid du Colombier }
74*3e12c5d1SDavid du Colombier
75*3e12c5d1SDavid du Colombier
76