| /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()
138 int degree, degree2, numberOfSquareRoots = 0; in computeBig() local
161 degree = getPadeDegree(normIminusT); in computeBig()
163 if (degree - degree2 <= 1 || hasExtraSquareRoot) in computeBig()
171 computePade(degree, IminusT, res); in computeBig()
184 int degree = 3; in getPadeDegree() local
185 for (; degree <= 4; ++degree) in getPadeDegree()
[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/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
| D | PolynomialsUtils.java | 95 public static PolynomialFunction createChebyshevPolynomial(final int degree) { in createChebyshevPolynomial() argument
96 return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS, in createChebyshevPolynomial()
120 public static PolynomialFunction createHermitePolynomial(final int degree) { in createHermitePolynomial() argument
121 return buildPolynomial(degree, HERMITE_COEFFICIENTS, in createHermitePolynomial()
146 public static PolynomialFunction createLaguerrePolynomial(final int degree) {
147 return buildPolynomial(degree, LAGUERRE_COEFFICIENTS,
173 public static PolynomialFunction createLegendrePolynomial(final int degree) {
174 return buildPolynomial(degree, LEGENDRE_COEFFICIENTS,
193 private static PolynomialFunction buildPolynomial(final int degree,
199 if (degree > maxDegree) {
[all …]
|
| D | PolynomialFunctionNewtonForm.java | 101 public int degree() { in degree() method in PolynomialFunctionNewtonForm
178 final int n = degree(); in computeCoefficients()
|
| /external/libgdx/gdx/src/com/badlogic/gdx/math/ |
| D | BSpline.java | 107 … <T extends Vector<T>> T calculate (final T out, final float t, final T[] points, final int degree, in calculate() argument
109 final int n = continuous ? points.length : points.length - degree; in calculate()
113 return calculate(out, i, u, points, degree, continuous, tmp); in calculate()
124 …<T extends Vector<T>> T derivative (final T out, final float t, final T[] points, final int degree, in derivative() argument
126 final int n = continuous ? points.length : points.length - degree; in derivative()
130 return derivative(out, i, u, points, degree, continuous, tmp); in derivative()
142 …ector<T>> T calculate (final T out, final int i, final float u, final T[] points, final int degree, in calculate() argument
144 switch (degree) { in calculate()
160 …ctor<T>> T derivative (final T out, final int i, final float u, final T[] points, final int degree, in derivative() argument
162 switch (degree) { in derivative()
[all …]
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/ |
| D | PolynomialFitter.java | 39 private final int degree; field in PolynomialFitter
47 …public PolynomialFitter(int degree, final DifferentiableMultivariateVectorialOptimizer optimizer) { in PolynomialFitter() argument
49 this.degree = degree; in PolynomialFitter()
76 … return new PolynomialFunction(fitter.fit(new ParametricPolynomial(), new double[degree + 1])); in fit()
|
| /external/pdfium/xfa/src/fxbarcode/pdf417/ |
| D | BC_PDF417ECModulusPoly.cpp | 69 int32_t CBC_PDF417ECModulusPoly::getCoefficient(int32_t degree) { in getCoefficient() argument
70 return m_coefficients[m_coefficients.GetSize() - 1 - degree]; in getCoefficient()
215 int32_t degree, in multiplyByMonomial() argument
218 if (degree < 0) { in multiplyByMonomial()
231 product.SetSize(size + degree); in multiplyByMonomial()
306 for (int32_t degree = getDegree(); degree >= 0; degree--) { in toString() local
307 int32_t coefficient = getCoefficient(degree); in toString()
317 if (degree == 0 || coefficient != 1) { in toString()
320 if (degree != 0) { in toString()
321 if (degree == 1) { in toString()
[all …]
|
| D | BC_PDF417ECModulusGF.cpp | 67 int32_t degree, in buildMonomial() argument
70 if (degree < 0) { in buildMonomial()
82 coefficients.SetSize(degree + 1); in buildMonomial()
|
| D | BC_PDF417ECModulusPoly.h | 20 int32_t getCoefficient(int32_t degree);
27 CBC_PDF417ECModulusPoly* multiplyByMonomial(int32_t degree,
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| D | test_graphutil.py | 62 degree = graph.inc_degree(node)
64 counts[degree] += 1
66 counts[degree] = 1
70 for degree, count in counts.items():
71 P[degree] = count * 1.0 / total_counts
|
| /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()
155 d = degree[i]; in minimum_degree_ordering()
250 head[degree[i]] = next[i]; in minimum_degree_ordering()
260 degree[k] = dk; /* external degree of k - |Lk\i| */ in minimum_degree_ordering()
282 w[e] = degree[e] + wnvi; /* 1st time e seen in scan 1 */ in minimum_degree_ordering()
336 degree[i] = std::min<Index> (degree[i], d); /* update degree(i) */ in minimum_degree_ordering()
347 degree[k] = dk; /* finalize |Lk| */ in minimum_degree_ordering()
396 d = degree[i] + dk - nvi; /* compute external degree(i) */ in minimum_degree_ordering()
403 degree[i] = d; in minimum_degree_ordering()
|
| /external/pdfium/xfa/src/fxbarcode/common/reedsolomon/ |
| D | BC_ReedSolomon.cpp | 33 CBC_ReedSolomonGF256Poly* CBC_ReedSolomonEncoder::BuildGenerator(int32_t degree, in BuildGenerator() argument
35 if (degree >= m_cachedGenerators.GetSize()) { in BuildGenerator()
39 for (int32_t d = m_cachedGenerators.GetSize(); d <= degree; d++) { in BuildGenerator()
53 return (CBC_ReedSolomonGF256Poly*)(m_cachedGenerators[degree]); in BuildGenerator()
|
| D | BC_ReedSolomonGF256.cpp | 79 int32_t degree, in BuildMonomial() argument
82 if (degree < 0) { in BuildMonomial()
92 coefficients.SetSize(degree + 1); in BuildMonomial()
|
| D | BC_ReedSolomonGF256Poly.h | 15 int32_t GetCoefficients(int32_t degree);
25 CBC_ReedSolomonGF256Poly* MultiplyByMonomial(int32_t degree,
|
| D | BC_ReedSolomonGF256Poly.cpp | 73 int32_t CBC_ReedSolomonGF256Poly::GetCoefficients(int32_t degree) { in GetCoefficients() argument
74 return m_coefficients[m_coefficients.GetSize() - 1 - degree]; in GetCoefficients()
190 int32_t degree, in MultiplyByMonomial() argument
193 if (degree < 0) { in MultiplyByMonomial()
204 product.SetSize(size + degree); in MultiplyByMonomial()
|
| /external/chromium-trace/catapult/tracing/third_party/gl-matrix/src/gl-matrix/ |
| D | common.js | 41 var degree = Math.PI / 180; variable
49 return a * degree;
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| D | SmoothingPolynomialBicubicSplineInterpolator.java | 54 public SmoothingPolynomialBicubicSplineInterpolator(int degree) { in SmoothingPolynomialBicubicSplineInterpolator() argument
55 this(degree, degree); in SmoothingPolynomialBicubicSplineInterpolator()
|
| /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/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| D | LongArray.java | 442 public int degree() in degree() method in LongArray
863 int aDeg = degree(); in modMultiplyLD()
868 int bDeg = other.degree(); in modMultiplyLD()
995 int aDeg = degree(); in modMultiply()
1000 int bDeg = other.degree(); in modMultiply()
1127 int aDeg = degree(); in modMultiplyAlt()
1132 int bDeg = other.degree(); in modMultiplyAlt()
1351 int aDeg = degree(); in multiply()
1356 int bDeg = other.degree(); in multiply()
2056 int uzDegree = degree(); in modInverse()
|
| /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/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
| D | GraggBulirschStoerStepInterpolator.java | 386 final int degree = in.readInt(); in readExternal() local
387 resetTables(degree); in readExternal()
388 currentDegree = degree; in readExternal()
|
| /external/freetype/include/freetype/internal/services/ |
| D | svkern.h | 34 FT_Int degree,
|