Generated on Mon Aug 27 2012 17:15:37 for Gecode by doxygen 1.8.1.2
base.hpp
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, 2011
8  *
9  * Last modified:
10  * $Date: 2011-07-09 00:08:27 +1000 (Sat, 09 Jul 2011) $ by $Author: schulte $
11  * $Revision: 12168 $
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 namespace Gecode { namespace Int { namespace NoOverlap {
39 
40  template<class Box>
42  Base<Box>::Base(Home home, Box* b0, int n0)
43  : Propagator(home), b(b0), n(n0) {
44  for (int i=n; i--; )
45  b[i].subscribe(home,*this);
46  }
47 
48  template<class Box>
49  forceinline int
50  Base<Box>::partition(Box* b, int i, int n) {
51  int j = n-1;
52  while (true) {
53  while (!b[j].mandatory() && (--j >= 0)) {}
54  while (b[i].mandatory() && (++i < n)) {}
55  if (j <= i) break;
56  std::swap(b[i],b[j]);
57  }
58  return i;
59  }
60 
61  template<class Box>
62  forceinline size_t
64  for (int i=n; i--; )
65  b[i].cancel(home,*this);
66  (void) Propagator::dispose(home);
67  return sizeof(*this);
68  }
69 
70 
71  template<class Box>
73  Base<Box>::Base(Space& home, bool shared, Base<Box>& p, int m)
74  : Propagator(home,shared,p), b(home.alloc<Box>(m)), n(p.n) {
75  for (int i=m; i--; )
76  b[i].update(home,shared,p.b[i]);
77  }
78 
79  template<class Box>
80  PropCost
81  Base<Box>::cost(const Space&, const ModEventDelta&) const {
82  return PropCost::quadratic(PropCost::HI,Box::dim()*n);
83  }
84 
85 }}}
86 
87 // STATISTICS: int-prop
88