Home | History | Annotate | Download | only in bits

Lines Matching full:last2

678    *  @param  last2   End of sequence to match.
680 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
681 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
685 * equal value-by-value with the sequence given by @p [first2,last2) and
692 * @p last1-(last2-first2) where @p last2-first2 is the length of the
695 * @p [first1,last1-(last2-first2))
722 * @param last2 End of sequence to match.
725 * @p [first1,last1-(last2-first2)) such that @c predicate(*(i+N), @p
726 * (first2+N)) is true for each @c N in the range @p [0,last2-first2), or
730 * equal value-by-value with the sequence given by @p [first2,last2) using
738 * @p last1-(last2-first2) where @p last2-first2 is the length of the
741 * @p [first1,last1-(last2-first2))
3498 * @param last2 End of sequence.
3499 * @return True if each element in [first2,last2) is contained in order
3503 * This operation expects both [first1,last1) and [first2,last2) to be
3504 * sorted. Searches for the presence of each element in [first2,last2)
3506 last2) is not
3507 * found before the search iterator reaches @a last2, false is returned.
3545 * @param last2 End of sequence.
3547 * @return True if each element in [first2,last2) is contained in order
3551 * This operation expects both [first1,last1) and [first2,last2) to be
3552 * sorted. Searches for the presence of each element in [first2,last2)
3555 * in [first2,last2) is not found before the search iterator reaches @a
3556 * last2, false is returned.
4299 * @param last2 End of match candidates.
4302 * iterator in [first2,last2), or @p last1 if no such iterator exists.
4305 * some element in the range [first2,last2). If found, returns an iterator
4335 * @param last2 End of match candidates.
4339 * iterator in [first2,last2), or @p last1 if no such iterator exists.
4343 * equal to some element in the range [first2,last2). If found,
4490 * @param last2 A forward iterator.
4492 * @p [first1,last1-(last2-first2)) such that @c *(i+N) == @p *(first2+N)
4493 * for each @c N in the range @p [0,last2-first2), or @p last1 if no
4497 * equal value-by-value with the sequence given by @p [first2,last2) and
4503 * @p last1-(last2-first2) where @p last2-first2 is the length of the
4506 * @p [first1,last1-(last2-first2))
4564 * @param last2 A forward iterator.
4567 * @p [first1,last1-(last2-first2)) such that
4569 * @p [0,last2-first2), or @p last1 if no such iterator exists.
4572 * equal value-by-value with the sequence given by @p [first2,last2),
5315 * @param last2 Another iterator.
5320 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
5321 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
5374 * @param last2 Another iterator.
5380 * Merges the ranges [first1,last1) and [first2,last2) into the sorted range
5381 * [result, result + (last1-first1) + (last2-first2)). Both input ranges
5527 * @param last2 End of second range.
5593 * @param last2 End of second range.
5662 * @param last2 End of second range.
5717 * @param last2 End of second range.
5775 * @param last2 End of second range.
5834 * @param last2 End of second range.
5896 * @param last2 End of second range.
5960 * @param last2 End of second range.