HomeSort by relevance Sort by last modified time
    Searched refs:btMatrixXu (Results 1 - 10 of 10) sorted by null

  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletDynamics/MLCPSolvers/
btLemkeAlgorithm.h 37 btLemkeAlgorithm(const btMatrixXu& M_, const btVectorXu& q_, const int & DEBUGLEVEL_ = 0) :
63 void setSystem(const btMatrixXu & M_, const btVectorXu & q_)
79 int findLexicographicMinimum(const btMatrixXu &A, const int & pivotColIndex);
81 void GaussJordanEliminationStep(btMatrixXu &A, int pivotRowIndex, int pivotColumnIndex, const btAlignedObjectArray<int>& basis);
85 btMatrixXu m_M;
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;
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)
77 btMatrixXu A1;
78 btMatrixXu B(n,n);
90 btMatrixXu matrix;
152 btMatrixXu b1(n,1);
154 btMatrixXu M(n*2,n*2);
169 btMatrixXu Bb1 = B*b1;
182 btMatrixXu y1;
194 btMatrixXu y1_b1(n,1);
200 btMatrixXu x1
    [all...]
btLemkeAlgorithm.cpp 81 btMatrixXu ident(dim, dim);
87 btMatrixXu mNeg = m_M.negative();
89 btMatrixXu A(dim, 2 * dim + 2);
224 int btLemkeAlgorithm::findLexicographicMinimum(const btMatrixXu& A, const int & pivotColIndex) {
298 void btLemkeAlgorithm::GaussJordanEliminationStep(btMatrixXu& A, int pivotRowIndex, int pivotColumnIndex, const btAlignedObjectArray<int>& basis)
btMLCPSolver.h 29 btMatrixXu m_A;
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)
btMLCPSolver.cpp 131 btMatrixXu Acopy = m_A;
219 static btMatrixXu J3;
224 static btMatrixXu JinvM3;
493 static btMatrixXu Minv;
510 static btMatrixXu J;
545 static btMatrixXu J_transpose;
548 static btMatrixXu tmp;
  /external/libgdx/extensions/gdx-bullet/jni/src/bullet/LinearMath/
btMatrixX.h 545 #define btMatrixXu btMatrixXd
548 #define btMatrixXu btMatrixXf

Completed in 711 milliseconds