Lines Matching defs:i
23 makeline(int i, int c, int lintype)
26 type = thish(i,c);
29 shortl = (table[i][c].col[0]=='\\');
30 if (c>0 && !shortl && thish(i,c-1) == type)return;
32 for(cr=c; cr < ncol && (ctype(i,cr)=='s'||type==thish(i,cr)); cr++);
34 for(cr=c+1; cr<ncol && ctype(i,cr)=='s'; cr++);
35 drawline(i, c, cr-1, lintype, 0, shortl);
39 fullwide(int i, int lintype)
48 while (i>0 && vspand(prev(i),cl,1))
51 if (i>0 && vspand(prev(i),cr,1))
54 drawline(i,cl,(cr<ncol?cr-1:cr),lintype,1,0);
62 drawline(int i, int cl, int cr, int lintype, int noheight, int shortl)
75 nodata = cr-cl>=ncol || noheight || allh(i);
89 switch(interv(i,cl))
100 switch(interv(i,cl))
110 switch(interv(i,cr+1))
119 switch(interv(i,cr+1))
157 int i,c,k,junk, stopp;
159 for(i=0; i<MAXLIN; i++)
160 linestop[i]=0;
161 for(i=0; i<nlin; i++)
164 k = left(i,c,&junk);
173 left(int i, int c, int *lwidp)
180 kind = lefdata(i,c);
182 if (i+1<nlin)
183 if (lefdata(next(i),c)== kind) return(-1);
184 while (i>=0 && lefdata(i,c)==kind)
185 i=prev(li=i);
188 for(lj= i+1; lj<li; lj++)
191 for(i= i+1; i<li; i++)
192 if (fullbot[i])
193 li=i;
198 lefdata(int i, int c)
201 if (i>=nlin) i=nlin-1;
202 if (ctype(i,c) == 's')
204 for(ck=c; ctype(i,ck)=='s'; ck--);
205 if (thish(i,ck)==0)
208 i =stynum[i];
209 i = lefline[i][c];
210 if (i>0) return(i);
218 next(int i)
220 while (i+1 <nlin)
222 i++;
223 if (!fullbot[i] && !instead[i]) break;
225 return(i);
229 prev(int i)
231 while (--i >=0 && (fullbot[i] || instead[i]))
233 return(i);