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 Remove duplicate values from from value iterator
38 *
39 * The iterator only requires that the value iterator
40 * iterates values in increasing order. Duplicates in the
41 * iterated value sequence are removed.
42 *
43 * \ingroup FuncIterValues
44 */
45 template<class I>
46 class Unique {
47 protected:
48 /// Value iterator used
49 I i;
50 public:
51 /// \name Constructors and initialization
52 //@{
53 /// Default constructor
54 Unique(void);
55 /// Initialize with value iterator \a i
56 Unique(I& i);
57 /// Initialize with value iterator \a i
58 void init(I& i);
59 //@}
60
61 /// \name Iteration control
62 //@{
63 /// Test whether iterator is still at a value or done
64 bool operator ()(void) const;
65 /// Move iterator to next unique value (if possible)
66 void operator ++(void);
67 //@}
68
69 /// \name Value access
70 //@{
71 /// Return current value
72 int val(void) const;
73 //@}
74 };
75
76 template<class I>
77 forceinline
78 Unique<I>::Unique(void) {}
79
80 template<class I>
81 forceinline
82 Unique<I>::Unique(I& i0)
83 : i(i0) {}
84
85 template<class I>
86 forceinline void
87 Unique<I>::init(I& i0) {
88 i = i0;
89 }
90
91 template<class I>
92 forceinline void
93 Unique<I>::operator ++(void) {
94 int n=i;
95 do {
96 ++i;
97 } while (i() && (i.val() == n));
98 }
99 template<class I>
100 forceinline bool
101 Unique<I>::operator ()(void) const {
102 return i();
103 }
104
105 template<class I>
106 forceinline int
107 Unique<I>::val(void) const {
108 return i.val();
109 }
110
111}}}
112
113// STATISTICS: iter-any
114