| /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/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...] |
| /external/curl/lib/ |
| inet_ntop.c | 91 } best, cur; local
103 best.base = -1;
105 best.len = 0;
116 if(best.base == -1 || cur.len > best.len)
117 best = cur;
121 if((cur.base != -1) && (best.base == -1 || cur.len > best.len))
122 best = cur;
123 if(best.base != -1 && best.len < 2
[all...] |
| /external/c-ares/ |
| inet_ntop.c | 129 struct { int base, len; } best, cur; local
141 best.base = -1;
142 best.len = 0;
153 if (best.base == -1 || cur.len > best.len)
154 best = cur;
160 if (best.base == -1 || cur.len > best.len)
161 best = cur;
163 if (best.base != -1 && best.len < 2
[all...] |
| /external/tcpdump/missing/ |
| inet_ntop.c | 113 } best, cur; local
125 best.len = 0;
126 best.base = -1;
139 if (best.base == -1 || cur.len > best.len)
140 best = cur;
144 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len))
145 best = cur;
146 if (best.base != -1 && best.len < 2
[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/webrtc/talk/media/base/ |
| videocapturer_unittest.cc | 343 cricket::VideoFormat best; local
344 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
345 EXPECT_EQ(640, best.width);
346 EXPECT_EQ(480, best.height);
347 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval);
350 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best));
353 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
360 cricket::VideoFormat best; local
362 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best));
363 EXPECT_EQ(1280, best.width)
418 cricket::VideoFormat best; local
510 cricket::VideoFormat best; local
548 cricket::VideoFormat best; local
585 cricket::VideoFormat best; local
616 cricket::VideoFormat best; local
681 cricket::VideoFormat best; local
[all...] |
| /device/google/contexthub/firmware/src/ |
| heap.c | 24 #define TIDX_HEAP_EXTRA 2 // must be >= 0; best if > 0, don't make it > 7, since it unnecessarily limits max heap size we can manage
117 struct HeapNode *node, *best = NULL; local
130 if (!node->used && node->size >= sz && (!best || best->size > node->size)) {
131 best = node;
132 if (best->size == sz)
139 if (!best) //alloc failed
142 if (best->size - sz > sizeof(struct HeapNode)) { //there is a point to split up the chunk
144 node = (struct HeapNode*)(best->data + sz);
148 node->size = best->size - sz - sizeof(struct HeapNode)
[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;
|
| /frameworks/compile/mclinker/lib/Support/ |
| TargetRegistry.cpp | 35 Target* best = NULL, * ambiguity = NULL; local
41 if (best == NULL || highest < quality) {
43 best = *target;
51 if (best == NULL) {
57 pError = std::string("Ambiguous targets: \"") + best->name() + "\" and \"" +
62 return best;
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/anqp/ |
| NAIRealmElement.java | 54 int best = AuthMatch.None; local
57 if (match > best) {
58 best = match;
59 if (best == AuthMatch.Exact) {
60 return best;
64 return best;
|
| NAIRealmData.java | 80 int best = AuthMatch.None; local
83 if (match > best) {
84 best = match;
85 if (best == AuthMatch.Exact) {
86 return best;
90 return best;
|
| /external/libgdx/gdx/src/com/badlogic/gdx/assets/loaders/resolvers/ |
| ResolutionFileResolver.java | 23 /** This {@link FileHandleResolver} uses a given list of {@link Resolution}s to determine the best match based on the current
39 * Since there is only a single {@link Resolution}, this will be the best match for any screen size. The resolver will now try to
106 Resolution best = descriptors[0];
local
110 if (w >= other.portraitWidth && other.portraitWidth >= best.portraitWidth && h >= other.portraitHeight
111 && other.portraitHeight >= best.portraitHeight) best = descriptors[i];
116 if (w >= other.portraitHeight && other.portraitHeight >= best.portraitHeight && h >= other.portraitWidth
117 && other.portraitWidth >= best.portraitWidth) best = descriptors[i];
120 return best;
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/third_party/retry-decorator/ |
| Makefile | 5 git archive --prefix="$(name)-$(ver)/" master | bzip2 --best > "$(name)-$(ver).tar.bz2"
|
| /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...] |
| /packages/apps/TV/src/com/android/tv/util/ |
| TvTrackInfoUtils.java | 86 * Selects the best TvTrackInfo available or the first if none matches.
92 * @return the best matching track or the first one if none matches.
100 TvTrackInfo best = null;
102 if (comparator.compare(track, best) > 0) {
103 best = track;
106 return best;
|
| /external/libgdx/backends/gdx-backends-gwt/src/com/badlogic/gdx/backends/gwt/emu/com/badlogic/gdx/assets/loaders/resolvers/ |
| ResolutionFileResolver.java | 68 int best = Integer.MAX_VALUE;
local
70 if (descriptors[i].portraitWidth < best) {
71 best = descriptors[i].portraitWidth;
76 best = Integer.MAX_VALUE;
79 best = descriptors[i].portraitWidth;
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| RegexpPool.java | 91 RegexpNode best = p; local
107 best = p;
119 best = p;
126 if (re.equals(best.re)) {
127 o = best.result;
128 best.result = null;
132 if (re.equals(best.re)) {
133 o = best.result;
134 best.result = null;
142 would match the string, the best match is returned first
193 RegexpNode best = p; local
[all...] |
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| pitch_estimator.c | 105 int32_t best[4]= {-100, -100, -100, -100}; local
109 if (in[k] > best[3]) {
110 if (in[k] > best[2]) {
111 if (in[k] > best[1]) {
112 if (in[k] > best[0]) { // The Best
113 best[3] = best[2];
115 best[2] = best[1]
[all...] |
| /packages/apps/Camera2/src/com/android/camera/one/v2/common/ |
| PictureSizeCalculator.java | 71 * @return The best natively-supported size to use.
113 Size best = null; local
120 best = candidate;
125 if (best == null) {
128 best = getLargestSupportedSize(supported);
131 return best;
|
| /libcore/luni/src/test/java/libcore/icu/ |
| ICUTest.java | 86 private String best(Locale l, String skeleton) { method in class:ICUTest
93 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-M-dd"))));
94 assertEquals("[y, d, M]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "yyyy-MMM-dd"))));
95 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(lv, "MMM-dd"))));
97 assertEquals("[y, M, d]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-M-dd"))));
98 assertEquals("[d, M, y]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "yyyy-MMM-dd"))));
99 assertEquals("[d, M, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(fa, "MMM-dd"))));
103 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-M-dd"))));
104 assertEquals("[M, d, y]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "yyyy-MMM-dd"))));
105 assertEquals("[M, d, \u0000]", Arrays.toString(ICU.getDateFormatOrder(best(en_US, "MMM-dd"))))
[all...] |
| /external/webp/src/enc/ |
| alpha.c | 33 // prediction modes 0 to 3 and pick the best one.
200 // Quick estimate of the best candidate.
210 // For large number of colors, try FILTER_NONE in addition to the best
235 FilterTrial best; local
238 InitFilterTrial(&best);
250 if (ok && trial.score < best.score) {
251 VP8BitWriterWipeOut(&best.bw);
252 best = trial;
261 reduce_levels, effort_level, NULL, &best);
265 stats->lossless_features = best.stats.lossless_features
[all...] |
| /external/skia/tests/ |
| StrokerTest.cpp | 134 int best = 0; local
145 if (best < gMaxRecursion[2]) {
153 best = gMaxRecursion[2];
162 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
213 int best = 0; local
237 if (best < gMaxRecursion[2]) {
245 best = gMaxRecursion[2];
254 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best);
323 int best = 0; local
341 if (best < gMaxRecursion[2])
368 int best[2] = { 0 }; local
[all...] |
