Generated on Sat Jan 20 2018 22:21:14 for Gecode by doxygen 1.8.13
view-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, 2003
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 Count {
39 
40  template<class VX, class VY, class VZ>
43  ViewArray<VX>& x0, VY y0, VZ z0, int c0)
44  : Propagator(home), x(x0), y(y0), z(z0), c(c0) {
45  if (isintset(y))
46  home.notice(*this,AP_DISPOSE);
47  x.subscribe(home,*this,PC_INT_DOM);
48  subscribe(home,*this,y);
49  z.subscribe(home,*this,PC_INT_BND);
50  }
51 
52  template<class VX, class VY, class VZ>
55  : Propagator(home,share,p), c(p.c) {
56  x.update(home,share,p.x);
57  y.update(home,share,p.y);
58  z.update(home,share,p.z);
59  }
60 
61  template<class VX, class VY, class VZ>
62  PropCost
64  return PropCost::linear(PropCost::LO,x.size()+1);
65  }
66 
67  template<class VX, class VY, class VZ>
68  void
70  x.reschedule(home,*this,PC_INT_DOM);
72  z.reschedule(home,*this,PC_INT_BND);
73  }
74 
75  template<class VX, class VY, class VZ>
76  forceinline size_t
78  if (isintset(y))
79  home.ignore(*this,AP_DISPOSE);
80  x.cancel(home,*this,PC_INT_DOM);
81  cancel(home,*this,y);
82  z.cancel(home,*this,PC_INT_BND);
83  (void) Propagator::dispose(home);
84  return sizeof(*this);
85  }
86 
87  template<class VX, class VY, class VZ>
88  forceinline void
90  int n = x.size();
91  for (int i=n; i--; )
92  switch (holds(x[i],y)) {
93  case RT_FALSE:
94  x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n];
95  break;
96  case RT_TRUE:
97  x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n];
98  c--;
99  break;
100  case RT_MAYBE:
101  break;
102  default:
103  GECODE_NEVER;
104  }
105  x.size(n);
106  }
107 
108  template<class VX, class VY, class VZ>
109  forceinline int
111  return -c;
112  }
113 
114  template<class VX, class VY, class VZ>
115  forceinline int
117  return x.size()-c;
118  }
119 
120  template<class VX>
121  forceinline bool
122  shared(const IntSet&, VX) {
123  return false;
124  }
125  template<class VX, class VY, class VZ>
126  forceinline bool
128  const VY& y, const VZ& z) {
129  if (shared(y,z))
130  return true;
131  for (int i = x.size(); i--; )
132  if (shared(x[i],z))
133  return true;
134  return false;
135  }
136 
137 }}}
138 
139 // STATISTICS: int-prop
int atleast(void) const
How many views are at least equal.
Definition: view-base.hpp:110
void update(Space &, bool share, ViewArray< View > &a)
Update array to be a clone of array a.
Definition: array.hpp:1387
Relation may hold or not.
Definition: view.hpp:1616
void reschedule(Space &home, Propagator &p, PropCond pc)
Re-schedule propagator p with propagation condition pc.
Definition: array.hpp:1429
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Definition: core.hpp:4841
Actor must always be disposed.
Definition: core.hpp:630
void cancel(Space &home, Propagator &p, IntSet &y)
Definition: rel.hpp:85
VZ z
View which yields result of counting.
Definition: count.hh:274
static bool sharing(const ViewArray< VX > &x, const VY &y, const VZ &z)
Test whether there is sharing of z with x or y.
Definition: view-base.hpp:127
Base-class for count propagators (view)
Definition: count.hh:267
RelTest holds(VX x, ConstIntView y)
Test whether x and y are equal.
Definition: rel.hpp:108
Base-class for propagators.
Definition: core.hpp:1092
void subscribe(Space &home, Propagator &p, PropCond pc, bool schedule=true)
Subscribe propagator p with propagation condition pc to variable.
Definition: array.hpp:1400
Computation spaces.
Definition: core.hpp:1748
bool shared(const IntSet &, VX)
Definition: view-base.hpp:122
Gecode::FloatVal c(-8, 8)
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
VY y
View to compare to.
Definition: count.hh:272
Gecode::IntArgs i(4, 1, 2, 3, 4)
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:238
ViewBase(Space &home, bool share, ViewBase &p)
Constructor for cloning p.
Definition: view-base.hpp:54
ViewArray< VX > x
Views still to count.
Definition: count.hh:270
int c
Number of views which are equal and have been eliminated.
Definition: count.hh:276
Relation does not hold.
Definition: view.hpp:1615
const Gecode::PropCond PC_INT_BND
Propagate when minimum or maximum of a view changes.
Definition: var-type.hpp:91
void count(Space &home)
Count how many views are equal now.
Definition: view-base.hpp:89
void subscribe(Space &home, Propagator &p, IntSet &y)
Definition: rel.hpp:75
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
Definition: var-type.hpp:100
Integer sets.
Definition: int.hh:174
Post propagator for SetVar SetOpType SetVar SetRelType SetVar z
Definition: set.hh:784
void cancel(Space &home, Propagator &p, PropCond pc)
Cancel subscription of propagator p with propagation condition pc to all views.
Definition: array.hpp:1408
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Definition: core.hpp:3321
Post propagator for SetVar SetOpType SetVar y
Definition: set.hh:784
virtual void reschedule(Space &home)
Schedule function.
Definition: view-base.hpp:69
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Definition: core.hpp:4141
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition: core.hpp:3354
Propagation cost.
Definition: core.hpp:554
#define forceinline
Definition: config.hpp:173
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low linear)
Definition: view-base.hpp:63
Post propagator for SetVar x
Definition: set.hh:784
bool isintset(VY y)
Return whether y is an integer set.
Definition: rel.hpp:49
int atmost(void) const
How many views are at most equal.
Definition: view-base.hpp:116
Gecode toplevel namespace
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition: view-base.hpp:77
void reschedule(Space &home, Propagator &p, IntSet &y)
Definition: rel.hpp:96
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1215
int ModEventDelta
Modification event deltas.
Definition: core.hpp:169
Home class for posting propagators
Definition: core.hpp:922
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:60
Relation does hold.
Definition: view.hpp:1617