main page
modules
namespaces
classes
files
Gecode home
Generated on Tue Jan 28 2020 00:00:00 for Gecode by
doxygen
1.8.17
gecode
int
no-overlap
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: 2016-06-29 17:28:17 +0200 (Wed, 29 Jun 2016) $ by $Author: schulte $
11
* $Revision: 15137 $
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>
41
forceinline
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
63
Base<Box>::dispose
(
Space
& home) {
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>
72
forceinline
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
template
<
class
Box>
86
void
87
Base<Box>::reschedule
(
Space
& home) {
88
for
(
int
i
=
n
;
i
--; )
89
b
[
i
].
reschedule
(home,*
this
);
90
}
91
92
}}}
93
94
// STATISTICS: int-prop
95
Gecode::Int::NoOverlap::Base::b
Box * b
Boxes.
Definition:
no-overlap.hh:241
Gecode::Int::NoOverlap::Base::dispose
virtual size_t dispose(Space &home)
Destructor.
Definition:
base.hpp:63
forceinline
#define forceinline
Definition:
config.hpp:173
Gecode::Int::NoOverlap::Base::cost
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function.
Definition:
base.hpp:81
Test::Int::Basic::i
Gecode::IntArgs i(4, 1, 2, 3, 4)
Gecode::Space
Computation spaces.
Definition:
core.hpp:1748
Gecode::PropCost::quadratic
static PropCost quadratic(PropCost::Mod m, unsigned int n)
Quadratic complexity for modifier m and size measure n.
Definition:
core.hpp:4832
Gecode
Gecode toplevel namespace
Gecode::Propagator
Base-class for propagators.
Definition:
core.hpp:1092
Gecode::Int::Count::reschedule
void reschedule(Space &home, Propagator &p, IntSet &y)
Definition:
rel.hpp:96
Gecode::Home
Home class for posting propagators
Definition:
core.hpp:922
b
struct Gecode::@579::NNF::@61::@62 b
For binary nodes (and, or, eqv)
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:50
Gecode::Int::NoOverlap::Base::reschedule
virtual void reschedule(Space &home)
Schedule function.
Definition:
base.hpp:87
Gecode::swap
IntRelType swap(IntRelType irt)
Return swapped relation type of irt.
Definition:
irt.hpp:41
Gecode::PropCost
Propagation cost.
Definition:
core.hpp:554
Gecode::Int::Count::cancel
void cancel(Space &home, Propagator &p, IntSet &y)
Definition:
rel.hpp:85
Gecode::Int::Count::shared
bool shared(const IntSet &, VX)
Definition:
view-base.hpp:122
Gecode::Int::NoOverlap::Base
Base class for no-overlap propagator.
Definition:
no-overlap.hh:238
Gecode::Actor::dispose
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition:
core.hpp:3354
Gecode::Int::NoOverlap::Base::n
int n
Number of mandatory boxes: b[0] ... b[n-1].
Definition:
no-overlap.hh:243
Gecode::PropCost::HI
@ HI
Expensive.
Definition:
core.hpp:582
Gecode::Int::Count::subscribe
void subscribe(Space &home, Propagator &p, IntSet &y)
Definition:
rel.hpp:75
n
int n
Number of negative literals for node type.
Definition:
bool-expr.cpp:238
Gecode::ModEventDelta
int ModEventDelta
Modification event deltas.
Definition:
core.hpp:169
p
int p
Number of positive literals for node type.
Definition:
bool-expr.cpp:236
Gecode::Int::NoOverlap::Base::Base
Base(Home home, Box *b, int n)
Constructor for posting with n mandatory boxes.
Definition:
base.hpp:42