|
auto | ereach_req (isize k) noexcept -> proxsuite::linalg::veg::dynstack::StackReq |
|
template<typename I > |
VEG_NODISCARD VEG_INLINE auto | ereach (usize &count, I *s, SymbolicMatRef< I > a, I const *parent, isize k, bool *pmarked) noexcept -> I * |
|
template<typename I > |
VEG_INLINE auto | postorder_depth_first_search (I *post, usize root, usize start_index, I *pstack, I *pfirst_child, I *pnext_child) noexcept -> usize |
|
template<typename I > |
VEG_INLINE auto | least_common_ancestor (usize i, usize j, I const *pfirst, I *pmax_first, I *pprev_leaf, I *pancestor) noexcept -> I |
|
template<typename I > |
void | inv_perm (I *perm_inv, I const *perm, isize n) noexcept |
|
template<typename I > |
auto | symmetric_permute_symbolic_req (proxsuite::linalg::veg::Tag< I >, isize n) noexcept -> proxsuite::linalg::veg::dynstack::StackReq |
|
template<typename I > |
auto | symmetric_permute_req (proxsuite::linalg::veg::Tag< I >, isize n) noexcept -> proxsuite::linalg::veg::dynstack::StackReq |
|
template<typename I > |
void | symmetric_permute_common (usize n, I const *pperm_inv, SymbolicMatRef< I > old_a, I *pnew_ap, I *pcol_counts) |
|
template<typename I > |
void | symmetric_permute_symbolic (SymbolicMatMut< I > new_a, SymbolicMatRef< I > old_a, I const *perm_inv, DynStackMut stack) noexcept |
|
template<typename T , typename I > |
void | symmetric_permute (MatMut< T, I > new_a, MatRef< T, I > old_a, I const *perm_inv, DynStackMut stack) noexcept(VEG_CONCEPT(nothrow_copyable< T >)) |
|