| /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)
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+1)
[all...] |
| Spline.h | 31 * 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.
59 : m_knots(1, (Degree==Dynamic ? 2 : 2*Degree+2))
60 , m_ctrls(ControlPointVectorType::Zero(2,(Degree==Dynamic ? 1 : Degree+1)))
64 enum { MinDegree = (Degree==Dynamic ? 0 : Degree) }
261 DenseIndex Spline<_Scalar, _Dim, _Degree>::degree() const function in class:Eigen::Spline
[all...] |
| /external/pdfium/core/include/thirdparties/freetype/freetype/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /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 | 67 public void setOrientation(int degree, boolean animation) {
70 degree = degree >= 0 ? degree % 360 : degree % 360 + 360;
71 if (degree == mTargetDegree) return;
73 mTargetDegree = degree;
110 int degree = mStartDegree + ANIMATION_SPEED local
112 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/ceres-solver/internal/ceres/ |
| polynomial.cc | 57 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 == 1)
254 const int degree = polynomial.rows() - 1; local
344 const int degree = num_constraints - 1; local
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 57 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
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...] |
| MatrixPower.h | 57 void computePade(int degree, const MatrixType& IminusT, MatrixType& res) const;
95 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, MatrixType& res) const
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 = 3 local
197 int degree = 3; local
229 int degree = 3; local
[all...] |
| /external/chromium_org/third_party/skia/experimental/Intersection/ |
| NearestPoint.cpp | 33 #define DEGREE 3 /* Cubic Bezier curve */
34 #define W_DEGREE 5 /* Degree of eqn to find roots of */
74 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 */
100 p = Bezier(V, DEGREE, t_candidate[i],
110 new_dist = V2SquaredLength(V2Sub(&P, &V[DEGREE], &v));
119 return (Bezier(V, DEGREE, t, (Point2 *)NULL, (Point2 *)NULL));
125 * Given a point and a Bezier curve, generate a 5th-degree
135 Vector2 c[DEGREE+1]; /* V(i)'s - P *
196 int degree; \/* The degree of the polynomial *\/ variable
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/skia/experimental/Intersection/ |
| NearestPoint.cpp | 33 #define DEGREE 3 /* Cubic Bezier curve */
34 #define W_DEGREE 5 /* Degree of eqn to find roots of */
74 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 */
100 p = Bezier(V, DEGREE, t_candidate[i],
110 new_dist = V2SquaredLength(V2Sub(&P, &V[DEGREE], &v));
119 return (Bezier(V, DEGREE, t, (Point2 *)NULL, (Point2 *)NULL));
125 * Given a point and a Bezier curve, generate a 5th-degree
135 Vector2 c[DEGREE+1]; /* V(i)'s - P *
196 int degree; \/* The degree of the polynomial *\/ variable
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...] |
| /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/chromium_org/third_party/freetype/include/freetype/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/freetype/include/internal/services/ |
| svkern.h | 34 FT_Int degree,
|
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/type1/ |
| t1afm.h | 46 FT_Int degree,
|
| /external/chromium_org/ui/events/gesture_detection/ |
| velocity_tracker.cc | 62 // Polynomial degree (number of coefficients), or zero if no information is
64 uint32_t degree;
72 degree = 0;
119 // Degree must be no greater than Estimator::MAX_DEGREE.
120 LeastSquaresVelocityTrackerStrategy(uint32_t degree,
159 // Degree must be 1 or 2.
160 explicit IntegratingVelocityTrackerStrategy(uint32_t degree);
175 uint32_t degree;
360 if (GetEstimator(id, &estimator) && estimator.degree >= 1) {
395 uint32_t degree,
[all...] |
| /frameworks/base/core/java/android/view/ |
| VelocityTracker.java | 246 * Polynomial degree, or zero if only position information is available.
248 public int degree; field in class:VelocityTracker.Estimator
276 * @return The X coefficient, or 0 if the index is greater than the degree.
279 return index <= degree ? xCoeff[index] : 0;
285 * @return The Y coefficient, or 0 if the index is greater than the degree.
288 return index <= degree ? yCoeff[index] : 0;
294 for (int i = 0; i <= degree; i++) {
|
| /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
|
| /prebuilts/eclipse/mavenplugins/tycho/tycho-dependencies-m2repo/org/eclipse/tycho/tycho-bundles-external/0.20.0/eclipse/plugins/ |
| org.sat4j.pb_2.3.5.v201308161310.jar | |
| /prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
| org.sat4j.pb_2.3.5.v20130525.jar | |
| /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...] |
| /packages/apps/Gallery/src/com/android/camera/ |
| ImageManager.java | 197 // picture. The degree is a one element array which returns the orientation
202 Bitmap source, byte[] jpegData, int[] degree) {
214 degree[0] = 0;
217 degree[0] = getExifOrientation(filePath);
238 values.put(Images.Media.ORIENTATION, degree[0]);
250 int degree = 0; local
264 degree = 90;
267 degree = 180;
270 degree = 270;
276 return degree;
[all...] |
| /external/eigen/Eigen/src/OrderingMethods/ |
| Amd.h | 86 * 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 list *
[all...] |
| /external/chromium_org/third_party/boringssl/src/crypto/ecdsa/ |
| ecdsa_test.c | 75 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;
|
