| /external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare_comp.pass.cpp | 29 int ia[] = {1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
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))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/ |
| lexicographical_compare.pass.cpp | 27 int ia[] = {1, 2, 3, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2)));
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa)));
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3)));
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa)))
[all...] |
| lexicographical_compare_comp.pass.cpp | 29 int ia[] = {1, 2, 3, 4}; local
30 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c));
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c));
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c));
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c))
[all...] |
| /external/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 27 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)));
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib)));
39 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)))
[all...] |
| includes_comp.pass.cpp | 28 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
40 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>()))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 27 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
28 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)));
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib)));
39 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)))
[all...] |
| includes_comp.pass.cpp | 28 int ia[] = {1, 2, 2, 3, 3, 3, 4, 4, 4, 4}; local
29 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
40 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), std::less<int>()))
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 40 int ia[n] = {0}; local
41 std::fill(Iter(ia), Iter(ia+n), 1);
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.fill/ |
| fill.pass.cpp | 40 int ia[n] = {0}; local
41 std::fill(Iter(ia), Iter(ia+n), 1);
42 assert(ia[0] == 1);
43 assert(ia[1] == 1);
44 assert(ia[2] == 1);
45 assert(ia[3] == 1);
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa))
[all...] |
| search_n_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa))
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| search_n.pass.cpp | 26 int ia[] = {0, 1, 2, 3, 4, 5}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia));
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0));
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa))
[all...] |
| search_n_pred.pass.cpp | 36 int ia[] = {0, 1, 2, 3, 4, 5}; local
37 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia));
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0));
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa))
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 26 int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 std::reverse(Iter(ia), Iter(ia));
29 assert(ia[0] == 0);
30 std::reverse(Iter(ia), Iter(ia+sa));
31 assert(ia[0] == 0);
|
| reverse_copy.pass.cpp | 25 const int ia[] = {0}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 OutIter r = std::reverse_copy(InIter(ia), InIter(ia), OutIter(ja));
31 r = std::reverse_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/ |
| reverse.pass.cpp | 26 int ia[] = {0}; local
27 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 std::reverse(Iter(ia), Iter(ia));
29 assert(ia[0] == 0);
30 std::reverse(Iter(ia), Iter(ia+sa));
31 assert(ia[0] == 0);
|
| reverse_copy.pass.cpp | 25 const int ia[] = {0}; local
26 const unsigned sa = sizeof(ia)/sizeof(ia[0]);
28 OutIter r = std::reverse_copy(InIter(ia), InIter(ia), OutIter(ja));
31 r = std::reverse_copy(InIter(ia), InIter(ia+sa), OutIter(ja));
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 27 int ia[N]; local
29 ia[i] = i;
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
35 assert(ia[i] == ib[i]);
|
| /frameworks/av/media/libstagefright/codecs/amrnb/dec/src/ |
| d8_31pf.cpp | 172 Word16 ia; local
188 ia =
196 ia,
201 ia = (Word16)(MSBs - (tempWord32 >> 1));
204 ia,
214 ib = ia - (Word16)(tempWord32 >> 1);
231 ia,
350 Word16 ia; local
420 ia =
427 ia += 12
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 27 int ia[N]; local
29 ia[i] = i;
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
35 assert(ia[i] == ib[i]);
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| partition_copy.pass.cpp | 32 const int ia[] = {1, 2, 3, 4, 6, 8, 5, 7}; local
36 P p = std::partition_copy(input_iterator<const int*>(std::begin(ia)),
37 input_iterator<const int*>(std::end(ia)),
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| partition_copy.pass.cpp | 32 const int ia[] = {1, 2, 3, 4, 6, 8, 5, 7}; local
36 P p = std::partition_copy(input_iterator<const int*>(std::begin(ia)),
37 input_iterator<const int*>(std::end(ia)),
|
| /external/sqlite/android/ |
| OldPhoneNumberUtils.cpp | 197 int ia, ib; local
206 ia = strlen(a);
208 if (ia == 0 || ib == 0) {
213 ia--;
218 while (ia >= 0 && ib >=0) {
222 ca = a[ia];
225 ia--;
242 ia--; ib--; matched++;
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) {
273 if (matchIntlPrefix(a, ia + 1) && matchIntlPrefix(b, ib +1))
[all...] |
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
| move_backward.pass.cpp | 30 int ia[N]; local
32 ia[i] = i;
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
38 assert(ia[i] == ib[i]);
48 std::unique_ptr<int> ia[N]; local
50 ia[i].reset(new int(i));
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.move/ |
| move_backward.pass.cpp | 30 int ia[N]; local
32 ia[i] = i;
35 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
38 assert(ia[i] == ib[i]);
48 std::unique_ptr<int> ia[N]; local
50 ia[i].reset(new int(i));
53 OutIter r = std::move_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
|
