| /external/icu/icu4c/source/test/intltest/ |
| 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 …]
|
| /external/cronet/stable/third_party/icu/source/test/intltest/ |
| 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 …]
|
| /external/cronet/tot/third_party/icu/source/test/intltest/ |
| 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 …]
|
| /external/cronet/stable/net/third_party/quiche/src/quiche/quic/core/congestion_control/ |
| 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 …]
|
| /external/cronet/tot/net/third_party/quiche/src/quiche/quic/core/congestion_control/ |
| 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 …]
|
| /external/pcre/maint/Unicode.tables/ |
| 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 …]
|
| /external/tcpdump/ |
| D | addrtostr.c | 113 } best, cur; in addrtostr6() local
124 best.len = 0; in addrtostr6()
125 best.base = -1; in addrtostr6()
134 if (best.base == -1 || cur.len > best.len) in addrtostr6()
135 best = cur; in addrtostr6()
139 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in addrtostr6()
140 best = cur; in addrtostr6()
141 if (best.base != -1 && best.len < 2) in addrtostr6()
142 best.base = -1; in addrtostr6()
158 /* Are we inside the best run of 0x00's? in addrtostr6()
[all …]
|
| /external/curl/lib/ |
| 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 …]
|
| /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 …]
|
| /external/libwebsockets/lib/core-net/ |
| 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 …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math3/ml/neuralnet/ |
| 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 …]
|
| /external/cronet/tot/third_party/apache-portable-runtime/src/network_io/unix/ |
| 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 …]
|
| /external/cronet/stable/third_party/apache-portable-runtime/src/network_io/unix/ |
| 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 …]
|
| /external/zstd/lib/dictBuilder/ |
| D | cover.c | 456 * Selects the best segment in an epoch.
474 /* Try each segment (activeSegment) and save the best (bestSegment) */
484 * Save the best segment in bestSegment.
515 /* If this segment is the best so far save it */
766 /* We fill the dictionary from the back to allow the best segments to be
895 void COVER_best_init(COVER_best_t *best) { argument
896 if (best==NULL) return; /* compatible with init on NULL */
897 (void)ZSTD_pthread_mutex_init(&best->mutex, NULL);
898 (void)ZSTD_pthread_cond_init(&best->cond, NULL);
899 best->liveJobs = 0;
[all …]
|
| /external/eigen/bench/ |
| 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 …]
|
| /external/musl/src/network/ |
| D | inet_ntop.c | 10 int i, j, max, best; in inet_ntop() local
34 for (i=best=0, max=2; buf[i]; i++) { in inet_ntop()
37 /* The leading sequence of zeros (best==0) is in inet_ntop()
42 if (j>max+(best==0)) best=i, max=j; in inet_ntop()
45 buf[best] = buf[best+1] = ':'; in inet_ntop()
46 memmove(buf+best+2, buf+best+max, i-best-max+1); in inet_ntop()
|
| /external/toolchain-utils/bestflags/ |
| D | hill_climb_best_neighbor.py | 9 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/python/cpython3/Lib/test/test_zipfile/_path/ |
| D | test_complexity.py | 22 best, others = big_o.big_o(
30 assert best <= big_o.complexities.Linear
71 best, others = big_o.big_o(
77 assert best <= big_o.complexities.Constant
81 best, others = big_o.big_o(
87 assert best <= big_o.complexities.Linear
91 best, others = big_o.big_o(
97 assert best <= big_o.complexities.Linear
101 best, others = big_o.big_o(
107 assert best <= big_o.complexities.Linear
|
| /external/swiftshader/third_party/llvm-16.0/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.h | 167 // The best SUnit candidate.
181 void setBest(SISchedCandidate &Best) { in setBest()
182 assert(Best.Reason != NoCand && "uninitialized Sched candidate"); in setBest()
183 SU = Best.SU; in setBest()
184 Reason = Best.Reason; in setBest()
185 SGPRUsage = Best.SGPRUsage; in setBest()
186 VGPRUsage = Best.VGPRUsage; in setBest()
187 IsLowLatency = Best.IsLowLatency; in setBest()
188 LowLatencyOffset = Best.LowLatencyOffset; in setBest()
189 HasLowLatencyNonWaitedParent = Best.HasLowLatencyNonWaitedParent; in setBest()
[all …]
|
| /external/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.h | 163 // 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/oboe/tests/ |
| D | testResampler.cpp | 152 MultiChannelResampler::Quality::Best in TEST()
166 checkResampler(8000, 11025, MultiChannelResampler::Quality::Best); in TEST()
169 checkResampler(8000, 48000, MultiChannelResampler::Quality::Best); in TEST()
173 checkResampler(8000, 44100, MultiChannelResampler::Quality::Best); in TEST()
177 checkResampler(11025, 24000, MultiChannelResampler::Quality::Best); in TEST()
194 checkResampler(11025, 48000, MultiChannelResampler::Quality::Best); in TEST()
198 checkResampler(11025, 44100, MultiChannelResampler::Quality::Best); in TEST()
202 checkResampler(11025, 88200, MultiChannelResampler::Quality::Best); in TEST()
206 checkResampler(16000, 48000, MultiChannelResampler::Quality::Best); in TEST()
213 checkResampler(44100, 48000, MultiChannelResampler::Quality::Best); in TEST()
[all …]
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/ |
| D | SIMachineScheduler.h | 170 // 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/libaom/av1/encoder/ |
| D | rdopt.h | 43 * 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/python/cpython3/Doc/howto/ |
| D | annotations.rst | 4 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
75 Best practice for accessing the annotations dict of other
77 as best practice for 3.10, assuming you aren't calling
[all …]
|
| /external/trusty/musl/src/network/ |
| D | inet_ntop.c | 10 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()
|