37 std::size_t
len() const noexcept {
return a_max.size(); }
58 std::size_t
s_len() const noexcept {
return s_len_; }
64 std::size_t s_len_ = 0;
Non-owning view of a Rust-backed constraint buffer.
Small C++17 expected-like result used by no-throw overloads.
TOPP2 problem descriptor.
IndexInterval idx_s_interval() const noexcept
ConstraintsRef constraints() const noexcept
Problem(ConstraintsRef constraints, IndexInterval idx_s_interval, Boundary2 a_boundary={})
std::size_t s_len() const noexcept
Boundary2 a_boundary() const noexcept
auto expected_from(Fn &&fn) -> Expected< typename std::decay< decltype(fn())>::type >
Second-order time-optimal reachability-analysis solver plus second-order reachable-set artifacts and ...
COPP_API ReachSet reach_set_bidirectional(const Problem &problem, const Options &options={})
Compute bidirectional TOPP2 reachable intervals, enforcing both boundaries.
COPP_API std::vector< double > solve(const Problem &problem, const Options &options={})
Solve TOPP2 with reachability analysis.
COPP_API ReachSet reach_set_backward(const Problem &problem, const Options &options={})
Compute backward-only TOPP2 reachable intervals.
Verbosity
Diagnostic verbosity for solver algorithms.
Second-order endpoint boundary values.
Closed station-index interval used by TOPP/COPP problem descriptors.
Tag object selecting no-throw overloads.
Options shared by TOPP2-RA and TOPP2 reachable-set construction.
Reachable interval result for second-order state a = (ds/dt)^2.
std::vector< double > a_min
std::size_t len() const noexcept
bool empty() const noexcept
std::vector< double > a_max