/usr/include/gecode/int/bin-packing.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 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 | /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Contributing authors:
* Stefano Gualandi <stefano.gualandi@gmail.com>
*
* Copyright:
* Stefano Gualandi, 2013
* Christian Schulte, 2010
*
* Last modified:
* $Date: 2014-08-28 14:29:11 +0200 (Thu, 28 Aug 2014) $ by $Author: schulte $
* $Revision: 14203 $
*
* 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_INT_BIN_PACKING_HH__
#define __GECODE_INT_BIN_PACKING_HH__
#include <gecode/int.hh>
/**
* \namespace Gecode::Int::BinPacking
* \brief %Bin-packing propagators
*/
namespace Gecode { namespace Int { namespace BinPacking {
/**
* \brief Item combining bin and size information
*/
class Item : public DerivedView<IntView> {
protected:
using DerivedView<IntView>::x;
/// Size of item
int s;
public:
/// Default constructor
Item(void);
/// Constructor
Item(IntView b, int s);
/// Return bin of item
IntView bin(void) const;
/// Set bin of item to \a b
void bin(IntView b);
/// Return size of item
int size(void) const;
/// Set size of item to \a s
void size(int s);
/// Update item during cloning
void update(Space& home, bool share, Item& i);
};
/// Whether two items are the same
bool same(const Item& i, const Item& j);
/// Test whether one item is before another
bool before(const Item& i, const Item& j);
/// For sorting according to size
bool operator <(const Item& i, const Item& j);
/// Size sets
class SizeSet {
protected:
/// Number of size entries in the set
int n;
/// Total size of the set
int t;
/// Array of sizes (will have more elements)
int* s;
public:
/// Default constructor
SizeSet(void);
/// Initialize for at most \a n_max items
SizeSet(Region& region, int n_max);
/// Add new size \a s
void add(int s);
/// Return cardinality of set (number of entries)
int card(void) const;
/// Return total size
int total(void) const;
/// Return size of item \a i
int operator [](int i) const;
};
/// Size sets with one element discarded
class SizeSetMinusOne : public SizeSet {
protected:
/// Position of discarded item
int p;
public:
/// Default constructor
SizeSetMinusOne(void);
/// Initialize for at most \n n_max entries
SizeSetMinusOne(Region& region, int n);
/// Discard size \a s
void minus(int s);
/// Return cardinality of set (number of entries)
int card(void) const;
/// Return total size
int total(void) const;
/// Return size of item \a i
int operator [](int i) const;
};
/**
* \brief Bin-packing propagator
*
* The algorithm is taken from:
* Paul Shaw. A Constraint for Bin Packing. CP 2004.
*
* Requires \code #include <gecode/int/bin-packing.hh> \endcode
*
* \ingroup FuncIntProp
*/
class Pack : public Propagator {
protected:
/// Views for load of bins
ViewArray<OffsetView> l;
/// Items with bin and size
ViewArray<Item> bs;
/// Total size of all items
int t;
/// Constructor for posting
Pack(Home home, ViewArray<OffsetView>& l, ViewArray<Item>& bs);
/// Constructor for cloning \a p
Pack(Space& home, bool share, Pack& p);
public:
/// Post propagator for loads \a l and items \a bs
GECODE_INT_EXPORT
static ExecStatus post(Home home,
ViewArray<OffsetView>& l, ViewArray<Item>& bs);
/// Detect non-existence of sums in \a a .. \a b
template<class SizeSet>
bool nosum(const SizeSet& s, int a, int b, int& ap, int& bp);
/// Detect non-existence of sums in \a a .. \a b
template<class SizeSet>
bool nosum(const SizeSet& s, int a, int b);
/// Perform propagation
GECODE_INT_EXPORT
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Cost function
GECODE_INT_EXPORT
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Copy propagator during cloning
GECODE_INT_EXPORT
virtual Actor* copy(Space& home, bool share);
/// Destructor
virtual size_t dispose(Space& home);
};
/// Graph containing conflict information
class ConflictGraph {
protected:
/// Home space
Space& home;
/// Bin variables
const IntVarArgs& b;
/// Number of bins
unsigned int bins;
/// Return number of nodes
int nodes(void) const;
/// Sets of graph nodes
class NodeSet : public Support::RawBitSetBase {
public:
/// Keep uninitialized
NodeSet(void);
/// Initialize node set for \a n nodes
NodeSet(Region& r, int n);
/// Initialize node set as copy of \a ns with \a n nodes
NodeSet(Region& r, int n, const NodeSet& ns);
/// Allocate node set for \a n nodes
void allocate(Region& r, int n);
/// Initialize node set for \a n nodes
void init(Region& r, int n);
/// Test whether node \a i is included
bool in(int i) const;
/// Include node \a i
void incl(int i);
/// Exclude node \a i
void excl(int i);
/// Copy elements from node set \a ns with \a n nodes
void copy(int n, const NodeSet& ns);
/// Clear the whole node set for \a n nodes
void empty(int n);
/**
* Initialize \a ac as intersection of \a a and \a c,
* \a bc as intersection of \a b and \a c where \a n
* is the maximal number of nodes. Return whether both \ac
* and \a bc are empty.
*/
static bool iwn(NodeSet& iwa, const NodeSet& a,
NodeSet& iwb, const NodeSet& b,
const NodeSet& c, int n);
};
/// Class for node in graph
class Node {
public:
/// The neighbors
NodeSet n;
/// Degree
unsigned int d;
/// Weight (initialized with degree before graph is reduced)
unsigned int w;
/// Default constructor
Node(void);
};
/// The nodes in the graph
Node* node;
/// Iterator over node sets
class Nodes {
private:
/// The node set to iterate over
const NodeSet& ns;
/// Current node
unsigned int c;
public:
/// Initialize for nodes in \a ns
Nodes(const NodeSet& ns);
/// \name Iteration control
//@{
/// Move iterator to next node (if possible)
void operator ++(void);
//@}
/// \name %Node access
//@{
/// Return current node
int operator ()(void) const;
//@}
};
/// \name Routines for Bosch-Kerbron algorithm
//@{
/// Clique information
class Clique {
public:
/// Nodes in the clique
NodeSet n;
/// Cardinality of clique
unsigned int c;
/// Weight of clique
unsigned int w;
/// Constructor for \a m nodes
Clique(Region& r, int m);
/// Include node \a i with weight \a w
void incl(int i, unsigned int w);
/// Exclude node \a i with weight \a w
void excl(int i, unsigned int w);
};
/// Find a pivot node with maximal degree from \a a or \a b
int pivot(const NodeSet& a, const NodeSet& b) const;
/// Run Bosch-Kerbron algorithm for finding max cliques
GECODE_INT_EXPORT
ExecStatus bk(NodeSet& p, NodeSet& x);
//@}
/// \name Managing cliques
//@{
/// Current clique
Clique cur;
/// Largest clique so far
Clique max;
/// Report the current clique
ExecStatus clique(void);
/// Found a clique of node \a i
ExecStatus clique(int i);
/// Found a clique of nodes \a i and \a j
ExecStatus clique(int i, int j);
/// Found a clique of nodes \a i, \a j, and \a k
ExecStatus clique(int i, int j, int k);
//@}
public:
/// Initialize graph
ConflictGraph(Space& home, Region& r, const IntVarArgs& b,
int m);
/// Add or remove an edge between nodes \a i and \a j (\a i must be less than \a j)
void edge(int i, int j, bool add=true);
/// Test whether nodes \a i and \a j are adjacent
bool adjacent(int i, int j) const;
/// Post additional constraints
ExecStatus post(void);
/// Return maximal clique found
IntSet maxclique(void) const;
/// Destructor
~ConflictGraph(void);
};
}}}
#include <gecode/int/bin-packing/propagate.hpp>
#include <gecode/int/bin-packing/conflict-graph.hpp>
#endif
// STATISTICS: int-prop
|