|
| | btLCP (int _n, int _nskip, int _nub, btScalar *_Adata, btScalar *_x, btScalar *_b, btScalar *_w, btScalar *_lo, btScalar *_hi, btScalar *l, btScalar *_d, btScalar *_Dell, btScalar *_ell, btScalar *_tmp, bool *_state, int *_findex, int *p, int *c, btScalar **Arows) |
| |
| int | getNub () const |
| |
| void | transfer_i_to_C (int i) |
| |
| void | transfer_i_to_N (int i) |
| |
| void | transfer_i_from_N_to_C (int i) |
| |
| void | transfer_i_from_C_to_N (int i, btAlignedObjectArray< btScalar > &scratch) |
| |
| int | numC () const |
| |
| int | numN () const |
| |
| int | indexC (int i) const |
| |
| int | indexN (int i) const |
| |
| btScalar | Aii (int i) const |
| |
| btScalar | AiC_times_qC (int i, btScalar *q) const |
| |
| btScalar | AiN_times_qN (int i, btScalar *q) const |
| |
| void | pN_equals_ANC_times_qC (btScalar *p, btScalar *q) |
| |
| void | pN_plusequals_ANi (btScalar *p, int i, int sign=1) |
| |
| void | pC_plusequals_s_times_qC (btScalar *p, btScalar s, btScalar *q) |
| |
| void | pN_plusequals_s_times_qN (btScalar *p, btScalar s, btScalar *q) |
| |
| void | solve1 (btScalar *a, int i, int dir=1, int only_transfer=0) |
| |
| void | unpermute () |
| |
Definition at line 1210 of file btDantzigLCP.cpp.
◆ btLCP()
| btLCP::btLCP |
( |
int | _n, |
|
|
int | _nskip, |
|
|
int | _nub, |
|
|
btScalar * | _Adata, |
|
|
btScalar * | _x, |
|
|
btScalar * | _b, |
|
|
btScalar * | _w, |
|
|
btScalar * | _lo, |
|
|
btScalar * | _hi, |
|
|
btScalar * | l, |
|
|
btScalar * | _d, |
|
|
btScalar * | _Dell, |
|
|
btScalar * | _ell, |
|
|
btScalar * | _tmp, |
|
|
bool * | _state, |
|
|
int * | _findex, |
|
|
int * | p, |
|
|
int * | c, |
|
|
btScalar ** | Arows ) |
◆ AiC_times_qC()
◆ Aii()
◆ AiN_times_qN()
◆ getNub()
| int btLCP::getNub |
( |
| ) |
const |
|
inline |
◆ indexC()
| int btLCP::indexC |
( |
int | i | ) |
const |
|
inline |
◆ indexN()
| int btLCP::indexN |
( |
int | i | ) |
const |
|
inline |
◆ numC()
| int btLCP::numC |
( |
| ) |
const |
|
inline |
◆ numN()
| int btLCP::numN |
( |
| ) |
const |
|
inline |
◆ pC_plusequals_s_times_qC()
◆ pN_equals_ANC_times_qC()
◆ pN_plusequals_ANi()
| void btLCP::pN_plusequals_ANi |
( |
btScalar * | p, |
|
|
int | i, |
|
|
int | sign = 1 ) |
◆ pN_plusequals_s_times_qN()
◆ solve1()
| void btLCP::solve1 |
( |
btScalar * | a, |
|
|
int | i, |
|
|
int | dir = 1, |
|
|
int | only_transfer = 0 ) |
◆ transfer_i_from_C_to_N()
◆ transfer_i_from_N_to_C()
| void btLCP::transfer_i_from_N_to_C |
( |
int | i | ) |
|
◆ transfer_i_to_C()
| void btLCP::transfer_i_to_C |
( |
int | i | ) |
|
◆ transfer_i_to_N()
| void btLCP::transfer_i_to_N |
( |
int | i | ) |
|
|
inline |
◆ unpermute()
| void btLCP::unpermute |
( |
| ) |
|
◆ m_A
◆ m_b
◆ m_C
| int* const * const * const btLCP::m_C |
◆ m_d
◆ m_Dell
◆ m_ell
◆ m_findex
| int* const btLCP::m_findex |
◆ m_hi
| btScalar* const * const * const * const * const btLCP::m_hi |
◆ m_L
◆ m_lo
| btScalar* const * const * const * const btLCP::m_lo |
◆ m_n
◆ m_nC
◆ m_nN
◆ m_nskip
◆ m_nub
◆ m_p
| int* const * const btLCP::m_p |
◆ m_state
| bool* const btLCP::m_state |
◆ m_tmp
| btScalar* const * const * const btLCP::m_tmp |
◆ m_w
| btScalar* const * const * const btLCP::m_w |
◆ m_x
The documentation for this struct was generated from the following file: