Functions | |
| void | Gecode::sequence (Home home, OpenIntVarList x, const IntSet &s, int q, int l, int u, IntPropLevel ipl=IPL_DEF) |
| Post a sliding sequence constraint on x. | |
| void | Gecode::sliding_sum (Home home, OpenIntVarList x, int q, int l, int u, IntPropLevel ipl=IPL_DEF) |
| Constrain the sum of every complete window in x. | |
Detailed Description
Function Documentation
◆ sequence()
| void Gecode::sequence | ( | Home | home, |
| OpenIntVarList | x, | ||
| const IntSet & | s, | ||
| int | q, | ||
| int | l, | ||
| int | u, | ||
| IntPropLevel | ipl = IPL_DEF ) |
Post a sliding sequence constraint on x.
Each complete window of size q, including windows completed after posting, contains between l and u values from s. A list shorter than q has no complete windows and satisfies the constraint. Domain filtering is enforced for each window separately; ipl is ignored.
Definition at line 190 of file sequence.cpp.
◆ sliding_sum()
| void Gecode::sliding_sum | ( | Home | home, |
| OpenIntVarList | x, | ||
| int | q, | ||
| int | l, | ||
| int | u, | ||
| IntPropLevel | ipl = IPL_DEF ) |
Constrain the sum of every complete window in x.
Each complete window of size q, including windows completed after posting, has a sum between l and u. A list shorter than q has no complete windows and satisfies the constraint. Unequal bounds use bounds propagation. For equality, ipl selects bounds or domain propagation; the default is domain propagation for windows of size at most two and bounds propagation for larger windows.
Definition at line 213 of file sequence.cpp.
