| /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...] |
| /frameworks/base/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p2/src/ |
| armVCM4P2_CompareMV.c | 14 * the best MV and SAD
29 * best MV and SAD
37 * [in] bestMVX x coordinate of the best motion vector
38 * [in] bestMVY y coordinate of the best motion vector
39 * [in] bestSAD best SAD
42 * OMX_INT -- 1 to indicate that the current sad is the best
43 * 0 to indicate that it is NOT the best SAD
|
| /frameworks/base/media/libstagefright/codecs/on2/h264dec/omxdl/reference/vc/m4p10/src/ |
| armVCM4P10_CompareMotionCostToMV.c | 14 * the best MV and SAD
67 * best MV and best MC
76 * [in] bestMV Best MV, contains best MV till the previous interation.
78 * [in] *pBestCost Contains the current best motion cost.
79 * [out] *pBestCost pBestCost Motion cost will be associated with the best MV
82 * than the best cost passed then the *pBestCost will be equal to candCost
83 * [out] bestMV Finally will have the best MV after the judgement.
86 * OMX_INT -- 1 to indicate that the current motion cost is the best
[all...] |
| /bionic/libc/inet/ |
| inet_ntop.c | 105 struct { int base, len; } best, cur; local
118 best.base = -1;
119 best.len = 0;
130 if (best.base == -1 || cur.len > best.len)
131 best = cur;
137 if (best.base == -1 || cur.len > best.len)
138 best = cur;
140 if (best.base != -1 && best.len < 2
[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/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/clang/test/SemaCXX/ |
| overloaded-builtin-operators-0x.cpp | 1 // RUN: %clang_cc1 -fsyntax-only -fshow-overloads=best -std=c++11 -verify %s
|
| /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...] |
| /packages/apps/Bluetooth/res/values-de/ |
| test_strings.xml | 7 <string name="update_record" msgid="2480425402384910635">"Aufnahme bestätigen"</string>
8 <string name="ack_record" msgid="6716152390978472184">"Aufnahme bestätigen"</string>
|
| /external/bluetooth/glib/ |
| MAINTAINERS | 12 questions are best directed to the mailing list gtk-devel-list@gnome.org.
|
| /external/harfbuzz/contrib/tables/ |
| BidiMirroring.txt | 26 # A comment indicates where the characters are "BEST FIT" mirroring.
81 2268; 2269 # [BEST FIT] LESS-THAN BUT NOT EQUAL TO
82 2269; 2268 # [BEST FIT] GREATER-THAN BUT NOT EQUAL TO
85 226E; 226F # [BEST FIT] NOT LESS-THAN
86 226F; 226E # [BEST FIT] NOT GREATER-THAN
87 2270; 2271 # [BEST FIT] NEITHER LESS-THAN NOR EQUAL TO
88 2271; 2270 # [BEST FIT] NEITHER GREATER-THAN NOR EQUAL TO
89 2272; 2273 # [BEST FIT] LESS-THAN OR EQUIVALENT TO
90 2273; 2272 # [BEST FIT] GREATER-THAN OR EQUIVALENT TO
91 2274; 2275 # [BEST FIT] NEITHER LESS-THAN NOR EQUIVALENT T
[all...] |
| /external/icu4c/data/unidata/ |
| BidiMirroring.txt | 27 # A comment indicates where the characters are "BEST FIT" mirroring.
90 2268; 2269 # [BEST FIT] LESS-THAN BUT NOT EQUAL TO
91 2269; 2268 # [BEST FIT] GREATER-THAN BUT NOT EQUAL TO
94 226E; 226F # [BEST FIT] NOT LESS-THAN
95 226F; 226E # [BEST FIT] NOT GREATER-THAN
96 2270; 2271 # [BEST FIT] NEITHER LESS-THAN NOR EQUAL TO
97 2271; 2270 # [BEST FIT] NEITHER GREATER-THAN NOR EQUAL TO
98 2272; 2273 # [BEST FIT] LESS-THAN OR EQUIVALENT TO
99 2273; 2272 # [BEST FIT] GREATER-THAN OR EQUIVALENT TO
100 2274; 2275 # [BEST FIT] NEITHER LESS-THAN NOR EQUIVALENT T
[all...] |
| /external/kernel-headers/original/linux/ |
| ioprio.h | 21 * class, it always gets premium service. BE is the best-effort scheduling
33 * 8 best effort priority levels are supported
|
| /external/llvm/lib/Support/ |
| TargetRegistry.cpp | 33 const Target *Best = 0, *EquallyBest = 0;
37 if (!Best || Qual > BestQuality) {
38 Best = &*it;
46 if (!Best) {
52 // Otherwise, take the best target, but make sure we don't have two equally
53 // good best targets.
56 Best->Name + "\" and \"" + EquallyBest->Name + "\"";
60 return Best;
|
| /external/neven/Embedded/common/src/b_APIEm/ |
| Functions.h | 41 bpi_SUB_MAX_2, /* subtract maximum (different id of best entry) */
42 bpi_SUB_4_MAX_2, /* subtract average maximum of best 4 entries (method 2) */
43 bpi_SUB_8_MAX_2, /* subtract average maximum of best 8 entries (method 2) */
44 bpi_SUB_16_MAX_2, /* subtract average maximum of best 16 entries (method 2) */
45 bpi_SUB_32_MAX_2 /* subtract average maximum of best 32 entries (method 2) */
|
| /external/srec/srec/Recognizer/include/ |
| SR_RecognizerResult.h | 55 * Returns number of entries in the n-best list.
66 * @param nbest Index of n-best list element (0-based)
77 * @param nbest Index of n-best list element (0-based)
78 * @param list [out] List of keys associated with n-best list entry.
90 * @param nbest Index of n-best list element (0-based)
125 * Returns number of entries in the n-best list.
136 * @param nbest Index of n-best list element (0-based)
149 * @param nbest Index of n-best list element (0-based)
150 * @param list [out] List of keys associated with n-best list entry.
164 * @param nbest Index of n-best list element (0-based
[all...] |
| /development/samples/training/multiscreen/newsreader/ |
| _index.html | 1 <p>A sample app demonstrating best practices to support multiple screen sizes and densities.</p>
|
| /development/sdk_overlay/frameworks/base/packages/SettingsProvider/res/values/ |
| defaults.xml | 21 default makes for the best developer experience. -->
|
| /external/chromium/chrome/browser/ |
| icon_loader_mac.mm | 21 // and NSImage choses the best at draw-time.
|
| /external/chromium/chrome/browser/ui/cocoa/location_bar/ |
| selected_keyword_decoration.h | 25 // Determines what combination of labels and image will best fit
|
| /external/icu4c/i18n/ |
| ucln_in.h | 26 It's usually best to have child dependencies called first. */
|
| /external/llvm/test/CodeGen/ARM/ |
| memcpy-inline.ll | 3 ; The ARM magic hinting works best with linear scan.
|
| /external/tcpdump/ |
| Makefile-devel-adds | 3 # From autoconf.info . Works best with GNU Make.
|
| /external/freetype/src/autofit/ |
| afhints.h | 119 * Each segment has at most one `best' candidate to form a black
125 * best segment_1 = segment_2 && best segment_2 = segment_1
127 * The best candidate is stored in field `link' in structure
132 * In the above ASCII drawing, the best candidate for both AB and CD is
133 * GH, while the best candidate for GH is AB. Similarly, the best
134 * candidate for EF and GH is AB, while the best candidate for AB is
142 * best segment_1 = segment_2 && best segment_2 != segment_
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/x11/ |
| SDL_x11modes.c | 109 int best = -1; local
116 best = i;
121 if ( best < 0 ||
122 (modes[i]->hdisplay < modes[best]->hdisplay &&
123 modes[i]->vdisplay <= modes[best]->vdisplay) ||
124 (modes[i]->vdisplay < modes[best]->vdisplay &&
125 modes[i]->hdisplay <= modes[best]->hdisplay) ) {
126 best = i;
130 if ( best >= 0 &&
131 ((modes[best]->hdisplay != mode.hdisplay) |
[all...] |
