HomeSort by relevance Sort by last modified time
    Searched refs:best (Results 1 - 25 of 196) sorted by null

1 2 3 4 5 6 7 8

  /development/perftests/panorama/feature_stab/db_vlvm/
db_utilities_indexing.h 96 double best; local
99 best=s[0];pos=0;
100 if(s[1]>best){best=s[1];pos=1;}
101 if(s[2]>best){best=s[2];pos=2;}
107 double best; local
110 best=s[0];pos=0;
111 if(s[1]>best){best=s[1];pos=1;
119 double best; local
132 double best; local
146 double best; local
161 double best; local
176 double best; local
193 double t,best; local
204 double t,best; local
    [all...]
  /packages/apps/Camera/jni/feature_stab/db_vlvm/
db_utilities_indexing.h 96 double best; local
99 best=s[0];pos=0;
100 if(s[1]>best){best=s[1];pos=1;}
101 if(s[2]>best){best=s[2];pos=2;}
107 double best; local
110 best=s[0];pos=0;
111 if(s[1]>best){best=s[1];pos=1;
119 double best; local
132 double best; local
146 double best; local
161 double best; local
176 double best; local
193 double t,best; local
204 double t,best; local
    [all...]
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_indexing.h 96 double best; local
99 best=s[0];pos=0;
100 if(s[1]>best){best=s[1];pos=1;}
101 if(s[2]>best){best=s[2];pos=2;}
107 double best; local
110 best=s[0];pos=0;
111 if(s[1]>best){best=s[1];pos=1;
119 double best; local
132 double best; local
146 double best; local
161 double best; local
176 double best; local
193 double t,best; local
204 double t,best; local
    [all...]
  /bionic/libc/upstream-openbsd/lib/libc/net/
inet_ntop.c 105 struct { int base, len; } best, cur; local
118 best.base = -1;
128 if (best.base == -1 || cur.len > best.len)
129 best = cur;
135 if (best.base == -1 || cur.len > best.len)
136 best = cur;
138 if (best.base != -1 && best.len < 2
    [all...]
  /external/tcpdump/missing/
inet_ntop.c 117 } best, cur; local
129 best.base = -1;
141 if (best.base == -1 || cur.len > best.len)
142 best = cur;
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
147 best = cur;
148 if (best.base != -1 && best.len < 2
    [all...]
  /external/chromium_org/third_party/libjingle/source/talk/media/base/
videocapturer_unittest.cc 295 cricket::VideoFormat best; local
296 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
297 EXPECT_EQ(640, best.width);
298 EXPECT_EQ(480, best.height);
299 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval);
302 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best));
305 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
312 cricket::VideoFormat best; local
314 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
315 EXPECT_EQ(1280, best.width)
370 cricket::VideoFormat best; local
462 cricket::VideoFormat best; local
500 cricket::VideoFormat best; local
537 cricket::VideoFormat best; local
568 cricket::VideoFormat best; local
633 cricket::VideoFormat best; local
    [all...]
  /ndk/sources/host-tools/make-3.81/
strcache.c 60 struct strcache *best = NULL; local
71 the blocks and choose the one with the best fit (the one that leaves the
74 if (sp->bytesfree > len && (!best || best->bytesfree > sp->bytesfree))
75 best = sp;
78 if (!best)
79 best = new_cache();
81 assert (best->bytesfree > len);
83 /* Add the string to the best cache. */
84 res = best->end
    [all...]
  /external/ppp/pppd/plugins/pppoatm/
misc.c 24 int i,best; local
30 best = -1;
35 best = i;
40 if (best > -1) (*pos) += best_len;
41 return best;
  /external/chromium_org/third_party/skia/experimental/Intersection/
CubicBounds.cpp 20 int best = -1; local
25 if (best < 0) {
26 best = index;
32 best = 1;
35 if (best >= 0) {
36 return leftTs[best];
CubicParameterizationCode.cpp 360 int best[bestCount][4]; local
361 bzero(best, sizeof(best));
369 if (best[w][0] < count[x][y][z]) {
370 best[w][0] = count[x][y][z];
371 best[w][1] = x;
372 best[w][2] = y;
373 best[w][3] = z;
381 printf("%c%c%c=%d\n", 'a' + best[w][1], 'a' + best[w][2]
    [all...]
  /external/skia/experimental/Intersection/
CubicBounds.cpp 20 int best = -1; local
25 if (best < 0) {
26 best = index;
32 best = 1;
35 if (best >= 0) {
36 return leftTs[best];
CubicParameterizationCode.cpp 360 int best[bestCount][4]; local
361 bzero(best, sizeof(best));
369 if (best[w][0] < count[x][y][z]) {
370 best[w][0] = count[x][y][z];
371 best[w][1] = x;
372 best[w][2] = y;
373 best[w][3] = z;
381 printf("%c%c%c=%d\n", 'a' + best[w][1], 'a' + best[w][2]
    [all...]
  /frameworks/compile/mclinker/lib/Support/
TargetRegistry.cpp 37 Target* best = NULL, *ambiguity = NULL; local
43 if (NULL == best || highest < quality) {
45 best = *target;
54 if (NULL == best) {
61 best->name() + "\" and \"" + ambiguity->name() + "\"";
65 return best;
  /external/eigen/bench/
quatmul.cpp 33 std::cout << label << " default " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best(CPU_TIMER)) << " M mul/s\n";
36 std::cout << label << " novec " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best(CPU_TIMER)) << " M mul/s\n";
bench_gemm.cpp 129 int tries = 2; // number of tries, we keep the best
202 std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tblas.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" << tblas.total(CPU_TIMER) << "s)\n";
203 std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tblas.best(REAL_TIMER))*1e-9 << " GFLOPS \t(" << tblas.total(REAL_TIMER) << "s)\n";
209 std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmt.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" << tmt.total(CPU_TIMER) << "s)\n";
210 std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmt.best(REAL_TIMER))*1e-9 << " GFLOPS \t(" << tmt.total(REAL_TIMER) << "s)\n";
220 std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tmono.best(CPU_TIMER))*1e-9 << " GFLOPS \t(" (…)
    [all...]
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;
  /libcore/luni/src/test/java/libcore/icu/
ICUTest.java 85 private String best(Locale l, String skeleton) { method in class:ICUTest
92 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-M-dd"))));
93 assertEquals("[y, d, M]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-MMM-dd"))));
94 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "MMM-dd"))));
96 assertEquals("[y, M, d]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-M-dd"))));
97 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-MMM-dd"))));
98 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "MMM-dd"))));
102 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-M-dd"))));
103 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-MMM-dd"))));
104 assertEquals("[M, d, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "MMM-dd"))))
    [all...]
  /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/
pitch_estimator.c 114 int32_t best[4]= {-100, -100, -100, -100}; local
118 if (in[k] > best[3]) {
119 if (in[k] > best[2]) {
120 if (in[k] > best[1]) {
121 if (in[k] > best[0]) { // The Best
122 best[3] = best[2];
124 best[2] = best[1]
    [all...]
  /external/webrtc/src/modules/audio_coding/codecs/isac/fix/source/
pitch_estimator.c 120 WebRtc_Word32 best[4]= {-100, -100, -100, -100}; local
124 if (in[k] > best[3]) {
125 if (in[k] > best[2]) {
126 if (in[k] > best[1]) {
127 if (in[k] > best[0]) { // The Best
128 best[3] = best[2];
130 best[2] = best[1]
    [all...]
  /external/chromium_org/net/http/
http_auth.cc 37 scoped_ptr<HttpAuthHandler> best; local
50 if (cur.get() && (!best.get() || best->score() < cur->score()) &&
52 best.swap(cur);
54 handler->swap(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/chromium_org/third_party/skia/src/gpu/gl/unix/
SkNativeGLContext_unix.cpp 139 int best = -1, best_num_samp = -1; local
148 if (best < 0 || (samp_buf && samples > best_num_samp))
149 best = i, best_num_samp = samples;
152 XVisualInfo temp = visReturn[best];
  /external/skia/src/gpu/gl/unix/
SkNativeGLContext_unix.cpp 139 int best = -1, best_num_samp = -1; local
148 if (best < 0 || (samp_buf && samples > best_num_samp))
149 best = i, best_num_samp = samples;
152 XVisualInfo temp = visReturn[best];
  /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...]
  /external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/
encodemb.c 252 int best; local
325 /* And pick the best. */
326 best = rd_cost1 < rd_cost0;
330 tokens[i][0].rate = base_bits + (best ? rate1 : rate0);
331 tokens[i][0].error = d2 + (best ? error1 : error0);
335 best_mask[0] |= best << i;
391 /* And pick the best. */
392 best = rd_cost1 < rd_cost0;
400 tokens[i][1].rate = base_bits + (best ? rate1 : rate0);
401 tokens[i][1].error = d2 + (best ? error1 : error0)
    [all...]

Completed in 818 milliseconds

1 2 3 4 5 6 7 8