Date: 2008-07-04 12:31:30
Jim Xochellis wrote:
> > 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
> > 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.
Mathias Gaunard wrote:
> 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.
I cannot think of a way to "overload" std::search to work with input
iterators, without changing its behavior significantly. Please see the
section "Oddities and drawbacks" of the
Home/Algorithms/single_pass_search/single_pass_search.html documentation file in the
"Boost File Vault", for more details.
ÂáñåèÞêáôå ôá åíï÷ëçôéêÜ ìçíýìáôá (spam); Ôï Yahoo! Mail
äéáèÝôåé ôçí êáëýôåñç äõíáôÞ ðñïóôáóßá êáôÜ ôùí åíï÷ëçôéêþí