| /external/deqp/framework/common/ |
| tcuInterval.hpp | 63 , m_lo (TCU_INFINITY)
70 , m_lo (m_hasNaN ? TCU_INFINITY : val)
75 , m_lo (de::min(a.lo(), b.lo()))
78 double length (void) const { return m_hi - m_lo; }
79 double lo (void) const { return m_lo; }
83 bool empty (void) const { return m_lo > m_hi; }
84 bool isFinite (void) const { return m_lo > -TCU_INFINITY && m_hi < TCU_INFINITY; }
91 de::min(m_lo, other.m_lo),
104 de::max(m_lo, other.m_lo)
151 double m_lo; member in class:tcu::Interval
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/ |
| btDantzigSolver.h | 35 btAlignedObjectArray<btScalar> m_lo; member in class:btDantzigSolver
67 m_lo.resize(n);
72 m_lo[i] = lo[i];
80 result = btSolveDantzigLCP (n,&m_A[0],&m_x[0],&m_b[0],&ww[0],nub,&m_lo[0],&m_hi[0],&m_dependencies[0],m_scratchMemory);
|
| btMLCPSolver.h | 32 btVectorXu m_lo; member in class:btMLCPSolver
|
| btMLCPSolver.cpp | 100 m_lo.resize(0);
134 result = m_solver->solveMLCP(m_A, m_b, m_x, m_lo,m_hi, m_limitDependencies,infoGlobal.m_numIterations );
136 result = m_solver->solveMLCP(Acopy, m_bSplit, m_xSplit, m_lo,m_hi, limitDependenciesCopy,infoGlobal.m_numIterations );
140 result = m_solver->solveMLCP(m_A, m_b, m_x, m_lo,m_hi, m_limitDependencies,infoGlobal.m_numIterations );
184 m_lo.resize(numConstraintRows);
194 m_lo[i] = -BT_INFINITY;
198 m_lo[i] = m_allConstraintPtrArray[i]->m_lowerLimit;
514 m_lo.resize(numConstraintRows);
520 m_lo[i] = m_allConstraintPtrArray[i]->m_lowerLimit;
|
| btDantzigLCP.cpp | 1196 btScalar *const m_x, * const m_b, *const m_w, *const m_lo,* const m_hi; \/\/ permuted LCP problem data member in struct:btLCP
[all...] |
