Searched defs:degree (Results 1 - 25 of 39) sorted by relevance

12

/external/eigen/unsupported/Eigen/src/Splines/
H A DSplineFitting.h31 * where \f$p\f$ is the degree and \f$m+1\f$ the number knots
35 * \param[in] degree The spline degree which is used during the interpolation.
41 void KnotAveraging(const KnotVectorType& parameters, DenseIndex degree, KnotVectorType& knots) argument
43 knots.resize(parameters.size()+degree+1);
45 for (DenseIndex j=1; j<parameters.size()-degree; ++j)
46 knots(j+degree) = parameters.segment(j,degree).mean();
48 knots.segment(0,degree+1) = KnotVectorType::Zero(degree
116 Interpolate(const PointArrayType& pts, DenseIndex degree, const KnotVectorType& knot_parameters) argument
148 Interpolate(const PointArrayType& pts, DenseIndex degree) argument
[all...]
H A DSpline.h31 * degree for optimization purposes (would result in stack allocation
40 enum { Degree = _Degree /*!< The spline curve's degree. */ };
56 * For Splines with dynamic degree, the resulting degree will be 0.
137 * spline degree.
177 * \brief Returns the spline degree.
179 DenseIndex degree() const;
190 static DenseIndex Span(typename SplineTraits<Spline>::Scalar u, DenseIndex degree, const typename SplineTraits<Spline>::KnotVectorType& knots);
201 * \param degree The degree o
213 Span( typename SplineTraits< Spline<_Scalar, _Dim, _Degree> >::Scalar u, DenseIndex degree, const typename SplineTraits< Spline<_Scalar, _Dim, _Degree> >::KnotVectorType& knots) argument
226 BasisFunctions( typename Spline<_Scalar, _Dim, _Degree>::Scalar u, DenseIndex degree, const typename Spline<_Scalar, _Dim, _Degree>::KnotVectorType& knots) argument
261 DenseIndex Spline<_Scalar, _Dim, _Degree>::degree() const function in class:Eigen::Spline
[all...]
/external/chromium_org/third_party/boringssl/src/crypto/ecdsa/
H A Decdsa_test.c75 unsigned int sig_len, degree, r_len, s_len, bn_len, buf_len; local
111 degree = EC_GROUP_get_degree(EC_KEY_get0_group(eckey));
112 if (degree < 160) {
206 bn_len = (degree + 7) / 8;
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3bitset.c485 ANTLR3_UINT32 degree; local
494 degree = 0;
503 degree++;
508 return degree;
/external/ceres-solver/internal/ceres/
H A Dpolynomial.cc57 const int degree = companion_matrix.rows(); local
71 for (int i = 0; i < degree; ++i) {
107 const int degree = polynomial.size() - 1; local
109 companion_matrix.resize(degree, degree);
112 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree);
191 const int degree = polynomial.size() - 1; local
199 if (degree == 0) {
209 if (degree
254 const int degree = polynomial.rows() - 1; local
344 const int degree = num_constraints - 1; local
[all...]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixLogarithm.h57 void computePade(MatrixType& result, const MatrixType& T, int degree);
131 int degree; local
142 degree = getPadeDegree(normTminusI);
144 if ((degree - degree2 <= 1) || (numberOfExtraSquareRoots == 1))
153 computePade(result, T, degree);
157 /* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = float) */
161 const float maxNormForPade[] = { 2.5111573934555054e-1 /* degree = 3 */ , 4.0535837411880493e-1,
163 int degree = 3; local
164 for (; degree <= maxPadeDegree; ++degree)
176 int degree = 3; local
207 int degree = 3; local
216 computePade(MatrixType& result, const MatrixType& T, int degree) argument
235 const int degree = 3; local
251 const int degree = 4; local
267 const int degree = 5; local
285 const int degree = 6; local
303 const int degree = 7; local
323 const int degree = 8; local
343 const int degree = 9; local
365 const int degree = 10; local
387 const int degree = 11; local
[all...]
H A DMatrixPower.h57 void computePade(int degree, const MatrixType& IminusT, MatrixType& res) const;
95 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, MatrixType& res) const argument
97 int i = degree<<1;
98 res = (m_p-degree) / ((i-1)<<1) * IminusT;
139 int degree, degree2, numberOfSquareRoots = 0; local
162 degree = getPadeDegree(normIminusT);
164 if (degree - degree2 <= 1 || hasExtraSquareRoot)
172 computePade(degree, IminusT, res);
184 const float maxNormForPade[] = { 2.8064004e-1f /* degree = 3 */ , 4.3386528e-1f };
185 int degree local
197 int degree = 3; local
229 int degree = 3; local
[all...]
/external/openssl/crypto/ecdsa/
H A Decdsatest.c296 unsigned int sig_len, degree, r_len, s_len, bn_len, buf_len; local
346 degree = EC_GROUP_get_degree(EC_KEY_get0_group(eckey));
347 if (degree < 160)
446 bn_len = (degree + 7) / 8;
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowMapView.java137 private int scaleDegree(int degree, int minPixel, int maxPixel, int centerDegree, int spanDegrees) { argument
139 int offsetDegrees = degree - minDegree;
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
H A DIntArray.java180 public int degree() method in class:IntArray
729 // Input: A nonzero polynomial a(z) of degree at most m-1
732 int uzDegree = degree();
762 int j = uzDegree - vz.degree();
785 uzDegree = uz.degree();
H A DLongArray.java423 public int degree() method in class:LongArray
842 * Find out the degree of each argument and handle the zero cases
844 int aDeg = degree();
849 int bDeg = other.degree();
974 * Find out the degree of each argument and handle the zero cases
976 int aDeg = degree();
981 int bDeg = other.degree();
1103 * Find out the degree of each argument and handle the zero cases
1105 int aDeg = degree();
1110 int bDeg = other.degree();
[all...]
/external/chromium_org/third_party/skia/experimental/Intersection/
H A DNearestPoint.cpp74 Point2 *w; /* Ctl pts for 5th-degree eqn */
79 /* Convert problem to 5th-degree Bezier form */
82 /* Find all possible roots of 5th-degree equation */
125 * Given a point and a Bezier curve, generate a 5th-degree
137 Point2 *w; /* Ctl pts of 5th-degree curve */
190 * Given a 5th-degree equation in Bernstein-Bezier form, find
194 static int FindRoots(w, degree, t, depth)
196 int degree; /* The degree of the polynomial */ variable
208 switch (CrossingCount(w, degree)) {
255 int degree; /* Degreee of Bezier curve */ variable
280 int degree; /* Degree of polynomial */ variable
391 int degree; /* Degree of curve */ variable
426 int degree; /* Degree of bezier curve */ variable
[all...]
/external/chromium_org/ui/events/gesture_detection/
H A Dvelocity_tracker.cc62 // Polynomial degree (number of coefficients), or zero if no information is
64 uint32_t degree;
72 degree = 0;
120 LeastSquaresVelocityTrackerStrategy(uint32_t degree,
160 explicit IntegratingVelocityTrackerStrategy(uint32_t degree);
175 uint32_t degree;
360 if (GetEstimator(id, &estimator) && estimator.degree >= 1) {
395 uint32_t degree,
397 : degree_(degree), weighting_(weighting) {
410 * Solves a linear least squares problem to obtain a N degree polynomia
394 LeastSquaresVelocityTrackerStrategy( uint32_t degree, Weighting weighting) argument
700 IntegratingVelocityTrackerStrategy( uint32_t degree) argument
[all...]
/external/eigen/Eigen/src/OrderingMethods/
H A DAmd.h86 * Approximate minimum degree ordering algorithm.
115 Index* degree = W + 5*(n+1); local
130 head[i] = -1; // degree list i is empty
137 degree[i] = len[i]; // degree of node i
144 /* --- Initialize degree lists ------------------------------------------ */
147 d = degree[i];
166 next[i] = head[d]; /* put node i in degree list d */
173 /* --- Select node of minimum approximate degree -------------------- */
176 head[mindeg] = next[k]; /* remove k from degree lis
[all...]
H A DEigen_Colamd.h159 /* a degree list */
160 Index hash ; /* hash value, if col is not in a degree list */
161 Index prev ; /* previous column in degree list, if col is in a */
162 /* degree list (but not at the head of a degree list) */
166 Index degree_next ; /* next column, if col is in a degree list */
179 Index degree ; /* number of principal & non-principal columns in row */ member in union:internal::Colamd_Row::__anon20935
312 * \brief Computes a column ordering using the column approximate minimum degree ordering
343 Index max_deg ; /* maximum row degree */
651 Row [row].shared1.degree
[all...]
/external/openssl/crypto/ec/
H A Dectest.c456 fprintf(stdout, "verify degree ...");
490 fprintf(stdout, "verify degree ...");
524 fprintf(stdout, "verify degree ...");
559 fprintf(stdout, "verify degree ...");
599 fprintf(stdout, "verify degree ...");
645 fprintf(stdout, "verify degree ...");
809 fprintf(stdout, "verify degree ..."); \
1316 int degree; member in struct:nistp_test_params
1376 fprintf(stdout, "\nNIST curve P-%d (optimised implementation):\n", test->degree);
1404 fprintf(stdout, "verify degree
[all...]
/external/skia/experimental/Intersection/
H A DNearestPoint.cpp74 Point2 *w; /* Ctl pts for 5th-degree eqn */
79 /* Convert problem to 5th-degree Bezier form */
82 /* Find all possible roots of 5th-degree equation */
125 * Given a point and a Bezier curve, generate a 5th-degree
137 Point2 *w; /* Ctl pts of 5th-degree curve */
190 * Given a 5th-degree equation in Bernstein-Bezier form, find
194 static int FindRoots(w, degree, t, depth)
196 int degree; /* The degree of the polynomial */ variable
208 switch (CrossingCount(w, degree)) {
255 int degree; /* Degreee of Bezier curve */ variable
280 int degree; /* Degree of polynomial */ variable
391 int degree; /* Degree of curve */ variable
426 int degree; /* Degree of bezier curve */ variable
[all...]
/external/chromium_org/third_party/freetype/include/freetype/internal/
H A Dt1types.h150 FT_Int degree; member in struct:AFM_TrackKernRec_
/external/chromium_org/ui/gfx/
H A Dtransform_unittest.cc406 float degree; member in struct:gfx::__anon16913::SetRotateCase
427 xform.Rotate(value.degree);
429 if (value.degree == value.degree) {
650 float degree; member in struct:gfx::__anon16913::SetRotateCase
671 xform.Rotate(value.degree + j * epsilon);
673 if (value.degree == value.degree) {
746 // this path crosses the 180-degree point.
796 // A 180 degree rotatio
[all...]
/external/freetype/include/internal/
H A Dt1types.h150 FT_Int degree; member in struct:AFM_TrackKernRec_
/external/pdfium/core/include/thirdparties/freetype/freetype/internal/
H A Dt1types.h150 FT_Int degree; member in struct:AFM_TrackKernRec_
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/internal/
H A Dt1types.h150 FT_Int degree; member in struct:AFM_TrackKernRec_
/external/kernel-headers/original/uapi/drm/
H A Dexynos_drm.h200 * @degree: flag of degree information.
217 __u32 degree; member in struct:drm_exynos_ipp_prop_list
235 * @degree: property of rotation degree.
243 enum drm_exynos_degree degree; member in struct:drm_exynos_ipp_config
/external/pdfium/core/src/fpdftext/
H A Dfpdf_text.cpp700 int degree = (int)(angle * 180 / PI + 0.5); local
701 if (degree % 90) {
704 if (degree < 0) {
705 degree += 360;
707 int index = degree / 90 % 3 - 1;
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_ra.cpp642 uint32_t degree; member in class:nv50_ir::GCRA::RIG_Node
728 nodes[i].degree, nodes[i].degreeLimit);
752 degree = 0;
981 this->degree += relDegree[node->colors][colors];
982 node->degree += relDegree[colors][node->colors];
1106 if (nodes[i].degree < nodes[i].degreeLimit) {
1122 bool move = b->degree >= b->degreeLimit;
1126 a->getValue()->id, a->degree, a->degreeLimit,
1127 b->getValue()->id, b->degree, b->degreeLimit);
1129 b->degree
[all...]

Completed in 1203 milliseconds

12