proxsuite::linalg::sparse::_detail Namespace Reference

Classes
struct	SymbolicMatMutInterface
struct	SymbolicMatRefInterface

Functions
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 >))

Function Documentation

ereach_req()

auto proxsuite::linalg::sparse::_detail::ereach_req ( isize k ) -> proxsuite::linalg::veg::dynstack::StackReq

inlinenoexcept

Definition at line 332 of file factorize.hpp.

ereach()

template<typename I>

VEG_NODISCARD VEG_INLINE auto proxsuite::linalg::sparse::_detail::ereach ( usize & count, I * s, SymbolicMatRef< I > a, I const * parent, isize k, bool * pmarked ) -> I*

noexcept

Definition at line 341 of file factorize.hpp.

postorder_depth_first_search()

template<typename I>

VEG_INLINE auto proxsuite::linalg::sparse::_detail::postorder_depth_first_search ( I * post, usize root, usize start_index, I * pstack, I * pfirst_child, I * pnext_child ) -> usize

noexcept

Definition at line 413 of file factorize.hpp.

least_common_ancestor()

template<typename I>

VEG_INLINE auto proxsuite::linalg::sparse::_detail::least_common_ancestor ( usize i, usize j, I const * pfirst, I * pmax_first, I * pprev_leaf, I * pancestor ) -> I

noexcept

Definition at line 521 of file factorize.hpp.

inv_perm()

template<typename I>

void proxsuite::linalg::sparse::_detail::inv_perm ( I * perm_inv, I const * perm, isize n )

noexcept

Definition at line 760 of file factorize.hpp.

symmetric_permute_symbolic_req()

template<typename I>

auto proxsuite::linalg::sparse::_detail::symmetric_permute_symbolic_req ( proxsuite::linalg::veg::Tag< I > , isize n ) -> proxsuite::linalg::veg::dynstack::StackReq

noexcept

Definition at line 769 of file factorize.hpp.

symmetric_permute_req()

template<typename I>

auto proxsuite::linalg::sparse::_detail::symmetric_permute_req ( proxsuite::linalg::veg::Tag< I > , isize n ) -> proxsuite::linalg::veg::dynstack::StackReq

noexcept

Definition at line 777 of file factorize.hpp.

symmetric_permute_common()

template<typename I>

void proxsuite::linalg::sparse::_detail::symmetric_permute_common	(	usize	n,
		I const *	pperm_inv,
		SymbolicMatRef< I >	old_a,
		I *	pnew_ap,
		I *	pcol_counts )

Definition at line 785 of file factorize.hpp.

symmetric_permute_symbolic()

template<typename I>

void proxsuite::linalg::sparse::_detail::symmetric_permute_symbolic ( SymbolicMatMut< I > new_a, SymbolicMatRef< I > old_a, I const * perm_inv, DynStackMut stack )

noexcept

Definition at line 817 of file factorize.hpp.

symmetric_permute()

template<typename T, typename I>

void proxsuite::linalg::sparse::_detail::symmetric_permute ( MatMut< T, I > new_a, MatRef< T, I > old_a, I const * perm_inv, DynStackMut stack )

noexcept

Definition at line 865 of file factorize.hpp.