aligator
0.14.0
A primal-dual augmented Lagrangian-type solver for nonlinear trajectory optimization.
|
Classes | |
class | span |
Functions | |
template<class C> | |
constexpr auto | data (C &c) noexcept(noexcept(c.data())) -> decltype(c.data()) |
template<class C> | |
constexpr auto | data (const C &c) noexcept(noexcept(c.data())) -> decltype(c.data()) |
template<class T, std::size_t N> | |
constexpr T * | data (T(&a)[N]) noexcept |
template<class T> | |
constexpr const T * | data (std::initializer_list< T > l) noexcept |
template<class I> | |
constexpr span< I > | make_span (I *f, std::size_t c) noexcept |
template<class I> | |
constexpr span< I > | make_span (I *f, I *l) noexcept |
template<class T, std::size_t N> | |
constexpr span< T, N > | make_span (T(&a)[N]) noexcept |
template<class T, std::size_t N> | |
constexpr span< T, N > | make_span (std::array< T, N > &a) noexcept |
template<class T, std::size_t N> | |
constexpr span< const T, N > | make_span (const std::array< T, N > &a) noexcept |
template<class R> | |
span< typename detail::span_data< R >::type > | make_span (R &&r) |
template<typename T, typename A> | |
T * | get_pointer (::xyz::polymorphic< T, A > const &x) |
Variables | |
constexpr std::size_t | dynamic_extent = static_cast<std::size_t>(-1) |
template<class T, std::size_t E> | |
constexpr std::size_t | span< T, E >::extent |
|
inlineconstexprnoexcept |
|
inlineconstexprnoexcept |
|
inlineconstexprnoexcept |
|
inlineconstexprnoexcept |
|
inlineconstexprnoexcept |
Definition at line 17 of file make_span.hpp.
|
inlineconstexprnoexcept |
Definition at line 24 of file make_span.hpp.
|
inlineconstexprnoexcept |
Definition at line 31 of file make_span.hpp.
|
inlineconstexprnoexcept |
Definition at line 38 of file make_span.hpp.
|
inlineconstexprnoexcept |
Definition at line 45 of file make_span.hpp.
|
inline |
Definition at line 52 of file make_span.hpp.
|
inline |
|
constexpr |