Home
last modified time | relevance | path

Searched refs:nIters (Results 1 – 25 of 179) sorted by relevance

12345678

/dports/devel/blitz/blitz-1.0.2/benchmarks/
H A Dhao-he.cpp36 for (int i=0; i < nIters; ++i) in version1()
52 for (int i=0; i < nIters; ++i) in version2()
73 for (int i=0; i < nIters; ++i) in version2b()
91 for (int i=0; i < nIters; ++i) in version3()
114 for (int i=0; i < nIters; ++i) in version4()
129 int run(int N, int nIters) in run() argument
133 version1(A,B,nIters); in run()
134 version2(A,B,nIters); in run()
135 version2b(A,B,nIters); in run()
136 version3(A,B,nIters); in run()
[all …]
/dports/biology/mothur/mothur-1.46.1/source/
H A Drarefact.cpp16 long long nIters, numSeqs; member
28 nIters = st; in singleRarefactData()
44 for(int iter=0;iter<params->nIters;iter++){ in singleDriver()
91 if (processors > (nIters)) { processors = nIters; } in getCurve()
94 int numItersPerProcessor = nIters / processors; in getCurve()
141 long long nIters; member
152 nIters = st; in sharedRarefactData()
183 for(int iter=0;iter<params->nIters;iter++){ in sharedDriver()
226 if (!jumble) { nIters = 1; } in getSharedCurve()
229 if (processors > (nIters)) { processors = nIters; } in getSharedCurve()
[all …]
H A Draredisplay.cpp76 nIters++; in reset()
99 data[1] = (it->second)[(int)(0.025*(nIters-1))]; in close()
100 data[2] = (it->second)[(int)(0.975*(nIters-1))]; in close()
105 nIters = 1; in close()
/dports/graphics/embree/embree-3.13.2/tutorials/collide/
H A Dpbd.h38 size_t nIters = 0; in constrainPositions() local
40 while (nIters < maxNumIterations) { in constrainPositions()
44 model.m_constraints_[i]->solvePositionConstraint (model, timeStep, nIters); in constrainPositions()
47 ++nIters; in constrainPositions()
50 nIters = 0; in constrainPositions()
52 while (nIters < 1) { in constrainPositions()
56 model.c_constraints_[i]->solvePositionConstraint (model, timeStep, nIters); in constrainPositions()
59 ++nIters; in constrainPositions()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/opt/sbd/
H A DsbdLut.c131 int m, nIters, iLit = 0; in Sbd_ProblemPrintSolution() local
137 for ( m = 0; m < nIters; m++, iLit++ ) in Sbd_ProblemPrintSolution()
149 int m, nIters, iLit = 0; in Sbd_ProblemCollectSolution() local
155 nIters = 1 << pStr->nVarIns; in Sbd_ProblemCollectSolution()
156 for ( m = 0; m < nIters; m++, iLit++ ) in Sbd_ProblemCollectSolution()
163 nIters = 0; in Sbd_ProblemCollectSolution()
168 nIters++; in Sbd_ProblemCollectSolution()
170 assert( nIters == 1 ); in Sbd_ProblemCollectSolution()
211 int i, iVar, iLit, nIters; in Sbd_ProblemSolve() local
242 for ( nIters = 0; nIters < (1 << nVars); nIters++ ) in Sbd_ProblemSolve()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/base/abci/
H A DabcReach.c150 int i, nIters, nBddSize; in Abc_NtkComputeReachable() local
172 for ( nIters = 1; nIters <= nIterMax; nIters++ ) in Abc_NtkComputeReachable()
194 printf( "The miter is proved REACHABLE in %d iterations. ", nIters ); in Abc_NtkComputeReachable()
209 fprintf( stdout, "Iteration = %3d. BDD = %5d. ", nIters, nBddSize ); in Abc_NtkComputeReachable()
235 if ( nIters > nIterMax || Cudd_DagSize(bReached) > nBddMax ) in Abc_NtkComputeReachable()
236 fprintf( stdout, "Reachability analysis is stopped after %d iterations.\n", nIters ); in Abc_NtkComputeReachable()
238 fprintf( stdout, "Reachability analysis completed in %d iterations.\n", nIters ); in Abc_NtkComputeReachable()
244 if ( nIters > nIterMax || Cudd_DagSize(bReached) > nBddMax ) in Abc_NtkComputeReachable()
245 printf( "Verified ONLY FOR STATES REACHED in %d iterations. \n", nIters ); in Abc_NtkComputeReachable()
246 printf( "The miter is proved unreachable in %d iteration. ", nIters ); in Abc_NtkComputeReachable()
H A DabcQbf.c69 int nIters, nInputs, RetValue, fFound = 0; in Abc_NtkQbf() local
136 for ( nIters = 0; nIters < nItersMax; nIters++ ) in Abc_NtkQbf()
191 printf( "Iter %2d : ", nIters+1 ); in Abc_NtkQbf()
207 printf( "Solved after %d iterations. ", nIters ); in Abc_NtkQbf()
209 else if ( nIters == nItersMax ) in Abc_NtkQbf()
/dports/graphics/py-gdal/gdal-3.3.3/gcore/
H A Drasterio_ssse3.cpp40 GInt64 nIters );
44 GInt64 nIters ) in GDALUnrolledCopy_GByte_3_1_SSSE3() argument
46 decltype(nIters) i; in GDALUnrolledCopy_GByte_3_1_SSSE3()
61 for ( i = 0; i < nIters - 16; i += 16 ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
81 for( ; i < nIters; i++ ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
/dports/graphics/p5-Geo-GDAL/gdal-3.3.3/gcore/
H A Drasterio_ssse3.cpp40 GInt64 nIters );
44 GInt64 nIters ) in GDALUnrolledCopy_GByte_3_1_SSSE3() argument
46 decltype(nIters) i; in GDALUnrolledCopy_GByte_3_1_SSSE3()
61 for ( i = 0; i < nIters - 16; i += 16 ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
81 for( ; i < nIters; i++ ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
/dports/graphics/gdal/gdal-3.3.3/gcore/
H A Drasterio_ssse3.cpp40 GInt64 nIters );
44 GInt64 nIters ) in GDALUnrolledCopy_GByte_3_1_SSSE3() argument
46 decltype(nIters) i; in GDALUnrolledCopy_GByte_3_1_SSSE3()
61 for ( i = 0; i < nIters - 16; i += 16 ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
81 for( ; i < nIters; i++ ) in GDALUnrolledCopy_GByte_3_1_SSSE3()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/llb/
H A Dllb2Core.c214 int nIters, nBddSize;//, iOutFail = -1; in Llb_CoreReachability_int() local
287 for ( nIters = 0; nIters < p->pPars->nIterMax; nIters++ ) in Llb_CoreReachability_int()
295 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
307 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
331 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
343 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
362 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
439 p->pPars->iFrame = nIters; in Llb_CoreReachability_int()
447 p->pPars->iFrame = nIters - 1; in Llb_CoreReachability_int()
469 if ( nIters >= p->pPars->nIterMax ) in Llb_CoreReachability_int()
[all …]
H A Dllb3Nonlin.c472 for ( nIters = 0; nIters < p->pPars->nIterMax; nIters++ ) in Llb_NonlinReachability()
480 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
491 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
512 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
527 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
545 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
568 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
580 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
598 p->pPars->iFrame = nIters - 1; in Llb_NonlinReachability()
654 p->pPars->iFrame = nIters; in Llb_NonlinReachability()
[all …]
H A Dllb1Reach.c590 int nIters, nBddSize = 0; in Llb_ManReachability() local
661 for ( nIters = 0; nIters < p->pPars->nIterMax; nIters++ ) in Llb_ManReachability()
669 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
683 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
707 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
734 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
761 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
811 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
837 fprintf( stdout, "F =%5d : ", nIters ); in Llb_ManReachability()
858 p->pPars->iFrame = nIters - 1; in Llb_ManReachability()
[all …]
H A Dllb4Nonlin.c739 for ( nIters = 0; nIters < p->pPars->nIterMax; nIters++ ) in Llb_Nonlin4Reachability()
747 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
767 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
778 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
792 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
814 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
835 p->pPars->iFrame = nIters - 1; in Llb_Nonlin4Reachability()
846 printf( "I =%5d : ", nIters ); in Llb_Nonlin4Reachability()
863 if ( nIters == p->pPars->nIterMax - 1 ) in Llb_Nonlin4Reachability()
867 p->pPars->iFrame = nIters; in Llb_Nonlin4Reachability()
[all …]
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/bbr/
H A DbbrReach.c248 int i, nIters, nBddSize = 0, status; in Aig_ManComputeReachable() local
282 for ( nIters = 0; nIters < pPars->nIterMax; nIters++ ) in Aig_ManComputeReachable()
294 pPars->iFrame = nIters - 1; in Aig_ManComputeReachable()
312 pPars->iFrame = nIters - 1; in Aig_ManComputeReachable()
345 pPars->iFrame = nIters; in Aig_ManComputeReachable()
362 fprintf( stdout, "Frame = %3d. BDD = %5d. ", nIters, nBddSize ); in Aig_ManComputeReachable()
402 if ( nIters > pPars->nIterMax || nBddSize > pPars->nBddMax ) in Aig_ManComputeReachable()
417 pPars->iFrame = nIters - 1; in Aig_ManComputeReachable()
420 assert(nIters >= pPars->nIterMax || nBddSize >= pPars->nBddMax); in Aig_ManComputeReachable()
422 printf( "Verified only for states reachable in %d frames. ", nIters ); in Aig_ManComputeReachable()
[all …]
/dports/science/silo/silo-4.10.2-bsd/tests/
H A Dlargefile.c144 int nIters = 2500; in main() local
153 nIters = 1990; in main()
174 for (j = 0; j < nIters; j++) in main()
179 printf("Iterations %04d to %04d of %04d\n", j, j+100-1, nIters); in main()
221 int n = rand() % 500 + (j >= 50 ? (nIters-500) : 0); in main()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/reo/
H A DreoApi.c64 p->nIters = 1; in Extra_ReorderInit()
192 void Extra_ReorderSetIterations( reo_man * p, int nIters ) in Extra_ReorderSetIterations() argument
194 p->nIters = nIters; in Extra_ReorderSetIterations()
/dports/science/clhep/2.4.1.0/CLHEP/GenericFunctions/src/
H A DFunctionNumDeriv.cc77 int nIters; in numericalDerivative() local
98 for ( nIters = 0; nIters < nItersMax; ++nIters ) { in numericalDerivative()
100 double h = h0 * adjustmentFactor[nIters]; in numericalDerivative()
/dports/math/octave-forge-matgeom/matgeom-1.2.3/inst/meshes3d/
H A DaverageMesh.m50 nIters = 10; variable
62 elseif strcmpi(name, 'nIters')
63 nIters = varargin{2}; variable
84 refVerticesIters = cell(1, nIters);
85 distListIters = cell(1, nIters);
90 for iIter = 1:nIters
92 fprintf('iter %d/%d\n', iIter, nIters);
/dports/math/stanmath/math-4.2.0/lib/tbb_2020.3/src/test/
H A Dtest_critical_section.cpp49 int nIters = MAX_WORK/nThread; in operator ()() local
52 for(int j = 0; j < nIters; j++) { in operator ()()
60 if(test_throw && j == (nIters / 2)) { in operator ()()
104 int nIters = MAX_WORK/nThread; in operator ()() local
107 for(int j = 0; j < nIters; j++) { in operator ()()
/dports/devel/tbb/oneTBB-2020.3/src/test/
H A Dtest_critical_section.cpp49 int nIters = MAX_WORK/nThread; in operator ()() local
52 for(int j = 0; j < nIters; j++) { in operator ()()
60 if(test_throw && j == (nIters / 2)) { in operator ()()
104 int nIters = MAX_WORK/nThread; in operator ()() local
107 for(int j = 0; j < nIters; j++) { in operator ()()
/dports/devel/taskflow/taskflow-3.2.0/3rd-party/tbb/src/test/
H A Dtest_critical_section.cpp49 int nIters = MAX_WORK/nThread; in operator ()() local
52 for(int j = 0; j < nIters; j++) { in operator ()()
60 if(test_throw && j == (nIters / 2)) { in operator ()()
104 int nIters = MAX_WORK/nThread; in operator ()() local
107 for(int j = 0; j < nIters; j++) { in operator ()()
/dports/science/rdkit/rdkit-Release_2021_03_5/Code/Numerics/Optimizer/
H A DtestOptimizer.cpp138 unsigned int nIters; in test2() local
149 BFGSOpt::minimize(dim, oLoc, 1e-4, nIters, nVal, func, gradFunc); in test2()
150 TEST_ASSERT(nIters = 1); in test2()
159 BFGSOpt::minimize(dim, oLoc, 1e-4, nIters, nVal, func, gradFunc); in test2()
168 BFGSOpt::minimize(dim, oLoc, 1e-4, nIters, nVal, func, gradFunc, 1e-8); in test2()
/dports/science/lammps/lammps-stable_29Sep2021/src/KOKKOS/
H A Dfix_rx_kokkos.h48 int nSteps, nIters, nFuncs, nFails; member
51 s_CounterType() : nSteps(0), nIters(0), nFuncs(0), nFails(0) {}; in s_CounterType()
57 nIters += rhs.nIters;
67 nIters += rhs.nIters;
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/aig/gia/
H A DgiaSwitch.c37 int nIters; // the number of timeframes member
81 p->nIters = 48; // the number of all timeframes to simulate in Gia_ManSetDefaultParamsSwi()
582 for ( i = 0; i < pPars->nIters; i++ ) in Gia_ManSwiSimulate()
585 if ( i == pPars->nIters - 1 ) in Gia_ManSwiSimulate()
594 printf( "Simulated %d frames with %d words. ", pPars->nIters, pPars->nWords ); in Gia_ManSwiSimulate()
603 …pSwitching[i] = Gia_ManSwiComputeProbOne( p->pData1[i], pPars->nWords*(pPars->nIters-pPars->nPref)… in Gia_ManSwiSimulate()
615 …pSwitching[i] = Gia_ManSwiComputeProbOne( p->pData1[i], pPars->nWords*(pPars->nIters-pPars->nPref)… in Gia_ManSwiSimulate()
620 …pSwitching[i] = Gia_ManSwiComputeSwitching( p->pData1[i], pPars->nWords*(pPars->nIters-pPars->nPre… in Gia_ManSwiSimulate()
664 pPars->nIters = nFrames; // set number of total timeframes in Gia_ManComputeSwitchProbs()
666 pPars->nIters = atoi( Abc_FrameReadFlag("seqsimframes") ); in Gia_ManComputeSwitchProbs()

12345678