Home
last modified time | relevance | path

Searched refs:maxL (Results 1 – 25 of 666) sorted by relevance

12345678910>>...27

/dports/biology/pooler/PrimerPooler-1.78/pooler/
H A Dload-common.c39 int r=0,minL=-1,maxL=0,isTag=0,maxTag=0; in numPrimers() local
56 maxL = ((basesFound > maxL) ? basesFound : maxL); in numPrimers()
65 …,"%d primers + %d tags\nShortest primer length is %d bases; longest is %d\n",r,*numTags,minL,maxL); in numPrimers()
68 maxL+=maxTag; in numPrimers()
69 …fprintf(stderr,"(max tag length is %d, so max tagged primer length is %d)\n",maxTag,maxL); // TODO… in numPrimers()
72 *maxLen = maxL; return checkLenLimit(maxL) ? -1 : r; in numPrimers()
/dports/biology/star/STAR-2.7.9a/source/
H A DReadAlign_maxMappableLength2strands.cpp7 uint Nrep=0, indStartEnd[2], maxL; in maxMappableLength2strands() local
63 maxL=0; in maxMappableLength2strands()
64 …mapGen, Read1, pieceStart, pieceLength, iSA1 & mapGen.SAiMarkNmask, iSA2, dirR, maxL, indStartEnd); in maxMappableLength2strands()
71 maxL=Lind; in maxMappableLength2strands()
81 … maxL=compareSeqToGenome(mapGen, Read1, pieceStart, pieceLength, Lind, iSA1, dirR, comparRes); in maxMappableLength2strands()
84 maxL=Lind; in maxMappableLength2strands()
86 maxL=0; in maxMappableLength2strands()
88 …mapGen, Read1, pieceStart, pieceLength, iSA1 & mapGen.SAiMarkNmask, iSA2, dirR, maxL, indStartEnd); in maxMappableLength2strands()
92 if (maxL+iDist > maxLbest) {//this idist is better in maxMappableLength2strands()
93 maxLbest=maxL+iDist; in maxMappableLength2strands()
[all …]
/dports/science/cdf/cdf33_0-dist/src/tools/
H A Dwindoz.c2446 int maxL;
2518 switch (maxL) {
2528 switch (maxL) {
2550 switch (maxL) {
2557 switch (maxL) {
2566 switch (maxL) {
2577 switch (maxL) {
2625 int maxL;
2628 switch (maxL) {
2645 int maxL;
[all …]
/dports/science/libecpint/libecpint-1.0.7/src/lib/
H A Dradial_quad.cpp40 bessie.init(maxL, 1600, 200, tol); in init()
47 std::vector<double> besselValues(maxL+1, 0.0); in buildBessel()
51 for (int l = 1; l <= maxL; l++) values(l, i) = 0.0; in buildBessel()
127 values.assign(maxL+1, 0.0); in integrate()
132 for (int l = offset; l <= maxL; l+=skip) { in integrate()
144 const int maxL, const int N, const int offset, in type1() argument
158 TwoIndex<double> intValues(maxL+1, gridSize, 0.0); in type1()
166 values.assign(maxL+1, 2*maxL + 1, 0.0); in type1()
193 for (int l = offset; l <= maxL; l+=2) { in type1()
210 for (int l = offset; l <= maxL; l+=2) in type1()
[all …]
H A Dbessel.cpp140 void BesselFunction::calculate(const double z, int maxL, std::vector<double> &values) const { in calculate() argument
141 if (lMax < maxL) { in calculate()
142 std::cout << "Asked for " << maxL << " but only initialised to maximum L = " << lMax << "\n"; in calculate()
143 maxL = lMax; in calculate()
152 for (int l = 1; l <= maxL; l++) values[l] = values[l-1]*z/(2.0*l+1.0); in calculate()
160 for (int l = 1; l <= maxL; l++) { in calculate()
182 for (int l = 0; l <= maxL; l++) values[l] = K[ix][l]; in calculate()
193 for (int l = 0; l <= maxL; l++) { in calculate()
/dports/science/pcmsolver/pcmsolver-1.3.0/tests/green/
H A Dgreen_spherical_sharp.cpp43 int maxL = 200; variable
55 maxL,
66 SphericalSharp<Stencil> gf(epsNP, epsSolv, NPradius, NPcenter, maxL);
86 SphericalSharp<> gf(epsNP, epsSolv, NPradius, NPcenter, maxL);
106 SphericalSharp<AD_gradient> gf(epsNP, epsSolv, NPradius, NPcenter, maxL);
126 SphericalSharp<AD_hessian> gf(epsNP, epsSolv, NPradius, NPcenter, maxL);
/dports/science/libecpint/libecpint-1.0.7/src/
H A Dgenerate.cpp263 int maxL = libecpint::maxL; in main() local
265 libecpint::AngularIntegral angInts(maxL, maxL); in main()
291 for (int j = 0; j <= maxL; j++) { in main()
293 for (int k = 0; k <= maxL; k++) { in main()
319 for (int i =0; i <= maxL; i++) { in main()
322 for (int j = 0; j<= maxL; j++) { in main()
328 for (int k = 0; k< maxL; k++) in main()
331 ecpgen_head << "qgen::Q" << I << "_" << J << "_" << maxL << "}"; in main()
332 if (j != maxL) ecpgen_head << ","; in main()
337 if (i != maxL) ecpgen_head << ","; in main()
/dports/science/libecpint/libecpint-1.0.7/doc/sphinx/source/api/
H A Dprogram_listing_file__Users_robertshaw_devfiles_libecpint_new_src_lib_radial_quad.cpp.rst53 bessie.init(maxL, 1600, 200, tol);
59 std::vector<double> besselValues(maxL+1, 0.0);
63 for (int l = 1; l <= maxL; l++) values(l, i) = 0.0;
126 values.assign(maxL+1, 0.0);
131 for (int l = offset; l <= maxL; l+=skip) {
147 TwoIndex<double> intValues(maxL+1, gridSize, 0.0);
149 TwoIndex<double> besselValues(maxL+1, gridSize, 0.0);
155 values.assign(maxL+1, 2*maxL + 1, 0.0);
183 for (int l = offset; l <= maxL; l+=2) {
200 for (int l = offset; l <= maxL; l+=2)
[all …]
H A Dprogram_listing_file__Users_robertshaw_devfiles_libecpint_src_lib_radial_quad.cpp.rst53 bessie.init(maxL, 1600, 200, tol);
60 std::vector<double> besselValues(maxL+1, 0.0);
140 values.assign(maxL+1, 0.0);
145 for (int l = offset; l <= maxL; l+=skip) {
157 const int maxL, const int N, const int offset,
171 TwoIndex<double> intValues(maxL+1, gridSize, 0.0);
173 TwoIndex<double> besselValues(maxL+1, gridSize, 0.0);
179 values.assign(maxL+1, 2*maxL + 1, 0.0);
206 for (int l = offset; l <= maxL; l+=2) {
223 for (int l = offset; l <= maxL; l+=2)
[all …]
H A Dprogram_listing_file__Users_robertshaw_devfiles_libecpint_src_generate.cpp.rst218 int maxL = libecpint::maxL;
220 libecpint::AngularIntegral angInts(maxL, maxL);
244 // Loop over all possible (l1, l2, lam) integrals up to l1 = l2 = lam = maxL
246 for (int j = 0; j <= maxL; j++) {
248 for (int k = 0; k <= maxL; k++) {
274 for (int i =0; i <= maxL; i++) {
277 for (int j = 0; j<= maxL; j++) {
283 for (int k = 0; k< maxL; k++)
286 ecpgen_head << "qgen::Q" << I << "_" << J << "_" << maxL << "}";
287 if (j != maxL) ecpgen_head << ",";
[all …]
H A Dprogram_listing_file__Users_robertshaw_devfiles_libecpint_new_src_generate.cpp.rst218 int maxL = libecpint::maxL;
220 libecpint::AngularIntegral angInts(maxL, maxL);
244 // Loop over all possible (l1, l2, lam) integrals up to l1 = l2 = lam = maxL
246 for (int j = 0; j <= maxL; j++) {
248 for (int k = 0; k <= maxL; k++) {
274 for (int i =0; i <= maxL; i++) {
277 for (int j = 0; j<= maxL; j++) {
283 for (int k = 0; k< maxL; k++)
286 ecpgen_head << "qgen::Q" << I << "_" << J << "_" << maxL << "}";
287 if (j != maxL) ecpgen_head << ",";
[all …]
H A Dvariable_generate_8cpp_1a96e56aec07e9dee3b0b39b2c73c59413.rst3 Variable maxL
13 .. doxygenvariable:: maxL
H A Dvariable_namespacelibecpint_1a190a564f849660c170e298aba2181d0a.rst3 Variable libecpint::maxL
13 .. doxygenvariable:: libecpint::maxL
/dports/science/dftbplus/dftbplus-19.1/prog/misc/skderivs/
H A Dskderivs.F90190 do ii = 1, maxL+1
321 integer :: angShell1(maxL+1), angShell2(maxL+1)
326 integer, parameter :: skMap(0:maxL, 0:maxL, 0:maxL) &
332 &(/maxL + 1, maxL + 1, maxL + 1/))
385 integer :: angs1(maxL+1), angs2(maxL+1)
/dports/cad/gmsh/gmsh-4.9.2-source/Mesh/
H A DqualityMeasuresJacobian.h56 inline double maxL() const { return _maxL; } in maxL() function
60 virtual bool boundsOk(double minL, double maxL) const = 0;
80 bool boundsOk(double minL, double maxL) const;
95 bool boundsOk(double minL, double maxL) const;
114 bool boundsOk(double minL, double maxL) const;
/dports/science/libecpint/libecpint-1.0.7/include/libecpint/
H A Dradial.hpp72 …void buildBessel(const std::vector<double> &r, int nr, int maxL, TwoIndex<double> &values, double …
114 …int integrate(int maxL, int gridSize, const TwoIndex<double> &intValues, GCQuadrature &grid, std::…
163 void init(int maxL, double tol = 1e-15, int small = 256, int large = 1024);
192 void type1(int maxL, int N, int offset,
/dports/science/qwalk/mainline-1.0.1-300-g1b7e381/src/basis_function/
H A DRgaussian_function.cpp40 int maxL=0, maxExpansion=0; in read() local
50 if(maxL < nlval) maxL=nlval; in read()
83 gaussexp.Resize(maxL, maxExpansion); in read()
84 gausscoeff.Resize(maxL, maxExpansion); in read()
85 radiusexp.Resize(maxL, maxExpansion); in read()
86 numExpansion.Resize(maxL); in read()
/dports/science/pcmsolver/pcmsolver-1.3.0/tests/iefpcm/
H A Diefpcm_log-spherical-diffuse-gepol-point.cpp77 int maxL = 5; variable
79 eps1, eps2, width, center, Eigen::Vector3d::Zero(), maxL);
110 int maxL = 5; variable
111 SphericalDiffuse<> gf_o(eps1, eps2, width, center, offset, maxL);
H A Diefpcm_erf-spherical-diffuse-gepol-point.cpp79 int maxL = 5; variable
81 eps1, eps2, width, center, Eigen::Vector3d::Zero(), maxL);
112 int maxL = 5; variable
113 SphericalDiffuse<OneLayerErf> gf_o(eps1, eps2, width, center, offset, maxL);
H A Diefpcm_tanh-spherical-diffuse-gepol-point.cpp80 int maxL = 5; variable
82 eps1, eps2, width, center, Eigen::Vector3d::Zero(), maxL);
113 int maxL = 5; variable
114 SphericalDiffuse<OneLayerTanh> gf_o(eps1, eps2, width, center, offset, maxL);
/dports/science/madness/madness-ebb3fd7/src/apps/polar/
H A Dgth_pseudopotential.h293 int maxL;
298 : maxL(radii.dim(0)) { in ProjStore()
300 for (int l = 0; l < maxL; l++) { in ProjStore()
418 int maxL;
422 YlmStore(World& world, int maxL, const coord_3d& center) : maxL(maxL) { in YlmStore() argument
423 for (int il = 0; il <= maxL; il++) { in YlmStore()
451 int maxL;
455 RlmStore(World& world, int maxL, const coord_3d center) : maxL(maxL) { in RlmStore() argument
457 for (int il = 0; il <= maxL; il++) { in RlmStore()
640 int maxL = atom_radii.dim(0)-1; in apply_potential() local
[all …]
/dports/graphics/luminance-qt5/luminance-hdr-2.6.1.1/src/TonemappingOperators/lischinski06/
H A Dtmo_lischinski06.cpp121 float maxL, minL; in tmo_lischinski06() local
122 …lhdrengine::findMinMaxPercentile(L.data(), L.getCols() * L.getRows(), 0.01f, minL, 0.99f, maxL, tr… in tmo_lischinski06()
126 const float maxL_log = xlogf(maxL + eps) * invLOG2; in tmo_lischinski06()
136 cout << "maxL: " << maxL << endl; in tmo_lischinski06()
215 float maxL, minL; in tmo_lischinski06() local
216 lhdrengine::findMinMaxPercentile(zones[i].data(), n, 0.5f, minL, 0.5f, maxL, true); in tmo_lischinski06()
/dports/benchmarks/ali/ali-0.7.5/vendor/github.com/mum4k/termdash/widgets/linechart/internal/zoom/
H A Dzoom.go436 maxL, err := base.Scale.CellLabel(maxCell)
441 diff := maxL.Value - minL.Value
443 return minL, maxL, nil
463 if l.Value < maxL.Value {
464 return l, maxL, nil
482 minL, maxL, err := findCellPair(base, hr.Start, hr.End-1)
487 zoom, err := newZoomedFromBase(int(minL.Value), int(maxL.Value), base, cvsAr)
555 minL, maxL, err := findCellPair(limits, minCell, maxCell)
560 zoom, err := newZoomedFromBase(int(minL.Value), int(maxL.Value), curr, cvsAr)
/dports/net/yate/yate-6.4.0-1/modules/
H A Dtonedetect.cpp314 double maxL = m_dtmfL[0].value(); in checkDtmf() local
316 if (maxL < m_dtmfL[i].value()) { in checkDtmf()
317 maxL = m_dtmfL[i].value(); in checkDtmf()
335 if ((maxL < limitOne) || in checkDtmf()
337 ((maxL+maxH) < limitAll)) { in checkDtmf()
341 c,maxL,maxH,m_pwr); in checkDtmf()
350 buf,m_id.c_str(),maxL,maxH,m_pwr); in checkDtmf()
357 buf,m_dtmfCount,m_id.c_str(),maxL,maxH,m_pwr); in checkDtmf()
361 buf,m_id.c_str(),maxL,maxH,m_pwr); in checkDtmf()
/dports/biology/canu/canu-2.2/src/stores/
H A DovStoreHistogram.C371 uint32 maxL = 0; in maxLength() local
377 for (uint32 ll=maxL; ll<_opelLen; ll++) in maxLength()
379 maxL = ll; in maxLength()
382 return(maxL * _bpb); in maxLength()
390 uint32 maxL = maxLength() / _bpb; in dumpEvalueLength() local
393 fprintf(out, "# MAX Length %u\n", maxL * _bpb); in dumpEvalueLength()
397 for (uint32 ll=0; ll<=maxL; ll++) in dumpEvalueLength()

12345678910>>...27