public class btSequentialImpulseConstraintSolver extends btConstraintSolver
className| Constructor and Description |
|---|
btSequentialImpulseConstraintSolver() |
btSequentialImpulseConstraintSolver(long cPtr,
boolean cMemoryOwn)
Construct a new btSequentialImpulseConstraintSolver, normally you should not need this constructor it's intended for low-level usage.
|
allSolved, getCPtr, getSolverType, prepareSolve, reset, solveGroupdispose, equals, getCPointer, hashCode, hasOwnership, isDisposed, isObtained, obtain, release, releaseOwnership, takeOwnership, toStringpublic btSequentialImpulseConstraintSolver(long cPtr,
boolean cMemoryOwn)
public btSequentialImpulseConstraintSolver()
public static long getCPtr(btSequentialImpulseConstraintSolver obj)
public long operatorNew(long sizeInBytes)
public void operatorDelete(long ptr)
public long operatorNew(long arg0,
long ptr)
public void operatorDelete(long arg0,
long arg1)
public long operatorNewArray(long sizeInBytes)
public void operatorDeleteArray(long ptr)
public long operatorNewArray(long arg0,
long ptr)
public void operatorDeleteArray(long arg0,
long arg1)
public long btRand2()
public int btRandInt2(int n)
public void setRandSeed(long seed)
public long getRandSeed()
public SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar getActiveConstraintRowSolverGeneric()
public void setConstraintRowSolverGeneric(SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar rowSolver)
public SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar getActiveConstraintRowSolverLowerLimit()
public void setConstraintRowSolverLowerLimit(SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar rowSolver)
public SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar getScalarConstraintRowSolverGeneric()
public SWIGTYPE_p_f_r_btSolverBody_r_btSolverBody_r_q_const__btSolverConstraint__btSimdScalar getScalarConstraintRowSolverLowerLimit()
Copyright © 2021. All rights reserved.