HomeSort by relevance Sort by last modified time
    Searched defs:worst (Results 1 - 8 of 8) sorted by null

  /external/chromium_org/third_party/smhasher/src/
AvalancheTest.cpp 39 double worst = 0; local
47 if(d > worst)
49 worst = d;
53 return worst;
Stats.h 127 double worst = 0; local
158 if(n > worst)
160 worst = n;
179 double pct = worst * 100.0;
181 printf("Worst bias is the %3d-bit window at bit %3d - %5.3f%%",worstWidth,worstStart,pct);
185 return worst;
309 double worst = 0; local
338 if(s > worst)
340 worst = s;
347 return worst;
    [all...]
  /external/eigen/bench/
BenchTimer.h 105 /** Return the worst elapsed time in seconds
107 inline double worst(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 103 unsigned worst, reverseWorst; member in struct:PBQP::Heuristics::Briggs::EdgeData
107 EdgeData() : worst(0), reverseWorst(0), isUpToDate(false) {}
321 ed.worst = 0;
337 if (colInfCounts[j] > ed.worst) {
338 ed.worst = colInfCounts[j];
366 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
393 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
  /external/speex/libspeex/
jitter.c 186 int worst = 0; local
230 worst = latest;
257 deltaT = best-worst;
260 /*fprintf(stderr, "auto_tradeoff = %d (%d %d %d)\n", jitter->auto_tradeoff, best, worst, i);*/
  /external/chromium_org/third_party/mesa/src/src/mesa/main/
texcompress_fxt1.c 315 GLint i, k, worst = -1; local
325 worst = k;
329 return worst;
546 GLint worst = fxt1_worst(vec[j], input, nc, n); local
548 vec[j][i] = input[worst][i];
    [all...]
  /external/mesa3d/src/mesa/main/
texcompress_fxt1.c 315 GLint i, k, worst = -1; local
325 worst = k;
329 return worst;
546 GLint worst = fxt1_worst(vec[j], input, nc, n); local
548 vec[j][i] = input[worst][i];
    [all...]
  /prebuilts/misc/common/icu4j/
icu4j.jar 

Completed in 2334 milliseconds