| /external/eigen/unsupported/Eigen/src/Splines/ |
| D | SplineFitting.h | 41 void KnotAveraging(const KnotVectorType& parameters, DenseIndex degree, KnotVectorType& knots) in KnotAveraging() argument
43 knots.resize(parameters.size()+degree+1); in KnotAveraging()
45 for (DenseIndex j=1; j<parameters.size()-degree; ++j) in KnotAveraging()
46 knots(j+degree) = parameters.segment(j,degree).mean(); in KnotAveraging()
48 knots.segment(0,degree+1) = KnotVectorType::Zero(degree+1); in KnotAveraging()
49 knots.segment(knots.size()-degree-1,degree+1) = KnotVectorType::Ones(degree+1); in KnotAveraging()
99 static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree);
111 …static SplineType Interpolate(const PointArrayType& pts, DenseIndex degree, const KnotVectorType& …
116 …SplineType SplineFitting<SplineType>::Interpolate(const PointArrayType& pts, DenseIndex degree, co… in Interpolate() argument
124 KnotAveraging(knot_parameters, degree, knots); in Interpolate()
[all …]
|
| D | Spline.h | 179 DenseIndex degree() const;
190 …static DenseIndex Span(typename SplineTraits<Spline>::Scalar u, DenseIndex degree, const typename …
204 static BasisVectorType BasisFunctions(Scalar u, DenseIndex degree, const KnotVectorType& knots);
215 DenseIndex degree, in Span() argument
219 if (u <= knots(0)) return degree; in Span()
220 …const Scalar* pos = std::upper_bound(knots.data()+degree-1, knots.data()+knots.size()-degree-1, u); in Span()
228 DenseIndex degree, in BasisFunctions() argument
233 const DenseIndex p = degree; in BasisFunctions()
234 const DenseIndex i = Spline::Span(u, degree, knots); in BasisFunctions()
261 DenseIndex Spline<_Scalar, _Dim, _Degree>::degree() const in degree() function
[all …]
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixLogarithm.h | 57 void computePade(MatrixType& result, const MatrixType& T, int degree);
131 int degree; in computeBig() local
142 degree = getPadeDegree(normTminusI); in computeBig()
144 if ((degree - degree2 <= 1) || (numberOfExtraSquareRoots == 1)) in computeBig()
153 computePade(result, T, degree); in computeBig()
163 int degree = 3; in getPadeDegree() local
164 for (; degree <= maxPadeDegree; ++degree) in getPadeDegree()
165 if (normTminusI <= maxNormForPade[degree - minPadeDegree]) in getPadeDegree()
167 return degree; in getPadeDegree()
176 int degree = 3; in getPadeDegree() local
[all …]
|
| D | MatrixPower.h | 57 void computePade(int degree, const MatrixType& IminusT, MatrixType& res) const;
95 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, MatrixType& … in computePade() argument
97 int i = degree<<1; in computePade()
98 res = (m_p-degree) / ((i-1)<<1) * IminusT; in computePade()
139 int degree, degree2, numberOfSquareRoots = 0; in computeBig() local
162 degree = getPadeDegree(normIminusT); in computeBig()
164 if (degree - degree2 <= 1 || hasExtraSquareRoot) in computeBig()
172 computePade(degree, IminusT, res); in computeBig()
185 int degree = 3; in getPadeDegree() local
186 for (; degree <= 4; ++degree) in getPadeDegree()
[all …]
|
| /external/skia/experimental/Intersection/ |
| D | NearestPoint.cpp | 194 static int FindRoots(w, degree, t, depth)
196 int degree; /* The degree of the polynomial */ variable
208 switch (CrossingCount(w, degree)) {
219 if (ControlPolygonFlatEnough(w, degree)) {
220 t[0] = ComputeXIntercept(w, degree);
229 Bezier(w, degree, 0.5, Left, Right);
230 left_count = FindRoots(Left, degree, left_t, depth+1);
231 right_count = FindRoots(Right, degree, right_t, depth+1);
253 static int CrossingCount(V, degree)
255 int degree; /* Degreee of Bezier curve */ variable
[all …]
|
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| D | NearestPoint.cpp | 194 static int FindRoots(w, degree, t, depth)
196 int degree; /* The degree of the polynomial */ variable
208 switch (CrossingCount(w, degree)) {
219 if (ControlPolygonFlatEnough(w, degree)) {
220 t[0] = ComputeXIntercept(w, degree);
229 Bezier(w, degree, 0.5, Left, Right);
230 left_count = FindRoots(Left, degree, left_t, depth+1);
231 right_count = FindRoots(Right, degree, right_t, depth+1);
253 static int CrossingCount(V, degree)
255 int degree; /* Degreee of Bezier curve */ variable
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | polynomial.cc | 57 const int degree = companion_matrix.rows(); in BalanceCompanionMatrix() local
71 for (int i = 0; i < degree; ++i) { in BalanceCompanionMatrix()
107 const int degree = polynomial.size() - 1; in BuildCompanionMatrix() local
109 companion_matrix.resize(degree, degree); in BuildCompanionMatrix()
112 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree); in BuildCompanionMatrix()
191 const int degree = polynomial.size() - 1; in FindPolynomialRoots() local
199 if (degree == 0) { in FindPolynomialRoots()
209 if (degree == 1) { in FindPolynomialRoots()
215 if (degree == 2) { in FindPolynomialRoots()
228 Matrix companion_matrix(degree, degree); in FindPolynomialRoots()
[all …]
|
| /external/chromium_org/ui/events/gesture_detection/ |
| D | velocity_tracker.cc | 64 uint32_t degree; member
72 degree = 0; in Clear()
120 LeastSquaresVelocityTrackerStrategy(uint32_t degree,
160 explicit IntegratingVelocityTrackerStrategy(uint32_t degree);
175 uint32_t degree; member
360 if (GetEstimator(id, &estimator) && estimator.degree >= 1) { in GetVelocity()
395 uint32_t degree, in LeastSquaresVelocityTrackerStrategy() argument
397 : degree_(degree), weighting_(weighting) { in LeastSquaresVelocityTrackerStrategy()
605 uint32_t degree = degree_; in GetEstimator() local
606 if (degree > m - 1) in GetEstimator()
[all …]
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| D | Amd.h | 115 Index* degree = W + 5*(n+1); in minimum_degree_ordering() local
137 degree[i] = len[i]; // degree of node i in minimum_degree_ordering()
147 d = degree[i]; in minimum_degree_ordering()
238 head[degree[i]] = next[i]; in minimum_degree_ordering()
248 degree[k] = dk; /* external degree of k - |Lk\i| */ in minimum_degree_ordering()
270 w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */ in minimum_degree_ordering()
324 degree[i] = std::min<Index> (degree[i], d); /* update degree(i) */ in minimum_degree_ordering()
335 degree[k] = dk; /* finalize |Lk| */ in minimum_degree_ordering()
384 d = degree[i] + dk - nvi; /* compute external degree(i) */ in minimum_degree_ordering()
391 degree[i] = d; in minimum_degree_ordering()
|
| /external/chromium_org/third_party/boringssl/src/crypto/ecdsa/ |
| D | ecdsa_test.c | 75 unsigned int sig_len, degree, r_len, s_len, bn_len, buf_len; in test_builtin() local
111 degree = EC_GROUP_get_degree(EC_KEY_get0_group(eckey)); in test_builtin()
112 if (degree < 160) { in test_builtin()
206 bn_len = (degree + 7) / 8; in test_builtin()
|
| /external/opencv/ml/src/ |
| D | mlsvm.cpp | 170 svm_type(CvSVM::C_SVC), kernel_type(CvSVM::RBF), degree(0), in CvSVMParams()
182 degree(_degree), gamma(_gamma), coef0(_coef0), in CvSVMParams()
262 cvPow( &R, &R, params->degree ); in calc_poly()
1231 params.degree = 0; in set_params()
1232 else if( params.degree <= 0 ) in set_params()
1613 double gamma = 0, C = 0, degree = 0, coef = 0, p = 0, nu = 0; in train_auto() local
1676 degree_grid.min_val = degree_grid.max_val = params.degree; in train_auto()
1684 degree_grid.min_val = degree_grid.max_val = params.degree; in train_auto()
1775 degree = degree_grid.min_val; in train_auto()
1778 params.degree = degree; in train_auto()
[all …]
|
| /external/openssl/crypto/ecdsa/ |
| D | ecdsatest.c | 296 unsigned int sig_len, degree, r_len, s_len, bn_len, buf_len; in test_builtin() local
346 degree = EC_GROUP_get_degree(EC_KEY_get0_group(eckey)); in test_builtin()
347 if (degree < 160) in test_builtin()
446 bn_len = (degree + 7) / 8; in test_builtin()
|
| /external/pdfium/core/include/thirdparties/freetype/freetype/internal/services/ |
| D | svkern.h | 34 FT_Int degree,
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/internal/services/ |
| D | svkern.h | 34 FT_Int degree,
|
| /external/chromium_org/third_party/freetype/include/freetype/internal/services/ |
| D | svkern.h | 34 FT_Int degree,
|
| /external/freetype/include/internal/services/ |
| D | svkern.h | 34 FT_Int degree,
|
| /external/antlr/antlr-3.4/runtime/C/src/ |
| D | antlr3bitset.c | 485 ANTLR3_UINT32 degree; in antlr3BitsetSize() local
494 degree = 0; in antlr3BitsetSize()
503 degree++; in antlr3BitsetSize()
508 return degree; in antlr3BitsetSize()
|
| /external/kernel-headers/original/uapi/drm/ |
| D | exynos_drm.h | 217 __u32 degree; member
243 enum drm_exynos_degree degree; member
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/type1/ |
| D | t1afm.h | 46 FT_Int degree,
|
| D | t1afm.c | 361 FT_Int degree, in T1_Get_Track_Kerning() argument
376 if ( tk->degree != degree ) in T1_Get_Track_Kerning()
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | LongArray.java | 423 public int degree() in degree() method in LongArray
844 int aDeg = degree(); in modMultiplyLD()
849 int bDeg = other.degree(); in modMultiplyLD()
976 int aDeg = degree(); in modMultiply()
981 int bDeg = other.degree(); in modMultiply()
1105 int aDeg = degree(); in modMultiplyAlt()
1110 int bDeg = other.degree(); in modMultiplyAlt()
1858 int uzDegree = degree(); in modInverse()
|
| D | IntArray.java | 180 public int degree() in degree() method in IntArray
732 int uzDegree = degree(); in modInverse()
762 int j = uzDegree - vz.degree(); in modInverse()
785 uzDegree = uz.degree(); in modInverse()
|
| /external/qemu/pc-bios/keymaps/ |
| D | it | 29 degree 0x0b shift altgr
86 degree 0x28 shift
|
| D | fr-be | 43 degree 0x0b shift altgr
45 degree 0x0c shift
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| D | ShadowMapView.java | 137 …private int scaleDegree(int degree, int minPixel, int maxPixel, int centerDegree, int spanDegrees)… in scaleDegree() argument
139 int offsetDegrees = degree - minDegree; in scaleDegree()
|