Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
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  * Last modified:
10  * $Date: 2012-09-07 17:42:21 +0200 (Fri, 07 Sep 2012) $ by $Author: schulte $
11  * $Revision: 13069 $
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 Iter { namespace Ranges {
39 
51  class Minus : public RangeListIter {
52  public:
54 
55  Minus(void);
58  Minus(const Minus& m);
60  template<class I>
61  Minus(Region& r, I& i);
63  template<class I>
64  void init(Region& r, I& i);
66  Minus& operator =(const Minus& m);
68  };
69 
70 
72  Minus::Minus(void) {}
73 
75  Minus::Minus(const Minus& m)
76  : RangeListIter(m) {}
77 
78  template<class I>
79  void
82  RangeList* p = NULL;
83  for (; i(); ++i) {
84  RangeList* t = new (*rlio) RangeList;
85  t->next = p;
86  t->min = -i.max();
87  t->max = -i.min();
88  p = t;
89  }
91  }
92 
93  template<class I>
96  init(r,i);
97  }
98 
101  return static_cast<Minus&>(RangeListIter::operator =(m));
102  }
103 
104 }}}
105 
106 // STATISTICS: iter-any
107 
NodeType t
Type of node.
Definition: bool-expr.cpp:234
RangeListIter & operator=(const RangeListIter &i)
Assignment operator.
Handle to region.
Definition: region.hpp:61
int p
Number of positive literals for node type.
Definition: bool-expr.cpp:236
Gecode::IntArgs i(4, 1, 2, 3, 4)
NNF * r
Right subtree.
Definition: bool-expr.cpp:246
Minus & operator=(const Minus &m)
Assignment operator (both iterators must be allocated from the same region)
int min
Minimum and maximum of a range.
Definition: ranges-list.hpp:51
Range iterator for pointwise minus of a range iterator.
void set(RangeList *l)
Set range lists.
void init(Region &r)
Initialize.
#define forceinline
Definition: config.hpp:132
Minus(void)
Default constructor.
Gecode toplevel namespace
void init(Region &r, I &i)
Initialize with ranges from i.
Iterator over range lists.
Definition: ranges-list.hpp:45