Re: [boost] Any interest in generic sequence searching through single-pass iterators?

dpxguard-boost@yahoo.gr wrote:

Hi list,

I have written in my free time the "single_pass_search" C++ template function, which performs generic sequence searching similarly to the std::search STL algorithm. The most important quality of single_pass_search and its main advantage over std::search is its capability to search for a sub-sequence in a search-range that is accessed through a pair of single-pass (input) iterators, while std::search requires that the search-range must be accessed via forward iterators at least.

I guess it could be interesting to overload std::search to work with input iterators too. There is no need to give it a different name.