Generated on Sat Feb 7 2015 02:01:21 for Gecode by doxygen 1.8.9.1
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: 2011-08-29 14:59:24 +0200 (Mon, 29 Aug 2011) $ by $Author: schulte $
11  * $Revision: 12359 $
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 (vtd(y) == VTD_INTSET)
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  forceinline size_t
70  if (vtd(y) == VTD_INTSET)
71  home.ignore(*this,AP_DISPOSE);
72  x.cancel(home,*this,PC_INT_DOM);
73  cancel(home,*this,y);
74  z.cancel(home,*this,PC_INT_BND);
75  (void) Propagator::dispose(home);
76  return sizeof(*this);
77  }
78 
79  template<class VX, class VY, class VZ>
80  forceinline void
82  int n = x.size();
83  for (int i=n; i--; )
84  switch (holds(x[i],y)) {
85  case RT_FALSE:
86  x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n];
87  break;
88  case RT_TRUE:
89  x[i].cancel(home,*this,PC_INT_DOM); x[i]=x[--n];
90  c--;
91  break;
92  case RT_MAYBE:
93  break;
94  default:
96  }
97  x.size(n);
98  }
99 
100  template<class VX, class VY, class VZ>
101  forceinline int
103  return -c;
104  }
105 
106  template<class VX, class VY, class VZ>
107  forceinline int
109  return x.size()-c;
110  }
111 
112  template<class VX>
113  forceinline bool
114  shared(const IntSet&, VX) {
115  return false;
116  }
117  template<class VX, class VY, class VZ>
118  forceinline bool
120  const VY& y, const VZ& z) {
121  if (shared(y,z))
122  return true;
123  for (int i = x.size(); i--; )
124  if (shared(x[i],z))
125  return true;
126  return false;
127  }
128 
129 }}}
130 
131 // STATISTICS: int-prop
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
static PropCost linear(PropCost::Mod m, unsigned int n)
Linear complexity for modifier pcm and size measure n.
Definition: core.hpp:4041
Actor must always be disposed.
Definition: core.hpp:610
void cancel(Space &home, Propagator &p, IntSet &y)
Definition: rel.hpp:84
VZ z
View which yields result of counting.
Definition: count.hh:272
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:119
int atleast(void) const
How many views are at least equal.
Definition: view-base.hpp:102
Base-class for count propagators (view)
Definition: count.hh:265
RelTest holds(VX x, ConstIntView y)
Test whether x and y are equal.
Definition: rel.hpp:96
Base-class for propagators.
Definition: core.hpp:755
Computation spaces.
Definition: core.hpp:1362
bool shared(const IntSet &, VX)
Definition: view-base.hpp:114
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:270
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:268
Relation does not hold.
Definition: view.hpp:1615
void subscribe(Space &home, Propagator &p, PropCond pc, bool process=true)
Subscribe propagator p with propagation condition pc to variable.
Definition: array.hpp:1400
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:81
void subscribe(Space &home, Propagator &p, IntSet &y)
Definition: rel.hpp:74
ViewTypeDesc vtd(VY y)
Return the view type description of y.
Definition: rel.hpp:49
const Gecode::PropCond PC_INT_DOM
Propagate when domain changes.
Definition: var-type.hpp:100
Integer sets.
Definition: int.hh:171
void notice(Actor &a, ActorProperty p, bool duplicate=false)
Notice actor property.
Definition: core.hpp:2849
int atmost(void) const
How many views are at most equal.
Definition: view-base.hpp:108
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
void ignore(Actor &a, ActorProperty p, bool duplicate=false)
Ignore actor property.
Definition: core.cpp:169
virtual size_t dispose(Space &home)
Delete actor and return its size.
Definition: core.hpp:2877
Propagation cost.
Definition: core.hpp:537
#define forceinline
Definition: config.hpp:132
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:1215
Gecode toplevel namespace
virtual PropCost cost(const Space &home, const ModEventDelta &med) const
Cost function (defined as low linear)
Definition: view-base.hpp:63
virtual size_t dispose(Space &home)
Delete propagator and return its size.
Definition: view-base.hpp:69
int ModEventDelta
Modification event deltas.
Definition: core.hpp:173
Home class for posting propagators
Definition: core.hpp:717
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:60
Relation does hold.
Definition: view.hpp:1617