| /external/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 31 * 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)
45 knots.resize(parameters.size()+degree+1);
47 for (DenseIndex j=1; j<parameters.size()-degree; ++j)
48 knots(j+degree) = parameters.segment(j,degree).mean();
50 knots.segment(0,degree+1) = KnotVectorType::Zero(degree+1)
[all...] |
| SplineFwd.h | 17 template <typename Scalar, int Dim, int Degree = Dynamic> class Spline;
23 * \brief Compile-time attributes of the Spline class for Dynamic degree.
30 enum { Degree = _Degree /*!< The spline curve's degree. */ };
56 * \brief Compile-time attributes of the Spline class for fixed degree.
58 * The traits class inherits all attributes from the SplineTraits of Dynamic degree.
73 /** \brief 2D float B-spline with dynamic degree. */
76 /** \brief 3D float B-spline with dynamic degree. */
79 /** \brief 2D double B-spline with dynamic degree. */
82 /** \brief 3D double B-spline with dynamic degree. *
[all...] |
| Spline.h | 31 * degree for optimization purposes (would result in stack allocation
40 enum { Degree = _Degree /*!< The spline curve's degree. */ };
122 * spline degree.
162 * \brief Returns the spline degree.
164 DenseIndex degree() const;
175 static DenseIndex Span(typename SplineTraits<Spline>::Scalar u, DenseIndex degree, const typename SplineTraits<Spline>::KnotVectorType& knots);
186 * \param degree The degree of the underlying spline.
189 static BasisVectorType BasisFunctions(Scalar u, DenseIndex degree, const KnotVectorType& knots)
246 DenseIndex Spline<_Scalar, _Dim, _Degree>::degree() const function in class:Eigen::Spline
[all...] |
| /external/pixman/test/ |
| rotate-test.c | 35 TRANSFORM (0, -1, 1, 0), /* wrong 90 degree rotation */
36 TRANSFORM (0, 1, -1, 0), /* wrong 270 degree rotation */
38 TRANSFORM (-1, 0, 0, -1), /* wrong 180 degree rotation */
39 TRANSFORM (0, -F1, F1, 0), /* correct 90 degree rotation */
40 TRANSFORM (0, F1, -F1, 0), /* correct 270 degree rotation */
42 TRANSFORM (-F1, 0, 0, -F1), /* correct 180 degree rotation */
|
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeyRotationEvent.java | 33 * @param degree Possible rotation degrees, see constants in
38 public MonkeyRotationEvent(int degree, boolean persist) {
40 mRotationDegree = degree;
47 System.out.println(":Sending rotation degree=" + mRotationDegree +
|
| /external/ceres-solver/internal/ceres/ |
| polynomial.cc | 56 const int degree = companion_matrix.rows(); local
70 for (int i = 0; i < degree; ++i) {
106 const int degree = polynomial.size() - 1; local
108 companion_matrix.resize(degree, degree);
111 companion_matrix.col(degree - 1) = -polynomial.reverse().head(degree);
133 const int degree = polynomial.size() - 1; local
136 if (degree == 0) {
147 if (degree == 1)
186 const int degree = polynomial.rows() - 1; local
270 const int degree = num_constraints - 1; local
[all...] |
| graph_algorithms.h | 85 // increasing degree. The same idea is used by Saad & Li in "MIQR: A
91 // degree. The output vector ordering contains elements of S in
92 // increasing order of their degree, followed by elements of V - S in
93 // increasing order of degree. The return value of the function is the
165 // degree. The input ordering is used to stabilize this sort, i.e., if
166 // two vertices have the same degree then they are ordered in the same
254 // Compute a degree two constrained Maximum Spanning Tree/forest of
257 // Finding degree 2 spanning tree of a graph is not always
260 // a any spanning trees of degree less than n-1.Even if such a tree
263 // We get around both of these problems by using a greedy, degree
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 58 void computePade(MatrixType& result, const MatrixType& T, int degree);
142 int degree; local
153 degree = getPadeDegree(normTminusI);
155 if ((degree - degree2 <= 1) || (numberOfExtraSquareRoots == 1))
165 computePade(result, T, degree);
169 /* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = float) */
173 const float maxNormForPade[] = { 2.5111573934555054e-1 /* degree = 3 */ , 4.0535837411880493e-1,
175 for (int degree = 3; degree <= maxPadeDegree; ++degree)
244 const int degree = 3; local
260 const int degree = 4; local
276 const int degree = 5; local
294 const int degree = 6; local
312 const int degree = 7; local
332 const int degree = 8; local
352 const int degree = 9; local
374 const int degree = 10; local
396 const int degree = 11; local
[all...] |
| /packages/apps/Camera/src/com/android/camera/ui/ |
| RotateImageView.java | 65 public void setOrientation(int degree, boolean animation) {
68 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
69 if (degree == mTargetDegree) return;
71 mTargetDegree = degree;
108 int degree = mStartDegree + ANIMATION_SPEED local
110 degree = degree >= 0 ? degree % 360 : degree % 360 + 360
[all...] |
| /packages/apps/Camera2/src/com/android/camera/ui/ |
| RotateImageView.java | 65 public void setOrientation(int degree, boolean animation) {
68 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
69 if (degree == mTargetDegree) return;
71 mTargetDegree = degree;
108 int degree = mStartDegree + ANIMATION_SPEED local
110 degree = degree >= 0 ? degree % 360 : degree % 360 + 360
[all...] |
| /packages/apps/LegacyCamera/src/com/android/camera/ui/ |
| RotateImageView.java | 68 public void setOrientation(int degree) {
70 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
71 if (degree == mTargetDegree) return;
73 mTargetDegree = degree;
106 int degree = mStartDegree + ANIMATION_SPEED local
108 degree = degree >= 0 ? degree % 360 : degree % 360 + 360
[all...] |
| /external/jmonkeyengine/engine/src/desktop/jme3tools/navigation/ |
| NumUtil.java | 8 * Provides various helper methods for number conversions (such as degree to radian
9 * conversion, decimal degree to radians etc)
|
| Position.java | 25 /* Degree position */
26 private double degree; field in class:Position
43 * @param degree
46 // public Position(double dblLat, double dblLng, double degree) throws InvalidPositionException {
49 // this.degree = degree;
152 * Returns the degree of the entity
153 * @return degree
157 // return degree;
|
| /external/chromium_org/chrome/third_party/chromevox/chromevox/background/mathmaps/functions/ |
| algebra.json | 5 "default": "degree"
|
| /external/chromium_org/third_party/freetype/include/freetype/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/freetype/include/freetype/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/chromium_org/third_party/WebKit/Source/platform/graphics/ |
| ImageOrientation.h | 42 OriginBottomRight = 3, // 180 degree rotation
44 OriginLeftTop = 5, // mirror along x-axis + 270 degree CW rotation
45 OriginRightTop = 6, // 90 degree CW rotation
46 OriginRightBottom = 7, // mirror along x-axis + 90 degree CW rotation
47 OriginLeftBottom = 8, // 270 degree CW rotation
|
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 89 * Approximate minimum degree ordering algorithm.
119 Index* degree = W + 5*(n+1); local
134 head[i] = -1; // degree list i is empty
141 degree[i] = len[i]; // degree of node i
148 /* --- Initialize degree lists ------------------------------------------ */
151 d = degree[i];
170 next[i] = head[d]; /* put node i in degree list d */
177 /* --- Select node of minimum approximate degree -------------------- */
180 head[mindeg] = next[k]; /* remove k from degree list *
[all...] |
| /external/chromium_org/chrome/common/extensions/api/ |
| power.idl | 19 // describes the degree to which power management should be disabled.
|
| /frameworks/native/include/input/ |
| VelocityTracker.h | 46 // Polynomial degree (number of coefficients), or zero if no information is
48 uint32_t degree; member in struct:android::VelocityTracker::Estimator
55 degree = 0;
156 // Degree must be no greater than Estimator::MAX_DEGREE.
157 LeastSquaresVelocityTrackerStrategy(uint32_t degree, Weighting weighting = WEIGHTING_NONE);
199 // Degree must be 1 or 2.
200 IntegratingVelocityTrackerStrategy(uint32_t degree);
213 uint32_t degree; member in struct:android::IntegratingVelocityTrackerStrategy::State
|
| /external/eigen/unsupported/Eigen/src/Polynomials/ |
| PolynomialUtils.h | 19 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
40 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
67 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
92 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
116 * monomial basis of the monic polynomial with same roots and minimal degree.
121 * by degrees i.e. poly[i] is the coefficient of degree i of the polynomial
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/ |
| Surface.java | 26 private int basisUFunctionDegree; //the degree of basis U function
27 private int basisVFunctionDegree; //the degree of basis V function
37 * @param basisUFunctionDegree the degree of basis U function
38 * @param basisVFunctionDegree the degree of basis V function
64 * @param basisUFunctionDegree the degree of basis U function
65 * @param basisVFunctionDegree the degree of basis V function
163 * This method returns the degree of basis U function.
164 * @return the degree of basis U function
171 * This method returns the degree of basis V function.
172 * @return the degree of basis V function
[all...] |
| /frameworks/native/libs/input/ |
| VelocityTracker.cpp | 254 "estimator (degree=%d, xCoeff=%s, yCoeff=%s, confidence=%f)",
256 int(estimator.degree),
257 vectorToString(estimator.xCoeff, estimator.degree + 1).string(),
258 vectorToString(estimator.yCoeff, estimator.degree + 1).string(),
337 if (getEstimator(id, &estimator) && estimator.degree >= 1) {
358 uint32_t degree, Weighting weighting) :
359 mDegree(degree), mWeighting(weighting) {
392 * Solves a linear least squares problem to obtain a N degree polynomial that fits
593 uint32_t degree = mDegree;
594 if (degree > m - 1)
[all...] |
| /frameworks/base/core/jni/ |
| android_view_VelocityTracker.cpp | 38 jfieldID degree; member in struct:android::__anon32797
209 env->SetIntField(outEstimatorObj, gEstimatorClassInfo.degree, estimator.degree);
265 GET_FIELD_ID(gEstimatorClassInfo.degree, clazz,
266 "degree", "I");
|
| /bionic/libm/upstream-freebsd/lib/msun/src/ |
| k_tanf.c | 50 * We add the small terms from lowest degree up for efficiency on
51 * non-sequential machines (the lowest degree terms tend to be ready
56 * small terms were added from highest degree down.
|
