| /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/eigen/unsupported/Eigen/src/Splines/ |
| SplineFitting.h | 35 * where \f$p\f$ is the degree and \f$m+1\f$ the number knots
39 * \param[in] degree The spline degree which is used during the interpolation.
45 void KnotAveraging(const KnotVectorType& parameters, DenseIndex degree, KnotVectorType& knots)
47 knots.resize(parameters.size()+degree+1);
49 for (DenseIndex j=1; j<parameters.size()-degree; ++j)
50 knots(j+degree) = parameters.segment(j,degree).mean();
52 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. */ };
62 * For Splines with dynamic degree, the resulting degree will be 0.
65 : m_knots(1, (Degree==Dynamic ? 2 : 2*Degree+2))
66 , m_ctrls(ControlPointVectorType::Zero(Dimension,(Degree==Dynamic ? 1 : Degree+1)))
70 enum { MinDegree = (Degree==Dynamic ? 0 : Degree) }
282 DenseIndex Spline<_Scalar, _Dim, _Degree>::degree() const function in class:Eigen::Spline
[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/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]));
|
| /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 Logger.out.println(":Sending rotation degree=" + mRotationDegree +
|
| /external/freetype/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/fxbarcode/common/reedsolomon/ |
| BC_ReedSolomon.h | 26 CBC_ReedSolomonGF256Poly* BuildGenerator(int32_t degree, int32_t& e);
|
| BC_ReedSolomonGF256Poly.h | 23 int32_t GetCoefficients(int32_t degree);
33 CBC_ReedSolomonGF256Poly* MultiplyByMonomial(int32_t degree,
|
| BC_ReedSolomon.cpp | 36 CBC_ReedSolomonGF256Poly* CBC_ReedSolomonEncoder::BuildGenerator(int32_t degree,
38 if (degree >= m_cachedGenerators.GetSize()) {
41 for (int32_t d = m_cachedGenerators.GetSize(); d <= degree; d++) {
57 return m_cachedGenerators[degree];
|
| BC_ReedSolomonGF256.cpp | 76 int32_t degree,
79 if (degree < 0) {
90 coefficients.SetSize(degree + 1);
|
| BC_ReedSolomonGF256.h | 27 CBC_ReedSolomonGF256Poly* BuildMonomial(int32_t degree,
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixLogarithm.h | 70 /* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = float) */
73 const float maxNormForPade[] = { 2.5111573934555054e-1 /* degree = 3 */ , 4.0535837411880493e-1,
77 int degree = minPadeDegree; local
78 for (; degree <= maxPadeDegree; ++degree)
79 if (normTminusI <= maxNormForPade[degree - minPadeDegree])
81 return degree;
84 /* \brief Get suitable degree for Pade approximation. (specialized for RealScalar = double) */
87 const double maxNormForPade[] = { 1.6206284795015624e-2 /* degree = 3 */ , 5.3873532631381171e-2,
91 int degree = minPadeDegree local
123 int degree = minPadeDegree; local
232 int degree; local
[all...] |
| MatrixPower.h | 103 void computePade(int degree, const MatrixType& IminusT, ResultType& res) const;
162 void MatrixPowerAtomic<MatrixType>::computePade(int degree, const MatrixType& IminusT, ResultType& res) const
164 int i = 2*degree;
165 res = (m_p-degree) / (2*i-2) * IminusT;
206 int degree, degree2, numberOfSquareRoots = 0; local
216 degree = getPadeDegree(normIminusT);
218 if (degree - degree2 <= 1 || hasExtraSquareRoot)
226 computePade(degree, IminusT, res);
238 const float maxNormForPade[] = { 2.8064004e-1f /* degree = 3 */ , 4.3386528e-1f };
239 int degree = 3 local
251 int degree = 3; local
283 int degree = 3; local
[all...] |
| /tools/tradefederation/core/src/com/android/tradefed/util/ |
| DirectedGraph.java | 86 * Return a map representation the in-degree of each vertex.
94 // Iterate over an count the in-degree
107 Map<V, Integer> degree = inDegree(); local
108 // Determine all vertices with zero in-degree
110 for (V v: degree.keySet()) {
111 if (degree.get(v) == 0) {
118 // Choose a vertex with zero in-degree
124 degree.put(neighbor, degree.get(neighbor) - 1);
125 // Remember any vertices that now have zero in-degree
[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/pdfium/third_party/freetype/src/type1/ |
| t1afm.h | 46 FT_Int degree,
|
| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| dumpcycles.c | 21 int degree;
local
28 degree=set_deg(c->cyclicDep);
29 fprintf(stderr,"Cycle %d: (degree %d) %s -->\n", i++, degree, RulePtr[c->croot]->rname);
|
| /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/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
| org.sat4j.pb_2.3.5.v20130525.jar | |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
| SmoothingPolynomialBicubicSplineInterpolator.java | 45 * Default constructor. The degree of the fitting polynomials is set to 3.
52 * @param degree Degree of the polynomial fitting functions.
54 public SmoothingPolynomialBicubicSplineInterpolator(int degree) {
55 this(degree, degree);
59 * @param xDegree Degree of the polynomial fitting functions along the
61 * @param yDegree Degree of the polynomial fitting functions along the
|
| /frameworks/native/libs/input/ |
| VelocityTracker.cpp | 255 "estimator (degree=%d, xCoeff=%s, yCoeff=%s, confidence=%f)",
257 int(estimator.degree),
258 vectorToString(estimator.xCoeff, estimator.degree + 1).c_str(),
259 vectorToString(estimator.yCoeff, estimator.degree + 1).c_str(),
338 if (getEstimator(id, &estimator) && estimator.degree >= 1) {
359 uint32_t degree, Weighting weighting) :
360 mDegree(degree), mWeighting(weighting) {
393 * Solves a linear least squares problem to obtain a N degree polynomial that fits
595 uint32_t degree = mDegree;
596 if (degree > m - 1)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| layout.go | 15 posdegree := f.newSparseSet(f.NumBlocks()) // blocks with positive remaining degree
17 zerodegree := f.newSparseSet(f.NumBlocks()) // blocks with zero remaining degree
67 // Use degree for now.
85 // Pick a zero-degree block if we can.
|
