this repo has no description
dekker.one
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, 2007
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
34namespace Gecode { namespace Iter { namespace Values {
35
36 /**
37 * \brief Value iterator for pointwise minus of a value iterator
38 *
39 * This iterator in effect changes the order of how values
40 * are iterated: the first values of the input iterator defines
41 * the last value of the Minus iterator. Upon initialization
42 * all values of the input iterator are stored in an array
43 * which later allows iteration in inverse direction.
44 *
45 * \ingroup FuncIterValues
46 */
47 class Minus : public ValueListIter {
48 public:
49 /// \name Constructors and initialization
50 //@{
51 /// Default constructor
52 Minus(void);
53 /// Copy constructor
54 Minus(const Minus& m);
55 /// Initialize with values from \a i
56 template<class I>
57 Minus(Region& r, I& i);
58 /// Initialize with values from \a i
59 template<class I>
60 void init(Region& r, I& i);
61 /// Assignment operator (both iterators must be allocated from the same region)
62 Minus& operator =(const Minus& m);
63 //@}
64 };
65
66
67 forceinline
68 Minus::Minus(void) {}
69
70 forceinline
71 Minus::Minus(const Minus& m)
72 : ValueListIter(m) {}
73
74 template<class I>
75 void
76 Minus::init(Region& r, I& i) {
77 ValueListIter::init(r);
78 ValueList* p = nullptr;
79 for (; i(); ++i) {
80 ValueList* t = new (*vlio) ValueList;
81 t->next = p;
82 t->val = -i.val();
83 p = t;
84 }
85 ValueListIter::set(p);
86 }
87
88 template<class I>
89 forceinline
90 Minus::Minus(Region& r, I& i) {
91 init(r,i);
92 }
93
94 forceinline Minus&
95 Minus::operator =(const Minus& m) {
96 return static_cast<Minus&>(ValueListIter::operator =(m));
97 }
98
99}}}
100
101// STATISTICS: iter-any