/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);
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
debug_fn_imps.hpp | 125 degree(node_const_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
debug_fn_imps.hpp | 125 degree(node_const_pointer p_nd) function in class:PB_DS_CLASS_C_DEC
|
/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.27/include/ |
fibheap.h | 67 __extension__ unsigned long int degree : 31; member in struct:fibnode 70 unsigned int degree : 31; member in struct:fibnode
|
/device/generic/goldfish/camera/ |
EmulatedCameraFactory.h | 155 int degree = property_get_int32(key, 90); local 156 return degree; 164 int degree = property_get_int32(key, 90); local 165 return degree;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/polynomials/ |
PolynomialFunctionNewtonForm.java | 40 * The coefficients of the polynomial, ordered by degree -- i.e. 42 * coefficient of x^n where n is the degree of the polynomial. 97 * Returns the degree of the polynomial. 99 * @return the degree of the polynomial 101 public int degree() { method in class:PolynomialFunctionNewtonForm 178 final int n = degree();
|
PolynomialFunction.java | 44 * The coefficients of the polynomial, ordered by degree -- i.e., 46 * coefficient of x^n where n is the degree of the polynomial. 52 * of the coefficients array is the constant term. Higher degree 53 * coefficients follow in sequence. The degree of the resulting polynomial 94 * Returns the degree of the polynomial 96 * @return the degree of the polynomial 98 public int degree() { method in class:PolynomialFunction 143 // identify the lowest degree polynomial 169 // identify the lowest degree polynomial
|
PolynomialFunctionLagrangeForm.java | 41 * The coefficients of the polynomial, ordered by degree -- i.e. 43 * coefficient of x^n where n is the degree of the polynomial. 93 * Returns the degree of the polynomial. 95 * @return the degree of the polynomial 97 public int degree() { method in class:PolynomialFunctionLagrangeForm 223 final int n = degree() + 1; 261 // polynomial of degree n-1. tc[] are the coefficients of the i-th
|
/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/eigen/Eigen/src/OrderingMethods/ |
Amd.h | 86 * Approximate minimum degree ordering algorithm. 118 StorageIndex* degree = W + 5*(n+1); local 133 head[i] = -1; // degree list i is empty 140 degree[i] = len[i]; // degree of node i 144 /* --- Initialize degree lists ------------------------------------------ */ 155 d = degree[i]; 174 next[i] = head[d]; /* put node i in degree list d */ 185 /* --- Select node of minimum approximate degree -------------------- */ 188 head[mindeg] = next[k]; /* remove k from degree list * [all...] |
/external/eigen/unsupported/test/ |
splines.cpp | 244 const unsigned int degree = 3; local 258 points, derivatives, derivativeIndices, degree);
|
/prebuilts/tools/common/m2/repository/org/eclipse/tycho/tycho-bundles-external/0.18.1/eclipse/plugins/ |
org.sat4j.pb_2.3.5.v20130525.jar | |
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/set/ |
set.c | 122 /* Fast compute degree of a set... the number
129 register unsigned degree = 0;
local 139 if (t & *b) ++degree;
144 return(degree);
|
/external/antlr/antlr-3.4/runtime/C/src/ |
antlr3bitset.c | 485 ANTLR3_UINT32 degree; local 494 degree = 0; 503 degree++; 508 return degree;
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/ode/nonstiff/ |
GraggBulirschStoerStepInterpolator.java | 103 /** Degree of the interpolation polynoms. */ 164 // copy the interpolation polynoms (up to the current degree only) 182 * interpolation polynoms up to the given degree 183 * @param maxDegree maximal degree to handle 235 * @param mu degree of the interpolation polynomial 386 final int degree = in.readInt(); local 387 resetTables(degree); 388 currentDegree = 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...] |
/external/eigen/unsupported/Eigen/src/Splines/ |
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...] |
/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/base/core/jni/ |
android_view_VelocityTracker.cpp | 39 jfieldID degree; member in struct:android::__anon45720 210 env->SetIntField(outEstimatorObj, gEstimatorClassInfo.degree, estimator.degree); 254 gEstimatorClassInfo.degree = GetFieldIDOrDie(env, clazz, "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
|
/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...] |
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/h/ |
AParser.cpp | 471 /* Fast compute degree of a set... the number
477 register int degree = 0;
local 485 if (t & *b) ++degree;
490 return(degree);
|
err.h | 468 /* Fast compute degree of a set... the number
474 register int degree = 0;
local 482 if (t & *b) ++degree;
487 return(degree);
|