Generated on for Gecode by doxygen 1.17.0
product.hpp File Reference
#include <algorithm>

Go to the source code of this file.

Classes

struct  Gecode::Int::Arithmetic::ProductInterval
 A representable, conservative interval for an exact product. More...
struct  Gecode::Int::Arithmetic::ProductWideInterval
 An interval whose endpoints have not been restricted to integer limits. More...

Namespaces

namespace  Gecode
 Gecode toplevel namespace
namespace  Gecode::Int
 Finite domain integers.
namespace  Gecode::Int::Arithmetic
 Numerical (arithmetic) propagators.

Functions

ProductInterval Gecode::Int::Arithmetic::product_interval_mul (ProductInterval a, int bmin, int bmax)
 Multiply two representable intervals, clipping out-of-range endpoints.
ProductInterval Gecode::Int::Arithmetic::product_interval_mul (ProductInterval a, ProductInterval b)
 Multiply two representable intervals.
int Gecode::Int::Arithmetic::product_power_abs (int x, int n)
 Compute a nonnegative power, saturating at the integer limit.
ProductInterval Gecode::Int::Arithmetic::product_power_interval (IntView x, int n)
 Bounds for a repeated occurrence viewed as an integer power.
bool Gecode::Int::Arithmetic::product_power_le (int x, int n, int limit)
int Gecode::Int::Arithmetic::product_floor_root (int x, int n)
 Floor and ceiling of a nonnegative integer root.
int Gecode::Int::Arithmetic::product_ceil_root (int x, int n)
ProductWideInterval Gecode::Int::Arithmetic::product_quotient_bounds (long long int ymin, long long int ymax, int qmin, int qmax)
 Quotient bounds for a zero-free divisor, before clipping the endpoints.
ProductInterval Gecode::Int::Arithmetic::product_quotient_interval (int ymin, int ymax, int qmin, int qmax)
 Compute a saturated hull of quotients by a zero-free interval.
ProductInterval Gecode::Int::Arithmetic::product_quotient_hull (ProductInterval y, ProductInterval q)
 Hull of quotients by the nonzero parts of a cofactor interval.
ProductInterval Gecode::Int::Arithmetic::product_root_interval (ProductInterval x, int n, ProductInterval d)
 Invert integer power bounds; min greater than max denotes no support.
ProductInterval Gecode::Int::Arithmetic::product_interval (const ViewArray< IntView > &x, int omit=-1)
 Compute product bounds, optionally omitting one factor.
bool Gecode::Int::Arithmetic::product_value (const int *v, int n, int &p)
 Evaluate a tuple without overflowing internal arithmetic.
RelTest Gecode::Int::Arithmetic::product_status (const ViewArray< IntView > &x, const IntView &y)
 Determine the relation when bounds or assignments prove it.