Defines a set of find algorithms. More...
#include <boost/algorithm/string/config.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/as_literal.hpp>
#include <boost/algorithm/string/finder.hpp>
#include <boost/algorithm/string/compare.hpp>
#include <boost/algorithm/string/constants.hpp>
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::algorithm | |
Functions | |
template<typename RangeT , typename FinderT > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< RangeT >::type > | boost::algorithm::find (RangeT &Input, const FinderT &Finder) |
Generic find algorithm. More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::find_first (Range1T &Input, const Range2T &Search) |
Find first algorithm. More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::ifind_first (Range1T &Input, const Range2T &Search, const std::locale &Loc=std::locale()) |
Find first algorithm ( case insensitive ) More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::find_last (Range1T &Input, const Range2T &Search) |
Find last algorithm. More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::ifind_last (Range1T &Input, const Range2T &Search, const std::locale &Loc=std::locale()) |
Find last algorithm ( case insensitive ) More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::find_nth (Range1T &Input, const Range2T &Search, int Nth) |
Find n-th algorithm. More... | |
template<typename Range1T , typename Range2T > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< Range1T > ::type > | boost::algorithm::ifind_nth (Range1T &Input, const Range2T &Search, int Nth, const std::locale &Loc=std::locale()) |
Find n-th algorithm ( case insensitive ). More... | |
template<typename RangeT > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< RangeT >::type > | boost::algorithm::find_head (RangeT &Input, int N) |
Find head algorithm. More... | |
template<typename RangeT > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< RangeT >::type > | boost::algorithm::find_tail (RangeT &Input, int N) |
Find tail algorithm. More... | |
template<typename RangeT , typename PredicateT > | |
iterator_range < BOOST_STRING_TYPENAME range_iterator< RangeT >::type > | boost::algorithm::find_token (RangeT &Input, PredicateT Pred, token_compress_mode_type eCompress=token_compress_off) |
Find token algorithm. More... | |
Defines a set of find algorithms.
The algorithms are searching for a substring of the input. The result is given as an iterator_range
delimiting the substring.