HomeSort by relevance Sort by last modified time
    Searched defs:ib (Results 1 - 25 of 106) sorted by null

1 2 3 4 5

  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.equal/
equal.pass.cpp 26 int ib[s] = {0, 1, 2, 5, 4, 5}; local
32 input_iterator<const int*>(ib)));
equal_pred.pass.cpp 28 int ib[s] = {0, 1, 2, 5, 4, 5}; local
35 input_iterator<const int*>(ib),
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.is_permutation/
is_permutation.pass.cpp 26 const int ib[] = {0}; local
30 forward_iterator<const int*>(ib)) == true);
33 forward_iterator<const int*>(ib)) == true);
37 const int ib[] = {1}; local
41 forward_iterator<const int*>(ib)) == false);
46 const int ib[] = {0, 0}; local
50 forward_iterator<const int*>(ib)) == true);
54 const int ib[] = {0, 1}; local
58 forward_iterator<const int*>(ib)) == false);
62 const int ib[] = {1, 0} local
70 const int ib[] = {1, 1}; local
78 const int ib[] = {0, 0}; local
86 const int ib[] = {0, 1}; local
94 const int ib[] = {1, 0}; local
102 const int ib[] = {1, 1}; local
110 const int ib[] = {0, 0}; local
118 const int ib[] = {0, 1}; local
126 const int ib[] = {1, 0}; local
134 const int ib[] = {1, 1}; local
142 const int ib[] = {0, 0}; local
150 const int ib[] = {0, 1}; local
158 const int ib[] = {1, 0}; local
166 const int ib[] = {1, 1}; local
175 const int ib[] = {1, 0, 0}; local
183 const int ib[] = {1, 0, 1}; local
191 const int ib[] = {1, 0, 2}; local
199 const int ib[] = {1, 1, 0}; local
207 const int ib[] = {1, 1, 1}; local
215 const int ib[] = {1, 1, 2}; local
223 const int ib[] = {1, 2, 0}; local
231 const int ib[] = {1, 2, 1}; local
239 const int ib[] = {1, 2, 2}; local
247 const int ib[] = {1, 0, 0}; local
255 const int ib[] = {1, 0, 1}; local
263 const int ib[] = {1, 0, 2}; local
271 const int ib[] = {1, 2, 0}; local
279 const int ib[] = {2, 1, 0}; local
287 const int ib[] = {2, 0, 1}; local
295 const int ib[] = {1, 0, 1}; local
303 const int ib[] = {1, 0, 0}; local
311 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
319 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
is_permutation_pred.pass.cpp 27 const int ib[] = {0}; local
31 forward_iterator<const int*>(ib),
35 forward_iterator<const int*>(ib),
40 const int ib[] = {1}; local
44 forward_iterator<const int*>(ib),
50 const int ib[] = {0, 0}; local
54 forward_iterator<const int*>(ib),
59 const int ib[] = {0, 1}; local
63 forward_iterator<const int*>(ib),
68 const int ib[] = {1, 0} local
77 const int ib[] = {1, 1}; local
86 const int ib[] = {0, 0}; local
95 const int ib[] = {0, 1}; local
104 const int ib[] = {1, 0}; local
113 const int ib[] = {1, 1}; local
122 const int ib[] = {0, 0}; local
131 const int ib[] = {0, 1}; local
140 const int ib[] = {1, 0}; local
149 const int ib[] = {1, 1}; local
158 const int ib[] = {0, 0}; local
167 const int ib[] = {0, 1}; local
176 const int ib[] = {1, 0}; local
185 const int ib[] = {1, 1}; local
195 const int ib[] = {1, 0, 0}; local
204 const int ib[] = {1, 0, 1}; local
213 const int ib[] = {1, 0, 2}; local
222 const int ib[] = {1, 1, 0}; local
231 const int ib[] = {1, 1, 1}; local
240 const int ib[] = {1, 1, 2}; local
249 const int ib[] = {1, 2, 0}; local
258 const int ib[] = {1, 2, 1}; local
267 const int ib[] = {1, 2, 2}; local
276 const int ib[] = {1, 0, 0}; local
285 const int ib[] = {1, 0, 1}; local
294 const int ib[] = {1, 0, 2}; local
303 const int ib[] = {1, 2, 0}; local
312 const int ib[] = {2, 1, 0}; local
321 const int ib[] = {2, 0, 1}; local
330 const int ib[] = {1, 0, 1}; local
339 const int ib[] = {1, 0, 0}; local
348 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
357 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/mismatch/
mismatch.pass.cpp 26 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
29 input_iterator<const int*>(ib)) ==
33 input_iterator<const int*>(ib+3))));
mismatch_pred.pass.cpp 28 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
31 input_iterator<const int*>(ib),
36 input_iterator<const int*>(ib+3))));
37 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
38 (std::pair<int*,int*>(ia+3,ib+3)));
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.lex.comparison/
lexicographical_compare.pass.cpp 29 int ib[] = {1, 2, 3}; local
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa));
34 assert(std::lexicographical_compare(ia, ia+sa, ib+1, ib+3))
    [all...]
lexicographical_compare_comp.pass.cpp 31 int ib[] = {1, 2, 3}; local
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c));
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c));
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c));
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c));
38 assert(!std::lexicographical_compare(ia, ia+sa, ib+1, ib+3, c))
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.copy/
copy.pass.cpp 29 int ib[N] = {0}; local
31 OutIter r = std::copy(InIter(ia), InIter(ia+N), OutIter(ib));
32 assert(base(r) == ib+N);
34 assert(ia[i] == ib[i]);
copy_backward.pass.cpp 30 int ib[N] = {0}; local
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
33 assert(base(r) == ib);
35 assert(ia[i] == ib[i]);
copy_n.pass.cpp 29 int ib[N] = {0}; local
31 OutIter r = std::copy_n(InIter(ia), N/2, OutIter(ib));
32 assert(base(r) == ib+N/2);
34 assert(ia[i] == ib[i]);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.move/
move.pass.cpp 33 int ib[N] = {0}; local
35 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
36 assert(base(r) == ib+N);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
54 assert(base(r) == ib+N);
56 assert(*ib[i] == i);
move_backward.pass.cpp 33 int ib[N] = {0}; local
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
36 assert(base(r) == ib);
38 assert(ia[i] == ib[i]);
51 std::unique_ptr<int> ib[N]; local
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
54 assert(base(r) == ib);
56 assert(*ib[i] == i);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.remove/
remove_copy.pass.cpp 28 int ib[sa]; local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
31 assert(ib[0] == 0);
32 assert(ib[1] == 1);
33 assert(ib[2] == 3);
34 assert(ib[3] == 4);
35 assert(ib[4] == 3);
36 assert(ib[5] == 4);
remove_copy_if.pass.cpp 30 int ib[sa]; local
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa-3);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 3);
39 assert(ib[5] == 4);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.replace/
replace_copy.pass.cpp 31 int ib[sa] = {0}; local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 5);
37 assert(ib[3] == 3);
38 assert(ib[4] == 4);
replace_copy_if.pass.cpp 32 int ib[sa] = {0}; local
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
35 assert(base(r) == ib + sa);
36 assert(ib[0] == 0);
37 assert(ib[1] == 1);
38 assert(ib[2] == 5);
39 assert(ib[3] == 3);
40 assert(ib[4] == 4);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.rotate/
rotate_copy.pass.cpp 27 int ib[sa] = {0}; local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
30 assert(base(r) == ib);
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
33 assert(base(r) == ib+1);
34 assert(ib[0] == 0);
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib));
37 assert(base(r) == ib+1);
38 assert(ib[0] == 0);
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib));
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.modifying.operations/alg.transform/
binary_transform.pass.cpp 30 int ib[sa] = {1, 2, 3, 4, 5}; local
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
32 OutIter(ib), std::minus<int>());
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 1);
36 assert(ib[2] == 1);
37 assert(ib[3] == 1);
38 assert(ib[4] == 1)
    [all...]
unary_transform.pass.cpp 30 int ib[sa] = {0}; local
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 2);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 5);
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.nonmodifying/alg.find.first.of/
find_first_of.pass.cpp 26 int ib[] = {1, 3, 5, 7}; local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
30 forward_iterator<const int*>(ib),
31 forward_iterator<const int*>(ib + sb)) ==
find_first_of_pred.pass.cpp 28 int ib[] = {1, 3, 5, 7}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
32 forward_iterator<const int*>(ib),
33 forward_iterator<const int*>(ib + sb),
  /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.merge/
merge.pass.cpp 31 int* ib = new int[N]; local
36 ib[i] = 2*i+1;
38 InIter2(ib), InIter2(ib+N), OutIter(ic));
44 delete [] ib;
50 int* ib = new int[N]; local
56 std::copy(ic+N, ic+2*N, ib);
58 std::sort(ib, ib+N);
60 InIter2(ib), InIter2(ib+N), OutIter(ic))
    [all...]
merge_comp.pass.cpp 34 int* ib = new int[N]; local
39 ib[i] = 2*i+1;
41 std::reverse(ib, ib+N);
43 InIter2(ib), InIter2(ib+N), OutIter(ic), std::greater<int>());
49 delete [] ib;
55 int* ib = new int[N]; local
61 std::copy(ic+N, ic+2*N, ib);
63 std::sort(ib, ib+N, std::greater<int>())
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
compare.pass.cpp 26 const char ib[] = "123"; local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1)
39 const wchar_t ib[] = L"123"; local
    [all...]

Completed in 141 milliseconds

1 2 3 4 5