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

1 2

  /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;
  /external/antlr/antlr-3.4/runtime/C/src/
antlr3bitset.c 485 ANTLR3_UINT32 degree; local
494 degree = 0;
503 degree++;
508 return degree;
  /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/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...]
Eigen_Colamd.h 159 /* a degree list */
160 Index hash ; /* hash value, if col is not in a degree list */
161 Index prev ; /* previous column in degree list, if col is in a */
162 /* degree list (but not at the head of a degree list) */
166 Index degree_next ; /* next column, if col is in a degree list */
179 Index degree ; /* number of principal & non-principal columns in row */ member in union:internal::Colamd_Row::__anon494
312 * \brief Computes a column ordering using the column approximate minimum degree ordering
343 Index max_deg ; /* maximum row degree */
651 Row [row].shared1.degree = Row [row].length
    [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/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. */ };
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/openssl/crypto/ecdsa/
ecdsatest.c 296 unsigned int sig_len, degree, r_len, s_len, bn_len, buf_len; local
346 degree = EC_GROUP_get_degree(EC_KEY_get0_group(eckey));
347 if (degree < 160)
446 bn_len = (degree + 7) / 8;
  /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/openssl/crypto/ec/
ectest.c 456 fprintf(stdout, "verify degree ...");
490 fprintf(stdout, "verify degree ...");
524 fprintf(stdout, "verify degree ...");
559 fprintf(stdout, "verify degree ...");
599 fprintf(stdout, "verify degree ...");
645 fprintf(stdout, "verify degree ...");
809 fprintf(stdout, "verify degree ..."); \
1316 int degree; member in struct:nistp_test_params
    [all...]
  /external/chromium_org/third_party/freetype/include/freetype/internal/
t1types.h 150 FT_Int degree; member in struct:AFM_TrackKernRec_
  /external/chromium_org/ui/gfx/
transform_unittest.cc 406 float degree; member in struct:gfx::__anon21531::SetRotateCase
427 xform.Rotate(value.degree);
429 if (value.degree == value.degree) {
650 float degree; member in struct:gfx::__anon21531::SetRotateCase
671 xform.Rotate(value.degree + j * epsilon);
673 if (value.degree == value.degree) {
746 // this path crosses the 180-degree point.
796 // A 180 degree rotation is exactly opposite on the sphere, therefor
    [all...]
  /external/freetype/include/internal/
t1types.h 150 FT_Int degree; member in struct:AFM_TrackKernRec_
  /bionic/libc/kernel/uapi/drm/
exynos_drm.h 155 __u32 degree; member in struct:drm_exynos_ipp_prop_list
174 enum drm_exynos_degree degree; member in struct:drm_exynos_ipp_config
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
IntArray.java 180 public int degree() method in class:IntArray
729 // Input: A nonzero polynomial a(z) of degree at most m-1
732 int uzDegree = degree();
762 int j = uzDegree - vz.degree();
785 uzDegree = uz.degree();
LongArray.java 423 public int degree() method in class:LongArray
    [all...]
  /external/kernel-headers/original/uapi/drm/
exynos_drm.h 200 * @degree: flag of degree information.
217 __u32 degree; member in struct:drm_exynos_ipp_prop_list
235 * @degree: property of rotation degree.
243 enum drm_exynos_degree degree; member in struct:drm_exynos_ipp_config
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
nv50_ir_ra.cpp 642 uint32_t degree; member in class:nv50_ir::GCRA::RIG_Node
728 nodes[i].degree, nodes[i].degreeLimit);
752 degree = 0;
981 this->degree += relDegree[node->colors][colors];
982 node->degree += relDegree[colors][node->colors];
1106 if (nodes[i].degree < nodes[i].degreeLimit) {
1122 bool move = b->degree >= b->degreeLimit;
1126 a->getValue()->id, a->degree, a->degreeLimit,
1127 b->getValue()->id, b->degree, b->degreeLimit);
1129 b->degree -= relDegree[a->colors][b->colors]
    [all...]
  /external/mesa3d/src/gallium/drivers/nv50/codegen/
nv50_ir_ra.cpp 642 uint32_t degree; member in class:nv50_ir::GCRA::RIG_Node
728 nodes[i].degree, nodes[i].degreeLimit);
752 degree = 0;
981 this->degree += relDegree[node->colors][colors];
982 node->degree += relDegree[colors][node->colors];
1106 if (nodes[i].degree < nodes[i].degreeLimit) {
1122 bool move = b->degree >= b->degreeLimit;
1126 a->getValue()->id, a->degree, a->degreeLimit,
1127 b->getValue()->id, b->degree, b->degreeLimit);
1129 b->degree -= relDegree[a->colors][b->colors]
    [all...]
  /external/opencv/ml/src/
mlsvm.cpp 156 else if( param_id == CvSVM::DEGREE )
170 svm_type(CvSVM::C_SVC), kernel_type(CvSVM::RBF), degree(0),
182 degree(_degree), gamma(_gamma), coef0(_coef0),
262 cvPow( &R, &R, params->degree );
1613 double gamma = 0, C = 0, degree = 0, coef = 0, p = 0, nu = 0; local
    [all...]
  /external/opencv/ml/include/
ml.h 329 double degree; // for poly member in struct:CvSVMParams
492 enum { C=0, GAMMA=1, P=2, NU=3, COEF=4, DEGREE=5 };
512 CvParamGrid degree_grid = get_default_grid(CvSVM::DEGREE) );
    [all...]
  /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
org.sat4j.pb_2.2.0.v20100429.jar 
  /external/icu/icu4c/source/test/cintltst/
cmsccoll.c 1720 static const UChar degree = 0xb0; \/* symbol *\/ local
1830 static const UChar degree = 0xb0; \/* symbol *\/ local
    [all...]
  /external/conscrypt/src/main/native/
org_conscrypt_NativeCrypto.cpp 3426 jint degree = EC_GROUP_get_degree(group); local
    [all...]

Completed in 1641 milliseconds

1 2