| /external/webp/src/enc/ |
| alpha_enc.c | 33 // prediction modes 0 to 3 and pick the best one.
203 // Quick estimate of the best candidate.
213 // For large number of colors, try FILTER_NONE in addition to the best
238 FilterTrial best; local
241 InitFilterTrial(&best);
253 if (ok && trial.score < best.score) {
254 VP8BitWriterWipeOut(&best.bw);
255 best = trial;
264 reduce_levels, effort_level, NULL, &best);
268 stats->lossless_features = best.stats.lossless_features
[all...] |
| /art/test/993-breakpoints/src/art/ |
| Breakpoint.java | 59 int best = -1; local
64 best = l.line;
67 return best;
174 int best = -1; local
179 best = l.line;
182 return best;
|
| /art/test/994-breakpoint-line/src/art/ |
| Breakpoint.java | 59 int best = -1; local
64 best = l.line;
67 return best;
174 int best = -1; local
179 best = l.line;
182 return best;
|
| /art/test/995-breakpoints-throw/src/art/ |
| Breakpoint.java | 59 int best = -1; local
64 best = l.line;
67 return best;
174 int best = -1; local
179 best = l.line;
182 return best;
|
| /art/test/996-breakpoint-obsolete/src/art/ |
| Breakpoint.java | 59 int best = -1; local
64 best = l.line;
67 return best;
174 int best = -1; local
179 best = l.line;
182 return best;
|
| /art/test/997-single-step/src/art/ |
| Breakpoint.java | 59 int best = -1; local
64 best = l.line;
67 return best;
174 int best = -1; local
179 best = l.line;
182 return best;
|
| /external/skia/tests/ |
| StrokerTest.cpp | 150 int best = 0; local
161 if (best < gMaxRecursion[2]) {
169 best = gMaxRecursion[2];
178 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
229 int best = 0; local
253 if (best < gMaxRecursion[2]) {
261 best = gMaxRecursion[2];
270 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
339 int best = 0; local
357 if (best < gMaxRecursion[2])
384 int best[2] = { 0 }; local
[all...] |
| /external/openssh/ |
| dh.c | 150 int best, bestcount, which; local
161 best = bestcount = 0;
172 if ((dhg.size > wantbits && dhg.size < best) ||
173 (dhg.size > best && best < wantbits)) {
174 best = dhg.size;
177 if (dhg.size == best)
194 dhg.size != best ||
|
| /external/syslinux/extlinux/ |
| mountinfo.c | 199 const struct mountinfo *m, *best; local
221 best = NULL;
236 best = m;
240 if (best && subpath) {
241 if (real_path[best->pathlen] == '\0')
244 *subpath = strdup(real_path + best->pathlen);
247 return best;
|
| /external/zopfli/src/zopfli/ |
| blocksplitter.c | 46 double best = ZOPFLI_LARGE_FLOAT; local
51 if (v < best) {
52 best = v;
64 double best; local
76 best = vp[0];
78 if (vp[i] < best) {
79 best = vp[i];
83 if (best > lastbest) break;
89 lastbest = best;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/direct/ |
| MultiDirectional.java | 71 final RealPointValuePair best = original[0]; local
75 if (comparator.compare(reflected, best) < 0) {
91 if (comparator.compare(contracted, best) < 0) {
113 * @param comparator comparator to use to sort simplex vertices from best to poorest
114 * @return best point in the transformed simplex
|
| NelderMead.java | 83 final RealPointValuePair best = simplex[0]; local
88 // compute the centroid of the best vertices
109 if ((comparator.compare(best, reflected) <= 0) &&
115 } else if (comparator.compare(reflected, best) < 0) {
|
| /external/syslinux/com32/sysdump/ |
| rbtree.c | 51 struct rbtree *best = NULL; local
59 best = tree;
63 return best;
|
| /frameworks/minikin/libs/minikin/ |
| Measurement.cpp | 104 size_t best = searchStart; local
114 best = i;
121 return best;
|
| /external/eigen/bench/ |
| benchCholesky.cpp | 81 << (timerNoSqrt.best()) / repeats << "s "
82 << "(" << 1e-9 * cost*repeats/timerNoSqrt.best() << " GFLOPS)\t"
83 << (timerSqrt.best()) / repeats << "s "
84 << "(" << 1e-9 * cost*repeats/timerSqrt.best() << " GFLOPS)\n";
|
| sparse_dense_product.cpp | 80 std::cout << " a * v:\t" << timer.best() << " " << double(REPEAT)/timer.best() << " * / sec " << endl;
87 std::cout << " a' * v:\t" << timer.best() << endl;
96 std::cout << " a * v:\t" << timer.best()/REPEAT << " " << double(REPEAT)/timer.best(REAL_TIMER) << " * / sec " << endl;
101 std::cout << " a' * v:\t" << timer.best()/REPEAT << endl;
|
| eig33.cpp | 179 std::cout << "Eigen iterative: " << t.best() << "s\n";
182 std::cout << "Eigen direct : " << t.best() << "s\n";
187 std::cout << "Direct: " << t.best() << "s\n\n";
|
| /external/clang/utils/ |
| FindSpecRefs | 604 best = None
625 if best is None or dist < best[0]:
626 best = (dist, (section, name, page))
627 return best[1]
637 best = None
641 if best is None or dist < best[0]:
642 best = (dist,'l'+m.group(1))
644 if best is not None
[all...] |
| CmpDriver | 53 best = None
57 if best is None or candidate < best[0]:
58 best = (candidate, a_0, j)
59 a = best[1]
|
| /external/fio/ |
| workqueue.c | 25 struct submit_worker **best)
33 if (!(*best) || sw->seq < (*best)->seq)
34 *best = sw;
44 struct submit_worker *sw, *best = NULL; local
48 sw = __get_submit_worker(wq, next, wq->max_workers - 1, &best);
50 sw = __get_submit_worker(wq, 0, next - 1, &best);
53 * No truly idle found, use best match
56 sw = best;
|
| /external/icu/icu4j/demos/src/com/ibm/icu/dev/demo/translit/ |
| demo.bat | 11 REM For best results, run the demo as an applet inside of Netscape
|
| /external/libvpx/libvpx/vp8/encoder/ |
| encodemb.c | 170 int best; local
231 /* And pick the best. */
232 best = rd_cost1 < rd_cost0;
236 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
237 tokens[i][0].error = d2 + (best ? error1 : error0);
241 best_mask[0] |= best << i;
288 /* And pick the best. */
289 best = rd_cost1 < rd_cost0;
296 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
297 tokens[i][1].error = d2 + (best ? error1 : error0)
[all...] |
| /packages/apps/Gallery2/jni/filters/ |
| kmeans.h | 157 int best = findClosest<T, N>(values + x, oldCenters, dimension, stride, pop_size); local
158 add<T, N>(values + x, tmp + best, dimension);
159 popularities[best / stride]++;
227 int best = findClosest<T, N>(values + x, centroids, dimension, stride, pop_size); local
228 set<T, T>(values + x, centroids + best, dimension);
|
| /toolchain/binutils/binutils-2.25/bfd/ |
| cpu-sh.c | 457 unsigned int best = ~arch_set; local
481 if (((try & ~arch_set) < (best & ~arch_set)
482 || ((try & ~arch_set) == (best & ~arch_set)
483 && (~try & arch_set) < (~best & arch_set)))
487 best = try;
|
| /external/eigen/bench/btl/data/ |
| mean.cxx | 113 cout << " <TH ALIGN=CENTER> in cache <BR> % best </TH>" << endl ;
115 cout << " <TH ALIGN=CENTER> out of cache <BR> % best </TH>" << endl ;
121 Lib_Mean best(*is);
129 cout << " <TD> " << 100*(is->_mean_in_cache/best._mean_in_cache) << " </TD>" << endl ;
131 cout << " <TD> " << 100*(is->_mean_out_of_cache/best._mean_out_of_cache) << " </TD>" << endl ;
|
