/usr/include/claw/iterator.hpp is in libclaw-dev 1.7.4-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 | /*
CLAW - a C++ Library Absolutely Wonderful
CLAW is a free library without any particular aim but being useful to
anyone.
Copyright (C) 2005-2011 Julien Jorge
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
contact: julien.jorge@gamned.org
*/
/**
* \file iterator.hpp
* \brief Some special kind of iterators. As an example: iterator on the keys of
* a map.
* \author Julien Jorge
*/
#ifndef __CLAW_ITERATOR_HPP__
#define __CLAW_ITERATOR_HPP__
#include <iterator>
namespace claw
{
/*-------------------------------------------------------------------------*/
/**
* \brief Base class for wrapped iterators.
* \author Julien Jorge
*/
template< typename Category, typename Value, typename Iterator,
typename Function >
class wrapped_iterator_by_category
{
}; // class wrapped_iterator_by_category
/*-------------------------------------------------------------------------*/
/**
* \brief Base class for wrapped iterators, specialized for forward iterators.
* \author Julien Jorge
*/
template<typename Value, typename Iterator, typename Function>
class wrapped_iterator_by_category
<std::forward_iterator_tag, Value, Iterator, Function>
{
public:
typedef typename std::iterator_traits<Iterator>::difference_type
difference_type;
typedef Value value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef typename std::iterator_traits<Iterator>::iterator_category
iterator_category;
typedef
wrapped_iterator_by_category
<std::forward_iterator_tag, Value, Iterator, Function>
self_type;
public:
wrapped_iterator_by_category() {}
wrapped_iterator_by_category( const Iterator& it )
: m_it(it)
{ }
wrapped_iterator_by_category( const Iterator& it, const Function& f )
: m_it(it), m_fun(f)
{ }
template<typename C, typename V, typename I, typename F>
wrapped_iterator_by_category
( const wrapped_iterator_by_category<C, V, I, F>& that )
: m_it(that.get_iterator()), m_fun(that.get_function())
{ }
const Iterator& get_iterator() const { return m_it; }
const Function& get_function() const { return m_fun; }
self_type& operator++()
{
++m_it;
return *this;
}
self_type operator++(int)
{
self_type tmp(*this);
++m_it;
return tmp;
}
reference operator*() const { return m_fun(*m_it); }
pointer operator->() const { return &m_fun(*m_it); }
bool operator==( const self_type& that ) const { return m_it == that.m_it; }
bool operator!=( const self_type& that ) const { return m_it != that.m_it; }
bool operator==( const Iterator& it ) const { return m_it == it; }
bool operator!=( const Iterator& it ) const { return m_it != it; }
private:
/** \brief The effective iterator. */
Iterator m_it;
/** \brief The function applied to the pointed items. */
Function m_fun;
}; // class wrapped_iterator_by_category [forward_iterator_tag]
/*-------------------------------------------------------------------------*/
/**
* \brief Base class for wrapped iterators, specialized for bidirectional
* iterators.
* \author Julien Jorge
*/
template<typename Value, typename Iterator, typename Function>
class wrapped_iterator_by_category
<std::bidirectional_iterator_tag, Value, Iterator, Function>
{
public:
typedef typename std::iterator_traits<Iterator>::difference_type
difference_type;
typedef Value value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef typename std::iterator_traits<Iterator>::iterator_category
iterator_category;
typedef
wrapped_iterator_by_category
<std::bidirectional_iterator_tag, Value, Iterator, Function> self_type;
public:
wrapped_iterator_by_category() {}
wrapped_iterator_by_category( const Iterator& it )
: m_it(it)
{ }
wrapped_iterator_by_category( const Iterator& it, const Function& f )
: m_it(it), m_fun(f)
{ }
template<typename C, typename V, typename I, typename F>
wrapped_iterator_by_category
( const wrapped_iterator_by_category<C, V, I, F>& that )
: m_it(that.get_iterator()), m_fun(that.get_function())
{ }
const Iterator& get_iterator() const { return m_it; }
const Function& get_function() const { return m_fun; }
self_type& operator++()
{
++m_it;
return *this;
}
self_type operator++(int)
{
self_type tmp(*this);
++m_it;
return tmp;
}
self_type& operator--()
{
--m_it;
return *this;
}
self_type operator--(int)
{
self_type tmp(*this);
--m_it;
return tmp;
}
reference operator*() const { return m_fun(*m_it); }
pointer operator->() const { return &m_fun(*m_it); }
bool operator==( const self_type& that ) const { return m_it == that.m_it; }
bool operator!=( const self_type& that ) const { return m_it != that.m_it; }
bool operator==( const Iterator& it ) const { return m_it == it; }
bool operator!=( const Iterator& it ) const { return m_it != it; }
private:
/** \brief The effective iterator. */
Iterator m_it;
/** \brief The function applied to the pointed items. */
Function m_fun;
}; // class wrapped_iterator_by_category [bidirectional_iterator_tag]
/*-------------------------------------------------------------------------*/
/**
* \brief Base class for wrapped iterators, specialized for random iterators.
* \author Julien Jorge
*/
template<typename Value, typename Iterator, typename Function>
class wrapped_iterator_by_category
<std::random_access_iterator_tag, Value, Iterator, Function>
{
public:
typedef typename std::iterator_traits<Iterator>::difference_type
difference_type;
typedef Value value_type;
typedef value_type* pointer;
typedef value_type& reference;
typedef typename std::iterator_traits<Iterator>::iterator_category
iterator_category;
typedef
wrapped_iterator_by_category
<std::random_access_iterator_tag, Value, Iterator, Function>
self_type;
public:
wrapped_iterator_by_category() {}
wrapped_iterator_by_category( const Iterator& it )
: m_it(it)
{ }
wrapped_iterator_by_category( const Iterator& it, const Function& f )
: m_it(it), m_fun(f)
{ }
template<typename V, typename I>
wrapped_iterator_by_category
( const wrapped_iterator_by_category
<std::random_access_iterator_tag, V, I, Function>& that )
: m_it(that.m_it), m_fun(that.m_fun)
{ }
template<typename C, typename V, typename I, typename F>
wrapped_iterator_by_category
( const wrapped_iterator_by_category<C, V, I, F>& that )
: m_it(that.get_iterator()), m_fun(that.get_function())
{ }
const Iterator& get_iterator() const { return m_it; }
const Function& get_function() const { return m_fun; }
self_type& operator++()
{
++m_it;
return *this;
}
self_type operator++(int)
{
self_type tmp(*this);
++m_it;
return tmp;
}
self_type& operator--()
{
--m_it;
return *this;
}
self_type operator--(int)
{
self_type tmp(*this);
--m_it;
return tmp;
}
reference operator*() const { return m_fun(*m_it); }
pointer operator->() const { return &m_fun(*m_it); }
bool operator==( const self_type& that ) const { return m_it == that.m_it; }
bool operator!=( const self_type& that ) const { return m_it != that.m_it; }
bool operator==( const Iterator& it ) const { return m_it == it; }
bool operator!=( const Iterator& it ) const { return m_it != it; }
bool operator<( const self_type& that ) const { return m_it < that.m_it; }
bool operator<=( const self_type& that ) const { return m_it <= that.m_it; }
bool operator>( const self_type& that ) const { return m_it > that.m_it; }
bool operator>=( const self_type& that ) const { return m_it >= that.m_it; }
difference_type operator-( const self_type& that ) const
{
return m_it - that.m_it;
}
self_type& operator+=(int n)
{
m_it += n;
return *this;
}
self_type operator+(int n) const
{
self_type result(*this);
result += n;
return result;
}
self_type& operator-=(int n) { return *this += -n; }
self_type operator-(int n) const
{
self_type result(*this);
result -= n;
return result;
}
reference operator[](int n) { return m_fun(m_it[n]); }
private:
/** \brief The effective iterator. */
Iterator m_it;
/** \brief The function applied to the pointed items. */
Function m_fun;
}; // class wrapped_iterator_by_category [random_access_iterator_tag]
template<typename Value, typename Iterator, typename Function>
wrapped_iterator_by_category
<std::random_access_iterator_tag, Value, Iterator, Function>
operator+
( int n,
const wrapped_iterator_by_category
< std::random_access_iterator_tag, Value, Iterator, Function >& it )
{
return it + n;
}
template<typename Value, typename Iterator, typename Function>
wrapped_iterator_by_category
<std::random_access_iterator_tag, Value, Iterator, Function>
operator-
( int n,
const wrapped_iterator_by_category
< std::random_access_iterator_tag, Value, Iterator, Function >& it )
{
return it - n;
}
/*-------------------------------------------------------------------------*/
/**
* \brief This class defines an iterator resulting of the appliance of a
* function to an effective iterator.
*
* \b Template \b arguments:
* - \a Value The value_type of the resulting iterator,
* - \a Iterator The original iterator type,
* - \a Function The function applied to the pointed values (this is the
* wrapper).
*
* \author Julien Jorge
*/
template <typename Value, typename Iterator, typename Function>
class wrapped_iterator
{
public:
/** \brief This is the type of the iterator that you want. */
typedef wrapped_iterator_by_category
< typename std::iterator_traits<Iterator>::iterator_category,
Value, Iterator, Function >
iterator_type;
}; // class wrapped_iterator
} // namespace claw
#endif // __CLAW_ITERATOR_HPP__
|