Generated on Sat Feb 7 2015 02:01:29 for Gecode by doxygen 1.8.9.1
int-rel.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, 2005
8  *
9  * Last modified:
10  * $Date: 2013-01-22 13:48:12 +0100 (Tue, 22 Jan 2013) $ by $Author: schulte $
11  * $Revision: 13227 $
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 {
39 
40  /*
41  * Operations for linear expressions
42  *
43  */
45  LinIntRel::LinIntRel(void) {}
46 
48  LinIntRel::LinIntRel(const LinIntExpr& l, IntRelType irt0, const LinIntExpr& r)
49  : e(l-r), irt(irt0) {}
50 
52  LinIntRel::LinIntRel(const LinIntExpr& l, IntRelType irt0, int r)
53  : e(l-r), irt(irt0) {}
54 
56  LinIntRel::LinIntRel(int l, IntRelType irt0, const LinIntExpr& r)
57  : e(l-r), irt(irt0) {}
58 
60  LinIntRel::neg(IntRelType irt) {
61  switch (irt) {
62  case IRT_EQ: return IRT_NQ;
63  case IRT_NQ: return IRT_EQ;
64  case IRT_LQ: return IRT_GR;
65  case IRT_LE: return IRT_GQ;
66  case IRT_GQ: return IRT_LE;
67  case IRT_GR: return IRT_LQ;
68  default: GECODE_NEVER;
69  }
70  return IRT_LQ;
71  }
72 
73  forceinline void
74  LinIntRel::post(Home home, bool t, IntConLevel icl) const {
75  e.post(home,t ? irt : neg(irt),icl);
76  }
77 
78  forceinline void
79  LinIntRel::post(Home home, const BoolVar& b, bool t, IntConLevel icl) const {
80  e.post(home,t ? irt : neg(irt),b,icl);
81  }
82 
83 }
84 
85 // STATISTICS: minimodel-any
NodeType t
Type of node.
Definition: bool-expr.cpp:234
IntConLevel
Consistency levels for integer propagators.
Definition: int.hh:937
NNF * l
Left subtree.
Definition: bool-expr.cpp:244
Less or equal ( )
Definition: int.hh:906
void post(Home home, bool t, IntConLevel icl) const
Post propagator for relation (if t is false for negated relation)
Definition: int-rel.hpp:74
Greater ( )
Definition: int.hh:909
Greater or equal ( )
Definition: int.hh:908
Equality ( )
Definition: int.hh:904
IntRelType
Relation types for integers.
Definition: int.hh:903
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
Less ( )
Definition: int.hh:907
Boolean integer variables.
Definition: int.hh:491
Linear expressions over integer variables.
Definition: minimodel.hh:138
#define forceinline
Definition: config.hpp:132
struct Gecode::@518::NNF::@57::@58 b
For binary nodes (and, or, eqv)
Gecode toplevel namespace
Disequality ( )
Definition: int.hh:905
Home class for posting propagators
Definition: core.hpp:717
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:60
void post(Home home, IntRelType irt, IntConLevel icl) const
Post propagator.
Definition: int-expr.cpp:160