1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Patrick Pekczynski <pekczynski@ps.uni-sb.de>
*
* Copyright:
* Patrick Pekczynski, 2004
*
* 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.
*
*
*/
#ifndef GECODE_INT_SORTED_HH
#define GECODE_INT_SORTED_HH
#include <gecode/int.hh>
/**
* \namespace Gecode::Int::Sorted
* \brief %Sorted propagators
*/
namespace Gecode { namespace Int { namespace Sorted {
/**
* \brief Bounds consistent sortedness propagator
*
* The algorithm is taken from: Sven Thiel, Efficient Algorithms
* for Constraint Propagation and for Processing Tree Descriptions,
* PhD thesis, Universität des Saarlandes, Germany, 2004, pages 39-59.
*
* Requires \code #include <gecode/int/sorted.hh> \endcode
* \ingroup FuncIntProp
*/
template<class View, bool Perm>
class Sorted : public Propagator {
protected:
/// Views to be sorted
ViewArray<View> x;
/// Views denoting the sorted version of \a x
ViewArray<View> y;
/// Permutation variables (none, if Perm is false)
ViewArray<View> z;
/// Original \a y array
ViewArray<View> w;
/// connection to dropped view
int reachable;
/// Constructor for posting
Sorted(Home home,
ViewArray<View>& x, ViewArray<View>& y, ViewArray<View>& z);
/// Constructor for cloning
Sorted(Space& home, Sorted<View,Perm>& p);
public:
/// Delete propagator and return its size
virtual size_t dispose(Space& home);
/// Copy propagator during cloning
virtual Actor* copy(Space& home);
/// Cost function returning low linear
virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
/// Schedule function
virtual void reschedule(Space& home);
/// Perform propagation
virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
/// Post propagator for views \a x, \a y, and \a z
static ExecStatus post(Home home, ViewArray<View>& x, ViewArray<View>& y,
ViewArray<View>& z);
};
}}}
#include <gecode/int/sorted/sortsup.hpp>
#include <gecode/int/sorted/order.hpp>
#include <gecode/int/sorted/matching.hpp>
#include <gecode/int/sorted/narrowing.hpp>
#include <gecode/int/sorted/propagate.hpp>
#endif
// STATISTICS: int-prop
|
