Generated on Sat Nov 9 2013 19:18:24 for Gecode by doxygen 1.8.4
bin-packing.cpp
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: 2013-03-28 22:24:21 +0100 (Thu, 28 Mar 2013) $ by $Author: tack $
11  * $Revision: 13561 $
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 
39 
40 namespace Gecode {
41 
42  void
44  const IntVarArgs& l,
45  const IntVarArgs& b, const IntArgs& s,
46  IntConLevel) {
47  using namespace Int;
48  if (l.same(home,b))
49  throw ArgumentSame("Int::binpacking");
50  if (b.size() != s.size())
51  throw ArgumentSizeMismatch("Int::binpacking");
52  for (int i=s.size(); i--; )
53  Limits::nonnegative(s[i],"Int::binpacking");
54  if (home.failed()) return;
55 
56  ViewArray<OffsetView> lv(home,l.size());
57  for (int i=l.size(); i--; )
58  lv[i] = OffsetView(l[i],0);
59 
60  if (b.size() == 0) {
61  for (int i=l.size(); i--; )
62  GECODE_ME_FAIL(lv[i].eq(home,0));
63  return;
64  }
65 
66  ViewArray<BinPacking::Item> bs(home,b.size());
67  for (int i=bs.size(); i--; )
68  bs[i] = BinPacking::Item(b[i],s[i]);
69 
70  Support::quicksort(&bs[0], bs.size());
71 
73  }
74 
75 }
76 
77 // STATISTICS: int-post