// Copyright 2009 (C) Dean Michael Berris // Copyright 2012 (C) Google, Inc. // Copyright 2012 (C) Jeffrey Lee Hellrung, Jr. // 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_FUNCTION_INPUT_ITERATOR #define BOOST_FUNCTION_INPUT_ITERATOR #include #include #include #include #include #include #include #include #include #include #ifdef BOOST_RESULT_OF_USE_TR1 #include #endif namespace boost { namespace iterators { namespace impl { // Computes the return type of an lvalue-call with an empty argument, // i.e. decltype(declval()()). F should be a nullary lvalue-callable // or function. template struct result_of_nullary_lvalue_call { typedef typename result_of< #ifdef BOOST_RESULT_OF_USE_TR1 typename mpl::if_, F&, F>::type() #else F&() #endif >::type type; }; template class function_input_iterator : public iterator_facade< function_input_iterator, typename result_of_nullary_lvalue_call::type, single_pass_traversal_tag, typename result_of_nullary_lvalue_call::type const & > { public: function_input_iterator() {} function_input_iterator(Function & f_, Input state_ = Input()) : f(boost::addressof(f_)), state(state_) {} void increment() { if(value) value = none; else (*f)(); ++state; } typename result_of_nullary_lvalue_call::type const & dereference() const { return (value ? value : value = (*f)()).get(); } bool equal(function_input_iterator const & other) const { return f == other.f && state == other.state; } private: Function * f; Input state; mutable optional::type> value; }; template class function_pointer_input_iterator : public iterator_facade< function_pointer_input_iterator, typename function_types::result_type::type, single_pass_traversal_tag, typename function_types::result_type::type const & > { public: function_pointer_input_iterator() {} function_pointer_input_iterator(Function &f_, Input state_ = Input()) : f(f_), state(state_) {} void increment() { if(value) value = none; else (*f)(); ++state; } typename function_types::result_type::type const & dereference() const { return (value ? value : value = (*f)()).get(); } bool equal(function_pointer_input_iterator const & other) const { return f == other.f && state == other.state; } private: Function f; Input state; mutable optional::type> value; }; } // namespace impl template class function_input_iterator : public mpl::if_< function_types::is_function_pointer, impl::function_pointer_input_iterator, impl::function_input_iterator >::type { typedef typename mpl::if_< function_types::is_function_pointer, impl::function_pointer_input_iterator, impl::function_input_iterator >::type base_type; public: function_input_iterator(Function & f, Input i) : base_type(f, i) {} }; template inline function_input_iterator make_function_input_iterator(Function & f, Input state) { typedef function_input_iterator result_t; return result_t(f, state); } template inline function_input_iterator make_function_input_iterator(Function * f, Input state) { typedef function_input_iterator result_t; return result_t(f, state); } struct infinite { infinite & operator++() { return *this; } infinite & operator++(int) { return *this; } bool operator==(infinite &) const { return false; }; bool operator==(infinite const &) const { return false; }; }; } // namespace iterators using iterators::function_input_iterator; using iterators::make_function_input_iterator; using iterators::infinite; } // namespace boost #endif