product-mod.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 | |
| bool | Gecode::Int::Arithmetic::product_mod_interval_mul (ProductInterval a, ProductInterval b, ProductInterval &p) |
| Multiply intervals exactly; saturation would make modular deductions unsound. | |
| bool | Gecode::Int::Arithmetic::product_mod_interval (const ViewArray< IntView > &x, ProductInterval &p, int a=1) |
| Return exact representable product bounds, or false on overflow. | |
| bool | Gecode::Int::Arithmetic::product_mod_intervals (const ViewArray< IntView > &x, ProductInterval *prefix, ProductInterval *suffix, int a=1) |
| Build all cofactor bounds in linear time, without modular saturation. | |
| int | Gecode::Int::Arithmetic::product_mod_coefficient (const ViewArray< IntView > &x, int m, int &free_count) |
| Reduce assigned factors and count the remaining factor occurrences. | |
| void | Gecode::Int::Arithmetic::product_mod_fold (ViewArray< IntView > &x, int m, int &c, int &a) |
| Fold assigned occurrences into modular and representable exact coefficients. | |
| void | Gecode::Int::Arithmetic::product_mod_units (ViewArray< IntView > &x) |
| Drop assigned units without changing a product with an unknown modulus. | |
| ExecStatus | Gecode::Int::Arithmetic::product_mod_nonzero (Space &home, ViewArray< IntView > &x, bool &modified) |
| A nonzero residue excludes bounds-visible zero factors. | |
| RelTest | Gecode::Int::Arithmetic::product_mod_status (const ViewArray< IntView > &x, const IntView &y, int m) |
| Determine the fixed-modulus relation algebraically. | |
| long long int | Gecode::Int::Arithmetic::product_mod_inverse (long long int a, long long int m) |
| Extended Euclid for a modular inverse (arguments are coprime). | |
| ProductInterval | Gecode::Int::Arithmetic::product_mod_congruence (ProductInterval x, int c, int m, int y) |
| Extreme solutions to c*x = y modulo m, or an empty interval. | |
| bool | Gecode::Int::Arithmetic::product_mod_var_mod_factor (const ViewArray< IntView > &x, const IntView &m) |
| Whether the modulus occurs among the factors. | |
| bool | Gecode::Int::Arithmetic::product_mod_var_exact (const ViewArray< IntView > &x, long long int &p) |
| Compute the exact assigned product when it fits in a signed 64-bit value. | |
| bool | Gecode::Int::Arithmetic::product_mod_var_divisor_bounds (int lower, int upper, long long int d, int &least, int &greatest) |
| Tighten divisor bounds for a nonzero difference without enumeration. | |
| ExecStatus | Gecode::Int::Arithmetic::product_mod_var_ranges (Home home, ViewArray< IntView > &x, IntView m, IntView y) |
| Propagate a nonnegative representable product with a variable modulus. | |
| RelTest | Gecode::Int::Arithmetic::product_mod_var_status (const ViewArray< IntView > &x, const IntView &m, const IntView &y) |
| Determine algebraic status; evaluate the residue only when fully assigned. | |
