Home
last modified time | relevance | path

Searched full:best (Results 1 – 25 of 5723) sorted by relevance

12345678910>>...229

/external/icu/icu4c/source/test/intltest/
Dlocalematchertest.cpp100 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 …]
/external/cronet/third_party/icu/source/test/intltest/
Dlocalematchertest.cpp100 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 …]
/external/cronet/net/third_party/quiche/src/quiche/quic/core/congestion_control/
Dwindowed_filter.h11 // 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 …]
/external/pcre/maint/Unicode.tables/
DBidiMirroring.txt29 # 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 …]
/external/tcpdump/
Daddrtostr.c115 } 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 …]
/external/curl/lib/
Dinet_ntop.c101 } best, cur; in inet_ntop6() local
113 best.base = -1; in inet_ntop6()
115 best.len = 0; in inet_ntop6()
126 if(best.base == -1 || cur.len > best.len) in inet_ntop6()
127 best = cur; in inet_ntop6()
131 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop6()
132 best = cur; in inet_ntop6()
133 if(best.base != -1 && best.len < 2) in inet_ntop6()
134 best.base = -1; in inet_ntop6()
138 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/cares/cares/
Dinet_ntop.c119 struct { int base, len; } best, cur; in inet_ntop6() local
131 best.base = -1; in inet_ntop6()
132 best.len = 0; in inet_ntop6()
143 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
144 best = cur; in inet_ntop6()
150 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
151 best = cur; in inet_ntop6()
153 if (best.base != -1 && best.len < 2) in inet_ntop6()
154 best.base = -1; in inet_ntop6()
161 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
[all …]
/external/libwebsockets/lib/core-net/
Dlws-dsh.c30 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 …]
/external/zstd/lib/dictBuilder/
Dcover.c403 * Selects the best segment in an epoch.
421 /* Try each segment (activeSegment) and save the best (bestSegment) */ in COVER_selectSegment()
431 * Save the best segment in bestSegment. in COVER_selectSegment()
462 /* If this segment is the best so far save it */ in COVER_selectSegment()
722 /* We fill the dictionary from the back to allow the best segments to be in COVER_buildDictionary()
851 void COVER_best_init(COVER_best_t *best) { in COVER_best_init() argument
852 if (best==NULL) return; /* compatible with init on NULL */ in COVER_best_init()
853 (void)ZSTD_pthread_mutex_init(&best->mutex, NULL); in COVER_best_init()
854 (void)ZSTD_pthread_cond_init(&best->cond, NULL); in COVER_best_init()
855 best->liveJobs = 0; in COVER_best_init()
[all …]
/external/mesa3d/src/gallium/drivers/radeonsi/
Dsi_test_dma_perf.c306 /* Analyze results and find the best methods. */ in si_test_dma_perf()
338 /* The list of best chosen methods. */ in si_test_dma_perf()
344 /* Find the best method. */ in si_test_dma_perf()
345 struct si_result *best = NULL; in si_test_dma_perf() local
393 if (!best) { in si_test_dma_perf()
394 best = r; in si_test_dma_perf()
404 if (best->score * min_improvement < r->score) in si_test_dma_perf()
405 best = r; in si_test_dma_perf()
414 /* If the best one is also the best for the previous size, in si_test_dma_perf()
417 * If there is no best, it means all methods were too slow in si_test_dma_perf()
[all …]
/external/eigen/bench/
Dbench_gemm.cpp177 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 …]
/external/toolchain-utils/bestflags/
Dhill_climb_best_neighbor.py9 neighbor gives better performance than the current task, it explores the best
24 Given a task, it explores all its neighbors. Pick the best neighbor for the
43 # the next iteration. This self._next_task contains the best task in the
52 out the best task in this generation and sets it to _next_task for the
56 True if the best neighbor improves upon the parent task.
59 # Find the best neighbor.
73 # If the best neighbor improves upon the parent task.
82 The best neighbor b of the current task is the parent of the next
93 # The best neighbor.
97 # The neighbors of the best neighbor.
/external/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.h163 // The best SUnit candidate.
178 void setBest(SISchedCandidate &Best) { in setBest()
179 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
180 SU = Best.SU; in setBest()
181 Reason = Best.Reason; in setBest()
182 SGPRUsage = Best.SGPRUsage; in setBest()
183 VGPRUsage = Best.VGPRUsage; in setBest()
184 IsLowLatency = Best.IsLowLatency; in setBest()
185 LowLatencyOffset = Best.LowLatencyOffset; in setBest()
186 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent; in setBest()
[all …]
/external/python/cpython3/Doc/howto/
Dannotations.rst4 Annotations Best Practices
11 This document is designed to encapsulate the best practices
17 best practices for accessing the annotations of an object
19 best practices for accessing the annotations of an object
21 other best practices
37 and newer, calling this function is the best practice for
44 ``__annotations__`` data member manually. Best practice
56 object, best practice in Python versions 3.10 and
69 Best practice for accessing the annotations dict of other
71 as best practice for 3.10, assuming you aren't calling
[all …]
/external/oboe/tests/
DtestResampler.cpp145 MultiChannelResampler::Quality::Best in TEST()
159 checkResampler(8000, 11025, MultiChannelResampler::Quality::Best); in TEST()
162 checkResampler(8000, 48000, MultiChannelResampler::Quality::Best); in TEST()
166 checkResampler(8000, 44100, MultiChannelResampler::Quality::Best); in TEST()
170 checkResampler(11025, 24000, MultiChannelResampler::Quality::Best); in TEST()
187 checkResampler(11025, 48000, MultiChannelResampler::Quality::Best); in TEST()
191 checkResampler(11025, 44100, MultiChannelResampler::Quality::Best); in TEST()
196 // checkResampler(11025, 88200, MultiChannelResampler::Quality::Best);
200 checkResampler(16000, 48000, MultiChannelResampler::Quality::Best); in TEST()
207 checkResampler(44100, 48000, MultiChannelResampler::Quality::Best); in TEST()
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
DSIMachineScheduler.h170 // The best SUnit candidate.
184 void setBest(SISchedCandidate &Best) { in setBest()
185 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
186 SU = Best.SU; in setBest()
187 Reason = Best.Reason; in setBest()
188 SGPRUsage = Best.SGPRUsage; in setBest()
189 VGPRUsage = Best.VGPRUsage; in setBest()
190 IsLowLatency = Best.IsLowLatency; in setBest()
191 LowLatencyOffset = Best.LowLatencyOffset; in setBest()
192 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent; in setBest()
[all …]
/external/icu/android_icu4j/src/main/java/android/icu/util/
DLocaleMatcher.java25 * 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 …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/
DLocaleMatcher.java24 * 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 …]
/external/libaom/av1/encoder/
Drdopt.h43 * encoding. This function will first search for the best luma prediction by
55 * \param[in] best_rd Best RD seen for this block so far.
58 * is modified to store information about the best mode computed
60 * corresponding to the best mode found.
71 * all possible inter modes and select the best one for the current block by
86 * \param[in] best_rd_so_far Best RD seen for this block so far
89 * is modified to store information about the best mode computed
91 * corresponding to the best mode found.
104 * This finction will loop over subset of intra modes and select the best one
119 * is modified to store information about the best mode computed
[all …]
/external/igt-gpu-tools/tools/
Dhsw_compute_wrpll.c128 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 …]
/external/libcups/scheduler/
Dauth.c262 * Locate the best matching location so we know what kind of in cupsdAuthorize()
266 con->best = cupsdFindBest(con->uri, httpGetState(con->http)); in cupsdAuthorize()
269 …t(con, CUPSD_LOG_DEBUG2, "con->uri=\"%s\", con->best=%p(%s)", con->uri, con->best, con->best ? con… in cupsdAuthorize()
271 if (con->best && con->best->type != CUPSD_AUTH_NONE) in cupsdAuthorize()
273 if (con->best->type == CUPSD_AUTH_DEFAULT) in cupsdAuthorize()
276 type = con->best->type; in cupsdAuthorize()
394 con->http->hostaddr->addr.sa_family == AF_LOCAL && con->best) in cupsdAuthorize()
411 for (name = (char *)cupsArrayFirst(con->best->names); in cupsdAuthorize()
413 name = (char *)cupsArrayNext(con->best->names)) in cupsdAuthorize()
1370 * 'cupsdFindBest()' - Find the location entry that best matches the resource.
[all …]
/external/icu/icu4c/source/common/unicode/
Dlocalematcher.h142 * Immutable class that picks the best match between a user's desired locales and
168 * <p>Otherwise, the order of supported locales may have no effect on the best-match results.
187 * Data for the best-matching pair of a desired and a supported locale.
220 * Returns the best-matching desired locale.
223 * @return the best-matching desired locale, or nullptr.
229 * Returns the best-matching supported locale.
234 * @return the best-matching supported locale, or nullptr.
240 * Returns the index of the best-matching desired locale in the input Iterable order.
243 * @return the index of the best-matching desired locale, or -1.
249 * Returns the index of the best-matching supported locale in the
[all …]
/external/cronet/third_party/icu/source/common/unicode/
Dlocalematcher.h142 * Immutable class that picks the best match between a user's desired locales and
168 * <p>Otherwise, the order of supported locales may have no effect on the best-match results.
187 * Data for the best-matching pair of a desired and a supported locale.
220 * Returns the best-matching desired locale.
223 * @return the best-matching desired locale, or nullptr.
229 * Returns the best-matching supported locale.
234 * @return the best-matching supported locale, or nullptr.
240 * Returns the index of the best-matching desired locale in the input Iterable order.
243 * @return the index of the best-matching desired locale, or -1.
249 * Returns the index of the best-matching supported locale in the
[all …]
/external/icu/libicu/cts_headers/unicode/
Dlocalematcher.h142 * Immutable class that picks the best match between a user's desired locales and
168 * <p>Otherwise, the order of supported locales may have no effect on the best-match results.
187 * Data for the best-matching pair of a desired and a supported locale.
220 * Returns the best-matching desired locale.
223 * @return the best-matching desired locale, or nullptr.
229 * Returns the best-matching supported locale.
234 * @return the best-matching supported locale, or nullptr.
240 * Returns the index of the best-matching desired locale in the input Iterable order.
243 * @return the index of the best-matching desired locale, or -1.
249 * Returns the index of the best-matching supported locale in the
[all …]
/external/musl/src/network/
Dinet_ntop.c10 int i, j, max, best; in inet_ntop() local
34 for (i=best=0, max=2; buf[i]; i++) { in inet_ntop()
37 if (j>max) best=i, max=j; in inet_ntop()
40 buf[best] = buf[best+1] = ':'; in inet_ntop()
41 memmove(buf+best+2, buf+best+max, i-best-max+1); in inet_ntop()

12345678910>>...229