|
|
| Node (const AssemblyTree::Node &anode) |
| |
|
| Node (InputStream &in) |
| |
|
void | write (OutputStream &out) |
| |
|
int | parent_id () const |
| |
|
std::vector< int > | children_ids () const |
| |
|
void | inspect (std::ostream &out) const |
| |
|
Range | p_pattern () const |
| |
|
Range | q_pattern () const |
| |
|
Range | p_blocking () const |
| |
|
Range | q_blocking () const |
| |
|
Range | iblock_pattern (int ib) const |
| |
|
Range | jblock_pattern (int jb) const |
| |
|
std::pair< int, int > | j_find (int j) const |
| |
|
std::pair< uint64_t, uint64_t > | n_words () const |
| |
|
uint64_t | n_work_solve () const |
| |
|
uint64_t | n_work_rankk () const |
| |
|
Range | iblock_up (int ib) const |
| |
|
Range | iblock_down (int ib, int c) const |
| |
|
Range | jblock_up (int jb) const |
| |
|
Range | jblock_down (int jb, int c) const |
| |
|
|
static bool | j_intersects (const Node &n1, const Node &n2) |
| |
|
static uint64_t | n_work_gemm (const Node &x, const Node &y) |
| |
|
|
int | id |
| |
|
int | p |
| |
|
int | q |
| |
|
int | j |
| |
|
std::vector< int > | i_pattern |
| |
|
std::vector< int > | j_pattern |
| |
|
int | P |
| |
|
int | Q |
| |
|
int | J |
| |
|
std::vector< int > | i_blocking |
| |
|
std::vector< int > | j_blocking |
| |
|
std::vector< int > | i_striding |
| |
|
std::vector< int > | j_striding |
| |
|
Node * | parent |
| |
|
std::vector< Node * > | children |
| |
The documentation for this class was generated from the following files:
- myramath/multifrontal/symbolic/SchurTree.h
- myramath/multifrontal/symbolic/SchurTree.cpp
