/dports/math/fricas/fricas-1.3.7/src/input/ |
H A D | distro.input | 9 testEquals("firstn(ss2,10)", "firstn(ss3,10)") 10 testEquals("firstn(ss3,10)", "firstn(ss4,10)") 13 testEquals("firstn(ss2a,10)", "firstn(ss2b,10)") 56 testEquals("firstn(cc, 5)", "firstn(c2m2c, 5)") 58 testEquals("firstn(mm, 5)", "firstn(m2c2m, 5)") 60 testEquals("firstn(cc, 5)", "firstn(c2m2c, 5)") 62 testEquals("firstn(mm, 5)", "firstn(m2c2m, 5)") 64 testEquals("firstn(cc, 5)", "firstn(c2m2c, 5)") 66 testEquals("firstn(mm, 5)", "firstn(m2c2m, 5)") 109 testEquals("firstn(moments dmk, 10)", "firstn(mm,10)") [all …]
|
/dports/mail/elm/elm2.5.8/lib/ |
H A D | mk_aliases.c | 289 if (firstn) 290 alias.comment += strlen(firstn) + 1; 317 if (firstn) { 318 fwrite(firstn, strlen(firstn), 1, data); 591 for (s = lastn, firstn = NULL; *s; s++) { 604 firstn = s + 1; 614 if (firstn) { 615 while (*firstn && isspace(*firstn)) 616 firstn++; 623 if (firstn) { [all …]
|
/dports/math/eclib/eclib-20210318/tests/ |
H A D | nftest.cc | 39 int limit,firstn,n=1,count=0; local 42 cerr<<"Enter first and last N: ";cin>>firstn>>limit; 43 n=firstn-1; cout<<endl; 72 cout << "\n" << count << " newform(s) in range " << firstn << "..." << limit << endl;
|
/dports/math/eclib/eclib-20210318/progs/ |
H A D | nfcount.cc | 30 int limit,n=1,count=0,firstn, verbose; in main() local 33 cout<<"Enter first and last N: ";cin>>firstn>>limit; in main() 34 n=firstn-1; cout<<endl; in main() 65 cout << "\n" << count << " newform(s) in range " << firstn << "..." << limit << endl; in main()
|
H A D | qexp.cc | 48 int limit,firstn,n=1; local 52 cerr<<"Enter first and last N: ";cin>>firstn>>limit; cerr<<endl; 53 n=firstn-1;
|
H A D | checkap.cc | 35 long firstn, lastn, n, nnf, naq, nap, n2ds, ap, i, j, p; in main() local 38 cout<<"Enter first and last N: "; cin>>firstn>>lastn; in main() 39 for(n=firstn; n<=lastn; n++) in main()
|
/dports/math/maxima/maxima-5.43.2/tests/ |
H A D | rtest2.mac | 782 /* firstn, lastn */ 787 firstn (mylist, 0); 790 firstn (mylist, 1); 793 firstn (mylist, 4); 796 firstn (mylist, 8); 799 firstn (mylist, 9); 802 firstn (mylist, 10); 838 firstn (fooexpr, 0); 841 firstn (fooexpr, 1); 844 firstn (fooexpr, 4); [all …]
|
/dports/lang/rust/rustc-1.58.1-src/src/tools/miri/tests/compile-fail/ |
H A D | generator-pinned-moved.rs | 8 fn firstn() -> impl Generator<Yield = u64, Return = ()> { in firstn() function 37 let mut generator_iterator = Box::new(GeneratorIteratorAdapter(firstn())); in main()
|
/dports/devel/p5-Data-Hexify/Data-Hexify-1.00/lib/Data/ |
H A D | Hexify.pm | 117 my $firstn = $chunk - $r; 120 $n = $firstn if $n > $firstn;
|
/dports/astro/astrometry/astrometry.net-0.85/solver/ |
H A D | fvrf_data.c | 499 long firstn, in iterdata() argument 536 if(firstn == 1 ) { /* first time for this table, so initialize */ in iterdata() 578 "Row #%ld, and Column #%d: X vector ", firstn+k, in iterdata() 613 "String in row #%ld, column #%d contains non-ASCII text.", firstn+k, in iterdata() 640 (firstn+j - 2)/repeat[i] +1, in iterdata() 673 "Number in row #%ld, column #%d has no decimal point:", firstn+k, in iterdata() 703 "Number in row #%ld, column #%d has embedded space:", firstn+k, in iterdata() 718 if(firstn + nrows - 1 == totaln) { in iterdata()
|
/dports/math/ogdf/OGDF/src/ogdf/orthogonal/internal/ |
H A D | CommonCompactionConstraintGraphBase.cpp | 246 node firstn = nullptr, secondn = nullptr; in removeRedundantVisibArcs() local 251 firstn = en; in removeRedundantVisibArcs() 263 if (firstn != nullptr && secondn != nullptr && firstn == secondn) { in removeRedundantVisibArcs()
|
/dports/math/maxima/maxima-5.43.2/doc/info/ |
H A D | Lists.texi | 616 @anchor{firstn} 644 @c firstn (mylist, 0); 645 @c firstn (mylist, 1); 646 @c firstn (mylist, 2); 647 @c firstn (mylist, 7); 676 @c firstn (mylist, 100); 693 @c firstn (myfoo, 4); 695 @c firstn (mybar, 4); 697 @c firstn (mymatrix, 3); 705 (%i2) firstn (myfoo, 4); [all …]
|
/dports/math/maxima/maxima-5.43.2/share/affine/ |
H A D | macbasic.mac | 59 if fast_solve then ans : fast_linsolve (eqns,firstn(length(monoms),aaaa)) else 60 ans:linsolve(eqns,firstn (length( monoms), aaaa)), 82 if fast_solve then ans : fast_linsolve (eqns,firstn(length(monoms),aaaa)) else 83 ans:linsolve(eqns,firstn (length( monoms), aaaa)),
|
/dports/dns/dnscrypt-proxy2/dnscrypt-proxy-2.1.1/vendor/github.com/golangci/dupl/syntax/ |
H A D | syntax.go | 63 firstn := firstSeq[lasti] 66 if firstn.Owns != n.Owns {
|
/dports/devel/dupl/dupl-1.0.0-11-g28d787e/syntax/ |
H A D | syntax.go | 63 firstn := firstSeq[lasti] 66 if firstn.Owns != n.Owns {
|
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/kunwardeep/paralleltest/tools/vendor/github.com/golangci/dupl/syntax/ |
H A D | syntax.go | 63 firstn := firstSeq[lasti] 66 if firstn.Owns != n.Owns {
|
/dports/multimedia/navidrome/navidrome-0.40.0/vendor/github.com/golangci/dupl/syntax/ |
H A D | syntax.go | 63 firstn := firstSeq[lasti] 66 if firstn.Owns != n.Owns {
|
/dports/astro/cfitsio/cfitsio-3.49/ |
H A D | iter_c.f | 128 subroutine writehisto(totaln, offset, firstn, nvalues, narrays, argument 132 integer totaln,offset,firstn,nvalues,narrays,status local
|
H A D | iter_c.c | 67 int writehisto(long totaln, long offset, long firstn, long nvalues, in writehisto() argument
|
/dports/science/healpix/Healpix_3.50/src/healpy/cfitsio/ |
H A D | iter_c.f | 128 subroutine writehisto(totaln, offset, firstn, nvalues, narrays, argument 132 integer totaln,offset,firstn,nvalues,narrays,status
|
H A D | iter_c.c | 67 int writehisto(long totaln, long offset, long firstn, long nvalues, in writehisto() argument
|
/dports/lang/mono/mono-5.10.1.57/mcs/class/System.Web/Test/mainsoft/NunitWebResources/ |
H A D | XMLDataSourceTest.xsl | 14 <xsl:value-of select="customername/firstn"/>
|
/dports/textproc/highlight/highlight-4.1/langDefs/ |
H A D | arc.lang | 34 "findsubseq", "firstn", "firstn-that", "flat", "fn", "for", "forlen",
|
/dports/math/fricas/fricas-1.3.7/pre-generated/src/algebra/ |
H A D | SEQUCAT.lsp | 45 ((|firstn|
|
/dports/lang/fpc/fpc-3.2.2/compiler/ |
H A D | ninl.pas | 4789 firstn, 4810 first:=firstn.resultdef; 4857 inserttypeconv(firstn,second); 4865 if is_const(firstn) then 4921 firstn, 4934 first:=firstn.resultdef; 4985 firstn : tnode; 5019 firstn:=tnode(list.last); 5020 if not assigned(firstn) then 5024 if is_dynamic_array(firstn.resultdef) or is_array_constructor(firstn.resultdef) then [all …]
|