base.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2011
*
* 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.
*
*/
namespace Gecode { namespace Int { namespace NoOverlap {
template<class Box>
forceinline
Base<Box>::Base(Home home, Box* b0, int n0)
: Propagator(home), b(b0), n(n0) {
for (int i=0; i<n; i++)
b[i].subscribe(home,*this);
}
template<class Box>
forceinline int
Base<Box>::partition(Box* b, int i, int n) {
int j = n-1;
while (true) {
while (!b[j].mandatory() && (--j >= 0)) {}
while (b[i].mandatory() && (++i < n)) {}
if (j <= i) break;
std::swap(b[i],b[j]);
}
return i;
}
template<class Box>
forceinline size_t
Base<Box>::dispose(Space& home) {
for (int i=0; i<n; i++)
b[i].cancel(home,*this);
(void) Propagator::dispose(home);
return sizeof(*this);
}
template<class Box>
forceinline
Base<Box>::Base(Space& home, Base<Box>& p, int m)
: Propagator(home,p), b(home.alloc<Box>(m)), n(p.n) {
for (int i=0; i<m; i++)
b[i].update(home,p.b[i]);
}
template<class Box>
PropCost
Base<Box>::cost(const Space&, const ModEventDelta&) const {
return PropCost::quadratic(PropCost::HI,Box::dim()*n);
}
template<class Box>
void
Base<Box>::reschedule(Space& home) {
for (int i=0; i<n; i++)
b[i].reschedule(home,*this);
}
}}}
// STATISTICS: int-prop
Gecode::Actor::dispose
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition core.hpp:3252
Gecode::Home
Home class for posting propagators
Definition core.hpp:856
Gecode::Int::NoOverlap::Base::n
int n
Number of mandatory boxes: b[0] ... b[n-1].
Definition no-overlap.hh:239
Gecode::Int::NoOverlap::Base::Base
Base(Home home, Box *b, int n)
Constructor for posting with n mandatory boxes.
Definition base.hpp:38
Gecode::Int::NoOverlap::Base::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition base.hpp:77
Gecode::Int::NoOverlap::Base::dispose
virtual size_t dispose(Space &home)
Destructor.
Definition base.hpp:59
Gecode::Int::NoOverlap::Base::b
Box * b
Boxes.
Definition no-overlap.hh:237
Gecode::Int::NoOverlap::Base::partition
static int partition(Box *b, int i, int n)
Partition n boxes b starting at position i.
Definition base.hpp:46
Gecode::Int::NoOverlap::Base::reschedule
virtual void reschedule(Space &home)
Schedule function.
Definition base.hpp:83
Gecode::PropCost
Propagation cost.
Definition core.hpp:486
Gecode::PropCost::quadratic
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
Definition core.hpp:4787
Gecode::PropCost::HI
@ HI
Expensive.
Definition core.hpp:514
Gecode::Propagator::Space
friend class Space
Definition core.hpp:1066
Gecode::Propagator::Propagator
Propagator(Home home)
Constructor for posting.
Definition core.hpp:3498
Gecode::ModEventDelta
int ModEventDelta
Modification event deltas.
Definition core.hpp:89
Gecode::Int::NoOverlap
No-overlap propagators
Definition no-overlap.cpp:38
Gecode::Int
Finite domain integers.
Gecode
Gecode toplevel namespace
forceinline
#define forceinline
Definition config.hpp:187