this repo has no description
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, 2008
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 selecting only negative values
38 *
39 * If \a strict is true, zero is excluded.
40 * \ingroup FuncIterValues
41 */
42 template<class I, bool strict=false>
43 class Negative {
44 protected:
45 /// Input iterator
46 I i;
47 public:
48 /// \name Constructors and initialization
49 //@{
50 /// Default constructor
51 Negative(void);
52 /// Initialize with values from \a i
53 Negative(I& i);
54 /// Initialize with values from \a i
55 void init(I& i);
56 //@}
57
58 /// \name Iteration control
59 //@{
60 /// Test whether iterator is still at a value or done
61 bool operator ()(void) const;
62 /// Move iterator to next value (if possible)
63 void operator ++(void);
64 //@}
65
66 /// \name Value access
67 //@{
68 /// Return current value
69 int val(void) const;
70 //@}
71 };
72
73
74 template<class I, bool strict>
75 forceinline
76 Negative<I,strict>::Negative(void) {}
77
78 template<class I, bool strict>
79 forceinline void
80 Negative<I,strict>::init(I& i0) {
81 i=i0;
82 }
83
84 template<class I, bool strict>
85 forceinline
86 Negative<I,strict>::Negative(I& i0) : i(i0) {}
87
88 template<class I, bool strict>
89 forceinline void
90 Negative<I,strict>::operator ++(void) {
91 ++i;
92 }
93 template<class I, bool strict>
94 forceinline bool
95 Negative<I,strict>::operator ()(void) const {
96 if (strict) {
97 return i() && (i.val() < 0);
98 } else {
99 return i() && (i.val() <= 0);
100 }
101 }
102
103 template<class I, bool strict>
104 forceinline int
105 Negative<I,strict>::val(void) const {
106 return i.val();
107 }
108
109}}}
110
111// STATISTICS: iter-any
112