Generated on Tue Sep 16 2014 20:36:45 for Gecode by doxygen 1.8.8
bin-packing.hh
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2010
8  *
9  * Last modified:
10  * $Date: 2010-10-06 23:20:35 +0200 (Wed, 06 Oct 2010) $ by $Author: schulte $
11  * $Revision: 11468 $
12  *
13  * This file is part of Gecode, the generic constraint
14  * development environment:
15  * http://www.gecode.org
16  *
17  * Permission is hereby granted, free of charge, to any person obtaining
18  * a copy of this software and associated documentation files (the
19  * "Software"), to deal in the Software without restriction, including
20  * without limitation the rights to use, copy, modify, merge, publish,
21  * distribute, sublicense, and/or sell copies of the Software, and to
22  * permit persons to whom the Software is furnished to do so, subject to
23  * the following conditions:
24  *
25  * The above copyright notice and this permission notice shall be
26  * included in all copies or substantial portions of the Software.
27  *
28  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35  *
36  */
37 
38 #ifndef __GECODE_INT_BIN_PACKING_HH__
39 #define __GECODE_INT_BIN_PACKING_HH__
40 
41 #include <gecode/int.hh>
42 
48 namespace Gecode { namespace Int { namespace BinPacking {
49 
53  class Item : public DerivedView<IntView> {
54  protected:
57  int s;
58  public:
60  Item(void);
62  Item(IntView b, int s);
63 
65  IntView bin(void) const;
67  void bin(IntView b);
69  int size(void) const;
71  void size(int s);
72 
74  void update(Space& home, bool share, Item& i);
75  };
76 
78  bool same(const Item& i, const Item& j);
80  bool before(const Item& i, const Item& j);
81 
83  bool operator <(const Item& i, const Item& j);
84 
85 
87  class SizeSet {
88  protected:
90  int n;
92  int t;
94  int* s;
95  public:
97  SizeSet(void);
99  SizeSet(Region& region, int n_max);
101  void add(int s);
103  int card(void) const;
105  int total(void) const;
107  int operator [](int i) const;
108  };
109 
111  class SizeSetMinusOne : public SizeSet {
112  protected:
114  int p;
115  public:
117  SizeSetMinusOne(void);
119  SizeSetMinusOne(Region& region, int n);
121  void minus(int s);
123  int card(void) const;
125  int total(void) const;
127  int operator [](int i) const;
128  };
129 
130 
141  class Pack : public Propagator {
142  protected:
148  int t;
152  Pack(Space& home, bool share, Pack& p);
153  public:
156  static ExecStatus post(Home home,
159  template<class SizeSet>
160  bool nosum(const SizeSet& s, int a, int b, int& ap, int& bp);
162  template<class SizeSet>
163  bool nosum(const SizeSet& s, int a, int b);
166  virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
169  virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
172  virtual Actor* copy(Space& home, bool share);
174  virtual size_t dispose(Space& home);
175  };
176 
177 }}}
178 
180 
181 #endif
182 
183 // STATISTICS: int-prop
184 
int * s
Array of sizes (will have more elements)
Definition: bin-packing.hh:94
int card(void) const
Return cardinality of set (number of entries)
Definition: propagate.hpp:106
int p
Position of discarded item.
Definition: bin-packing.hh:114
SizeSetMinusOne(void)
Default constructor.
Definition: propagate.hpp:119
bool nosum(const SizeSet &s, int a, int b, int &ap, int &bp)
Detect non-existence of sums in a .. b.
Definition: propagate.hpp:180
IntView bin(void) const
Return bin of item.
Definition: propagate.hpp:52
Item combining bin and size information.
Definition: bin-packing.hh:53
int size(void) const
Return size of item.
Definition: propagate.hpp:60
ViewArray< Item > bs
Items with bin and size.
Definition: bin-packing.hh:146
int t
Total size of all items.
Definition: bin-packing.hh:148
int operator[](int i) const
Return size of item i.
Definition: propagate.hpp:114
int card(void) const
Return cardinality of set (number of entries)
Definition: propagate.hpp:132
Base-class for propagators.
Definition: core.hpp:755
int n
Number of size entries in the set.
Definition: bin-packing.hh:90
Pack(Home home, ViewArray< OffsetView > &l, ViewArray< Item > &bs)
Constructor for posting.
Definition: propagate.hpp:155
ViewArray< OffsetView > l
Views for load of bins.
Definition: bin-packing.hh:144
Handle to region.
Definition: region.hpp:61
Computation spaces.
Definition: core.hpp:1325
static ExecStatus post(Home home, ViewArray< OffsetView > &l, ViewArray< Item > &bs)
Post propagator for loads l and items bs.
Definition: propagate.cpp:358
Base-class for derived views.
Definition: view.hpp:208
Base-class for both propagators and branchers.
Definition: core.hpp:666
void update(Space &home, bool share, Item &i)
Update item during cloning.
Definition: propagate.hpp:69
SizeSet(void)
Default constructor.
Definition: propagate.hpp:97
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
ModEventDelta med
A set of modification events (used during propagation)
Definition: core.hpp:764
bool operator<(const Item &i, const Item &j)
For sorting according to size.
Definition: propagate.hpp:87
virtual Actor * copy(Space &home, bool share)
Copy propagator during cloning.
Definition: propagate.cpp:53
int operator[](int i) const
Return size of item i.
Definition: propagate.hpp:142
struct Gecode::@512::NNF::@54::@55 b
For binary nodes (and, or, eqv)
View arrays.
Definition: array.hpp:234
void add(int s)
Add new size s.
Definition: propagate.hpp:102
Item(void)
Default constructor.
Definition: propagate.hpp:45
bool before(const Item &i, const Item &j)
Test whether one item is before another.
Definition: propagate.hpp:80
Bin-packing propagator.
Definition: bin-packing.hh:141
Example: Bin packing
Integer view for integer variables.
Definition: view.hpp:129
virtual size_t dispose(Space &home)
Destructor.
Definition: propagate.hpp:171
Propagation cost.
Definition: core.hpp:537
ExecStatus
Definition: core.hpp:523
bool same(const Item &i, const Item &j)
Whether two items are the same.
Definition: propagate.hpp:76
Size sets with one element discarded.
Definition: bin-packing.hh:111
int t
Total size of the set.
Definition: bin-packing.hh:92
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition: propagate.cpp:48
void minus(int s)
Discard size s.
Definition: propagate.hpp:124
virtual ExecStatus propagate(Space &home, const ModEventDelta &med)
Perform propagation.
Definition: propagate.cpp:111
Gecode toplevel namespace
struct Gecode::@512::NNF::@54::@56 a
For atomic nodes.
#define GECODE_INT_EXPORT
Definition: int.hh:76
int ModEventDelta
Modification event deltas.
Definition: core.hpp:173
Home class for posting propagators
Definition: core.hpp:717
int total(void) const
Return total size.
Definition: propagate.hpp:110
int total(void) const
Return total size.
Definition: propagate.hpp:137