Generated on for Gecode by doxygen 1.17.0
Gecode::Int::Cumulative::Kaoc Namespace Reference

Classes

struct  Bits

Functions

void add (Bits &bits, int demand, int capacity)
int most_significant (unsigned long long word)
unsigned long long through (int bit)
int max_reachable (const Bits &bits, int residual)
 Return the greatest reachable subset demand at most residual.
template<class Tasks>
bool conflict (Tasks &tasks, int capacity)

Function Documentation

◆ add()

void Gecode::Int::Cumulative::Kaoc::add ( Bits & bits,
int demand,
int capacity )
inline

Definition at line 47 of file knapsack-overload.hpp.

◆ most_significant()

int Gecode::Int::Cumulative::Kaoc::most_significant ( unsigned long long word)
inline

Definition at line 70 of file knapsack-overload.hpp.

◆ through()

unsigned long long Gecode::Int::Cumulative::Kaoc::through ( int bit)
inline

Definition at line 83 of file knapsack-overload.hpp.

◆ max_reachable()

int Gecode::Int::Cumulative::Kaoc::max_reachable ( const Bits & bits,
int residual )
inline

Return the greatest reachable subset demand at most residual.

Definition at line 90 of file knapsack-overload.hpp.

◆ conflict()

template<class Tasks>
bool Gecode::Int::Cumulative::Kaoc::conflict ( Tasks & tasks,
int capacity )

Definition at line 107 of file knapsack-overload.hpp.