gcd.hpp File Reference
#include <algorithm>Go to the source code of this file.
Namespaces | |
| namespace | Gecode |
| Gecode toplevel namespace | |
| namespace | Gecode::Int |
| Finite domain integers. | |
| namespace | Gecode::Int::Arithmetic |
| Numerical (arithmetic) propagators. | |
Functions | |
| int | Gecode::Int::Arithmetic::gcd_value (int a, int b) |
| int | Gecode::Int::Arithmetic::gcd_max_abs (const IntView &x) |
| bool | Gecode::Int::Arithmetic::gcd_excludes_zero_bnd (const IntView &x) |
| int | Gecode::Int::Arithmetic::gcd_upper (const IntView &x0, const IntView &x1) |
| Upper bound on a gcd from the operand bounds. | |
| ExecStatus | Gecode::Int::Arithmetic::multiple_bounds (Home home, IntView x, int d) |
| Tighten a view to the extreme multiples of a positive divisor. | |
| template<class View> | |
| bool | Gecode::Int::Arithmetic::gcd_support_min (View x, int a, int g, int &bound) |
| Probe at most 64 multiples for a coprime quotient at an endpoint. | |
| ExecStatus | Gecode::Int::Arithmetic::gcd_coprime_bounds (Home home, IntView x, int a, int g) |
| With an assigned operand, exclude endpoints lacking a coprime quotient. | |
| ExecStatus | Gecode::Int::Arithmetic::gcd_divisor_bounds (Home home, IntView g, int a) |
| A fixed quotient of an assigned operand admits at most one GCD divisor. | |
| RelTest | Gecode::Int::Arithmetic::gcd_abs_status (const IntView &x0, const IntView &x1) |
| Status of abs(x0)=x1 using bounds, assignments, and domain membership. | |
| RelTest | Gecode::Int::Arithmetic::gcd_status (const IntView &x0, const IntView &x1, const IntView &x2) |
