OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:btVectorXu
(Results
1 - 9
of
9
) sorted by null
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/
btMLCPSolverInterface.h
30
virtual bool solveMLCP(const btMatrixXu & A, const
btVectorXu
& b,
btVectorXu
& x, const
btVectorXu
& lo,const
btVectorXu
& hi,const btAlignedObjectArray<int>& limitDependency, int numIterations, bool useSparsity = true)=0;
btLemkeAlgorithm.h
37
btLemkeAlgorithm(const btMatrixXu& M_, const
btVectorXu
& q_, const int & DEBUGLEVEL_ = 0) :
63
void setSystem(const btMatrixXu & M_, const
btVectorXu
& q_)
73
btVectorXu
solve(unsigned int maxloops = 0);
80
bool LexicographicPositive(const
btVectorXu
& v);
82
bool greaterZero(const
btVectorXu
& vector);
86
btVectorXu
m_q;
btMLCPSolver.h
30
btVectorXu
m_b;
31
btVectorXu
m_x;
32
btVectorXu
m_lo;
33
btVectorXu
m_hi;
36
btVectorXu
m_bSplit;
37
btVectorXu
m_xSplit;
38
btVectorXu
m_bSplit1;
39
btVectorXu
m_xSplit2;
btSolveProjectedGaussSeidel.h
27
virtual bool solveMLCP(const btMatrixXu & A, const
btVectorXu
& b,
btVectorXu
& x, const
btVectorXu
& lo,const
btVectorXu
& hi,const btAlignedObjectArray<int>& limitDependency, int numIterations, bool useSparsity = true)
btDantzigSolver.h
46
virtual bool solveMLCP(const btMatrixXu & A, const
btVectorXu
& b,
btVectorXu
& x, const
btVectorXu
& lo,const
btVectorXu
& hi,const btAlignedObjectArray<int>& limitDependency, int numIterations, bool useSparsity = true)
btPATHSolver.h
59
virtual bool solveMLCP(const btMatrixXu & A, const
btVectorXu
& b,
btVectorXu
& x, const
btVectorXu
& lo,const
btVectorXu
& hi,const btAlignedObjectArray<int>& limitDependency, int numIterations, bool useSparsity = true)
btLemkeSolver.h
50
virtual bool solveMLCP(const btMatrixXu & A, const
btVectorXu
& b,
btVectorXu
& x, const
btVectorXu
& lo,const
btVectorXu
& hi,const btAlignedObjectArray<int>& limitDependency, int numIterations, bool useSparsity = true)
63
btVectorXu
solution(n);
64
btVectorXu
q1;
172
btVectorXu
qq;
180
btVectorXu
z1;
272
btVectorXu
q;
284
btVectorXu
solution = lemke.solve(m_maxLoops)
[
all
...]
btLemkeAlgorithm.cpp
63
btVectorXu
btLemkeAlgorithm::solve(unsigned int maxloops /* = 0*/)
76
btVectorXu
solutionVector(2 * dim);
101
//
btVectorXu
q_;
227
btAlignedObjectArray<
btVectorXu
> Rows;
231
btVectorXu
vec(dim + 1);
260
btVectorXu
test(dim + 1);
284
bool btLemkeAlgorithm::LexicographicPositive(const
btVectorXu
& v)
345
bool btLemkeAlgorithm::greaterZero(const
btVectorXu
& vector)
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btMatrixX.h
544
#define
btVectorXu
btVectorXd
547
#define
btVectorXu
btVectorXf
Completed in 1317 milliseconds