iter_find.hpp File Reference

Defines generic split algorithms. More...

#include <boost/algorithm/string/config.hpp>
#include <algorithm>
#include <iterator>
#include <boost/iterator/transform_iterator.hpp>
#include <boost/range/iterator_range_core.hpp>
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
#include <boost/range/iterator.hpp>
#include <boost/range/value_type.hpp>
#include <boost/range/as_literal.hpp>
#include <boost/algorithm/string/concept.hpp>
#include <boost/algorithm/string/find_iterator.hpp>
#include <boost/algorithm/string/detail/util.hpp>

Include dependency graph for iter_find.hpp:

This graph shows which files directly or indirectly include this file:

Namespaces
	boost
	Duration formatting facet for input.
	boost::algorithm

Functions
template<typename SequenceSequenceT , typename RangeT , typename FinderT >
SequenceSequenceT &	boost::algorithm::iter_find (SequenceSequenceT &Result, RangeT &Input, FinderT Finder)
	Iter find algorithm. More...
template<typename SequenceSequenceT , typename RangeT , typename FinderT >
SequenceSequenceT &	boost::algorithm::iter_split (SequenceSequenceT &Result, RangeT &Input, FinderT Finder)
	Split find algorithm. More...

Detailed Description

Defines generic split algorithms.

Split algorithms can be used to divide a sequence into several part according to a given criteria. Result is given as a 'container of containers' where elements are copies or references to extracted parts.

There are two algorithms provided. One iterates over matching substrings, the other one over the gaps between these matches.