|
|
void | ReorderOnEdge () |
| |
|
void | OrderOnEdge () |
| |
|
void | CalculateTimeStepOnEdge (std::vector< double > &dt, std::vector< bool > &isSnaxDone, int edgeInd) |
| |
|
void | DetectImpactOnEdge (std::vector< int > &isImpact, std::vector< bool > &isSnaxDone, int edgeInd) |
| |
|
bool | checkready () |
| |
|
void | ForceArrayReady () |
| |
|
void | PrepareForUse () |
| |
|
void | Concatenate (const snaxarray &other) |
| |
|
snax & | operator[] (const int a) |
| |
|
int | findparent (int key) const |
| |
|
void | findsiblings (int key, std::vector< int > &siblings) const |
| |
|
int | countparent (int key) const |
| |
|
void | HashParent () |
| |
|
void | DeHashParent (const int pos) |
| |
|
bool | memberIsHashParent (const int pos) const |
| |
|
void | Init (int n) |
| |
|
void | push_back (snax &newelem) |
| |
|
void | clear () |
| |
|
bool | checkready () |
| |
|
void | ForceArrayReady () |
| |
|
void | PrepareForUse () |
| |
|
void | Concatenate (const SnakStruct< snax > &other) |
| |
|
void | remove (const std::vector< int > &sub) |
| |
|
snax & | operator[] (const int a) |
| |
|
void | disp () const |
| |
|
void | disp (const std::vector< int > &subs) const |
| |
|
void | disp (int iStart, int iEnd) const |
| |
|
int | find (int key, bool noWarn=false) const |
| |
|
std::vector< int > | find_list (const std::vector< int > &key, bool noWarn=false) const |
| |
|
int | GetMaxIndex () const |
| |
|
void | Init (int n) |
| |
|
bool | isready () const |
| |
|
bool | checkready () |
| |
|
void | Concatenate (const ArrayStruct< T > &other) |
| |
|
void | PopulateIndices () |
| |
|
void | SetMaxIndex () |
| |
|
void | HashArray () |
| |
|
void | PrepareForUse () |
| |
|
void | ChangeIndices (int nVert, int nEdge, int nSurf, int nVolu) |
| |
|
void | write (FILE *fid) const |
| |
|
void | read (FILE *fid) |
| |
|
void | remove (std::vector< int > delInd) |
| |
|
void | TightenConnectivity () |
| |
|
int | size () const |
| |
|
int | capacity () const |
| |
|
void | assign (int n, T &newelem) |
| |
|
void | push_back (T &newelem) |
| |
|
void | reserve (int n) |
| |
|
void | clear () |
| |
|
void | issafeaccess (const int a) |
| |
|
const T * | operator() (const int a) const |
| |
|
const T * | isearch (const int b) const |
| |
|
T & | operator[] (const int a) |
| |
|
|
int | isOrderedOnEdge = 0 |
| |
|
std::unordered_multimap< int, int > | hashParent |
| |
|
int | isHashParent |
| |
|
int | maxIndex |
| |
|
int | isHash = 0 |
| |
|
int | isSetMI = 0 |
| |
|
bool | readyforuse = false |
| |
|
bool | isInMesh = false |
| |
|
std::vector< T > | elems |
| |
|
std::unordered_multimap< int, int > | hashTable |
| |
|
|
class | snake |
| |
|
class | snax |
| |
|
void | SpawnArrivedSnaxelsDir (snake &fullsnake, snake &partSnake, const std::vector< int > &isImpact, int dir) |
| |
|
|
void | ForceArrayReady () |
| |
|
void | SetLastIndex () |
| |
Definition at line 55 of file snake.hpp.
The documentation for this class was generated from the following files:
Public Member Functions inherited from SnakStruct< snax >