Generated on Sun Aug 9 2020 05:34:08 for Gecode by doxygen 1.8.18
view-values.cpp
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, 2012
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 #include <gecode/int/branch.hh>
35 
36 namespace Gecode { namespace Int { namespace Branch {
37 
39  : PosChoice(b,x.size(),p), n(0) {
40  for (ViewRanges<IntView> r(x); r(); ++r)
41  n++;
42  pm = heap.alloc<PosMin>(n+1);
43  unsigned int w=0;
44  int i=0;
45  for (ViewRanges<IntView> r(x); r(); ++r) {
46  pm[i].min = r.min();
47  pm[i].pos = w;
48  w += r.width(); i++;
49  }
50  pm[i].pos = w;
51  }
52 
54  Archive& e)
55  : PosChoice(b,a,p) {
56  e >> n;
57  pm = heap.alloc<PosMin>(n+1);
58  for (unsigned int i=0; i<n+1; i++) {
59  e >> pm[i].pos;
60  e >> pm[i].min;
61  }
62  }
63 
65  heap.free<PosMin>(pm,n+1);
66  }
67 
68  forceinline void
71  e << this->alternatives() << n;
72  for (unsigned int i=0; i<n+1; i++) {
73  e << pm[i].pos;
74  e << pm[i].min;
75  }
76  }
77 
78 }}}
79 
80 // STATISTICS: int-branch
Post propagator for SetVar x
Definition: set.hh:767
unsigned int alternatives(void) const
Return number of alternatives.
Definition: core.hpp:3770
unsigned int size(I &i)
Size of all ranges of range iterator i.
Archive representation
Definition: archive.hpp:42
virtual void archive(Archive &e) const
Archive into e.
Definition: view.hpp:130
T * alloc(long unsigned int n)
Allocate block of n objects of type T from heap.
Definition: heap.hpp:431
Gecode toplevel namespace
Choices storing position
Definition: view.hpp:55
Base-class for branchers.
Definition: core.hpp:1442
virtual void archive(Archive &e) const
Archive into e.
Definition: view-values.cpp:69
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition: set.hh:767
struct Gecode::@602::NNF::@65::@66 b
For binary nodes (and, or, eqv)
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
Heap heap
The single global heap.
Definition: heap.cpp:44
void free(T *b, long unsigned int n)
Delete n objects starting at b.
Definition: heap.hpp:457
Integer view for integer variables.
Definition: view.hpp:129
Range iterator for integer variable views
Definition: int.hpp:246
virtual ~PosValuesChoice(void)
Deallocate.
Definition: view-values.cpp:64
#define forceinline
Definition: config.hpp:185
PosValuesChoice(const Brancher &b, const Pos &p, IntView x)
Initialize choice for brancher b, position p, and view x.
Definition: view-values.cpp:38
Position information.
Definition: view.hpp:44
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Gecode::IntArgs i({1, 2, 3, 4})
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232