| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| NelderMead.java | 85 final RealPointValuePair worst = simplex[n]; local
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/ |
| 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/ |
| 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;
|
| /system/core/logd/ |
| LogBuffer.cpp | 551 // pruning for worst UID.
661 // the worst offender by logging source. Thus the logs slowly loose content
666 // The first loop performs blacklisting and worst offender pruning. Falling
667 // through when there are no notable worst offenders and have not hit the
668 // region lock preventing further worst offender pruning. This loop also looks
752 // prune by worst offenders; by blacklist, UID, and by PID of system UID
755 // recalculate the worst offender on every batched pass
756 int worst = -1; // not valid for getUid() or getKey() local
767 .findWorst(worst, worst_sizes, second_worst_sizes,
772 .findWorst(worst, worst_sizes, second_worst_sizes
[all...] |
| LogStatistics.h | 643 void findWorst(int& worst, size_t& worst_sizes, size_t& second_worst_sizes,
651 worst = sorted[0]->getKey();
660 void findWorst(int& worst, size_t worst_sizes, size_t& second_worst_sizes) {
662 worst = sorted[0]->getKey();
|
| /external/ltp/pan/ |
| 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/ |
| BenchTimer.h | 112 /** Return the worst elapsed time in seconds
114 inline double worst(int TIMER = CPU_TIMER) const function in class:Eigen::BenchTimer
|
| /system/libhwbinder/vts/performance/ |
| PerfTest.cpp | 152 double worst = (double)worst_ / 1.0E6; local
156 << ", \"wst\":" << setw(W) << left << worst << ", \"bst\":" << setw(W) << left << best
|
| Benchmark_throughput.cpp | 113 // e.g. best/worst/total_time.
136 double worst = (double) m_worst / 1.0E6; local
140 << "ms worst:"
141 << worst
|
| /external/nanopb-c/generator/ |
| 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
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| RenderMachineFunction.cpp | 345 "Worst map already initialised?");
380 unsigned worst = 0; local
395 if (trc1RegWorst > worst) {
396 worst = trc1RegWorst;
400 if (worst != 0) {
401 classLine[trc2] = worst;
[all...] |
| /external/v8/tools/ |
| csvparser.js | 70 // in the worst case the match will be an empty string.
|
| /frameworks/native/libs/binder/tests/ |
| binderThroughputTest.cpp | 145 double worst = (double)m_worst / 1.0E6; local
147 cout << "average:" << average << "ms worst:" << worst << "ms best:" << best << "ms" << endl;
|
| schd-dbg.cpp | 246 double worst = (double)m_worst / 1.0E6; local
251 << average << ",\"wst\":" << setw(W) << left << worst
|
| /prebuilts/go/darwin-x86/src/runtime/ |
| mem_windows.go | 43 // in the worst case, but that's fast enough.
|
| mgcsweep.go | 370 // deductSweepCredit makes a worst-case assumption that all spanBytes
402 // offsets the worst-case charge performed by deductSweepCredit.
|
| /prebuilts/go/linux-x86/src/runtime/ |
| mem_windows.go | 43 // in the worst case, but that's fast enough.
|
| mgcsweep.go | 370 // deductSweepCredit makes a worst-case assumption that all spanBytes
402 // offsets the worst-case charge performed by deductSweepCredit.
|
| /external/fec/ |
| 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/ |
| LocaleMatcher.java | 486 final double worst; field in class:LocaleMatcher.Level
489 worst = d;
548 System.out.println("\t\t\t\tNOTFOUND\t" + level.worst);
550 return level.worst;
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| LocaleMatcher.java | 493 final double worst; field in class:LocaleMatcher.Level
496 worst = d;
555 System.out.println("\t\t\t\tNOTFOUND\t" + level.worst);
557 return level.worst;
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/EbcDxe/X64/ |
| EbcLowLevel.asm | 87 ; Considering the worst case, load 4 potiential arguments
|
| /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/mesa3d/src/mesa/main/ |
| 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];
[all...] |
| /art/build/ |
| art.go | 75 // the debug version. So make the gap consistent (and adjust for the worst).
|
