Lines Matching refs:Sequence1

248 template <typename Sequence1, typename Sequence2>
249 container_algorithm_internal::ContainerIter<Sequence1> c_find_end(
250     Sequence1& sequence, Sequence2& subsequence) {
259 template <typename Sequence1, typename Sequence2, typename BinaryPredicate>
260 container_algorithm_internal::ContainerIter<Sequence1> c_find_end(
261     Sequence1& sequence, Sequence2& subsequence, BinaryPredicate&& pred) {
449 template <typename Sequence1, typename Sequence2>
450 container_algorithm_internal::ContainerIter<Sequence1> c_search(
451     Sequence1& sequence, Sequence2& subsequence) {
460 template <typename Sequence1, typename Sequence2, typename BinaryPredicate>
461 container_algorithm_internal::ContainerIter<Sequence1> c_search(
462     Sequence1& sequence, Sequence2& subsequence, BinaryPredicate&& pred) {
1580 template <typename Sequence1, typename Sequence2>
1581 bool c_lexicographical_compare(Sequence1&& sequence1, Sequence2&& sequence2) {
1591 template <typename Sequence1, typename Sequence2, typename Compare>
1592 bool c_lexicographical_compare(Sequence1&& sequence1, Sequence2&& sequence2,
1692 template <typename Sequence1, typename Sequence2, typename T>
1693 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2,
1704 template <typename Sequence1, typename Sequence2, typename T,
1706 decay_t<T> c_inner_product(const Sequence1& factors1, const Sequence2& factors2,