| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| H A D | NelderMead.java | 85 final RealPointValuePair worst = simplex[n];
86 final double[] xWorst = worst.getPointRef();
89 // (dismissing the worst point at index n)
134 if (comparator.compare(reflected, worst) < 0) {
158 if (comparator.compare(inContracted, worst) < 0) {
|
| /external/autotest/client/tests/monotonic_time/src/ |
| H A D | time_test.c | 144 int64_t worst; /* worst backward time jump */ member in struct:test_info
152 INFO("new %s-warp maximum: %9"PRId64, test->name, test->worst);
174 if (delta < test->worst) { \
175 test->worst = delta; \
298 printf("FAIL: %s-worst-warp=%"PRId64"\n",
299 test->name, test->worst);
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| H A D | Briggs.h | 104 unsigned worst, reverseWorst; member in struct:PBQP::Heuristics::Briggs::EdgeData
108 EdgeData() : worst(0), reverseWorst(0), isUpToDate(false) {}
322 ed.worst = 0;
338 if (colInfCounts[j] > ed.worst) {
339 ed.worst = colInfCounts[j];
367 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
394 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
|
| /external/python/cpython3/Lib/ |
| H A D | timeit.py | 350 worst = max(r)
351 if worst >= best * 4:
352 usec = worst * 1e6 / number
355 "The test results are likely unreliable. The worst\n"
|
| /external/webp/src/enc/ |
| H A D | backward_references_enc.c | 847 VP8LBackwardRefs* worst) {
866 res = BackwardReferencesRle(width, height, argb, 0, worst);
871 res = BackwardReferencesLz77(width, height, argb, 0, hash_chain, worst);
876 &hash_chain_box, worst);
884 if (!CalculateBestCacheSize(argb, quality, worst, &cache_bits_tmp)) {
888 if (!BackwardRefsWithLocalCache(argb, cache_bits_tmp, worst)) {
894 VP8LHistogramCreate(histo, worst, cache_bits_tmp);
897 VP8LBackwardRefs* const tmp = worst;
898 worst = best;
914 hash_chain_tmp, best, worst)) {
843 GetBackwardReferences( int width, int height, const uint32_t* const argb, int quality, int lz77_types_to_try, int* const cache_bits, const VP8LHashChain* const hash_chain, VP8LBackwardRefs* best, VP8LBackwardRefs* worst) argument
[all...] |
| /external/ltp/pan/ |
| H A D | tag_report.c | 101 * (a) keep track of the "worst case" in this *TAG*
444 /* keep "worst case" */
455 * Determine a "worst case" status from two given statuses.
459 /* NULL-terminated table, ordered from worst-case to best-case */
460 static char *worst[] = { local
469 for (w1 = worst; *w1 != NULL && strcmp(t1, *w1); w1++) ;
471 for (w2 = worst; *w2 != NULL && strcmp(t2, *w2); w2++) ;
|
| /external/eigen/bench/ |
| H A D | BenchTimer.h | 112 /** Return the worst elapsed time in seconds
114 inline double worst(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /external/nanopb-c/generator/ |
| H A D | nanopb_generator.py | 816 worst = 0
826 elif status > worst:
827 worst = status
830 if worst > 255 or checks:
833 if worst > 65535 or checks:
835 if worst > 65535:
850 if worst < 65536:
852 if worst > 255:
|
| /external/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| H A D | grow_stats.cc | 232 worst; local
241 if (worst.size() < to_remove) {
242 worst.push(std::pair<float, int>(split_score, i));
244 } else if (worst.top().first < split_score) {
245 indices.erase(worst.top().second);
246 worst.pop();
247 worst.push(std::pair<float, int>(split_score, i));
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| H A D | RenderMachineFunction.cpp | 380 unsigned worst = 0; local
395 if (trc1RegWorst > worst) {
396 worst = trc1RegWorst;
400 if (worst != 0) {
401 classLine[trc2] = worst;
|
| /external/fec/ |
| H A D | sse2bfly27.s | 71 # code because the worst-case metric spread (at high Eb/No) is only 120,
128 # determined worst-case metric spread for this code and branch metrics in the range 0-30.
|
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| H A D | LocaleMatcher.java | 491 final double worst; field in class:LocaleMatcher.Level
494 worst = d;
553 System.out.println("\t\t\t\tNOTFOUND\t" + level.worst);
555 return level.worst;
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| H A D | LocaleMatcher.java | 498 final double worst; field in class:LocaleMatcher.Level
501 worst = d;
560 System.out.println("\t\t\t\tNOTFOUND\t" + level.worst);
562 return level.worst;
|
| /external/speex/libspeex/ |
| H A D | 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/mesa3d/src/mesa/main/ |
| H A D | texcompress_fxt1.c | 287 GLint i, k, worst = -1; local
297 worst = k;
301 return worst;
518 GLint worst = fxt1_worst(vec[j], input, nc, n); local
520 vec[j][i] = input[worst][i];
|
| /external/libvpx/libvpx/vp9/encoder/ |
| H A D | vp9_encoder.h | 351 double worst; member in struct:IMAGE_STAT
|
| H A D | vp9_encoder.c | 2076 cpi->psnr.worst = 100.0;
2096 cpi->fastssim.worst = 100.0;
2098 cpi->psnrhvs.worst = 100.0;
2358 cpi->psnrhvs.stat[ALL] / cpi->count, cpi->psnr.worst,
2359 cpi->worst_ssim, cpi->fastssim.worst, cpi->psnrhvs.worst,
4835 s->worst = VPXMIN(s->worst, all);
|
| /external/conscrypt/benchmark-android/ |
| H A D | vogar.jar | META-INF/ META-INF/MANIFEST.MF vogar/ vogar/TestProperties.class TestProperties.java package vogar ... |