Generated on Sat Feb 7 2015 02:01:26 for Gecode by doxygen 1.8.9.1
ranges-singleton-append.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  * Guido Tack <tack@gecode.org>
6  *
7  * Copyright:
8  * Christian Schulte, 2004
9  * Guido Tack, 2006
10  *
11  * Last modified:
12  * $Date: 2010-07-28 17:35:33 +0200 (Wed, 28 Jul 2010) $ by $Author: schulte $
13  * $Revision: 11294 $
14  *
15  * This file is part of Gecode, the generic constraint
16  * development environment:
17  * http://www.gecode.org
18  *
19  * Permission is hereby granted, free of charge, to any person obtaining
20  * a copy of this software and associated documentation files (the
21  * "Software"), to deal in the Software without restriction, including
22  * without limitation the rights to use, copy, modify, merge, publish,
23  * distribute, sublicense, and/or sell copies of the Software, and to
24  * permit persons to whom the Software is furnished to do so, subject to
25  * the following conditions:
26  *
27  * The above copyright notice and this permission notice shall be
28  * included in all copies or substantial portions of the Software.
29  *
30  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
31  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
32  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
33  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
34  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
35  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
36  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
37  *
38  */
39 
40 namespace Gecode { namespace Iter { namespace Ranges {
41 
50  template<class J>
51  class SingletonAppend : public MinMax {
52  protected:
54  J j;
55  public:
57 
58  SingletonAppend(void);
61  SingletonAppend(int i0, int i1, J& j);
63  void init(int i0, int i1, J& j);
65 
67 
68  void operator ++(void);
71  };
72 
73 
74  /*
75  * Binary SingletonAppend
76  *
77  */
78 
79  template<class J>
80  inline void
82  if (j()) {
83  mi = j.min(); ma = j.max();
84  ++j;
85  } else {
86  finish();
87  }
88  }
89 
90 
91  template<class J>
94 
95  template<class J>
97  SingletonAppend<J>::SingletonAppend(int i0, int i1, J& j0)
98  : j(j0) {
99  mi=i0; ma=i1;
100  }
101 
102  template<class J>
103  forceinline void
104  SingletonAppend<J>::init(int i0, int i1, J& j0) {
105  mi=i0; ma=i1; j=j0;
106  }
107 
108 }}}
109 
110 // STATISTICS: iter-any
111 
void init(int i0, int i1, J &j)
Initialize with singleton (i0, i1) and iterator j.
Base for range iterators with explicit min and max.
Range iterator for appending a singleton with a range iterator
void operator++(void)
Move iterator to next range (if possible)
int mi
Minimum of current range.
#define forceinline
Definition: config.hpp:132
Gecode toplevel namespace
int ma
Maximum of current range.