Generated on Sat Feb 7 2015 02:01:15 for Gecode by doxygen 1.8.9.1
val-sel.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  * Contributing authors:
7  * Gabor Szokoli <szokoli@gecode.org>
8  * Guido Tack <tack@gecode.org>
9  *
10  * Copyright:
11  * Christian Schulte, 2012
12  * Gabor Szokoli, 2004
13  * Guido Tack, 2004
14  *
15  * Last modified:
16  * $Date: 2012-10-02 15:49:50 +0200 (Tue, 02 Oct 2012) $ by $Author: schulte $
17  * $Revision: 13123 $
18  *
19  * This file is part of Gecode, the generic constraint
20  * development environment:
21  * http://www.gecode.org
22  *
23  * Permission is hereby granted, free of charge, to any person obtaining
24  * a copy of this software and associated documentation files (the
25  * "Software"), to deal in the Software without restriction, including
26  * without limitation the rights to use, copy, modify, merge, publish,
27  * distribute, sublicense, and/or sell copies of the Software, and to
28  * permit persons to whom the Software is furnished to do so, subject to
29  * the following conditions:
30  *
31  * The above copyright notice and this permission notice shall be
32  * included in all copies or substantial portions of the Software.
33  *
34  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
35  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
36  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
37  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
38  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
39  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
40  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
41  *
42  */
43 
44 namespace Gecode { namespace Set { namespace Branch {
45 
48  : ValSel<SetView,int>(home,vb) {}
51  : ValSel<SetView,int>(home,shared,vs) {}
52  forceinline int
53  ValSelMin::val(const Space&, SetView x, int) {
55  return u.min();
56  }
57 
60  : ValSel<SetView,int>(home,vb) {}
63  : ValSel<SetView,int>(home,shared,vs) {}
64  forceinline int
65  ValSelMax::val(const Space&, SetView x, int) {
66  int max = 0;
67  for (UnknownRanges<SetView> u(x); u(); ++u)
68  max = u.max();
69  return max;
70  }
71 
74  : ValSel<SetView,int>(home,vb) {}
77  : ValSel<SetView,int>(home,shared,vs) {}
78  forceinline int
79  ValSelMed::val(const Space&, SetView x, int) {
81  unsigned int i = Iter::Ranges::size(u1) / 2;
83  int med = (u2.min()+u2.max()) / 2;
84  ++u2;
85  if (!u2()) {
86  return med;
87  }
89  while (i >= u3.width()) {
90  i -= u3.width();
91  ++u3;
92  }
93  return u3.min() + static_cast<int>(i);
94  }
95 
98  : ValSel<SetView,int>(home,vb), r(vb.rnd()) {}
101  : ValSel<SetView,int>(home,shared,vs) {
102  r.update(home,shared,vs.r);
103  }
104  forceinline int
105  ValSelRnd::val(const Space&, SetView x, int) {
107  unsigned int p = r(Iter::Ranges::size(u));
108  for (UnknownRanges<SetView> i(x); i(); ++i) {
109  if (i.width() > p)
110  return i.min() + static_cast<int>(p);
111  p -= i.width();
112  }
113  GECODE_NEVER;
114  return 0;
115  }
116  forceinline bool
117  ValSelRnd::notice(void) const {
118  return true;
119  }
120  forceinline void
122  r.~Rnd();
123  }
124 
125 }}}
126 
127 // STATISTICS: set-branch
128 
int val(const Space &home, SetView x, int i)
Return value of view x at position i.
Definition: val-sel.hpp:65
Range iterator for the unknown set.
Definition: var-imp.hpp:406
Value selection class for median of view.
Definition: branch.hh:242
int max(void) const
Return largest value of range.
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:57
int val(const Space &home, SetView x, int i)
Return value of view x at position i.
Definition: val-sel.hpp:105
Value selection class for mimimum of view.
Definition: branch.hh:210
ValSelMax(Space &home, const ValBranch &vb)
Constructor for initialization.
Definition: val-sel.hpp:59
unsigned int width(void) const
Return width of range (distance between minimum and maximum)
Computation spaces.
Definition: core.hpp:1362
ValSelMed(Space &home, const ValBranch &vb)
Constructor for initialization.
Definition: val-sel.hpp:73
int min(void) const
Return smallest value of range.
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
int val(const Space &home, SetView x, int i)
Return value of view x at position i.
Definition: val-sel.hpp:79
Gecode::IntArgs i(4, 1, 2, 3, 4)
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
unsigned int size(I &i)
Size of all ranges of range iterator i.
union Gecode::@518::NNF::@57 u
Union depending on nodetype t.
Set view for set variables
Definition: view.hpp:60
void update(Space &home, bool share, SharedHandle &sh)
Updating during cloning.
Definition: core.hpp:2656
Value branching information.
Definition: branch-val.hpp:44
Node * x
Pointer to corresponding Boolean expression node.
Definition: bool-expr.cpp:253
ValSelRnd(Space &home, const ValBranch &vb)
Constructor for initialization.
Definition: val-sel.hpp:97
#define forceinline
Definition: config.hpp:132
Value selection class for maximum of view.
Definition: branch.hh:226
bool notice(void) const
Whether dispose must always be called (that is, notice is needed)
Definition: val-sel.hpp:117
bool shared(const ConstView< ViewA > &, const ConstView< ViewB > &)
Test whether views share same variable.
Definition: view.hpp:662
Gecode toplevel namespace
#define GECODE_NEVER
Assert that this command is never executed.
Definition: macros.hpp:60
int val(const Space &home, SetView x, int i)
Return value of view x at position i.
Definition: val-sel.hpp:53
Value selection class for random value of view.
Definition: branch.hh:258
ValSelMin(Space &home, const ValBranch &vb)
Constructor for initialization.
Definition: val-sel.hpp:47
void dispose(Space &home)
Delete value selection.
Definition: val-sel.hpp:121
Rnd r
The used random number generator.
Definition: branch.hh:261
Base class for value selection.