#include <utility>
Go to the source code of this file.
|
| void | Gecode::Int::Cumulative::Kaoc::add (Bits &bits, int demand, int capacity) |
| int | Gecode::Int::Cumulative::Kaoc::most_significant (unsigned long long word) |
| unsigned long long | Gecode::Int::Cumulative::Kaoc::through (int bit) |
| int | Gecode::Int::Cumulative::Kaoc::max_reachable (const Bits &bits, int residual) |
| | Return the greatest reachable subset demand at most residual.
|
| template<class Tasks> |
| bool | Gecode::Int::Cumulative::Kaoc::conflict (Tasks &tasks, int capacity) |
| template<class Task> |
| ExecStatus | Gecode::Int::Cumulative::supported_knapsack_overload (TaskArray< Task > &tasks, int capacity) |
| ExecStatus | Gecode::Int::Cumulative::knapsack_overload (Space &home, int c, TaskArray< ManFixPTask > &t) |
| ExecStatus | Gecode::Int::Cumulative::knapsack_overload (Space &home, int c, TaskArray< ManFixPSETask > &t) |
| ExecStatus | Gecode::Int::Cumulative::knapsack_overload (Space &home, int c, TaskArray< OptFixPTask > &t) |
| ExecStatus | Gecode::Int::Cumulative::knapsack_overload (Space &home, int c, TaskArray< OptFixPSETask > &t) |