FM / iterator

/usr/include/boost/iterator

Name	Size	Mode	Actions
detail/	-	0755	rm
advance.hpp	2056	0644	edit dl rm
counting_iterator.hpp	6280	0644	edit dl rm
distance.hpp	1868	0644	edit dl rm
filter_iterator.hpp	3904	0644	edit dl rm
function_input_iterator.hpp	5608	0644	edit dl rm
function_output_iterator.hpp	1738	0644	edit dl rm
indirect_iterator.hpp	3858	0644	edit dl rm
interoperable.hpp	1557	0644	edit dl rm
is_lvalue_iterator.hpp	4215	0644	edit dl rm
is_readable_iterator.hpp	2927	0644	edit dl rm
iterator_adaptor.hpp	11142	0644	edit dl rm
iterator_archetypes.hpp	15521	0644	edit dl rm
iterator_categories.hpp	6214	0644	edit dl rm
iterator_concepts.hpp	7401	0644	edit dl rm
iterator_facade.hpp	34735	0644	edit dl rm
iterator_traits.hpp	1451	0644	edit dl rm
minimum_category.hpp	2256	0644	edit dl rm
new_iterator_tests.hpp	7330	0644	edit dl rm
permutation_iterator.hpp	2363	0644	edit dl rm
reverse_iterator.hpp	2055	0644	edit dl rm
transform_iterator.hpp	5921	0644	edit dl rm
zip_iterator.hpp	10404	0644	edit dl rm

Edit: /usr/include/boost/iterator/filter_iterator.hpp (3904B)

#include <boost/iterator/iterator_adaptor.hpp>
#include <boost/iterator/iterator_categories.hpp>

#include <boost/type_traits/is_class.hpp>
#include <boost/static_assert.hpp>

namespace boost {
namespace iterators {

template <class Predicate, class Iterator>
  class filter_iterator;

namespace detail
  {
    template <class Predicate, class Iterator>
    struct filter_iterator_base
    {
        typedef iterator_adaptor<
            filter_iterator<Predicate, Iterator>
          , Iterator
          , use_default
          , typename mpl::if_<
                is_convertible<
                    typename iterator_traversal<Iterator>::type
                  , random_access_traversal_tag
                >
              , bidirectional_traversal_tag
              , use_default
            >::type
        > type;
    };
  }

template <class Predicate, class Iterator>
  class filter_iterator
    : public detail::filter_iterator_base<Predicate, Iterator>::type
  {
      typedef typename detail::filter_iterator_base<
          Predicate, Iterator
      >::type super_t;

friend class iterator_core_access;

public:
      filter_iterator() { }

filter_iterator(Predicate f, Iterator x, Iterator end_ = Iterator())
          : super_t(x), m_predicate(f), m_end(end_)
      {
          satisfy_predicate();
      }

filter_iterator(Iterator x, Iterator end_ = Iterator())
        : super_t(x), m_predicate(), m_end(end_)
      {
        // Pro8 is a little too aggressive about instantiating the
        // body of this function.
#if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003))
          // Don't allow use of this constructor if Predicate is a
          // function pointer type, since it will be 0.
          BOOST_STATIC_ASSERT(is_class<Predicate>::value);
#endif
          satisfy_predicate();
      }

template<class OtherIterator>
      filter_iterator(
          filter_iterator<Predicate, OtherIterator> const& t
          , typename enable_if_convertible<OtherIterator, Iterator>::type* = 0
          )
          : super_t(t.base()), m_predicate(t.predicate()), m_end(t.end()) {}

Predicate predicate() const { return m_predicate; }

Iterator end() const { return m_end; }

private:
      void increment()
      {
          ++(this->base_reference());
          satisfy_predicate();
      }

void decrement()
      {
        while(!this->m_predicate(*--(this->base_reference()))){};
      }

void satisfy_predicate()
      {
          while (this->base() != this->m_end && !this->m_predicate(*this->base()))
              ++(this->base_reference());
      }

// Probably should be the initial base class so it can be
      // optimized away via EBO if it is an empty class.
      Predicate m_predicate;
      Iterator m_end;
  };

template <class Predicate, class Iterator>
  inline filter_iterator<Predicate,Iterator>
  make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator())
  {
      return filter_iterator<Predicate,Iterator>(f,x,end);
  }

template <class Predicate, class Iterator>
  inline filter_iterator<Predicate,Iterator>
  make_filter_iterator(
      typename iterators::enable_if<
          is_class<Predicate>
        , Iterator
      >::type x
    , Iterator end = Iterator())
  {
      return filter_iterator<Predicate,Iterator>(x,end);
  }

} // namespace iterators

using iterators::filter_iterator;
using iterators::make_filter_iterator;

} // namespace boost

#endif // BOOST_FILTER_ITERATOR_23022003THW_HPP

// (C) Copyright David Abrahams 2002. // (C) Copyright Jeremy Siek 2002. // (C) Copyright Thomas Witt 2002. // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_FILTER_ITERATOR_23022003THW_HPP #define BOOST_FILTER_ITERATOR_23022003THW_HPP #include #include #include #include namespace boost { namespace iterators { template class filter_iterator; namespace detail { template struct filter_iterator_base { typedef iterator_adaptor< filter_iterator , Iterator , use_default , typename mpl::if_< is_convertible< typename iterator_traversal::type , random_access_traversal_tag > , bidirectional_traversal_tag , use_default >::type > type; }; } template class filter_iterator : public detail::filter_iterator_base::type { typedef typename detail::filter_iterator_base< Predicate, Iterator >::type super_t; friend class iterator_core_access; public: filter_iterator() { } filter_iterator(Predicate f, Iterator x, Iterator end_ = Iterator()) : super_t(x), m_predicate(f), m_end(end_) { satisfy_predicate(); } filter_iterator(Iterator x, Iterator end_ = Iterator()) : super_t(x), m_predicate(), m_end(end_) { // Pro8 is a little too aggressive about instantiating the // body of this function. #if !BOOST_WORKAROUND(__MWERKS__, BOOST_TESTED_AT(0x3003)) // Don't allow use of this constructor if Predicate is a // function pointer type, since it will be 0. BOOST_STATIC_ASSERT(is_class::value); #endif satisfy_predicate(); } template filter_iterator( filter_iterator const& t , typename enable_if_convertible::type* = 0 ) : super_t(t.base()), m_predicate(t.predicate()), m_end(t.end()) {} Predicate predicate() const { return m_predicate; } Iterator end() const { return m_end; } private: void increment() { ++(this->base_reference()); satisfy_predicate(); } void decrement() { while(!this->m_predicate(*--(this->base_reference()))){}; } void satisfy_predicate() { while (this->base() != this->m_end && !this->m_predicate(*this->base())) ++(this->base_reference()); } // Probably should be the initial base class so it can be // optimized away via EBO if it is an empty class. Predicate m_predicate; Iterator m_end; }; template inline filter_iterator make_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()) { return filter_iterator(f,x,end); } template inline filter_iterator make_filter_iterator( typename iterators::enable_if< is_class , Iterator >::type x , Iterator end = Iterator()) { return filter_iterator(x,end); } } // namespace iterators using iterators::filter_iterator; using iterators::make_filter_iterator; } // namespace boost #endif // BOOST_FILTER_ITERATOR_23022003THW_HPP