🚀 go-pugleaf

Marian Hellema <marian@atcmp.nl> revealed:
|I am not sure what the algorithm find_first_of() does.
|      find_first_of(ForwardIterator1 first1, ForwardIterator1 last1,
|                    ForwardIterator2 first2, ForwardIterator2 last2);

|    Returns:
|    The first iterator i in  the  range  [first1,  last1-(last2-first2))
|    such  that for any non-negative integer n < (last2-first2), the fol-
|    lowing   corresponding   conditions   hold:   *i   ==   *(first2+=n),
|    pred(*i,*(first2+n))  == true.  Returns last1 if no such iterator is
|    found.

|I simply do not understand what this says; the more I read it, the more
|I get confused. It seems to say that all the elements in the second range
|[first2, last2) should have the same value??

I think that instead of saying "for any", they mean to/should say
"there exists a"  I agree that it is confusing.
--
Samuel T. Denton, III  (std@maryville.com)

Any similarily between opinions expressed herein and those of 
my employer is purely coincidental.

Hail Eris!  All Hail Discordia!


---
[ comp.std.c++ is moderated.  Submission address: std-c++@ncar.ucar.edu.
  Contact address: std-c++-request@ncar.ucar.edu.  The moderation policy
  is summarized in http://dogbert.lbl.gov/~matt/std-c++/policy.html. ]