HomeSort by relevance Sort by last modified time
    Searched refs:TRIES (Results 1 - 5 of 5) sorted by null

  /external/eigen/bench/
bench_reverse.cpp 11 #ifndef TRIES
12 #define TRIES 20
33 for (int t=0; t<TRIES; ++t)
benchCholesky.cpp 22 #ifndef TRIES
23 #define TRIES 10
54 for (int t=0; t<TRIES; ++t)
65 for (int t=0; t<TRIES; ++t)
96 for (int t=0; t<TRIES; ++t)
benchEigenSolver.cpp 23 #ifndef TRIES
24 #define TRIES 4
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)
BenchTimer.h 163 #define BENCH(TIMER,TRIES,REP,CODE) { \
165 for(int uglyvarname1=0; uglyvarname1<TRIES; ++uglyvarname1){ \
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
SortedMapTestBase.java 41 final int TRIES = 100;
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; i++)
    [all...]

Completed in 2852 milliseconds