| /external/eigen/test/ |
| sparseLM.cpp | 161 int maxiter = 200; local
163 MatrixXd Err(values, maxiter);
164 MatrixXd Mod(values, maxiter);
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| repr.py | 41 def _repr_iterable(self, x, level, left, right, maxiter, trail=''):
48 pieces = [repr1(elem, newlevel) for elem in islice(x, maxiter)]
49 if n > maxiter: pieces.append('...')
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| repr.py | 41 def _repr_iterable(self, x, level, left, right, maxiter, trail=''):
48 pieces = [repr1(elem, newlevel) for elem in islice(x, maxiter)]
49 if n > maxiter: pieces.append('...')
|
| /external/iptables/libxtables/ |
| xtoptions.c | 289 unsigned int maxiter; local
294 maxiter = entry->size / esize;
295 if (maxiter == 0)
296 maxiter = ARRAY_SIZE(cb->val.u32_range);
303 if (cb->nvals == maxiter)
306 cb->ext_name, entry->name, maxiter);
620 unsigned int maxiter; local
627 maxiter = entry->size / esize;
628 if (maxiter == 0)
629 maxiter = 2; /* ARRAY_SIZE(cb->val.port_range) *
[all...] |
| /external/opencv/cxcore/src/ |
| cxutils.cpp | 448 * reciprocals in maxiter iterations, the convergence requirement will be
466 static void icvFindPolynomialRoots(const double *a, double *u, int n, int maxiter, int fig)
541 for (i = maxiter; i > 0; i--) {
642 void cvSolvePoly(const CvMat* a, CvMat *r, int maxiter, int fig)
677 icvFindPolynomialRoots( ad, rd, n, maxiter, fig);
[all...] |
| /external/opencv/cxcore/include/ |
| cxcore.h | 693 int maxiter CV_DEFAULT(0), int fig CV_DEFAULT(0));
[all...] |
| /prebuilts/tools/common/m2/repository/org/freemarker/freemarker/2.3.20/ |
| freemarker-2.3.20.jar | |
