HomeSort by relevance Sort by last modified time
    Searched refs:degree (Results 1 - 25 of 152) sorted by null

1 2 3 4 5 6 7

  /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...]
  /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/
PolynomialsUtils.java 92 * @param degree degree of the polynomial
93 * @return Chebyshev polynomial of specified degree
95 public static PolynomialFunction createChebyshevPolynomial(final int degree) {
96 return buildPolynomial(degree, CHEBYSHEV_COEFFICIENTS,
117 * @param degree degree of the polynomial
118 * @return Hermite polynomial of specified degree
120 public static PolynomialFunction createHermitePolynomial(final int degree) {
121 return buildPolynomial(degree, HERMITE_COEFFICIENTS
    [all...]
  /external/chromium-trace/catapult/tracing/third_party/gl-matrix/src/gl-matrix/
common.js 41 var degree = Math.PI / 180; variable
44 * Convert Degree To Radian
49 return a * degree;
  /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/apache-commons-math/src/main/java/org/apache/commons/math/optimization/fitting/
PolynomialFitter.java 38 /** Polynomial degree. */
39 private final int degree; field in class:PolynomialFitter
43 * ie. a n-degree polynomial has n+1 coefficients.</p>
44 * @param degree maximal degree of the polynomial
47 public PolynomialFitter(int degree, final DifferentiableMultivariateVectorialOptimizer optimizer) {
49 this.degree = degree;
76 return new PolynomialFunction(fitter.fit(new ParametricPolynomial(), new double[degree + 1]));
  /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;
138 int degree, degree2, numberOfSquareRoots = 0; local
161 degree = getPadeDegree(normIminusT);
163 if (degree - degree2 <= 1 || hasExtraSquareRoot)
171 computePade(degree, IminusT, res);
183 const float maxNormForPade[] = { 2.8064004e-1f /* degree = 3 */ , 4.3386528e-1f };
184 int degree = 3 local
196 int degree = 3; local
228 int degree = 3; local
    [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/freetype/include/freetype/internal/services/
svkern.h 34 FT_Int degree,
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/include/freetype/internal/services/
svkern.h 34 FT_Int degree,
  /external/pdfium/third_party/freetype/include/freetype/internal/services/
svkern.h 34 FT_Int degree,
  /external/pdfium/xfa/src/fxbarcode/common/reedsolomon/
BC_ReedSolomon.h 15 CBC_ReedSolomonGF256Poly* BuildGenerator(int32_t degree, int32_t& e);
BC_ReedSolomonGF256Poly.h 15 int32_t GetCoefficients(int32_t degree);
25 CBC_ReedSolomonGF256Poly* MultiplyByMonomial(int32_t degree,
BC_ReedSolomon.cpp 33 CBC_ReedSolomonGF256Poly* CBC_ReedSolomonEncoder::BuildGenerator(int32_t degree,
35 if (degree >= m_cachedGenerators.GetSize()) {
39 for (int32_t d = m_cachedGenerators.GetSize(); d <= degree; d++) {
53 return (CBC_ReedSolomonGF256Poly*)(m_cachedGenerators[degree]);
  /external/libgdx/gdx/src/com/badlogic/gdx/math/
BSpline.java 59 * @param i The span (0<=i<spanCount) spanCount = continuous ? points.length : points.length - 3 (cubic degree)
80 * @param i The span (0<=i<spanCount) spanCount = continuous ? points.length : points.length - 3 (cubic degree)
99 /** Calculates the n-degree b-spline value for the given position (t).
103 * @param degree The degree of the b-spline
107 public static <T extends Vector<T>> T calculate (final T out, final float t, final T[] points, final int degree,
109 final int n = continuous ? points.length : points.length - degree;
113 return calculate(out, i, u, points, degree, continuous, tmp);
116 /** Calculates the n-degree b-spline derivative for the given position (t).
120 * @param degree The degree of the b-splin
171 public int degree; field in class:BSpline
    [all...]
  /external/pdfium/xfa/src/fxbarcode/pdf417/
BC_PDF417ECModulusPoly.h 20 int32_t getCoefficient(int32_t degree);
27 CBC_PDF417ECModulusPoly* multiplyByMonomial(int32_t degree,
BC_PDF417ECModulusPoly.cpp 69 int32_t CBC_PDF417ECModulusPoly::getCoefficient(int32_t degree) {
70 return m_coefficients[m_coefficients.GetSize() - 1 - degree];
215 int32_t degree,
218 if (degree < 0) {
231 product.SetSize(size + degree);
306 for (int32_t degree = getDegree(); degree >= 0; degree--) {
307 int32_t coefficient = getCoefficient(degree);
317 if (degree == 0 || coefficient != 1) {
    [all...]
  /toolchain/binutils/binutils-2.25/include/
fibheap.h 68 __extension__ unsigned long int degree : 31; member in struct:fibnode
71 unsigned int degree : 31; member in struct:fibnode
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/type1/
t1afm.h 46 FT_Int degree,
  /external/pdfium/third_party/freetype/src/type1/
t1afm.h 46 FT_Int degree,
  /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++) {
  /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
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
74 # to check if P[degree] ~ degree ** G (for some G)
78 #print sorted([(count, degree) for degree, count in counts.items()])
  /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 

Completed in 699 milliseconds

1 2 3 4 5 6 7