Boost
C++ Libraries
...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
Boost
C++ Libraries
...one of the most highly
regarded and expertly designed C++ library projects in the
world.
— Herb Sutter and Andrei
Alexandrescu, C++
Coding Standards
boost::algorithm::find_tail — Find tail algorithm.
template<typename RangeT> iterator_range< typename range_result_iterator< RangeT >::type > find_tail(RangeT & Input, unsigned int N);
Get the head of the input. Head is a suffix of the string of the given size. If the input is shorter then required, whole input if considered to be the tail.
Parameters
An input string
Length of the tail
Returns:
An iterator_range delimiting the match. Returned iterator is either RangeT::iterator or RangeT::const_iterator , depending on the constness of the input parameter.
Notes:
This function provides the strong exception-safety guarantee
| Copyright © 2002-2004 Pavol Droba |