| /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/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/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/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/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;
|
| /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
|
| /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/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/tensorflow/tensorflow/contrib/tensor_forest/kernels/v4/ |
| 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));
[all...] |
| /system/core/logd/ |
| LogBuffer.cpp | 559 // pruning for worst UID.
669 // the worst offender by logging source. Thus the logs slowly loose content
674 // The first loop performs blacklisting and worst offender pruning. Falling
675 // through when there are no notable worst offenders and have not hit the
676 // region lock preventing further worst offender pruning. This loop also looks
760 // prune by worst offenders; by blacklist, UID, and by PID of system UID
763 // recalculate the worst offender on every batched pass
764 int worst = -1; // not valid for getUid() or getKey() local
775 .findWorst(worst, worst_sizes, second_worst_sizes,
780 .findWorst(worst, worst_sizes, second_worst_sizes
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/util/ |
| 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;
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| 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;
[all...] |
| /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...] |
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_encoder.h | 351 double worst; member in struct:IMAGE_STAT
|
| /prebuilts/misc/common/icu4j/ |
| icu4j.jar | |
| /prebuilts/misc/common/robolectric/3.1.1/lib/ |
| icu4j-53.1.jar | |
| /prebuilts/misc/common/robolectric/3.4.2/lib/ |
| icu4j-53.1.jar | |
| /prebuilts/misc/common/robolectric/3.5.1/lib/ |
| icu4j-53.1.jar | |
| /prebuilts/misc/common/robolectric/3.6.1/lib/ |
| icu4j-53.1.jar | |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/53.1/ |
| icu4j-53.1.jar | |
| /prebuilts/tools/common/m2/repository/com/ibm/icu/icu4j/54.1.1/ |
| icu4j-54.1.1.jar | |
