Generated on Tue Mar 24 2020 14:04:04 for Gecode by doxygen 1.8.17
ranges-minus.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, 2004
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 namespace Gecode { namespace Iter { namespace Ranges {
35 
47  class Minus : public RangeListIter {
48  public:
50 
51  Minus(void);
54  Minus(const Minus& m);
56  template<class I>
57  Minus(Region& r, I& i);
59  template<class I>
60  void init(Region& r, I& i);
62  Minus& operator =(const Minus& m);
64  };
65 
66 
68  Minus::Minus(void) {}
69 
71  Minus::Minus(const Minus& m)
72  : RangeListIter(m) {}
73 
74  template<class I>
75  void
78  RangeList* p = NULL;
79  for (; i(); ++i) {
80  RangeList* t = new (*rlio) RangeList;
81  t->next = p;
82  t->min = -i.max();
83  t->max = -i.min();
84  p = t;
85  }
87  }
88 
89  template<class I>
92  init(r,i);
93  }
94 
97  return static_cast<Minus&>(RangeListIter::operator =(m));
98  }
99 
100 }}}
101 
102 // STATISTICS: iter-any
103 
Minus(void)
Default constructor.
NodeType t
Type of node.
Definition: bool-expr.cpp:230
RangeListIter & operator=(const RangeListIter &i)
Assignment operator.
Gecode toplevel namespace
Range list class.
Definition: ranges-list.hpp:44
Handle to region.
Definition: region.hpp:55
Post propagator for SetVar SetOpType SetVar SetRelType r
Definition: set.hh:767
Range iterator for pointwise minus of a range iterator.
void init(Region &r, I &i)
Initialize with ranges from i.
Iterator over range lists.
Definition: ranges-list.hpp:41
void set(RangeList *l)
Set range lists.
void init(Region &r)
Initialize.
#define forceinline
Definition: config.hpp:185
Gecode::IntArgs i({1, 2, 3, 4})
Minus & operator=(const Minus &m)
Assignment operator (both iterators must be allocated from the same region)
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:232