| /external/eigen/Eigen/src/Eigenvalues/ |
| RealQZ.h | 172 /** \brief Returns number of performed QR-like iterations.
174 Index iterations() const function in class:Eigen::RealQZ
180 /** Sets the maximal number of iterations allowed to converge to one eigenvalue
617 // check if we converged before reaching iterations limit
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| Scaling.h | 182 int m_maxits; // Maximum number of iterations allowed
|
| /external/eigen/unsupported/Eigen/src/LevenbergMarquardt/ |
| LMpar.h | 127 /* is zero or the number of iterations has reached 10. */
|
| /external/fio/t/ |
| lfsr-test.c | 20 "spin: how many iterations before we produce a number\n"
|
| /external/icu/icu4c/source/test/intltest/ |
| numfmtst.h | 323 void checkRounding(DecimalFormat* df, double base, int iterations, double increment);
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| ValueIterator.java | 14 * <p>The ValueIterator allows iterations over integer indexes in the range
|
| /external/libdrm/tests/ |
| random.c | 109 printf("After 10000 iterations: %lu (%lu expected): %s\n",
|
| /external/libopus/silk/ |
| define.h | 132 /* Maximum numbers of iterations used to stabilize an LPC vector */
|
| /external/libunwind/tests/ |
| ia64-test-stack-asm.S | 86 // for even iterations, allocate a local variable:
|
| test-async-sig.c | 122 panic ("FAILURE: unw_step() looping over %d iterations\n", depth);
|
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionAliasAnalysis.cpp | 15 // dependencies between different iterations.
|
| /external/llvm/lib/Transforms/Scalar/ |
| LoopInstSimplify.cpp | 118 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/lib/Transforms/Utils/ |
| SimplifyInstructions.cpp | 69 // simplify all instructions. On later iterations ToSimplify is not
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| 2008-08-04-LongAddRec.ll | 2 ; RUN: -scalar-evolution-max-iterations=0 | FileCheck %s
|
| SolveQuadraticEquation.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
|
| trip-count.ll | 1 ; RUN: opt < %s -analyze -scalar-evolution -scalar-evolution-max-iterations=0 | FileCheck %s
|
| trip-count10.ll | 78 ; Trip counts for non-polynomial iterations. It's theoretically possible
|
| /external/mesa3d/src/gallium/state_trackers/d3d1x/docs/ |
| coding_style.txt | 67 Try to use typedefs for STL maps on which you need to declare iterations, as well as function pointers or other "weird" C types.
|
| /external/opencv3/3rdparty/libwebp/utils/ |
| quant_levels.c | 78 // k-Means iterations.
|
| /external/opencv3/doc/py_tutorials/py_ml/py_kmeans/py_kmeans_understanding/ |
| py_kmeans_understanding.markdown | 62 *(Or it may be stopped depending on the criteria we provide, like maximum number of iterations, or a
|
| /external/opencv3/modules/ts/include/opencv2/ts/ |
| ocl_perf.hpp | 103 for(declare.iterations(n), cvtest::ocl::perf::safeFinish(); startTimer(), next(); cvtest::ocl::perf::safeFinish(), stopTimer())
|
| /external/opencv3/samples/gpu/ |
| pyrlk_optical_flow.cpp | 89 "{ iters | 30 | specify iterations count [PyrLK] }"
|
| /external/regex-re2/util/ |
| sparse_set.h | 162 // Can sort the sparse array so that future iterations
|
| /external/skia/src/pathops/ |
| SkPathOpsTypes.cpp | 196 // cube root approximation using 3 iterations of Halley's method (double)
|
| /external/skia/tests/ |
| GrMemoryPoolTest.cpp | 191 // number of iterations
|
