| /external/webrtc/talk/media/base/ |
| D | videocapturer_unittest.cc | 343 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/missing/ |
| D | inet_ntop.c | 113 } best, cur; in inet_ntop_v6() local
125 best.len = 0; in inet_ntop_v6()
126 best.base = -1; in inet_ntop_v6()
139 if (best.base == -1 || cur.len > best.len) in inet_ntop_v6()
140 best = cur; in inet_ntop_v6()
144 if ((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop_v6()
145 best = cur; in inet_ntop_v6()
146 if (best.base != -1 && best.len < 2) in inet_ntop_v6()
147 best.base = -1; in inet_ntop_v6()
154 /* Are we inside the best run of 0x00's? in inet_ntop_v6()
[all …]
|
| /external/curl/lib/ |
| D | inet_ntop.c | 92 } best, cur; in inet_ntop6() local
104 best.base = -1; in inet_ntop6()
106 best.len = 0; in inet_ntop6()
117 if(best.base == -1 || cur.len > best.len) in inet_ntop6()
118 best = cur; in inet_ntop6()
122 if((cur.base != -1) && (best.base == -1 || cur.len > best.len)) in inet_ntop6()
123 best = cur; in inet_ntop6()
124 if(best.base != -1 && best.len < 2) in inet_ntop6()
125 best.base = -1; in inet_ntop6()
129 /* Are we inside the best run of 0x00's? */ in inet_ntop6()
[all …]
|
| /external/c-ares/ |
| D | inet_ntop.c | 129 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/eigen/bench/ |
| D | bench_gemm.cpp | 129 int tries = 2; // number of tries, we keep the best in main()
202 …std::cout << "blas cpu " << tblas.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
203 …std::cout << "blas real " << tblas.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
209 …std::cout << "eigen cpu " << tmt.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
210 …std::cout << "eigen real " << tmt.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t… in main()
220 …std::cout << "eigen mono cpu " << tmono.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
221 …std::cout << "eigen mono real " << tmono.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2… in main()
222 …t << "mt speed up x" << tmono.best(CPU_TIMER) / tmt.best(REAL_TIMER) << " => " << (100.0*tmono.be… in main()
238 …std::cout << "\"matlab\" cpu " << t.best(CPU_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
239 …std::cout << "\"matlab\" real " << t.best(REAL_TIMER)/rep << "s \t" << (double(m)*n*p*rep*2/t.b… in main()
[all …]
|
| D | quatmul.cpp | 33 …std::cout << label << " default " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best… in bench()
36 …std::cout << label << " novec " << 1e3*t.best(CPU_TIMER) << "ms \t" << 1e-6*double(rep)/(t.best… in bench()
|
| /external/webrtc/webrtc/modules/audio_coding/codecs/isac/fix/source/ |
| D | pitch_estimator.c | 105 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/webp/src/enc/ |
| D | alpha.c | 33 // prediction modes 0 to 3 and pick the best one.
200 // Quick estimate of the best candidate. in GetFilterMap()
210 // For large number of colors, try FILTER_NONE in addition to the best in GetFilterMap()
235 FilterTrial best; in ApplyFiltersAndEncode() local
238 InitFilterTrial(&best); in ApplyFiltersAndEncode()
250 if (ok && trial.score < best.score) { in ApplyFiltersAndEncode()
251 VP8BitWriterWipeOut(&best.bw); in ApplyFiltersAndEncode()
252 best = trial; in ApplyFiltersAndEncode()
261 reduce_levels, effort_level, NULL, &best); in ApplyFiltersAndEncode()
265 stats->lossless_features = best.stats.lossless_features; in ApplyFiltersAndEncode()
[all …]
|
| /external/skia/tests/ |
| D | StrokerTest.cpp | 134 int best = 0; in DEF_TEST() local
145 if (best < gMaxRecursion[2]) { in DEF_TEST()
153 best = gMaxRecursion[2]; in DEF_TEST()
162 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
213 int best = 0; in DEF_TEST() local
237 if (best < gMaxRecursion[2]) { in DEF_TEST()
245 best = gMaxRecursion[2]; in DEF_TEST()
254 SkDebugf("\n%s max quad=%d\n", __FUNCTION__, best); in DEF_TEST()
323 int best = 0; in DEF_TEST() local
341 if (best < gMaxRecursion[2]) { in DEF_TEST()
[all …]
|
| /external/libavc/encoder/ |
| D | ih264e_intra_modes_eval.h | 107 * 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/webrtc/webrtc/p2p/base/ |
| D | p2ptransportchannel.cc | 82 // 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/selinux/libselinux/man/man3/ |
| D | selabel_lookup_best_match.3 | 4 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/libvpx/libvpx/vp8/encoder/ |
| D | encodemb.c | 204 int best; in optimize_b() local
270 /* And pick the best. */ in optimize_b()
271 best = rd_cost1 < rd_cost0; in optimize_b()
275 tokens[i][0].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
276 tokens[i][0].error = d2 + (best ? error1 : error0); in optimize_b()
280 best_mask[0] |= best << i; in optimize_b()
336 /* And pick the best. */ in optimize_b()
337 best = rd_cost1 < rd_cost0; in optimize_b()
345 tokens[i][1].rate = base_bits + (best ? rate1 : rate0); in optimize_b()
346 tokens[i][1].error = d2 + (best ? error1 : error0); in optimize_b()
[all …]
|
| /external/opencv3/modules/calib3d/src/ |
| D | rho.cpp | 286 /* Best model (so far) */
291 } best; member
590 * - The buffer for the best-so-far homography
605 best.inl = NULL; in initialize()
606 best.numInl = 0; in initialize()
774 return isBestModelGoodEnough() ? best.numInl : 0; in rhoHest()
825 best.H = (float*) (ptr + best_H_of); in allocatePerObj()
862 best.inl = (char*)(ptr + best_inl_of); in allocatePerRun()
874 best.inl = NULL; in deallocatePerRun()
891 best.H = NULL; in deallocatePerObj()
[all …]
|
| /external/ppp/pppd/plugins/pppoatm/ |
| D | misc.c | 24 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/apache-commons-math/src/main/java/org/apache/commons/math/genetics/ |
| D | ElitisticListPopulation.java | 25 * 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/freetype/src/autofit/ |
| D | afhints.h | 122 * Each segment has at most one `best' candidate to form a black
128 * best segment_1 = segment_2 && best segment_2 = segment_1
130 * The best candidate is stored in field `link' in structure
133 * In the above ASCII drawing, the best candidate for both AB and CD is
134 * GH, while the best candidate for GH is AB. Similarly, the best
135 * candidate for EF and GH is AB, while the best candidate for AB is
149 * best segment_1 = segment_2 && best segment_2 != segment_1
154 * The best candidate is stored in field `serif' in structure
|
| /external/zopfli/src/zopfli/ |
| D | blocksplitter.c | 46 double best = ZOPFLI_LARGE_FLOAT; in FindMinimum() local
51 if (v < best) { in FindMinimum()
52 best = v; in FindMinimum()
64 double best; in FindMinimum() local
76 best = vp[0]; in FindMinimum()
78 if (vp[i] < best) { in FindMinimum()
79 best = vp[i]; in FindMinimum()
83 if (best > lastbest) break; in FindMinimum()
89 lastbest = best; in FindMinimum()
|
| /external/chromium-trace/catapult/third_party/apiclient/googleapiclient/ |
| D | mimeparse.py | 83 """Find the best match for a mime-type amongst parsed media-ranges.
85 Find the best match for a given mime-type against a list of media_ranges
87 the fitness value and the value of the 'q' quality parameter of the best
117 """Find the best match for a mime-type amongst parsed media-ranges.
119 Find the best match for a given mime-type against a list of media_ranges
121 quality parameter of the best match, 0 if no match was found. This function
148 Takes a list of supported mime-types and finds the best match for all the
|
| /external/opencv3/doc/py_tutorials/py_feature2d/py_matcher/ |
| D | py_matcher.markdown | 27 in set B as the best match and vice-versa. That is, the two features in both sets should match each
32 one returns the best match. Second method returns k best matches where k is specified by the user.
37 best matches. There is also **cv2.drawMatchesKnn** which draws all the k best matches. If k=2, it
68 best matches in two images. We sort them in ascending order of their distances so that best matches
102 This time, we will use BFMatcher.knnMatch() to get k best matches. In this example, we will take k=2
|
| /external/opencv3/doc/py_tutorials/py_core/py_optimization/ |
| D | py_optimization.markdown | 68 10 loops, best of 3: 34.9 ms per loop
77 10 loops, best of 3: 64.1 ms per loop
97 10000000 loops, best of 3: 73 ns per loop
100 10000000 loops, best of 3: 58.3 ns per loop
105 1000000 loops, best of 3: 1.25 us per loop
108 1000000 loops, best of 3: 1.16 us per loop
123 100000 loops, best of 3: 15.8 us per loop
126 1000 loops, best of 3: 370 us per loop
|
| /external/robolectric/v1/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowLocationManager.java | 97 // if this provider gets disabled and it was the best active provider, then it's not anymore in setProviderEnabled()
133 …* Returns the best provider with respect to the passed criteria (if any) and its status. If no cri…
135 …* NB: Gps is considered the best provider for fine accuracy and high power consumption, network is…
136 * best provider for coarse accuracy and low power consumption.
267 * @return the criteria used to find the best provider
278 * @return the enabled value used to find the best provider
289 * name of the provider who should be considered best
295 throw new IllegalStateException("Best provider is not a known provider"); in setBestProvider()
297 …// If provider is not enabled but it is supposed to be set as the best enabled provider don't set … in setBestProvider()
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/ |
| D | MultiStartUnivariateRealOptimizer.java | 170 * double, double) optimize} method returns the best point only. This
172 * including the best one already returned by the {@link
179 * runs that did converge first, sorted from best to worst
186 * if the first element is not NaN, it is the best point found across
205 * runs that did converge first, sorted from best to worst
212 * if the first element is not NaN, it is the best point found across
261 // sort the optima from best to worst, followed by NaN elements in optimize()
307 // return the found point given the best objective function value in optimize()
|
| /external/libvpx/libvpx/vp9/encoder/ |
| D | vp9_speed_features.h | 123 // Skips comp inter modes if the best so far is an intra mode.
126 // Skips oblique intra modes if the best so far is an inter mode.
129 // Skips oblique intra modes at angles 27, 63, 117, 153 if the best
216 // If 1 we iterate finding a best reference for 2 ref frames together - via
217 // a log search that iterates 4 times (check around mv for last for best
219 // we just use the best motion vector found for each frame by itself.
253 // of the best so far.
305 // best for 8x8 mode. If set to 0 we always re check all the filters for
352 // higher than the best rd we've seen so far.
|
| /external/neven/Embedded/common/src/b_APIEm/ |
| D | 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) */
|