this repo has no description
dekker.one
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, 2019
8 *
9 * This file is part of Gecode, the generic constraint
10 * development environment:
11 * http://www.gecode.org
12 *
13 * Permission is hereby granted, free of charge, to any person obtaining
14 * a copy of this software and associated documentation files (the
15 * "Software"), to deal in the Software without restriction, including
16 * without limitation the rights to use, copy, modify, merge, publish,
17 * distribute, sublicense, and/or sell copies of the Software, and to
18 * permit persons to whom the Software is furnished to do so, subject to
19 * the following conditions:
20 *
21 * The above copyright notice and this permission notice shall be
22 * included in all copies or substantial portions of the Software.
23 *
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31 *
32 */
33
34#ifndef GECODE_INT_ORDER_HH
35#define GECODE_INT_ORDER_HH
36
37#include <gecode/int.hh>
38
39/**
40 * \namespace Gecode::Int::Order
41 *
42 * \brief %Int for ordering two tasks
43 */
44
45namespace Gecode { namespace Int { namespace Order {
46
47 /**
48 * \brief %Scheduling propagator for ordering two tasks
49 *
50 * Requires \code #include <gecode/int/order.hh> \endcode
51 * \ingroup FuncIntProp
52 */
53 class OrderProp : public Propagator {
54 protected:
55 /// View for start times
56 IntView s0, s1;
57 /// Boolean view for order
58 BoolView b;
59 /// Processing times
60 int p0, p1;
61 /// Constructor for cloning
62 OrderProp(Space& home, OrderProp& p);
63 /// Constructor for creation
64 OrderProp(Home home, IntView s0, int p0, IntView s1, int p1,
65 BoolView b);
66 public:
67 /// Copy propagator during cloning
68 GECODE_INT_EXPORT
69 virtual Actor* copy(Space& home);
70 /// Cost function (defined as low binary)
71 GECODE_INT_EXPORT
72 virtual PropCost cost(const Space& home, const ModEventDelta& med) const;
73 /// Schedule function
74 GECODE_INT_EXPORT
75 virtual void reschedule(Space& home);
76 /// Perform propagation
77 GECODE_INT_EXPORT
78 virtual ExecStatus propagate(Space& home, const ModEventDelta& med);
79 /// Post order propagator
80 static ExecStatus post(Home home, IntView s0, int p0, IntView s1, int p1,
81 BoolView b);
82 /// Delete propagator and return its size
83 GECODE_INT_EXPORT
84 virtual size_t dispose(Space& home);
85 };
86
87}}}
88
89#include <gecode/int/order/propagate.hpp>
90
91#endif
92
93// STATISTICS: int-prop