|
Gecode 6.4.0
|
#include < -- improving gecode/implementation/gecode/gecode/optimize/result.hpp>
Public Member Functions | |
| SolveBudget (const SolveOptions &options) | |
| double | elapsed_seconds () const noexcept |
| double | remaining_seconds () const noexcept |
| bool | cancelled () const noexcept |
| bool | time_limit_reached () const noexcept |
| bool | node_limit_reached () const noexcept |
| bool | expired () const noexcept |
| std::optional< Termination > | stop_reason () const noexcept |
| void | add_nodes (std::uint64_t count=1) noexcept |
| std::uint64_t | nodes () const noexcept |
| std::shared_ptr< CancellationToken > | cancellation () const noexcept |
Copies share a monotonic clock, cancellation token and cumulative node count. All stages of one solve should use this same budget rather than restarting the deadline. Callers explicitly add newly consumed nodes (not a cumulative backend total on every poll). Concurrent node additions saturate at UINT64_MAX.
|
explicit |
|
noexcept |
|
noexcept |
|
noexcept |
|
noexcept |
|
noexcept |
|
noexcept |
|
noexcept |
Cancellation takes precedence over time, then node limits.
|
noexcept |
|
noexcept |
|
noexcept |