|
| void | check (const IntVarArgs &x, MinDistancePropKind kind) |
| | Validate the organization and number of positions.
|
| ExecStatus | post (Home home, const IntVarArgs &x, IntView z, const IntDistance &d, const IntSharedArray &r, MinDistancePropKind kind, IntPropLevel ipl) |
| | Shared posting for the two public overloads.
|
| int | requirement (const IntSharedArray &r, int n, int i, int j) |
| | Inclusive requirement, with an empty matrix denoting all zeroes.
|
| ExecStatus | forward (Space &home, IntView a, IntView b, int threshold, const IntDistance &d, bool &changed) |
| | Prune the partner of an assigned endpoint.
|
| void | pair_max (IntView x, IntView y, const IntDistance &d, PairCache &c) |
| | Recompute the maximum distance between current domains.
|
| ExecStatus | assigned (Space &home, const ViewArray< IntView > &x, IntView z, const IntDistance &d, const IntSharedArray &r) |
| | Validate and bind a complete assignment.
|
| ExecStatus | zero (Space &home, const ViewArray< IntView > &x, const IntDistance &d, const IntSharedArray &r, bool &changed, bool &realized) |
| | Enforce an actual zero-distance witness when the objective is zero.
|
Minimum-distance propagators over indexed sites.
The forward-bound and greedy conflict-matching algorithms follow: M. Z. Lagerkvist, Propagation Algorithms for the Minimum-Distance Constraint over Selected Points, ModRef 2026. https://github.com/zayenz/modref2026-minimum-distance-propagators