Home
last modified time | relevance | path

Searched refs:a_0 (Results 1 – 3 of 3) sorted by relevance

/external/clang/utils/
DCmpDriver55 a_0 = a[:j] + [None] + a[j:]
56 candidate = cost(a_0, b)
58 best = (candidate, a_0, j)
/external/eigen/unsupported/Eigen/
DPolynomials59 \f$ p(x) = a_0 + a_{1}x + ... + a_{n-1}x^{n-1} + x^n \f$
93 \f$ |r_i| \ge c(p) = \left( \sum_{k=0}^{d} \left | \frac{a_k}{a_0} \right | \right)^{-1} \f$
101 The roots of \f$ p(x) = a_0 + a_1 x + a_2 x^2 + a_{3} x^3 + x^4 \f$ are the eigenvalues of
105 0 & 0 & 0 & a_0 \\
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/Dynamics/
DbtRigidBody.cpp308 const btScalar a_0 = a[0], a_1 = a[1], a_2 = a[2]; in btSetCrossMatrixMinus() local
310 -a_2, 0, +a_0, in btSetCrossMatrixMinus()
311 +a_1, -a_0, 0); in btSetCrossMatrixMinus()