Tests for arithmetic constraints More...
Classes | |
| class | GcdXYZ |
| Test for the ternary greatest-common-divisor constraint More... | |
| class | GcdXXY |
| Test for gcd with identical operands More... | |
| class | GcdXYX |
| Test for gcd with result aliased to the first operand More... | |
| class | GcdXXX |
| Test for gcd with all variables aliased More... | |
| class | DividesXY |
| Test for the reified divisibility constraint More... | |
| class | DividesXX |
| Test divisibility with aliased operands More... | |
| class | NumberTheoryAlgebraic |
| Algebraic deductions must not wait for unrelated variables to be fixed. More... | |
| class | NumberTheorySparseBounds |
| Sparse endpoints must reach a fixpoint after a divisor is assigned. More... | |
| class | NumberTheoryLifecycle |
| Activation and rescheduling survive cloning and arithmetic rewrites. More... | |
| class | NumberTheoryIdentities |
| Reified identities do not require the remaining factors to be fixed. More... | |
| class | NumberTheoryLimits |
| Known identities at the integer limits, independent of the oracles. More... | |
| class | ProductModLimits |
| Known modular residues whose unreduced product exceeds 64 bits. More... | |
| class | ProductXYZR |
| Test for an ordinary and reified three-factor product More... | |
| class | ProductEmpty |
| Test for the empty product More... | |
| class | ProductSingleton |
| Test for the singleton product More... | |
| class | ProductXXYAlias |
| Test repeated factors and result aliasing More... | |
| class | ProductInterleaved |
| Interleaved powers exercise grouping, cofactors, and cloned rewrites. More... | |
| class | ProductBoundsLarge |
| Test forward and inverse product bounds on large factor domains More... | |
| class | ProductSimplifySign |
| Test zero, unit, and aggregate-sign product simplifications. More... | |
| class | ProductPowerAlias |
| Test repeated powers and result-alias cancellation. More... | |
| class | ProductInverseBounds |
| Test zero-aware inverse bounds for every cofactor sign class. More... | |
| class | ProductCompactionZero |
| Unit compaction must finish before a zero factor subsumes the actor. More... | |
| class | ProductModXYZR |
| Test for an ordinary and reified three-factor modular product More... | |
| class | ProductModCoefficient |
| Assigned coefficients with several free factors and all reification modes. More... | |
| class | ProductModFolded |
| Folded coefficients, repeated factors, and products beyond machine range. More... | |
| class | ProductModNonzero |
| A nonzero modular result excludes every zero factor. More... | |
| class | ProductModEmpty |
| Test for the empty modular product, including modulus one More... | |
| class | ProductModSingleton |
| Test for a singleton modular product More... | |
| class | ProductModXXYAlias |
| Test repeated factors with the result aliased to a factor More... | |
| class | ProductModAlgebraic |
| Targeted algebraic and quotient-band propagation for fixed modulus. More... | |
| class | ProductModVarXYMR |
| Test for an ordinary two-factor product with a variable modulus More... | |
| class | ProductModVarEmpty |
| Test for the empty product with a variable modulus More... | |
| class | ProductModVarSingleton |
| Test for a singleton product with a variable modulus More... | |
| class | ProductModVarRepeated |
| Test repeated factors with a variable modulus More... | |
| class | ProductModVarModFactorAlias |
| Test modulus/factor aliasing More... | |
| class | ProductModVarFactorResultAlias |
| Test factor/result aliasing More... | |
| class | ProductModVarModResultAlias |
| Test modulus/result aliasing, which is necessarily inconsistent More... | |
| class | ProductModVarBounds |
| Targeted bounds and arithmetic checks for a variable modulus. More... | |
| class | ProductModVarSparseModulus |
| Modulus bounds must reach a fixpoint after jumping over a domain hole. More... | |
| class | ProductModVarAlgebraic |
| Targeted algebraic propagation for a variable modulus. More... | |
| class | ProductModVarInactive |
| Inactive implications preserve every assignment in the input domains. More... | |
| class | ProductModInvalidModulus |
| Test that a nonpositive modular-product modulus is rejected More... | |
| class | MultXYZ |
| Test for multiplication constraint More... | |
| class | MultXXY |
| Test for multiplication constraint with shared variables More... | |
| class | MultXYX |
| Test for multiplication constraint with shared variables More... | |
| class | MultXYY |
| Test for multiplication constraint with shared variables More... | |
| class | MultXXX |
| Test for multiplication constraint with shared variables More... | |
| class | SqrXY |
| Test for squaring constraint More... | |
| class | SqrXX |
| Test for squaring constraint with shared variables More... | |
| class | SqrtXY |
| Test for square root constraint More... | |
| class | SqrtXX |
| Test for square root constraint with shared variables More... | |
| class | PowXY |
| Test for power constraint More... | |
| class | PowXX |
| Test for power constraint with shared variables More... | |
| class | NrootXY |
| Test for nroot constraint More... | |
| class | NrootXX |
| Test for nroot constraint with shared variables More... | |
| class | DivMod |
| Test for division/modulo constraint More... | |
| class | Div |
| Test for division constraint More... | |
| class | Mod |
| Test for modulo constraint More... | |
| class | AbsXY |
| Test for absolute value constraint More... | |
| class | AbsXX |
| Test for absolute value constraint with shared variables More... | |
| class | MinXYZ |
| Test for binary minimum constraint More... | |
| class | MinXXY |
| Test for binary minimum constraint with shared variables More... | |
| class | MinXYX |
| Test for binary minimum constraint with shared variables More... | |
| class | MinXYY |
| Test for binary minimum constraint with shared variables More... | |
| class | MinXXX |
| Test for binary minimum constraint with shared variables More... | |
| class | MaxXYZ |
| Test for binary maximum constraint More... | |
| class | MaxXXY |
| Test for binary maximum constraint with shared variables More... | |
| class | MaxXYX |
| Test for binary maximum constraint with shared variables More... | |
| class | MaxXYY |
| Test for binary maximum constraint with shared variables More... | |
| class | MaxXXX |
| Test for binary maximum constraint with shared variables More... | |
| class | MinNary |
| Test for n-ary minimmum constraint More... | |
| class | MinNaryShared |
| Test for n-ary minimmum constraint with shared variables More... | |
| class | MaxNary |
| Test for n-ary maximum constraint More... | |
| class | MaxNaryShared |
| Test for n-ary maximum constraint with shared variables More... | |
| class | ArgMax |
| Test for argument maximum constraint More... | |
| class | ArgMaxShared |
| Test for argument maximum constraint with shared variables More... | |
| class | ArgMin |
| Test for argument minimum constraint More... | |
| class | ArgMinShared |
| Test for argument minimum constraint with shared variables More... | |
| class | ArgMaxBool |
| Test for Boolean argument maximum constraint More... | |
| class | ArgMaxBoolShared |
| Test for argument maximum constraint with shared variables More... | |
| class | ArgMinBool |
| Test for argument minimum constraint More... | |
| class | ArgMinBoolShared |
| Test for argument minimum constraint with shared variables More... | |
| class | Create |
| Help class to create and register tests. More... | |
Functions | |
| int | gcd_value (int a, int b) |
| Compute the mathematical greatest common divisor for testing. | |
| bool | arithmetic_failed (const std::string &what, const Gecode::VarArgArray< Gecode::IntVar > &x) |
| Report a targeted arithmetic failure through the standard test log. | |
| bool | product_value (const Assignment &x, int n, int &product) |
| Evaluate an exact product for testing without overflowing. | |
| int | product_mod_value (const Assignment &x, int n, int m) |
| Compute a canonical modular product for testing. | |
| bool | powgr (int n, long long int r, int x) |
| int | fnroot (int n, int x) |
| bool | powle (int n, long long int r, int x) |
| int | cnroot (int n, int x) |
Variables | |
| Create | c |
Detailed Description
Tests for arithmetic constraints
Function Documentation
◆ gcd_value()
| int Test::Int::Arithmetic::gcd_value | ( | int | a, |
| int | b ) |
Compute the mathematical greatest common divisor for testing.
Definition at line 53 of file arithmetic.cpp.
◆ arithmetic_failed()
| bool Test::Int::Arithmetic::arithmetic_failed | ( | const std::string & | what, |
| const Gecode::VarArgArray< Gecode::IntVar > & | x ) |
Report a targeted arithmetic failure through the standard test log.
Definition at line 224 of file arithmetic.cpp.
◆ product_value()
| bool Test::Int::Arithmetic::product_value | ( | const Assignment & | x, |
| int | n, | ||
| int & | product ) |
Evaluate an exact product for testing without overflowing.
Definition at line 588 of file arithmetic.cpp.
◆ product_mod_value()
| int Test::Int::Arithmetic::product_mod_value | ( | const Assignment & | x, |
| int | n, | ||
| int | m ) |
Compute a canonical modular product for testing.
Definition at line 1154 of file arithmetic.cpp.
◆ powgr()
| bool Test::Int::Arithmetic::powgr | ( | int | n, |
| long long int | r, | ||
| int | x ) |
Definition at line 2185 of file arithmetic.cpp.
◆ fnroot()
| int Test::Int::Arithmetic::fnroot | ( | int | n, |
| int | x ) |
Definition at line 2197 of file arithmetic.cpp.
◆ powle()
| bool Test::Int::Arithmetic::powle | ( | int | n, |
| long long int | r, | ||
| int | x ) |
Definition at line 2212 of file arithmetic.cpp.
◆ cnroot()
| int Test::Int::Arithmetic::cnroot | ( | int | n, |
| int | x ) |
Definition at line 2225 of file arithmetic.cpp.
Variable Documentation
◆ c
| Create Test::Int::Arithmetic::c |
Definition at line 3269 of file arithmetic.cpp.
