/usr/include/gecode/float/linear.hh is in libgecode-dev 4.4.0-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
* Guido Tack <tack@gecode.org>
* Vincent Barichard <Vincent.Barichard@univ-angers.fr>
*
* Copyright:
* Christian Schulte, 2002
* Guido Tack, 2004
* Vincent Barichard, 2012
*
* Last modified:
* $Date: 2013-01-24 19:28:06 +0100 (Thu, 24 Jan 2013) $ by $Author: schulte $
* $Revision: 13235 $
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
#ifndef __GECODE_FLOAT_LINEAR_HH__
#define __GECODE_FLOAT_LINEAR_HH__
#include <gecode/int.hh>
#include <gecode/float.hh>
/**
* \namespace Gecode::Float::Linear
* \brief %Linear propagators
*/
namespace Gecode { namespace Float { namespace Linear {
/**
* \brief Base-class for n-ary linear propagators
*
* Positive views are of type \a P whereas negative views are of type \a N.
*/
template<class P, class N, PropCond pc>
class Lin : public Propagator {
protected:
/// Array of positive views
ViewArray<P> x;
/// Array of negative views
ViewArray<N> y;
/// Constant value
FloatVal c;
/// Constructor for cloning \a p
Lin(Space& home, bool share, Lin<P,N,pc>& p);
/// Constructor for creation
Lin(Home home, ViewArray<P>& x, ViewArray<N>& y, FloatVal c);
public:
/// Cost function (defined as low linear)
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
};
/**
* \brief Compute bounds information for positive views
*
* \relates Lin
*/
template<class View>
void bounds_p(ModEventDelta med, ViewArray<View>& x,
FloatVal& c, FloatNum& sl, FloatNum& su);
/**
* \brief Compute bounds information for negative views
*
* \relates Lin
*/
template<class View>
void bounds_n(ModEventDelta med, ViewArray<View>& y,
FloatVal& c, FloatNum& sl, FloatNum& su);
/**
* \brief %Propagator for bounds consistent n-ary linear equality
*
* Positive views are of type \a P whereas negative views are of type \a N.
*
* Requires \code #include <gecode/float/linear.hh> \endcode
* \ingroup FuncFloatProp
*/
template<class P, class N>
class Eq : public Lin<P,N,PC_FLOAT_BND> {
protected:
using Lin<P,N,PC_FLOAT_BND>::x;
using Lin<P,N,PC_FLOAT_BND>::y;
using Lin<P,N,PC_FLOAT_BND>::c;
/// Constructor for cloning \a p
Eq(Space& home, bool share, Eq& p);
public:
/// Constructor for creation
Eq(Home home, ViewArray<P>& x, ViewArray<N>& y, FloatVal c);
/// Create copy during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i=c\f$
static ExecStatus
post(Home home, ViewArray<P>& x, ViewArray<N>& y, FloatVal c);
};
/**
* \brief %Propagator for bounds consistent n-ary linear less or equal
*
* Positive views are of type \a P whereas negative views are of type \a N.
*
* Requires \code #include <gecode/float/linear.hh> \endcode
* \ingroup FuncFloatProp
*/
template<class P, class N>
class Lq : public Lin<P,N,PC_FLOAT_BND> {
protected:
using Lin<P,N,PC_FLOAT_BND>::x;
using Lin<P,N,PC_FLOAT_BND>::y;
using Lin<P,N,PC_FLOAT_BND>::c;
/// Constructor for cloning \a p
Lq(Space& home, bool share, Lq& p);
public:
/// Constructor for creation
Lq(Home home, ViewArray<P>& x, ViewArray<N>& y, FloatVal c);
/// Create copy during cloning
virtual Actor* copy(Space& home, bool share);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator for \f$\sum_{i=0}^{|x|-1}x_i-\sum_{i=0}^{|y|-1}y_i\leq c\f$
static ExecStatus
post(Home home, ViewArray<P>& x, ViewArray<N>& y, FloatVal c);
};
}}}
#include <gecode/float/linear/nary.hpp>
namespace Gecode { namespace Float { namespace Linear {
/**
* \brief Class for describing linear term \f$a\cdot x\f$
*
*/
class Term {
public:
/// Coefficient
FloatVal a;
/// View
FloatView x;
};
/** \brief Estimate lower and upper bounds
*
* Estimates the boundaries for a linear expression
* \f$\sum_{i=0}^{n-1}t_i + c\f$. If the boundaries exceed
* the limits as defined in Limits::Float, these boundaries
* are returned.
*
* \param t array of linear terms
* \param n size of array
* \param c constant
* \param l lower bound
* \param u upper bound
*
*/
GECODE_FLOAT_EXPORT void
estimate(Term* t, int n, FloatVal c, FloatNum& l, FloatNum& u);
/**
* \brief Post propagator for linear constraint over floats
* \param home current space
* \param t array of linear terms over floats
* \param n size of array
* \param frt type of relation
* \param c result of linear constraint
*
* All variants for linear constraints share the following properties:
* - Variables occuring multiply in the term array are replaced
* by a single occurence: for example, \f$ax+bx\f$ becomes
* \f$(a+b)x\f$.
*
* Requires \code #include <gecode/float/linear.hh> \endcode
* \ingroup FuncFloatProp
*/
GECODE_FLOAT_EXPORT void
post(Home home, Term* t, int n, FloatRelType frt, FloatVal c);
/**
* \brief Post propagator for reified linear constraint over floats
* \param home current space
* \param t array of linear terms over Booleans
* \param n size of array
* \param frt type of relation
* \param c result of linear constraint
* \param r reification specification
*
* All variants for linear constraints share the following properties:
* - Variables occuring multiply in the term array are replaced
* by a single occurence: for example, \f$ax+bx\f$ becomes
* \f$(a+b)x\f$.
*
* Requires \code #include <gecode/float/linear.hh> \endcode
* \ingroup FuncFloatProp
*/
GECODE_FLOAT_EXPORT void
post(Home home, Term* t, int n, FloatRelType frt, FloatVal c, Reify r);
}}}
#endif
// STATISTICS: float-prop
|