Searched defs:TRIES (Results 1 - 4 of 4) sorted by relevance

/external/eigen/bench/
H A DbenchCholesky.cpp22 #ifndef TRIES
23 #define TRIES 10 macro
54 for (int t=0; t<TRIES; ++t)
65 for (int t=0; t<TRIES; ++t)
96 for (int t=0; t<TRIES; ++t)
H A Dbench_reverse.cpp11 #ifndef TRIES
12 #define TRIES 20 macro
33 for (int t=0; t<TRIES; ++t)
H A DbenchEigenSolver.cpp23 #ifndef TRIES
24 #define TRIES 4 macro
55 for (int t=0; t<TRIES; ++t)
69 for (int t=0; t<TRIES; ++t)
99 for (int t=0; t<TRIES; ++t)
110 // for (int t=0; t<TRIES; ++t)
144 for (int t=0; t<TRIES; ++t)
155 for (int t=0; t<TRIES; ++t)
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
H A DSortedMapTestBase.java41 final int TRIES = 100; field in class:SortedMapTestBase
61 for (int i = 0; i < TRIES; i++) {
69 for (int i = 0; i < TRIES; i++) {
90 for (int i = 0; i < TRIES; i++) {
112 for (int i = 0; i < TRIES; i++) {
133 Map<Integer, Integer> mixin = new HashMap<Integer, Integer>(TRIES);
134 for (int i = 0; i < TRIES; i++) {
147 if (i % (N / TRIES) == 0) {
193 for (int i = 0; i < TRIES; i++) {
205 for (int i = 0; i < TRIES;
[all...]

Completed in 350 milliseconds