proxsuite 0.7.2 The Advanced Proximal Optimization Toolbox |
#include "proxsuite/linalg/sparse/core.hpp"#include <proxsuite/linalg/veg/tuple.hpp>#include <algorithm>Go to the source code of this file.
Namespaces | |
| namespace | proxsuite |
| namespace | proxsuite::linalg |
| namespace | proxsuite::linalg::sparse |
Functions | |
| template<typename I> | |
| auto | proxsuite::linalg::sparse::merge_second_col_into_first_req (proxsuite::linalg::veg::Tag< I >, isize second_size) noexcept -> proxsuite::linalg::veg::dynstack::StackReq |
| template<typename T, typename I> | |
| auto | proxsuite::linalg::sparse::merge_second_col_into_first (I *difference, T *first_values, I *first_ptr, PROXSUITE_MAYBE_UNUSED isize first_full_len, isize first_initial_len, Slice< I > second, proxsuite::linalg::veg::DoNotDeduce< I > ignore_threshold_inclusive, bool move_values, DynStackMut stack) noexcept(false) -> proxsuite::linalg::veg::Tuple< SliceMut< T >, SliceMut< I >, SliceMut< I > > |
| template<typename T, typename I> | |
| auto | proxsuite::linalg::sparse::rank1_update_req (proxsuite::linalg::veg::Tag< T >, proxsuite::linalg::veg::Tag< I >, isize n, bool id_perm, isize col_nnz) noexcept -> proxsuite::linalg::veg::dynstack::StackReq |
| template<typename T, typename I> | |
| auto | proxsuite::linalg::sparse::rank1_update (MatMut< T, I > ld, I *etree, I const *perm_inv, VecRef< T, I > w, proxsuite::linalg::veg::DoNotDeduce< T > alpha, DynStackMut stack) noexcept(false) -> MatMut< T, I > |