// (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_CIRCULAR_FILTER_ITERATOR_23022003THW_HPP #define BOOST_CIRCULAR_FILTER_ITERATOR_23022003THW_HPP #include #include #include #include #include namespace boost { template class circular_filter_iterator; namespace detail { template struct circular_filter_iterator_base { typedef iterator_adaptor< circular_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 circular_filter_iterator : public detail::circular_filter_iterator_base::type { typedef typename detail::circular_filter_iterator_base< Predicate, Iterator >::type super_t; friend class iterator_core_access; public: circular_filter_iterator() { } circular_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()) : super_t(x), m_predicate(f), m_end(end) { satisfy_predicate(); } circular_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 circular_filter_iterator( circular_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() { --(this->base_reference()); while (this->base() != this->m_end && !this->m_predicate(*this->base())){ --(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 circular_filter_iterator make_circular_filter_iterator(Predicate f, Iterator x, Iterator end = Iterator()) { return circular_filter_iterator(f,x,end); } template circular_filter_iterator make_circular_filter_iterator( typename iterators::enable_if< is_class , Iterator >::type x , Iterator end = Iterator() #if BOOST_WORKAROUND(BOOST_MSVC, == 1200) , Predicate* = 0 #endif ) { return circular_filter_iterator(x,end); } } // namespace boost #endif // BOOST_CIRCULAR_FILTER_ITERATOR_23022003THW_HPP