Home
last modified time | relevance | path

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

12345678910>>...114

/external/webrtc/talk/media/base/
Dvideocapturer_unittest.cc343 cricket::VideoFormat best; in TEST_F() local
344 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
345 EXPECT_EQ(640, best.width); in TEST_F()
346 EXPECT_EQ(480, best.height); in TEST_F()
347 EXPECT_EQ(cricket::VideoFormat::FpsToInterval(30), best.interval); in TEST_F()
350 EXPECT_FALSE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
353 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
360 cricket::VideoFormat best; in TEST_F() local
362 EXPECT_TRUE(capturer_.GetBestCaptureFormat(desired, &best)); in TEST_F()
363 EXPECT_EQ(1280, best.width); in TEST_F()
[all …]
/external/tcpdump/
Daddrtostr.c115 } best, cur; in addrtostr6() local
127 best.len = 0; in addrtostr6()
128 best.base = -1; in addrtostr6()
141 if (best.base == -1 || cur.len > best.len) in addrtostr6()
142 best = cur; in addrtostr6()
146 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in addrtostr6()
147 best = cur; in addrtostr6()
148 if (best.base != -1 && best.len < 2) in addrtostr6()
149 best.base = -1; in addrtostr6()
166 /* Are we inside the best run of 0x00's? in addrtostr6()
[all …]
/external/curl/lib/
Dinet_ntop.c91 } best, cur; in inet_ntop6() local
103 best.base = -1; in inet_ntop6()
105 best.len = 0; in inet_ntop6()
116 if(best.base == -1 || cur.len > best.len) in inet_ntop6()
117 best = cur; in inet_ntop6()
121 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop6()
122 best = cur; in inet_ntop6()
123 if(best.base != -1 && best.len < 2) in inet_ntop6()
124 best.base = -1; in inet_ntop6()
128 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
[all …]
/external/c-ares/
Dinet_ntop.c129 struct { int base, len; } best, cur; in inet_ntop6() local
141 best.base = -1; in inet_ntop6()
142 best.len = 0; in inet_ntop6()
153 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
154 best = cur; in inet_ntop6()
160 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
161 best = cur; in inet_ntop6()
163 if (best.base != -1 && best.len < 2) in inet_ntop6()
164 best.base = -1; in inet_ntop6()
171 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
[all …]
/external/openssh/openbsd-compat/
Dinet_ntop.c119 struct { int base, len; } best, cur; in inet_ntop6() local
132 best.base = -1; in inet_ntop6()
142 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
143 best = cur; in inet_ntop6()
149 if (best.base == -1 || cur.len > best.len) in inet_ntop6()
150 best = cur; in inet_ntop6()
152 if (best.base != -1 && best.len < 2) in inet_ntop6()
153 best.base = -1; in inet_ntop6()
161 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
162 if (best.base != -1 && i >= best.base && in inet_ntop6()
[all …]
/external/eigen/bench/
Dbench_gemm.cpp145 int tries = 2; // number of tries, we keep the best in main()
262 …std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
263 …std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
269 …std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
270 …std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
280 …std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
281 …std::cout << "eigen mono real " << tmono.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
282 …t << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => " << (100.0*tmono.be… in main()
291 …std::cout << "lazy cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main()
292 …std::cout << "lazy real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/tm… in main()
[all …]
Ddense_solvers.cpp74 results["LLT"][id] = t_llt.best(); in bench()
75 results["LDLT"][id] = t_ldlt.best(); in bench()
76 results["PartialPivLU"][id] = t_lu.best(); in bench()
77 results["FullPivLU"][id] = t_fplu.best(); in bench()
78 results["HouseholderQR"][id] = t_qr.best(); in bench()
79 results["ColPivHouseholderQR"][id] = t_cpqr.best(); in bench()
80 results["CompleteOrthogonalDecomposition"][id] = t_cod.best(); in bench()
81 results["FullPivHouseholderQR"][id] = t_fpqr.best(); in bench()
82 results["JacobiSVD"][id] = t_jsvd.best(); in bench()
83 results["BDCSVD"][id] = t_bdcsvd.best(); in bench()
/external/syslinux/core/thread/
Dschedule.c16 struct thread *st, *nt, *best; in __schedule() local
48 best = NULL; in __schedule()
60 if (!best || nt->prio < best->prio) in __schedule()
61 best = nt; in __schedule()
68 if (!best) in __schedule()
71 if (best != curr) { in __schedule()
76 dprintf("@ %llu -> %p (%s)\n", tsc, best, best->name); in __schedule()
77 __switch_to(best); in __schedule()
/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.
Dtesting_batch.py8 Test the best branching hill climbing algorithms, genetic algorithm and
278 """Test the best result the algorithm should return.
288 best_result: The expected best result of the algorithm. If best_result is
289 -1, the algorithm may or may not return the best value. Therefore, no
302 # The best result of the algorithm so far.
318 # If the mock result of the current task is the best so far, set this
319 # result to be the best result.
349 """Test the best hill climb algorithm.
351 Test whether it finds the best results as expected.
366 # of all the flags. Therefore, the best value is supposed to be 0, i.e.,
[all …]
/external/libcups/cups/
Ddest-options.c1797 *best = NULL, /* Best matching entry */ in cups_get_media_db() local
1829 * Found an exact match, let's figure out the best margins for the flags in cups_get_media_db()
1833 best = mdb; in cups_get_media_db()
1841 if (best->left != 0 || best->right != 0 || best->top != 0 || best->bottom != 0) in cups_get_media_db()
1847 if (mdb->left <= best->left && mdb->right <= best->right && in cups_get_media_db()
1848 mdb->top <= best->top && mdb->bottom <= best->bottom) in cups_get_media_db()
1850 best = mdb; in cups_get_media_db()
1864 (best->left || best->right || best->top || best->bottom)) in cups_get_media_db()
1877 if (mdb->left >= best->left && mdb->right >= best->right && in cups_get_media_db()
1878 mdb->top >= best->top && mdb->bottom >= best->bottom && in cups_get_media_db()
[all …]
/external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/
Dpitch_estimator.c105 int32_t best[4]= {-100, -100, -100, -100}; in FindFour32() local
109 if (in[k] > best[3]) { in FindFour32()
110 if (in[k] > best[2]) { in FindFour32()
111 if (in[k] > best[1]) { in FindFour32()
112 if (in[k] > best[0]) { // The Best in FindFour32()
113 best[3] = best[2]; in FindFour32()
115 best[2] = best[1]; in FindFour32()
117 best[1] = best[0]; in FindFour32()
119 best[0] = in[k]; in FindFour32()
121 } else { // 2nd best in FindFour32()
[all …]
/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/skia/tools/
Dmonobench.cpp43 ns best; in main() member
123 bench.best = std::min(bench.best, elapsed / loops); in main()
126 struct Result { const char* name; ns best; }; in main() member
130 sorted[i].best = benches[i].best; in main()
133 return a.best < b.best; in main()
139 SkDebugf(" %s %gns" , result.name, result.best.count()); in main()
141 SkDebugf(" %s %.3gx", result.name, result.best / sorted[0].best); in main()
/external/selinux/libselinux/man/man3/
Dselabel_lookup_best_match.34 selabel_lookup_best_match \- obtain a best match SELinux security
36 performs a best match lookup operation on the handle
42 The \fIkey\fR parameter is a file path to check for best match using zero or
43 more \fIlink\fR (aliases) parameters. The order of precedence for best match is:
90 The file label backend supports this by looking up the "best match"
92 (aliases). The order of precedence for best match is described above.
/external/webp/src/enc/
Dalpha_enc.c33 // prediction modes 0 to 3 and pick the best one.
203 // Quick estimate of the best candidate. in GetFilterMap()
213 // For large number of colors, try FILTER_NONE in addition to the best in GetFilterMap()
238 FilterTrial best; in ApplyFiltersAndEncode() local
241 InitFilterTrial(&best); in ApplyFiltersAndEncode()
253 if (ok && trial.score < best.score) { in ApplyFiltersAndEncode()
254 VP8BitWriterWipeOut(&best.bw); in ApplyFiltersAndEncode()
255 best = trial; in ApplyFiltersAndEncode()
264 reduce_levels, effort_level, NULL, &best); in ApplyFiltersAndEncode()
268 stats->lossless_features = best.stats.lossless_features; in ApplyFiltersAndEncode()
[all …]
/external/skia/tests/
DStrokerTest.cpp150 int best = 0; in DEF_TEST() local
161 if (best < gMaxRecursion[2]) { in DEF_TEST()
169 best = gMaxRecursion[2]; in DEF_TEST()
178 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
229 int best = 0; in DEF_TEST() local
253 if (best < gMaxRecursion[2]) { in DEF_TEST()
261 best = gMaxRecursion[2]; in DEF_TEST()
270 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
339 int best = 0; in DEF_TEST() local
357 if (best < gMaxRecursion[2]) { in DEF_TEST()
[all …]
/external/swiftshader/third_party/LLVM/lib/Support/
DTargetRegistry.cpp33 const Target *Best = 0, *EquallyBest = 0; in lookupTarget() local
37 if (!Best || Qual > BestQuality) { in lookupTarget()
38 Best = &*it; in lookupTarget()
46 if (!Best) { in lookupTarget()
52 // Otherwise, take the best target, but make sure we don't have two equally in lookupTarget()
53 // good best targets. in lookupTarget()
56 Best->Name + "\" and \"" + EquallyBest->Name + "\""; in lookupTarget()
60 return Best; in lookupTarget()
/external/libavc/encoder/
Dih264e_intra_modes_eval.h107 * evaluate best intra 16x16 mode (rate distortion opt off)
111 * that best represents the macro-block (least distortion) and occupies fewer
145 * evaluate best intra 8x8 mode (rate distortion opt on)
149 * that best represents the macro-block (least distortion) and occupies fewer
181 * evaluate best intra 4x4 mode (rate distortion opt on)
185 * that best represents the macro-block (least distortion) and occupies fewer
204 * 24*lambda is added to the SAD before comparison with the best SAD for
221 * evaluate best intra 4x4 mode (rate distortion opt off)
225 * that best represents the macro-block (least distortion) and occupies fewer
244 * 24*lambda is added to the SAD before comparison with the best SAD for
[all …]
/external/ppp/pppd/plugins/pppoatm/
Dmisc.c24 int i,best; in __atmlib_fetch() local
30 best = -1; in __atmlib_fetch()
35 best = i; in __atmlib_fetch()
40 if (best > -1) (*pos) += best_len; in __atmlib_fetch()
41 return best; in __atmlib_fetch()
/external/syslinux/com32/lib/syslinux/
Dzonelist.c199 struct syslinux_memmap *best = NULL; in syslinux_memmap_largest() local
205 best = list; in syslinux_memmap_largest()
212 if (!best) in syslinux_memmap_largest()
215 *start = best->start; in syslinux_memmap_largest()
235 addr_t size, best; in syslinux_memmap_highest() local
237 for (best = 0; list->type != SMT_END; list = list->next) { in syslinux_memmap_highest()
250 best = ALIGN_DOWN(list->start + size - len, align); in syslinux_memmap_highest()
252 best = ALIGN_DOWN(ceiling - len, align); in syslinux_memmap_highest()
254 if (best < *start) in syslinux_memmap_highest()
255 best = 0; in syslinux_memmap_highest()
[all …]
/external/libvpx/libvpx/vp8/encoder/
Dencodemb.c170 int best; in optimize_b() local
231 /* And pick the best. */ in optimize_b()
232 best = rd_cost1 < rd_cost0; in optimize_b()
236 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
237 tokens[i][0].error = d2 + (best ? error1 : error0); in optimize_b()
241 best_mask[0] |= best << i; in optimize_b()
288 /* And pick the best. */ in optimize_b()
289 best = rd_cost1 < rd_cost0; in optimize_b()
296 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
297 tokens[i][1].error = d2 + (best ? error1 : error0); in optimize_b()
[all …]
/external/webrtc/webrtc/p2p/base/
Dp2ptransportchannel.cc82 // pruning, pinging, and selecting the best connection, we want to treat the in CompareConnectionStates()
92 // In the case where we reconnect TCP connections, the original best in CompareConnectionStates()
191 // STRONG_PING_DELAY (480ms) is applied when the best connection is both
194 // WEAK_PING_DELAY (48ms) is applied when the best connection is either not
198 // If the current best connection is both writable and receiving, then we will
659 LOG(LS_INFO) << "Switching best connection on controlled side: " in OnNominated()
662 // Now we have selected the best connection, time to prune other existing in OnNominated()
667 LOG(LS_INFO) << "Not switching the best connection on controlled side yet," in OnNominated()
904 // Send data to the other side, using our best connection.
976 // Prepare for best candidate sorting.
[all …]
/external/apache-commons-math/src/main/java/org/apache/commons/math/genetics/
DElitisticListPopulation.java25 * Population of chromosomes which uses elitism (certain percentace of the best
44 * how many best chromosomes will be directly transferred to the
58 * how many best chromosomes will be directly transferred to the
68 * <code>{@link #elitismRate}<code> percents of the best
89 * Sets the elitism rate, i.e. how many best chromosomes will be directly
93 * how many best chromosomes will be directly transferred to the
/external/python/cpython2/Doc/library/
Dtimeit.rst34 10000 loops, best of 3: 40.3 usec per loop
36 10000 loops, best of 3: 33.4 usec per loop
38 10000 loops, best of 3: 25.2 usec per loop
224 the best thing to do when accurate timing is necessary is to repeat
225 the timing a few times and use the best time. The :option:`-r` option is good
250 10000000 loops, best of 3: 0.0877 usec per loop
252 1000000 loops, best of 3: 0.342 usec per loop
279 100000 loops, best of 3: 15.7 usec per loop
281 100000 loops, best of 3: 4.26 usec per loop
284 1000000 loops, best of 3: 1.43 usec per loop
[all …]

12345678910>>...114