Lines Matching refs:s1
68 int s1[N];
69 std::copy(B, B + N, s1);
70 VERIFY(std::equal(s1, s1 + N, B));
72 std::sort(s1, s1 + N);
73 VERIFY(std::equal(s1, s1 + N, A));
77 std::sort(s1, s1 + N, gt);
78 VERIFY(std::equal(s1, s1 + N, C));
85 int s1[N];
86 std::copy(A, A + N, s1);
87 VERIFY(std::equal(s1, s1 + N, A));
89 std::stable_sort(s1, s1 + N, CompLast());
90 VERIFY(std::equal(s1, s1 + N, B));
92 std::stable_sort(s1, s1 + N);
93 VERIFY(std::equal(s1, s1 + N, A));
97 std::stable_sort(s1, s1 + N, gt);
98 VERIFY(std::equal(s1, s1 + N, C));
106 int s1[N];
107 std::copy(B, B + N, s1);
108 VERIFY(std::equal(s1, s1 + N, B));
110 std::partial_sort(s1, s1 + P, s1 + N);
111 VERIFY(std::equal(s1, s1 + P, A));
115 std::partial_sort(s1, s1 + P, s1 + N, gt);
116 VERIFY(std::equal(s1, s1 + P, C));
125 int s1[N];
126 std::copy(B, B + N, s1);
127 VERIFY(std::equal(s1, s1 + N, B));
131 partial_sort_copy(s1, s1 + N, s2, s2 + P);
136 partial_sort_copy(s1, s1 + N, s2, s2 + P, gt);
139 VERIFY(std::equal(s2, partial_sort_copy(s1, s1 + N, s2, s2 + 2*N), A));
148 int s1[N];
149 std::copy(B, B + N, s1);
150 VERIFY(std::equal(s1, s1 + N, B));
152 int* pn = s1 + (N / 2) - 1;
153 nth_element(s1, pn, s1 + N);
154 for (const int* i = pn; i < s1 + N; ++i) VERIFY(!(*i < *pn));
157 nth_element(s1, pn, s1 + N, pred);
158 for (const int* i = pn; i < s1 + N; ++i) VERIFY(!pred(*i, *pn));