/dports/comms/gnuradio/gnuradio-3.8.4.0/gr-blocks/lib/ |
H A D | complex_to_interleaved_char_impl.cc | 55 int npairs = (d_vector ? noutput_items : noutput_items / 2); in work() local 56 for (int i = 0; i < npairs; i++) { in work()
|
/dports/science/octopus/octopus-10.5/src/math/ |
H A D | permutations.F90 | 42 integer :: nn, npairs component 120 perm_out%npairs = perm_in%npairs
|
/dports/biology/infernal/infernal-1.1.3/easel/ |
H A D | esl_wuss.c | 174 int npairs = 0; /* total number of basepairs */ in esl_ct2wuss() local 182 for (j = 1; j <= n; j ++) { if (ct[j] > 0 && j < ct[j]) npairs ++; } in esl_ct2wuss() 354 if (npairs != npairs_reached) in esl_ct2wuss() 355 ESL_EXCEPTION(eslFAIL, "found %d out of %d pairs.", npairs_reached, npairs); in esl_ct2wuss() 398 int npairs = 0; /* total number of basepairs */ in esl_ct2simplewuss() local 406 for (j = 1; j <= n; j ++) { if (ct[j] > 0 && j < ct[j]) npairs ++; } in esl_ct2simplewuss() 533 if (npairs != npairs_reached) in esl_ct2simplewuss() 534 ESL_EXCEPTION(eslFAIL, "found %d out of %d pairs.", npairs_reached, npairs); in esl_ct2simplewuss()
|
/dports/biology/hmmer/hmmer-3.3/easel/ |
H A D | esl_wuss.c | 174 int npairs = 0; /* total number of basepairs */ in esl_ct2wuss() local 182 for (j = 1; j <= n; j ++) { if (ct[j] > 0 && j < ct[j]) npairs ++; } in esl_ct2wuss() 354 if (npairs != npairs_reached) in esl_ct2wuss() 355 ESL_EXCEPTION(eslFAIL, "found %d out of %d pairs.", npairs_reached, npairs); in esl_ct2wuss() 398 int npairs = 0; /* total number of basepairs */ in esl_ct2simplewuss() local 406 for (j = 1; j <= n; j ++) { if (ct[j] > 0 && j < ct[j]) npairs ++; } in esl_ct2simplewuss() 533 if (npairs != npairs_reached) in esl_ct2simplewuss() 534 ESL_EXCEPTION(eslFAIL, "found %d out of %d pairs.", npairs_reached, npairs); in esl_ct2simplewuss()
|
/dports/biology/gmap/gmap-2020-09-12/src/ |
H A D | stage3.c | 559 int npairs; member 986 } else if (x->npairs < y->npairs) { in Stage3_cmp() 988 } else if (y->npairs < x->npairs) { in Stage3_cmp() 3747 *npairs = 0; 3787 npairs = 0; in dual_break_count_npairs() 3799 npairs += 1; in dual_break_count_npairs() 3822 npairs = 0; in negative_break_count_npairs() 3834 npairs += 1; in negative_break_count_npairs() 5953 new->npairs = npairs; in Stage3_new() 6050 int npairs; in Stage3_new_from_pairs() local [all …]
|
H A D | simplepair.h | 52 struct T *pairarray, int npairs, int querylength, 55 Simplepair_overlap_print_sam (Filestring_T fp, char *abbrev, struct T *pairarray, int npairs,
|
/dports/science/qmcpack/qmcpack-3.11.0/src/QMCHamiltonians/ |
H A D | PairCorrEstimator.cpp | 50 int npairs = 0; in PairCorrEstimator() local 57 pair_map[i * num_species + j] = npairs; in PairCorrEstimator() 58 ++npairs; in PairCorrEstimator() 272 const RealType npairs = (m == n ? (nn * (nn - 1) / 2.) : (nn * nm)); in set_norm_factor() local 273 rho = npairs / Volume; in set_norm_factor()
|
H A D | NLPP.cu | 137 int npairs = 0, index = 0, blockNum = 0; in find_core_electrons_PBC_kernel() local 175 npairs++; in find_core_electrons_PBC_kernel() 190 numPairs[blockIdx.x] = npairs; in find_core_electrons_PBC_kernel() 292 int npairs = 0, index = 0, blockNum = 0; in find_core_electrons_PBC_kernel() local 382 npairs++; in find_core_electrons_PBC_kernel() 402 numPairs[blockIdx.x] = npairs; in find_core_electrons_PBC_kernel() 504 int npairs = 0, index = 0, blockNum = 0; in find_core_electrons_kernel() local 544 npairs++; in find_core_electrons_kernel() 559 numPairs[blockIdx.x] = npairs; in find_core_electrons_kernel() 738 npairs++; in find_core_electrons_kernel() [all …]
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | heur_twoopt.c | 934 int npairs = 0; in optimize() local 1153 if( npairs == arraysize ) in optimize() 1161 assert( npairs < arraysize ); in optimize() 1163 bestmasters[npairs] = master; in optimize() 1164 bestslaves[npairs] = vars[bestslavepos]; in optimize() 1165 …objchanges[npairs] = ((int)bestslavedir * SCIPvarGetObj(bestslaves[npairs]) + (int)bestmasterdir … in optimize() 1166 bestdirections[npairs] = bestdirection; in optimize() 1168 assert(objchanges[npairs] < 0); in optimize() 1175 ++npairs; in optimize() 1180 if( npairs == 0 ) in optimize() [all …]
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | manybody_siepmann.F | 739 ipair, istart, jkind, nkinds, npairs, & local 756 npairs = neighbor_kind_pair%npairs 757 IF (npairs == 0) CYCLE 764 npairs = iend - istart + 1 767 IF (pot%type(i) == siepmann_type) npairs_tot = npairs_tot + npairs 779 npairs = neighbor_kind_pair%npairs 780 IF (npairs == 0) CYCLE 789 npairs = iend - istart + 1 795 DO ipair = 1, npairs 799 npairs_tot = npairs_tot + npairs
|
H A D | manybody_tersoff.F | 734 ipair, istart, jkind, nkinds, npairs, & local 751 npairs = neighbor_kind_pair%npairs 752 IF (npairs == 0) CYCLE 759 npairs = iend - istart + 1 762 IF (pot%type(i) == tersoff_type) npairs_tot = npairs_tot + npairs 774 npairs = neighbor_kind_pair%npairs 775 IF (npairs == 0) CYCLE 784 npairs = iend - istart + 1 790 DO ipair = 1, npairs 794 npairs_tot = npairs_tot + npairs
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | manybody_tersoff.F | 734 ipair, istart, jkind, nkinds, npairs, & local 751 npairs = neighbor_kind_pair%npairs 752 IF (npairs == 0) CYCLE 759 npairs = iend - istart + 1 762 IF (pot%type(i) == tersoff_type) npairs_tot = npairs_tot + npairs 774 npairs = neighbor_kind_pair%npairs 775 IF (npairs == 0) CYCLE 784 npairs = iend - istart + 1 790 DO ipair = 1, npairs 794 npairs_tot = npairs_tot + npairs
|
H A D | manybody_siepmann.F | 739 ipair, istart, jkind, nkinds, npairs, & local 756 npairs = neighbor_kind_pair%npairs 757 IF (npairs == 0) CYCLE 764 npairs = iend - istart + 1 767 IF (pot%type(i) == siepmann_type) npairs_tot = npairs_tot + npairs 779 npairs = neighbor_kind_pair%npairs 780 IF (npairs == 0) CYCLE 789 npairs = iend - istart + 1 795 DO ipair = 1, npairs 799 npairs_tot = npairs_tot + npairs
|
/dports/devel/lua-stdlib/lua-stdlib-release-v41.2.2/lib/ |
H A D | std.lua.in | 154 -- @see npairs 200 -- @function npairs 207 -- for i,v in npairs {"one", nil, "three"} do ... end 208 npairs = X ("npairs (table)", base.npairs), 249 --- An iterator like npairs, but in reverse. 251 -- the same rules as @{npairs} for determining first and last elements. 256 -- @see npairs
|
H A D | std.lua | 208 npairs = X ("npairs (table)", base.npairs),
|
/dports/biology/abyss/abyss-2.3.1/DistanceEst/ |
H A D | DistanceEst.cpp | 100 static unsigned npairs; variable 251 if (numPairs < opt::npairs) in estimateDistance() 302 if (pairs.size() < opt::npairs) in writeEstimate() 311 if (est.numPairs >= opt::npairs) { in writeEstimate() 455 case 'n': arg >> opt::npairs; break; in main() 492 if (opt::npairs <= 0) { in main() 552 "n=" << opt::npairs << "]\n"; in main() 559 << opt::npairs; in main()
|
/dports/science/lammps/lammps-stable_29Sep2021/src/MANYBODY/ |
H A D | pair_bop.cpp | 315 memory->create(pi_a,npairs,"BOP:pi_a"); in allocate() 319 memory->create(pi_c,npairs,"BOP:pi_c"); in allocate() 1884 memory->create(rcut,npairs,"BOP:rcut"); in read_table() 1945 for (int i = 0; i < npairs; ++i) { in read_table() 2026 for (int i = 0; i < npairs; i++) { in read_table() 2036 for (int i = 0; i < npairs; i++) { in read_table() 2044 for (int i = 0; i < npairs; i++) { in read_table() 2054 for (int i = 0; i < npairs; i++) { in read_table() 2081 reader->next_dvector(rcut,npairs); in read_table() 2088 for (int i = 0; i < npairs; i++) { in read_table() [all …]
|
/dports/math/libsharp2/libsharp-54856313a5fcfb6a33817b7dfa28c4b1965ffbd1/libsharp2/ |
H A D | sharp.c | 201 info->npairs=0; in sharp_make_geom_info() 220 info->pair[info->npairs].r1=infos[pos]; in sharp_make_geom_info() 224 info->pair[info->npairs].r2=infos[pos+1]; in sharp_make_geom_info() 227 info->pair[info->npairs].r1=infos[pos+1]; in sharp_make_geom_info() 228 info->pair[info->npairs].r2=infos[pos]; in sharp_make_geom_info() 233 info->pair[info->npairs].r2.nph=-1; in sharp_make_geom_info() 235 ++info->npairs; in sharp_make_geom_info() 245 for (int m=0; m<info->npairs; ++m) in sharp_map_size() 391 for (int j=0;j<ginfo->npairs;++j) in clear_map() 413 for (int j=0;j<ginfo->npairs;++j) in clear_map() [all …]
|
/dports/devel/lua-stdlib/lua-stdlib-release-v41.2.2/lib/std/ |
H A D | functional.lua | 14 local ielems, ipairs, ireverse, npairs, pairs = 15 base.ielems, base.ipairs, base.ireverse, base.npairs, base.pairs 33 for _, v in npairs {...} do 56 for _, fn in npairs (fns) do
|
/dports/math/brial/BRiAl-1.2.10/sage-brial/brial/ |
H A D | simplebb.py | 15 while g.npairs() > 0: 34 while g.npairs() > 0:
|
/dports/math/py-brial/BRiAl-1.2.10/sage-brial/brial/ |
H A D | simplebb.py | 15 while g.npairs() > 0: 34 while g.npairs() > 0:
|
/dports/science/siesta/siesta-4.1.5/Src/ |
H A D | electrostatic.f | 14 use atm_types, only: nspecies, species, elec_corr, npairs 35 npairs = ((nspecies+1)*nspecies)/2 36 allocate(elec_corr(npairs)) 37 do is=1,npairs
|
/dports/print/typetools/lcdf-typetools-2.108/libefont/ |
H A D | ttfkern.cc | 99 uint16_t npairs = subt.u16(off - 8); in unparse_automatics() local 100 for (uint16_t j = 0; j < npairs; ++j, off += 6) { in unparse_automatics()
|
/dports/print/texlive-base/texlive-20150521-source/texk/lcdf-typetools/lcdf-typetools-2.104/libefont/ |
H A D | ttfkern.cc | 99 uint16_t npairs = subt.u16(off - 8); in unparse_automatics() local 100 for (uint16_t j = 0; j < npairs; ++j, off += 6) { in unparse_automatics()
|
/dports/print/tex-dvipsk/texlive-20150521-source/texk/lcdf-typetools/lcdf-typetools-2.104/libefont/ |
H A D | ttfkern.cc | 99 uint16_t npairs = subt.u16(off - 8); in unparse_automatics() local 100 for (uint16_t j = 0; j < npairs; ++j, off += 6) { in unparse_automatics()
|