Home
last modified time | relevance | path

Searched refs:minc (Results 1 – 7 of 7) sorted by relevance

/external/python/cpython2/Lib/
Dcolorsys.py69 minc = min(r, g, b)
71 l = (minc+maxc)/2.0
72 if minc == maxc:
75 s = (maxc-minc) / (maxc+minc)
77 s = (maxc-minc) / (2.0-maxc-minc)
78 rc = (maxc-r) / (maxc-minc)
79 gc = (maxc-g) / (maxc-minc)
80 bc = (maxc-b) / (maxc-minc)
118 minc = min(r, g, b)
120 if minc == maxc:
[all …]
/external/python/cpython3/Lib/
Dcolorsys.py77 minc = min(r, g, b)
79 l = (minc+maxc)/2.0
80 if minc == maxc:
83 s = (maxc-minc) / (maxc+minc)
85 s = (maxc-minc) / (2.0-maxc-minc)
86 rc = (maxc-r) / (maxc-minc)
87 gc = (maxc-g) / (maxc-minc)
88 bc = (maxc-b) / (maxc-minc)
126 minc = min(r, g, b)
128 if minc == maxc:
[all …]
/external/eigen/test/
Dredux.cpp32 Scalar s(0), p(1), minc(numext::real(m1.coeff(0))), maxc(numext::real(m1.coeff(0))); in matrixRedux() local
38 minc = (std::min)(numext::real(minc), numext::real(m1(i,j))); in matrixRedux()
46 VERIFY_IS_APPROX(m1.real().minCoeff(), numext::real(minc)); in matrixRedux()
93 RealScalar minc(numext::real(v.coeff(0))), maxc(numext::real(v.coeff(0))); in vectorRedux() local
98 minc = (std::min)(minc, numext::real(v[j])); in vectorRedux()
103 VERIFY_IS_APPROX(minc, v.real().head(i).minCoeff()); in vectorRedux()
110 RealScalar minc(numext::real(v.coeff(i))), maxc(numext::real(v.coeff(i))); in vectorRedux() local
115 minc = (std::min)(minc, numext::real(v[j])); in vectorRedux()
120 VERIFY_IS_APPROX(minc, v.real().tail(size-i).minCoeff()); in vectorRedux()
127 RealScalar minc(numext::real(v.coeff(i))), maxc(numext::real(v.coeff(i))); in vectorRedux() local
[all …]
Dvisitor.cpp28 Scalar minc = Scalar(1000), maxc = Scalar(-1000); in matrixVisitor() local
33 if(m(i,j) < minc) in matrixVisitor()
35 minc = m(i,j); in matrixVisitor()
54 VERIFY_IS_APPROX(minc, eigen_minc); in matrixVisitor()
56 VERIFY_IS_APPROX(minc, m.minCoeff()); in matrixVisitor()
80 Scalar minc = v(0), maxc = v(0); in vectorVisitor() local
84 if(v(i) < minc) in vectorVisitor()
86 minc = v(i); in vectorVisitor()
101 VERIFY_IS_APPROX(minc, eigen_minc); in vectorVisitor()
103 VERIFY_IS_APPROX(minc, v.minCoeff()); in vectorVisitor()
/external/fio/
Dgettime.c264 uint64_t minc, maxc, avg, cycles[NR_TIME_ITERS]; in calibrate_cpu_clock() local
287 minc = -1ULL; in calibrate_cpu_clock()
292 minc = min(cycles[i], minc); in calibrate_cpu_clock()
309 (unsigned long long) minc, in calibrate_cpu_clock()
/external/libvpx/libvpx/vp9/encoder/
Dvp9_mcomp.c168 if (c >= minc && c <= maxc && r >= minr && r <= maxr) { \
196 if (c >= minc && c <= maxc && r >= minr && r <= maxr) { \
307 int minc, maxc, minr, maxr; \
313 minc = subpel_mv_limits.col_min; \
413 (void)minc; in vp9_skip_sub_pixel_tree()
665 int minc, maxc, minr, maxr; in vp9_find_best_sub_pixel_tree() local
675 minc = subpel_mv_limits.col_min; in vp9_find_best_sub_pixel_tree()
697 if (tc >= minc && tc <= maxc && tr >= minr && tr <= maxr) { in vp9_find_best_sub_pixel_tree()
728 if (tc >= minc && tc <= maxc && tr >= minr && tr <= maxr) { in vp9_find_best_sub_pixel_tree()
2289 (void)minc; in vp9_return_max_sub_pixel_mv()
[all …]
/external/libvpx/libvpx/vp8/encoder/
Dmcomp.c205 if (c >= minc && c <= maxc && r >= minr && r <= maxr) s else e;
242 int minc = VPXMAX(x->mv_col_min * 4, in vp8_find_best_sub_pixel_step_iteratively() local