Home
last modified time | relevance | path

Searched refs:nlin (Results 1 – 25 of 256) sorted by relevance

1234567891011

/dports/devel/plan9port/plan9port-1f098efb7370a0b28306d10681e21883fb1c1507/src/cmd/tbl/
H A Dt5.c11 for (nlin = nslin = 0; gets1(cstore, MAXCHS - (cstore - cspace)); nlin++) { in gettbl()
12 stynum[nlin] = nslin; in gettbl()
21 if (nlin >= MAXLIN) { in gettbl()
25 fullbot[nlin] = 0; in gettbl()
32 instead[nlin] = 0; in gettbl()
33 if (nodata(nlin)) { in gettbl()
41 nlin++; in gettbl()
43 fullbot[nlin] = 0; in gettbl()
74 table[nlin][icol].rcol = maknew(table[nlin][icol].col); in gettbl()
77 table[nlin][icol].rcol = table[nlin][icol].col; in gettbl()
[all …]
H A Dt7.c19 for (i = 0; i < nlin; i++) in runout()
87 for (texlin = horlin = i = 0; i < nlin; i++) { in need()
121 if (fullbot[nlin-1] == 0) { in deftail()
125 drawline(nlin, 0, ncol, dboxflg ? '=' : '-', 1, 0); in deftail()
131 if ((lf = left(nlin - 1, c, &lwid)) >= 0) { in deftail()
135 drawvert(lf, nlin - 1, c, lwid); in deftail()
142 drawvert (0, nlin - 1, ncol, dboxflg ? 2 : 1); in deftail()
H A Dti.c14 if (i >= nlin) in interv()
22 if (i + 1 >= nlin && allh(i)) in interv()
41 if (fullbot[i] == '=' || (dboxflg && (i == 0 || i >= nlin - 1))) { in interh()
48 if (i >= nlin) in interh()
H A Dtu.c167 for (i = 0; i < nlin; i++) in getstop()
191 if (i + 1 < nlin) in left()
215 if (i >= nlin) in lefdata()
216 i = nlin - 1; in lefdata()
240 while (i + 1 < nlin) { in next()
/dports/textproc/heirloom-doctools/heirloom-doctools-160308/tbl/
H A Dt5.c42 for (nlin=nslin=0; ocbase=cbase, gets1(&cbase, &cstore, &linesize); nlin++) in gettbl()
45 stynum[nlin]=nslin; in gettbl()
57 if (nlin>=MAXLIN && !morelines(nlin)) in gettbl()
62 table[nlin] = NULL; in gettbl()
63 fullbot[nlin]=0; in gettbl()
71 if (nodata(nlin)) in gettbl()
74 fullbot[nlin]= ch; in gettbl()
75 nlin++; in gettbl()
78 fullbot[nlin]=0; in gettbl()
89 stynum[nlin] = nslin; in gettbl()
[all …]
H A Dt7.c42 for(i=0; i<nlin; i++) in runout()
110 for(texlin = horlin = i = 0; i < nlin; i++) { in need()
151 drawline(nlin,0,ncol, dboxflg ? '=' : '-',1,0); in deftail()
161 if (nlin>0 && (lf=left(nlin-1,c, &lwid))>=0) in deftail()
166 drawvert(lf, nlin-1, c, lwid); in deftail()
174 drawvert (0, nlin-1, ncol, dboxflg? 2 : 1); in deftail()
H A Dti.c36 if (i>=nlin) return(TOP); in interv()
43 if (i+1 >= nlin) in interv()
56 if (fullbot[i]== '=' || (dboxflg && (i==0 || i>= nlin-1))) in interh()
64 if (i>=nlin) return(0); in interh()
H A Dtu.c294 } else if (i < nlin - 1) { in glibe()
318 bl = i && i >= nlin - 1 ? 0 : in grbe()
332 for(i=0; i<nlin; i++) in getstop()
352 if (i+1<nlin) in left()
370 if (i>=nlin) i=nlin-1; in lefdata()
388 while (i+1 <nlin) in next()
/dports/biology/emboss/EMBOSS-6.6.0/plplot/
H A Dplsdef.c194 spat(PLINT inc[], PLINT del[], PLINT nlin);
285 c_plpat(PLINT nlin, PLINT *inc, PLINT *del) in c_plpat() argument
293 if (nlin < 1 || nlin > 2) { in c_plpat()
297 for (i = 0; i < nlin; i++) { in c_plpat()
303 spat(inc, del, nlin); in c_plpat()
344 spat(PLINT inc[], PLINT del[], PLINT nlin) in spat() argument
348 plsc->nps = nlin; in spat()
349 for (i = 0; i < nlin; i++) { in spat()
/dports/math/plplot-ada/plplot-5.15.0/src/
H A Dplsdef.c193 spat( const PLINT inc[], const PLINT del[], PLINT nlin ); in plP_setsub()
293 c_plpat( PLINT nlin, PLINT_VECTOR inc, PLINT_VECTOR del ) in c_plcalc_world()
302 if ( nlin < 1 || nlin > 2 ) in c_plcalc_world()
307 for ( i = 0; i < nlin; i++ ) in c_plcalc_world()
316 spat( inc, del, nlin ); in c_plcalc_world()
359 spat( const PLINT inc[], const PLINT del[], PLINT nlin )
363 plsc->nps = nlin;
364 for ( i = 0; i < nlin; i++ )
/dports/math/plplot/plplot-5.15.0/src/
H A Dplsdef.c193 spat( const PLINT inc[], const PLINT del[], PLINT nlin );
293 c_plpat( PLINT nlin, PLINT_VECTOR inc, PLINT_VECTOR del ) in c_plpat() argument
302 if ( nlin < 1 || nlin > 2 ) in c_plpat()
307 for ( i = 0; i < nlin; i++ ) in c_plpat()
316 spat( inc, del, nlin ); in c_plpat()
359 spat( const PLINT inc[], const PLINT del[], PLINT nlin ) in spat() argument
363 plsc->nps = nlin; in spat()
364 for ( i = 0; i < nlin; i++ ) in spat()
/dports/science/afni/afni-AFNI_21.3.16/src/
H A Dthd_linecount.c14 int nlin ; in THD_linecount() local
19 nlin = 0 ; in THD_linecount()
21 if( *cpt == '\n' ) nlin++ ; in THD_linecount()
23 if( *(cpt-1) != '\n' ) nlin++ ; in THD_linecount()
25 return nlin ; in THD_linecount()
H A Dto26.c25 int ii , jj , nn , rr , kk , nlin=0 ; in main() local
71 printf(" \"%s\",\n",zout) ; nlin++ ; nn = 0 ; in main()
76 printf(" \"%s\"\n};\n",out) ; nlin++ ; in main()
78 printf("#define NLINE_%s %d\n",nam,nlin) ; in main()
/dports/lang/swi-pl/swipl-8.2.3/src/Tests/xsb/delay_tests/
H A Dresidual1_old4 mdl(f(f(f(f(f(1,2,3,4,5)))))) :- nlin(f(f(f(f(f(1,2,3,4,5)))))).
5 nlin(f(f(f(f(f(1,2,3,4,5))))),f(f(f(f(f(1,2,3,4,5)))))) :- p2, tnot nlin(f(f(f(f(f(1,2,3,4,5))))),f…
6 nlin(f(f(f(f(f(1,2,3,4,5))))),f(f(f(f(f(1,2,3,4,5)))))) :- p2, tnot nlin(f(f(f(f(f(1,2,3,4,5))))),f…
7 nlin(f(f(f(f(f(1,2,3,4,5))))),f(f(f(f(f(1,2,3,4,5)))))) :- p2, tnot nlin(f(f(f(f(f(1,2,3,4,5))))),f…
8 nlin(f(f(f(f(f(1,2,3,4,5)))))) :- nlin(f(f(f(f(f(1,2,3,4,5))))),f(f(f(f(f(1,2,3,4,5)))))).
H A Dresidual1.P29 nlin(_), nlin(_,_), mdl(_).
52 test(C,D) :- C = nlin(_), gcr(C,D).
53 test(C,D) :- C = nlin(_,_), gcr(C,D).
108 :- table nlin/1, nlin/2.
110 nlin(X) :- nlin(X,X).
112 nlin(X,X) :- X = f(f(f(f(f(1,2,3,4,5))))), tnot(nlin(X,X)), p2.
121 mdl(X) :- nlin(X).
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/standardize/
H A DsplitAux.cpp120 int maxindex = -1, nlin = 0, which = 1; in splitAux() local
137 for (int i=0, n = lcoe.size (); n--; i++, nlin++) { in splitAux()
164 which = - nlin - 1; in splitAux()
229 maxindex, auxcoe, which, nargs, nlin); in splitAux()
261 if (nlin > 0) { // there is an element in the linear sum to be drawn in splitAux()
269 int mid = (which >= 0) ? nlin : - which - 1; in splitAux()
271 linind2 = new int [nlin + 1]; in splitAux()
272 lincoe2 = new CouNumber [nlin + 1]; in splitAux()
290 for (j++; j<nlin; j++) printf ("<%g x%d> ", lincoe2 [j-1], linind2 [j-1]); in splitAux()
328 else --nlin; // ...the linear part in splitAux()
[all …]
/dports/math/octave-forge-geometry/geometry-4.0.0/inst/
H A DclipPolyline_clipper.m17 ## @deftypefn {Function File} [@var{olin}, @var{nlin}] = clipPolyline_clipper (@var{inlin}, @var{c…
18 ## @deftypefnx {Function File} [@var{olin}, @var{nlin}] = clipPolyline_clipper (@var{inlin}, @var{c…
44 function [olin, nlin] = clipPolyline_clipper (inpoly, clippoly, method=1)
65 nlin = numel (olin); variable
69 [tmp(1:2:2*nlin, 1)] = deal ({olin.x});
70 [tmp(2:2:2*nlin-1, 1)] = NaN;
75 [tmp(1:2:2*nlin, 1)] = deal ({olin.y});
76 [tmp(2:2:2*nlin-1, 1)] = NaN;
/dports/editors/picpas/PicPas-7940bc3/_libraries/Xpres-1.3.2/
H A DXpresBas.pas93 nlin : LongInt; //Número de líneas del Contexto
201 nlin := 0;
222 If nlin = 0 Then begin
227 Result := (lex.GetY >= nlin) and lex.GetEol;
305 if nlin = 0 then exit; //protección
308 if fFil <= nlin then begin //se puede leer
330 if fFil <= nlin then //se puede leer
390 nlin := curLines.Count; //actualiza número de líneas
405 nlin := curLines.Count; //actualiza número de líneas
415 nlin := curLines.Count; //actualiza número de líneas
[all …]
/dports/editors/picpas/PicPas-7940bc3/txpres/
H A DXpresBas.pas93 nlin : LongInt; //Número de líneas del Contexto
201 nlin := 0;
222 If nlin = 0 Then begin
227 Result := (lex.GetY >= nlin) and lex.GetEol;
305 if nlin = 0 then exit; //protección
308 if fFil <= nlin then begin //se puede leer
330 if fFil <= nlin then //se puede leer
390 nlin := curLines.Count; //actualiza número de líneas
405 nlin := curLines.Count; //actualiza número de líneas
415 nlin := curLines.Count; //actualiza número de líneas
[all …]
/dports/math/csdp/Csdp-releases-6.2.0/matlab/
H A Dwritesol.m50 nlin=K.l;
53 nlin=0;
57 nlin=0;
88 % v(1..nlin) LP variables.
90 base=nlin+1;
156 if (nlin > 0)
157 for i=veclpbase:nlin
184 if (nlin > 0)
185 for i=veclpbase:nlin
H A Dwritesdpa.m192 nlin=K.l;
193 sizelin=nlin;
196 nlin=0;
199 nlin=0;
203 nlin=0;
228 if (nlin>0)
237 fprintf('Number of LP vars: %d \n',nlin);
264 if (nlin > 0)
265 fprintf(fid,'%d ',-nlin);
323 for i=1:nlin
[all …]
/dports/net-im/climm/climm-0.7.1/contrib/
H A Dlogconv.tcl106 if {$nlin != "" && $nlin != 0} {
118 if {$nlin != "" && $nlin != 0} {
126 set nlin [string trim $nlin " +"]
127 if {$nlin != "" && $nlin != 0} {
H A Dlogmod.tcl30 if {[set nlin [string trim $nlin " +"]] == ""} {
31 set nlin 0
34 while {[incr nlin -1] >= 0 && ([set line [gets $fd]] != "" || ![eof $fd])} {
/dports/science/gromacs/gromacs-2021.4/scripts/
H A Dmake_gromos_rtp.py139 self.natom, self.nlin = split(res[ind+1])
141 self.nlin = atoi(self.nlin)
147 for i in range(self.nlin):
157 while cntr < self.natom - self.nlin:
175 for i in range(self.nlin):
256 if f.nlin != 0: # 0 for a separate molecule
277 for j in range(f.natom - f.nlin):
289 for j in range(f.nlin):
312 for j in range(f.natom - f.nlin):
/dports/math/couenne/Couenne-releases-0.5.8/Couenne/src/readnl/
H A DCouenneAmplInterface.cpp271 int nlin = common -> nlin; // Number of linear terms in readnl() local
273 if (nlin > 0) { in readnl()
275 int *indexL = new int [nlin+1]; in readnl()
276 CouNumber *coeff = new CouNumber [nlin]; in readnl()
280 for (int j = 0; j < nlin; j++) { in readnl()
293 indexL [nlin] = -1; in readnl()
319 int nlin = common -> nlin; // Number of linear terms in readnl() local
321 if (nlin > 0) { in readnl()
324 CouNumber *coeff = new CouNumber [nlin]; in readnl()
328 for (int j = 0; j < nlin; j++) { in readnl()
[all …]

1234567891011