/aosp_15_r20/packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/ |
D | db_utilities_indexing.h | 96 double best; in db_MaxIndex3() local 99 best=s[0];pos=0; in db_MaxIndex3() 100 if(s[1]>best){best=s[1];pos=1;} in db_MaxIndex3() 101 if(s[2]>best){best=s[2];pos=2;} in db_MaxIndex3() 107 double best; in db_MaxIndex4() local 110 best=s[0];pos=0; in db_MaxIndex4() 111 if(s[1]>best){best=s[1];pos=1;} in db_MaxIndex4() 112 if(s[2]>best){best=s[2];pos=2;} in db_MaxIndex4() 113 if(s[3]>best){best=s[3];pos=3;} in db_MaxIndex4() 119 double best; in db_MaxIndex5() local [all …]
|
/aosp_15_r20/external/icu/icu4c/source/test/intltest/ |
H A D | localematchertest.cpp | 100 const Locale *best = matcher.getBestMatch(Locale::getFrench(), errorCode); in testEmpty() local 101 assertEquals("getBestMatch(fr)", "(null)", locString(best)); in testEmpty() 130 const Locale *best = matcher.getBestMatch("en_GB", errorCode); in testBasics() local 131 assertEquals("fromRange.getBestMatch(en_GB)", "en_GB", locString(best)); in testBasics() 132 best = matcher.getBestMatch("en_US", errorCode); in testBasics() 133 assertEquals("fromRange.getBestMatch(en_US)", "en", locString(best)); in testBasics() 134 best = matcher.getBestMatch("fr_FR", errorCode); in testBasics() 135 assertEquals("fromRange.getBestMatch(fr_FR)", "fr", locString(best)); in testBasics() 136 best = matcher.getBestMatch("ja_JP", errorCode); in testBasics() 137 assertEquals("fromRange.getBestMatch(ja_JP)", "fr", locString(best)); in testBasics() [all …]
|
/aosp_15_r20/external/cronet/third_party/icu/source/test/intltest/ |
H A D | localematchertest.cpp | 100 const Locale *best = matcher.getBestMatch(Locale::getFrench(), errorCode); in testEmpty() local 101 assertEquals("getBestMatch(fr)", "(null)", locString(best)); in testEmpty() 130 const Locale *best = matcher.getBestMatch("en_GB", errorCode); in testBasics() local 131 assertEquals("fromRange.getBestMatch(en_GB)", "en_GB", locString(best)); in testBasics() 132 best = matcher.getBestMatch("en_US", errorCode); in testBasics() 133 assertEquals("fromRange.getBestMatch(en_US)", "en", locString(best)); in testBasics() 134 best = matcher.getBestMatch("fr_FR", errorCode); in testBasics() 135 assertEquals("fromRange.getBestMatch(fr_FR)", "fr", locString(best)); in testBasics() 136 best = matcher.getBestMatch("ja_JP", errorCode); in testBasics() 137 assertEquals("fromRange.getBestMatch(ja_JP)", "fr", locString(best)); in testBasics() [all …]
|
/aosp_15_r20/external/pcre/maint/Unicode.tables/ |
H A D | BidiMirroring.txt | 29 # A comment indicates where the characters are "BEST FIT" mirroring. 60 # exact mirroring pairs and "BEST FIT" mirroring pairs that had been 99 2209; 220C # [BEST FIT] NOT AN ELEMENT OF 102 220C; 2209 # [BEST FIT] DOES NOT CONTAIN AS MEMBER 123 2268; 2269 # [BEST FIT] LESS-THAN BUT NOT EQUAL TO 124 2269; 2268 # [BEST FIT] GREATER-THAN BUT NOT EQUAL TO 127 226E; 226F # [BEST FIT] NOT LESS-THAN 128 226F; 226E # [BEST FIT] NOT GREATER-THAN 129 2270; 2271 # [BEST FIT] NEITHER LESS-THAN NOR EQUAL TO 130 2271; 2270 # [BEST FIT] NEITHER GREATER-THAN NOR EQUAL TO [all …]
|
/aosp_15_r20/external/zstd/lib/dictBuilder/ |
H A D | cover.c | 405 * Selects the best segment in an epoch. 423 /* Try each segment (activeSegment) and save the best (bestSegment) */ in COVER_selectSegment() 433 * Save the best segment in bestSegment. in COVER_selectSegment() 464 /* If this segment is the best so far save it */ in COVER_selectSegment() 725 /* We fill the dictionary from the back to allow the best segments to be in COVER_buildDictionary() 854 void COVER_best_init(COVER_best_t *best) { in COVER_best_init() argument 855 if (best==NULL) return; /* compatible with init on NULL */ in COVER_best_init() 856 (void)ZSTD_pthread_mutex_init(&best->mutex, NULL); in COVER_best_init() 857 (void)ZSTD_pthread_cond_init(&best->cond, NULL); in COVER_best_init() 858 best->liveJobs = 0; in COVER_best_init() [all …]
|
/aosp_15_r20/external/cronet/net/third_party/quiche/src/quiche/quic/core/congestion_control/ |
H A D | windowed_filter.h | 11 // the best, second best, and third best min (or max) estimates, maintaining an 12 // invariant that the measurement time of the n'th best >= n-1'th best. 15 // the same sample. The second best estimate is then recorded in the second 16 // quarter of the window, and a third best estimate is recorded in the second 21 // A new best sample replaces all three estimates, since the new best is lower 24 // holds true for second best and third best estimates. Specifically, when a 25 // sample arrives that is better than the second best but not better than the 26 // best, it replaces the second and third best estimates but not the best 27 // estimate. Similarly, a sample that is better than the third best estimate 28 // but not the other estimates replaces only the third best estimate. [all …]
|
/aosp_15_r20/external/libwebsockets/lib/core-net/ |
H A D | lws-dsh.c | 30 lws_dsh_obj_t *best; member 115 (!s->best || obj->asize < s->best->asize)) { in search_best_free() 116 s->best = obj; in search_best_free() 166 s.best = NULL; in _lws_dsh_alloc_tail() 173 if (!s.best) { in _lws_dsh_alloc_tail() 180 assert(!(((unsigned long)s.best) & (sizeof(int *) - 1))); in _lws_dsh_alloc_tail() 182 if (s.best->asize < asize + (2 * sizeof(*s.best))) { in _lws_dsh_alloc_tail() 190 lws_dll2_remove(&s.best->list); in _lws_dsh_alloc_tail() 191 s.best->dsh = s.dsh; in _lws_dsh_alloc_tail() 192 s.best->kind = kind; in _lws_dsh_alloc_tail() [all …]
|
/aosp_15_r20/external/tcpdump/ |
H A D | addrtostr.c | 115 } best, cur; in addrtostr6() local 126 best.len = 0; in addrtostr6() 127 best.base = -1; in addrtostr6() 140 if (best.base == -1 || cur.len > best.len) in addrtostr6() 141 best = cur; in addrtostr6() 145 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in addrtostr6() 146 best = cur; in addrtostr6() 147 if (best.base != -1 && best.len < 2) in addrtostr6() 148 best.base = -1; in addrtostr6() 165 /* Are we inside the best run of 0x00's? in addrtostr6() [all …]
|
/aosp_15_r20/external/rust/android-crates-io/crates/grpcio-sys/grpc/third_party/cares/cares/src/lib/ |
D | inet_ntop.c | 113 struct { int base, len; } best, cur; in inet_ntop6() local 125 best.base = -1; in inet_ntop6() 126 best.len = 0; in inet_ntop6() 137 if (best.base == -1 || cur.len > best.len) in inet_ntop6() 138 best = cur; in inet_ntop6() 144 if (best.base == -1 || cur.len > best.len) in inet_ntop6() 145 best = cur; in inet_ntop6() 147 if (best.base != -1 && best.len < 2) in inet_ntop6() 148 best.base = -1; in inet_ntop6() 155 /* Are we inside the best run of 0x00's? */ in inet_ntop6() [all …]
|
/aosp_15_r20/external/curl/lib/ |
H A D | inet_ntop.c | 101 } best, cur; in inet_ntop6() local 113 best.base = -1; in inet_ntop6() 115 best.len = 0; in inet_ntop6() 127 if(best.base == -1 || cur.len > best.len) in inet_ntop6() 128 best = cur; in inet_ntop6() 132 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop6() 133 best = cur; in inet_ntop6() 134 if(best.base != -1 && best.len < 2) in inet_ntop6() 135 best.base = -1; in inet_ntop6() 139 /* Are we inside the best run of 0x00's? */ in inet_ntop6() [all …]
|
/aosp_15_r20/external/eigen/bench/ |
H A D | bench_gemm.cpp | 177 int tries = 2; // number of tries, we keep the best in main() 294 …std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main() 295 …std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main() 304 …std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main() 305 …std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main() 315 …std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main() 316 …std::cout << "eigen mono real " << tmono.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main() 317 …t << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => " << (100.0*tmono.be… in main() 326 …std::cout << "lazy cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main() 327 …std::cout << "lazy real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main() [all …]
|
/aosp_15_r20/bionic/libc/upstream-openbsd/lib/libc/net/ |
H A D | inet_ntop.c | 105 struct { int base, len; } best, cur; in inet_ntop6() local 118 best.base = -1; in inet_ntop6() 128 if (best.base == -1 || cur.len > best.len) in inet_ntop6() 129 best = cur; in inet_ntop6() 135 if (best.base == -1 || cur.len > best.len) in inet_ntop6() 136 best = cur; in inet_ntop6() 138 if (best.base != -1 && best.len < 2) in inet_ntop6() 139 best.base = -1; in inet_ntop6() 147 /* Are we inside the best run of 0x00's? */ in inet_ntop6() 148 if (best.base != -1 && i >= best.base && in inet_ntop6() [all …]
|
/aosp_15_r20/external/libcups/cups/ |
H A D | dest-options.c | 2288 *best = NULL, /* Best matching entry */ in cups_get_media_db() local 2320 * Found an exact match, let's figure out the best margins for the flags in cups_get_media_db() 2324 best = mdb; in cups_get_media_db() 2332 if (best->left != 0 || best->right != 0 || best->top != 0 || best->bottom != 0) in cups_get_media_db() 2338 if (mdb->left <= best->left && mdb->right <= best->right && in cups_get_media_db() 2339 mdb->top <= best->top && mdb->bottom <= best->bottom) in cups_get_media_db() 2341 best = mdb; in cups_get_media_db() 2355 (best->left || best->right || best->top || best->bottom)) in cups_get_media_db() 2368 if (mdb->left >= best->left && mdb->right >= best->right && in cups_get_media_db() 2369 mdb->top >= best->top && mdb->bottom >= best->bottom && in cups_get_media_db() [all …]
|
/aosp_15_r20/external/libcups/scheduler/ |
H A D | auth.c | 261 * Locate the best matching location so we know what kind of in cupsdAuthorize() 265 con->best = cupsdFindBest(con->uri, httpGetState(con->http)); in cupsdAuthorize() 268 …t(con, CUPSD_LOG_DEBUG2, "con->uri=\"%s\", con->best=%p(%s)", con->uri, con->best, con->best ? con… in cupsdAuthorize() 270 if (con->best && con->best->type != CUPSD_AUTH_NONE) in cupsdAuthorize() 272 if (con->best->type == CUPSD_AUTH_DEFAULT) in cupsdAuthorize() 275 type = con->best->type; in cupsdAuthorize() 393 con->http->hostaddr->addr.sa_family == AF_LOCAL && con->best) in cupsdAuthorize() 410 for (name = (char *)cupsArrayFirst(con->best->names); in cupsdAuthorize() 412 name = (char *)cupsArrayNext(con->best->names)) in cupsdAuthorize() 1369 * 'cupsdFindBest()' - Find the location entry that best matches the resource. [all …]
|
/aosp_15_r20/external/apache-commons-math/src/main/java/org/apache/commons/math3/ml/neuralnet/ |
H A D | MapUtils.java | 44 * Finds the neuron that best matches the given features. 59 Neuron best = null; in findBest() local 65 best = n; in findBest() 69 return best; in findBest() 73 * Finds the two neurons that best match the given features. 88 Neuron[] best = { null, null }; in findBestAndSecondBest() local 94 // Replace second best with old best. in findBestAndSecondBest() 96 best[1] = best[0]; in findBestAndSecondBest() 98 // Store current as new best. in findBestAndSecondBest() 100 best[0] = n; in findBestAndSecondBest() [all …]
|
/aosp_15_r20/external/icu/icu4j/main/core/src/main/java/com/ibm/icu/util/ |
H A D | LocaleMatcher.java | 24 * Immutable class that picks the best match between a user's desired locales and 48 * <p>Otherwise, the order of supported locales may have no effect on the best-match results. 186 * Data for the best-matching pair of a desired and a supported locale. 210 * Returns the best-matching desired locale. 213 * @return the best-matching desired locale, or null. 221 * Returns the best-matching desired locale. 224 * @return the best-matching desired locale, or null. 233 * Returns the best-matching supported locale. 238 * @return the best-matching supported locale, or null. 243 * Returns the best-matching supported locale. [all …]
|
/aosp_15_r20/external/icu/android_icu4j/src/main/java/android/icu/util/ |
H A D | LocaleMatcher.java | 25 * Immutable class that picks the best match between a user's desired locales and 49 * <p>Otherwise, the order of supported locales may have no effect on the best-match results. 175 * Data for the best-matching pair of a desired and a supported locale. 199 * Returns the best-matching desired locale. 202 * @return the best-matching desired locale, or null. 209 * Returns the best-matching desired locale. 212 * @return the best-matching desired locale, or null. 220 * Returns the best-matching supported locale. 225 * @return the best-matching supported locale, or null. 229 * Returns the best-matching supported locale. [all …]
|
/aosp_15_r20/hardware/google/gfxstream/third-party/astc-encoder/Source/ |
D | astcenc_pick_best_endpoint_format.cpp | 21 * @brief Functions for finding best endpoint format. 312 * @param[out] best_error The best error for each integer count and quant level. 666 * @brief For one partition compute the best format and quantization for a given bit count. 668 * @param best_combined_error The best error for each quant level and integer count. 669 * @param best_combined_format The best format for each quant level and integer count. 671 * @param[out] best_quant_level The output best color quant level. 672 * @param[out] best_format The output best color format. 674 * @return The output error for the best pairing. 719 …* @brief For 2 partitions compute the best format combinations for every pair of quant mode and in… 721 …* @param best_error The best error for a single endpoint quant level and integer … [all …]
|
/aosp_15_r20/external/cronet/third_party/apache-portable-runtime/src/network_io/unix/ |
H A D | inet_ntop.c | 150 struct { int base, len; } best = {-1, 0}, cur = {-1, 0}; in inet_ntop6() local 181 if (best.base == -1 || cur.len > best.len) { in inet_ntop6() 182 best = cur; in inet_ntop6() 192 if (best.base == -1 || cur.len > best.len) { in inet_ntop6() 193 best = cur; in inet_ntop6() 196 if (best.base != -1 && best.len < 2) { in inet_ntop6() 197 best.base = -1; in inet_ntop6() 205 /* Are we inside the best run of 0x00's? */ in inet_ntop6() 206 if (i == best.base) { in inet_ntop6() 208 i += best.len; in inet_ntop6() [all …]
|
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r536225/python3/lib/python3.11/site-packages/pip/_vendor/distro/ |
D | distro.py | 322 def version(pretty: bool = False, best: bool = False) -> str: 342 The *best* parameter can be used to control the approach for the returned 345 If *best* is false, the first non-empty version number in priority order of 348 If *best* is true, the most precise version number out of all examined 354 If *best* is false, this order represents the priority order: 367 return _distro.version(pretty, best) 370 def version_parts(best: bool = False) -> Tuple[str, str, str]: 381 For a description of the *best* parameter, see the :func:`distro.version` 384 return _distro.version_parts(best) 387 def major_version(best: bool = False) -> str: [all …]
|
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r522817/python3/lib/python3.11/site-packages/pip/_vendor/distro/ |
D | distro.py | 322 def version(pretty: bool = False, best: bool = False) -> str: 342 The *best* parameter can be used to control the approach for the returned 345 If *best* is false, the first non-empty version number in priority order of 348 If *best* is true, the most precise version number out of all examined 354 If *best* is false, this order represents the priority order: 367 return _distro.version(pretty, best) 370 def version_parts(best: bool = False) -> Tuple[str, str, str]: 381 For a description of the *best* parameter, see the :func:`distro.version` 384 return _distro.version_parts(best) 387 def major_version(best: bool = False) -> str: [all …]
|
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567/python3/lib/python3.11/site-packages/pip/_vendor/distro/ |
D | distro.py | 322 def version(pretty: bool = False, best: bool = False) -> str: 342 The *best* parameter can be used to control the approach for the returned 345 If *best* is false, the first non-empty version number in priority order of 348 If *best* is true, the most precise version number out of all examined 354 If *best* is false, this order represents the priority order: 367 return _distro.version(pretty, best) 370 def version_parts(best: bool = False) -> Tuple[str, str, str]: 381 For a description of the *best* parameter, see the :func:`distro.version` 384 return _distro.version_parts(best) 387 def major_version(best: bool = False) -> str: [all …]
|
/aosp_15_r20/prebuilts/clang/host/linux-x86/clang-r530567b/python3/lib/python3.11/site-packages/pip/_vendor/distro/ |
D | distro.py | 322 def version(pretty: bool = False, best: bool = False) -> str: 342 The *best* parameter can be used to control the approach for the returned 345 If *best* is false, the first non-empty version number in priority order of 348 If *best* is true, the most precise version number out of all examined 354 If *best* is false, this order represents the priority order: 367 return _distro.version(pretty, best) 370 def version_parts(best: bool = False) -> Tuple[str, str, str]: 381 For a description of the *best* parameter, see the :func:`distro.version` 384 return _distro.version_parts(best) 387 def major_version(best: bool = False) -> str: [all …]
|
/aosp_15_r20/external/igt-gpu-tools/tools/ |
H A D | hsw_compute_wrpll.c | 128 struct wrpll_rnp *best) in wrpll_update_rnp() argument 132 /* No best (r,n,p) yet */ in wrpll_update_rnp() 133 if (best->p == 0) { in wrpll_update_rnp() 134 best->p = p; in wrpll_update_rnp() 135 best->n2 = n2; in wrpll_update_rnp() 136 best->r2 = r2; in wrpll_update_rnp() 155 b = freq2k * budget * best->p * best->r2; in wrpll_update_rnp() 157 diff_best = ABS_DIFF((freq2k * best->p * best->r2), in wrpll_update_rnp() 158 (LC_FREQ_2K * best->n2)); in wrpll_update_rnp() 164 if (best->p * best->r2 * diff < p * r2 * diff_best) { in wrpll_update_rnp() [all …]
|
/aosp_15_r20/prebuilts/runtime/mainline/i18n/sdk/common_os/include/external/icu/icu4c/source/common/unicode/ |
H A D | localematcher.h | 146 * Immutable class that picks the best match between a user's desired locales and 172 * <p>Otherwise, the order of supported locales may have no effect on the best-match results. 191 * Data for the best-matching pair of a desired and a supported locale. 224 * Returns the best-matching desired locale. 227 * @return the best-matching desired locale, or nullptr. 233 * Returns the best-matching supported locale. 238 * @return the best-matching supported locale, or nullptr. 244 * Returns the index of the best-matching desired locale in the input Iterable order. 247 * @return the index of the best-matching desired locale, or -1. 253 * Returns the index of the best-matching supported locale in the [all …]
|