/dports/science/quantum-espresso/q-e-qe-6.7.0/PP/src/ |
H A D | plan_avg.f90 | 37 INTEGER :: ninter variable 119 ninter) 168 INTEGER :: ninter local 200 ninter = 1 203 ntau (ninter) = 1 205 DO iin = 1, ninter 212 ninter = ninter + 1 215 ntau (ninter) = 1 222 DO iin = 1, ninter 231 DO iin = 1, ninter [all …]
|
/dports/math/faiss/faiss-1.7.1/contrib/ |
H A D | evaluation.py | 19 ninter = sum( 23 return ninter / I1.size 51 ninter = np.zeros(nq, dtype="int64") 64 ninter[q] = len(inter) 73 ninter, 86 ngt, nres, ninter = ngt.sum(), nres.sum(), ninter.sum() 89 precision = ninter / nres 94 recall = ninter / ngt 108 recalls = ninter / ngt 114 ninter[mask] = 1 [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/Revoropt/include/Revoropt/Tools/ |
H A D | measure_def.hpp | 221 if(ninter > 0) { in tsia_no_vertex_in_circle() 285 unsigned char ninter ; in tsia_one_vertex_in_circle() local 290 assert( (ninter == 1) in tsia_one_vertex_in_circle() 298 assert( (ninter == 1) in tsia_one_vertex_in_circle() 319 if(ninter > 0) { in tsia_one_vertex_in_circle() 321 assert( (ninter == 2) in tsia_one_vertex_in_circle() 345 ninter += ninter ; in tsia_one_vertex_in_circle() 370 unsigned char ninter ; in tsia_two_vertices_in_circle() local 375 assert( (ninter == 1) in tsia_two_vertices_in_circle() 383 assert( (ninter == 1) in tsia_two_vertices_in_circle() [all …]
|
/dports/science/py-pyscf/pyscf-2.0.1/pyscf/lib/mcscf/ |
H A D | select_ci.c | 68 int ninter = nstrs; 188 int ninter = 0; 196 ninter++; 200 return ninter; 235 int ninter = 0; 243 ninter++; 247 return ninter; 290 int ninter = 0; 300 inter[ninter] = str1; 301 ninter++; [all …]
|
/dports/devel/ga/ga-5.8/tcgmsg/examples/ |
H A D | md.f | 112 call neigh(npart, x, side, rcoff, ninter, inter, maxint, 381 subroutine neigh(npart, x, side, rcoff, ninter, inter, maxint, argument 402 ninter = 0 433 ninter = ninter + 1 434 if (ninter.gt.maxint) then 435 write(6,*) ' too many interactions ', ninter 438 inter(1,ninter) = i 439 inter(2,ninter) = j 454 $ ninter, inter) 458 dimension x(npart, 3), f(npart, 3), inter(2, ninter) [all …]
|
/dports/math/faiss/faiss-1.7.1/tests/ |
H A D | test_index_accuracy.py | 255 ninter = faiss.eval_intersection(I, gt_I) 485 ninter = faiss.eval_intersection(I, gt_I) 499 ninter = faiss.eval_intersection(I, gt_I) 504 assert (ninter >= self.ref_results[ 540 ninter = {} 553 ninter[v] = faiss.eval_intersection(I, gt_I) 554 print('ninter=', ninter) 559 assert abs(ninter['2x8'] - 458) < 4 560 assert abs(ninter['8x2'] - 465) < 4 728 ninter = faiss.eval_intersection(I, gt_I) [all …]
|
H A D | test_fast_scan_ivf.py | 158 ninter = 0 160 ninter += len(np.intersect1d(Inew[i], Iref[i])) 161 intersection_at_10 = ninter / nq
|
/dports/science/py-pyscf/pyscf-2.0.1/pyscf/fci/ |
H A D | selected_ci.py | 210 ninter = len(inter1) 212 inter = numpy.empty((ninter*nelec), dtype=numpy.int64) 216 ctypes.c_int(ninter)) 218 ninter = len(inter) 221 link_index = numpy.zeros((ninter,nvir*nvir,4), dtype=numpy.int32) 251 ninter = len(inter) 254 link_index = numpy.zeros((ninter,nvir,4), dtype=numpy.int32) 257 ctypes.c_int(nstrs), ctypes.c_int(ninter), 278 ninter = len(inter) 280 link_index = numpy.zeros((ninter,nelec+1,4), dtype=numpy.int32) [all …]
|
/dports/science/siconos/siconos-4.4.0/kernel/swig/tests/ |
H A D | test_lagrangiands_osi.py | 74 ninter = 0 77 nsds.link(interactions[ninter], ds) 78 ninter += 1
|
/dports/biology/paml/paml4.9j/src/ |
H A D | basemlg.c | 35 double GetBmx (int ninter, int nsum, int im, int M[], int nodeb[]); 429 int ninter=tree.nbranch-com.ns+1; in RhoRate() local 459 Bmx=GetBmx (ninter, nsum, im, M, nodeb); in RhoRate() 490 int ninter=tree.nbranch-com.ns+1; in lfunG_print() local 516 Bmx=GetBmx (ninter, nsum, im, M, nodeb); in lfunG_print() 559 int ninter=tree.nbranch-com.ns+1; in lfunG() local 579 Bmx=GetBmx (ninter, nsum, im, M, nodeb); in lfunG() 590 int nbranch=tree.nbranch, ninter=nbranch-com.ns+1; in lfunG_d() local 621 Bmx=GetBmx (ninter, nsum, im, M, nodeb); in lfunG_d() 644 int nbranch=tree.nbranch, ninter=nbranch-com.ns+1; in lfunG_dd() local [all …]
|
/dports/science/py-pymatgen/pymatgen-2022.0.15/pymatgen/command_line/ |
H A D | vampire_caller.py | 353 ninter = 0 355 ninter += sgraph.get_coordination_of_site(i) 358 ucf += ["%d isotropic" % (ninter)]
|
/dports/math/faiss/faiss-1.7.1/benchs/bench_all_ivf/ |
H A D | cmp_with_scann.py | 33 ninter = 0 35 ninter += np.intersect1d(I[i, :rank], gt[i, :rank]).size 36 inter = ninter / (nq * rank)
|
H A D | bench_all_ivf.py | 315 ninter = sum( 319 return ninter / a.size
|
/dports/science/afni/afni-AFNI_21.3.16/src/SUMA/gts/test/boolean/ |
H A D | cubes.c | 102 static guint ncalls = 0, ninter = 0, nfailed = 0; in surface_inter() local 154 ninter++; in surface_inter() 188 ncalls, ninter, nfailed); in surface_inter()
|
/dports/graphics/gts/gts-0.7.6/test/boolean/ |
H A D | cubes.c | 102 static guint ncalls = 0, ninter = 0, nfailed = 0; in surface_inter() local 154 ninter++; in surface_inter() 188 ncalls, ninter, nfailed); in surface_inter()
|
/dports/math/freefem++/FreeFem-sources-4.6/idp/ |
H A D | ffddm_partitioning.idp | 656 int ninter = 0; 659 rest[ninter++] = renum[j]; 660 rest.resize(ninter); 661 if (ninter > 0){ 663 if (ninter > 1) 664 Ic = (0:ninter-1); 665 real[int] Kc(ninter); 668 Raug.resize(ninter, pr#AugVhi.ndof);
|
/dports/cad/repsnapper/repsnapper-2.5a4/src/slicer/ |
H A D | geometry.cpp | 678 uint ninter = 0; in lineInPolys() local 681 if (polys[i].vertexInside(from)) ninter++; in lineInPolys() 682 if (polys[i].vertexInside(to)) ninter++; in lineInPolys() 684 ninter += inter.size(); in lineInPolys() 687 return (ninter != 0); in lineInPolys()
|
/dports/biology/ncbi-cxx-toolkit/ncbi_cxx--25_2_0/src/app/read_blast_result/ |
H A D | problems.cpp | 304 int ninter=0; in FixStrands() local 305 for(CTypeIterator<CSeq_interval> inter = ::Begin(loc); inter; ++inter, ++ninter) in FixStrands() 313 NcbiCerr << "CReadBlastApp::FixStrands: ninters= " << ninter << NcbiEndl; in FixStrands()
|
/dports/math/faiss/faiss-1.7.1/faiss/python/ |
H A D | __init__.py | 1265 ninter = 0 1267 ninter += ranklist_intersection_size( 1269 return ninter
|
/dports/math/gretl/gretl-2021d/lib/src/ |
H A D | compare.c | 2526 int ninter = 0, newvars = 0; in make_chow_list() local 2543 ninter = brklist[0]; in make_chow_list() 2547 ninter = pmod->ncoeff - pmod->ifc; in make_chow_list() 2550 newvars = ninter + 1 - havedum; in make_chow_list() 2555 chowlist = gretl_list_new(pmod->list[0] + ninter + 1); in make_chow_list() 2583 for (i=0; i<ninter; i++) { in make_chow_list()
|
/dports/science/py-scipy/scipy-1.7.1/scipy/spatial/ |
H A D | qhull.pyx | 2678 intersections : ndarray of double, shape (ninter, ndim)
|
/dports/textproc/weka/weka-3-8-5/data/ |
H A D | ReutersCorn-train.arff | 418 …t Beliview.\n Delivery method will be by in-line or in-well transfer,\ninter-facility transfer … 1227 …mmerce and Industry,\nYeutter said \"Capital and trade flows are clearly\ninter-releated now.\n …
|
H A D | ReutersGrain-train.arff | 418 …t Beliview.\n Delivery method will be by in-line or in-well transfer,\ninter-facility transfer … 1227 …mmerce and Industry,\nYeutter said \"Capital and trade flows are clearly\ninter-releated now.\n …
|
/dports/editors/texstudio/texstudio-4.1.2/utilities/dictionaries/ |
H A D | fy_FY-WesternFrisian.dic | 158375 ninter
|