| /dports/net/libunp/unpv12e/libgai/ |
| H A D | ga_nsearch.c | 13 int nsearch = 0; in ga_nsearch() local
23 nsearch++; in ga_nsearch()
30 nsearch++; in ga_nsearch()
37 nsearch++; in ga_nsearch()
42 nsearch++; in ga_nsearch()
55 nsearch++; in ga_nsearch()
62 nsearch++; in ga_nsearch()
87 nsearch++; in ga_nsearch()
94 nsearch++; in ga_nsearch()
101 nsearch++; in ga_nsearch()
[all …]
|
| H A D | getaddrinfo.c | 10 int rc, error, nsearch; in getaddrinfo() local
48 nsearch = ga_nsearch(hostname, &hints, &search[0]); in getaddrinfo()
49 for (sptr = &search[0]; sptr < &search[nsearch]; sptr++) { in getaddrinfo()
94 if (nsearch == 2) { in getaddrinfo()
109 if (nsearch == 2) in getaddrinfo()
|
| /dports/science/quantum-espresso/q-e-qe-6.7.0/upflib/ |
| H A D | upf_free_unit.f90 | 56 integer :: isearch,nsearch,unitmin local
63 nsearch = iotk_unitmax - iotk_unitmin + 1
65 do isearch=0,nsearch-1
66 unit = modulo(isearch+offset,nsearch) + unitmin
75 if(isearch>=nsearch) then
80 offset = modulo(unit - unitmin + 1,nsearch)
|
| /dports/science/tinker/tinker/source/ |
| H A D | pss.f | 393 integer niter,nsearch
439 nsearch = 0
448 nsearch = nsearch + 1
464 nsearch = nsearch + 1
523 integer niter,nsearch
569 nsearch = 0
574 nsearch = nsearch + 1
587 nsearch = nsearch + 1
762 integer nstep,nsearch
828 write (iout,40) nsearch
[all …]
|
| H A D | scan.f | 368 integer i,k,nsearch local
394 nsearch = 0
399 nsearch = nsearch + 1
400 call climber (nsearch,minimum,step,grdmin)
405 nsearch = nsearch + 1
406 call climber (nsearch,minimum,step,grdmin)
489 subroutine climber (nsearch,minimum,step,grdmin) argument
500 integer nstep,nsearch local
550 write (iout,10) nsearch
554 write (iout,20) nsearch
[all …]
|
| H A D | pssrot.f | 293 integer ndoi,nsearch local
335 nsearch = 0
341 nsearch = nsearch + 1
342 call climbrot (nsearch,minimum,step,grdmin)
353 nsearch = nsearch + 1
354 call climbrot (nsearch,minimum,step,grdmin)
448 subroutine climbrot (nsearch,minimum,step,grdmin) argument
456 integer i,nsearch local
499 write (iout,10) nsearch,kstep-1,minimum
504 write (iout,20) nsearch
[all …]
|
| H A D | pssrigid.f | 317 integer nvar,nsearch local
362 nsearch = 0
372 nsearch = nsearch + 1
373 call climbrgd (nsearch,minimum,step,grdmin)
390 nsearch = nsearch + 1
391 call climbrgd (nsearch,minimum,step,grdmin)
508 subroutine climbrgd (nsearch,minimum,step,grdmin) argument
516 integer i,j,nsearch local
567 write (iout,10) nsearch,kstep-1,minimum
572 write (iout,20) nsearch
[all …]
|
| /dports/audio/libmysofa/libmysofa-1.2.1-16-g52590e1/src/tests/ |
| H A D | tools.c | 88 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
92 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
96 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
100 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
104 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
108 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
112 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
116 nsearch(&key, (char *)array, 5, sizeof(int), cmp, &l, &h); in test_nsearch()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/test/java/com/wiredtiger/test/ |
| H A D | AsyncTest.java | 53 /*package*/ int nsearch = 0; field in Callback
82 ntotal = ninsert + nsearch + nerror; in notify()
95 nsearch += 1; in notify()
378 assertEquals(N_ENTRIES, callback.nsearch); in async01()
393 assertEquals(100, callback.nsearch); in async02()
408 assertEquals(100, callback.nsearch); in async03()
423 assertEquals(N_ENTRIES, callback.nsearch); in async04()
438 assertEquals(N_ENTRIES, callback.nsearch); in async05()
453 assertEquals(1000000, callback.nsearch); in async06()
469 assertEquals(100, callback.nsearch); in asyncManyConnections01()
[all …]
|
| /dports/databases/grass7/grass-7.8.6/vector/v.surf.idw/ |
| H A D | main.c | 31 int nsearch; variable
177 nsearch = npoints < search_points ? npoints : search_points; in main()
312 while (pointsfound < nsearch) { in main()
388 for (n = 0; n < nsearch; n++) { in main()
469 if (i < nsearch) { in calculate_distances()
477 if (i == nsearch) { in calculate_distances()
479 for (n = 1; n < nsearch; n++) { in calculate_distances()
497 for (n = 1; n < nsearch; n++) { in calculate_distances()
515 for (i = 0; i < nsearch; i++) { in calculate_distances_noindex()
523 for (n = 1; n < nsearch; n++) { in calculate_distances_noindex()
[all …]
|
| /dports/science/tinker/tinker/other/ |
| H A D | agda.f | 579 integer i,j,k,neigen,ndoi,nsearch
610 nsearch = 0
618 nsearch = nsearch + 1
620 call climber (nsearch,minimum,step)
635 nsearch = nsearch + 1
637 call climber (nsearch,minimum,step)
730 subroutine climber (nsearch,minimum,step)
739 integer i,kstep,nstep,nsearch
779 write (iout,10) nsearch,kstep+1,minimum
784 write (iout,20) nsearch
[all …]
|
| /dports/math/highs/HiGHS-cfe064e/src/ipm/basiclu/src/ |
| H A D | lu_markowitz.c | 56 lu_int nsearch, cheap, found, min_colnz, min_rownz; in lu_markowitz() local
66 nsearch = 0; /* count rows/columns searched */ in lu_markowitz()
116 if (++nsearch >= maxsearch) in lu_markowitz()
172 if (++nsearch >= maxsearch) in lu_markowitz()
182 this->nsearch_pivot += nsearch; in lu_markowitz()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/optimize/_highs/src/ipm/basiclu/src/ |
| H A D | lu_markowitz.c | 56 lu_int nsearch, cheap, found, min_colnz, min_rownz; in lu_markowitz() local
66 nsearch = 0; /* count rows/columns searched */ in lu_markowitz()
116 if (++nsearch >= maxsearch) in lu_markowitz()
172 if (++nsearch >= maxsearch) in lu_markowitz()
182 this->nsearch_pivot += nsearch; in lu_markowitz()
|
| /dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/system/ |
| H A D | Pbc_enforcer.cpp | 300 const int nsearch=4; in find_centers() local
317 for(int ii=-nsearch; ii < nsearch+1; ii++) { in find_centers()
318 for(int jj=-nsearch; jj < nsearch+1; jj++) { in find_centers()
319 for(int kk=-nsearch; kk < nsearch+1; kk++) { in find_centers()
|
| H A D | Periodic_sample.cpp | 233 int nsearch=1; in init() local
234 int nl=2*nsearch+1; in init()
238 for(int aa=-nsearch; aa <= nsearch; aa++) { in init()
239 for(int bb=-nsearch; bb <= nsearch; bb++) { in init()
240 for(int cc=-nsearch; cc <= nsearch; cc++) { in init()
|
| /dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/converter/ |
| H A D | converter.cpp | 341 const int nsearch=1;//number of adjacent cells to search in find_centers() local
358 for(int ii=-nsearch; ii < nsearch+1; ii++) { in find_centers()
359 for(int jj=-nsearch; jj < nsearch+1; jj++) { in find_centers()
360 for(int kk=-nsearch; kk < nsearch+1; kk++) { in find_centers()
|
| H A D | abinit2qmc.cpp | 84 int nsearch=20; in supercell_kpoints() local
85 for(int ii=-nsearch; ii < nsearch; ii++) in supercell_kpoints()
86 for(int jj=-nsearch; jj < nsearch; jj++) in supercell_kpoints()
87 for(int kk=-nsearch; kk < nsearch; kk++) { in supercell_kpoints()
135 int nsearch=10; in extend_supercell() local
136 for(int ii=-nsearch; ii< nsearch; ii++) in extend_supercell()
137 for(int jj=-nsearch; jj< nsearch; jj++) in extend_supercell()
138 for(int kk=-nsearch; kk< nsearch; kk++) { in extend_supercell()
|
| /dports/net/yaz/yaz-5.31.1/util/ |
| H A D | benchmark.c | 20 int nsearch; /* number of searches on each connection */ member
62 case 's': boptions.nsearch = atoi(arg); break; in main()
|
| /dports/shells/rc/rc-1.7.4/ |
| H A D | history.c | 35 static int nreplace = 0, nsearch = 0; variable
297 search[nsearch++] = argv[i]; in main()
314 for (i = 0; i < nsearch; i++) in main()
|
| /dports/science/lammps/lammps-stable_29Sep2021/src/MGPT/ |
| H A D | pair_mgpt.h | 108 int maxlength,nstep,nsearch; variable
154 nsearch = 0; in Hash()
174 int NSearch() { return nsearch; } in NSearch()
229 nsearch = nsearch + 1; in Remove()
251 nsearch = nsearch + 1; in Lookup()
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/wiredtiger/test/suite/ |
| H A D | test_async01.py | 46 self.nsearch = 0
88 self.nsearch += 1
259 self.assertTrue(callback.nsearch == self.nentries * 2)
|
| /dports/www/elinks/elinks-0.11.7/src/viewer/text/ |
| H A D | search.c | 54 if (c == ' ' && !document->nsearch) return; in add_srch_chr()
57 int n = document->nsearch; in add_srch_chr()
68 document->nsearch++; in add_srch_chr()
109 for (i = 0; i < document->nsearch; i++) { in sort_srch()
132 assert(document && document->nsearch == 0); in get_srch()
176 return document->nsearch; in get_srch()
192 document->nsearch = 0; in get_search_data()
198 while (document->nsearch in get_search_data()
199 && document->search[--document->nsearch].c == ' '); in get_search_data()
241 if (*s2 > document->search + document->nsearch - l + 1) in get_range()
[all …]
|
| /dports/x11-toolkits/open-motif/motif-2.3.8/localized/util/ |
| H A D | mkcatdefs.c | 73 static int nsearch(char *);
281 if ((m = nsearch(msgname)) > 0) { in mkcatdefs()
574 nsearch (char *tname) in nsearch() function
|
| /dports/emulators/x49gp/x49gp/x49gp-code/include/ |
| H A D | s3c2410_mmu.h | 26 unsigned long nsearch; member
|
| /dports/www/py-protego/Protego-0.1.16/tests/test_data/ |
| H A D | www.senecacollege.ca | 7 Disallow: /registrar/nsearch/
|