Home | Libraries | People | FAQ | More |
boost::algorithm::ifind_nth — Find n-th algorithm ( case insensitive ).
template<typename Range1T, typename Range2T> iterator_range< typename range_result_iterator< Range1T >::type > ifind_nth(Range1T & Input, const Range2T & Search, unsigned int Nth, const std::locale & Loc = std::locale());
Search for the n-th (zero-indexed) occurence of the substring in the input. Searching is case insensitive.
Parameters
A string which will be searched.
A locale used for case insensitive comparison
An index (zero-indexed) of the match to be found.
A substring to be searched for.
Returns:
An iterator_range
delimiting the match. Returned iterator is either Range1T::iterator
or Range1T::const_iterator
, depending on the constness of the input parameter.
Notes:
This function provides the strong exception-safety guarantee
Copyright © 2002-2004 Pavol Droba |