Home
last modified time | relevance | path

Searched defs:ia (Results 1 – 25 of 171) sorted by relevance

1234567

/external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
Dis_permutation.pass.cpp29 const int ia[] = {0}; in main() local
56 const int ia[] = {0}; in main() local
71 const int ia[] = {0, 0}; in main() local
89 const int ia[] = {0, 0}; in main() local
103 const int ia[] = {0, 0}; in main() local
117 const int ia[] = {0, 0}; in main() local
131 const int ia[] = {0, 1}; in main() local
145 const int ia[] = {0, 1}; in main() local
163 const int ia[] = {0, 1}; in main() local
177 const int ia[] = {0, 1}; in main() local
[all …]
Dis_permutation_pred.pass.cpp38 const int ia[] = {0}; in main() local
63 const int ia[] = {0}; in main() local
80 const int ia[] = {0, 0}; in main() local
101 const int ia[] = {0, 0}; in main() local
117 const int ia[] = {0, 0}; in main() local
133 const int ia[] = {0, 0}; in main() local
149 const int ia[] = {0, 1}; in main() local
165 const int ia[] = {0, 1}; in main() local
186 const int ia[] = {0, 1}; in main() local
207 const int ia[] = {0, 1}; in main() local
[all …]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
Dpartition_point.pass.cpp29 const int ia[] = {2, 4, 6, 8, 10}; in main() local
35 const int ia[] = {1, 2, 4, 6, 8}; in main() local
41 const int ia[] = {1, 3, 2, 4, 6}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
53 const int ia[] = {1, 3, 5, 7, 2, 4}; in main() local
59 const int ia[] = {1, 3, 5, 7, 9, 2}; in main() local
65 const int ia[] = {1, 3, 5, 7, 9, 11}; in main() local
71 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
Dis_partitioned.pass.cpp29 const int ia[] = {1, 2, 3, 4, 5, 6}; in main() local
35 const int ia[] = {1, 3, 5, 2, 4, 6}; in main() local
41 const int ia[] = {2, 4, 6, 1, 3, 5}; in main() local
47 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
53 const int ia[] = {1, 3, 5, 2, 4, 6, 7}; in main() local
/external/libcxx/test/algorithms/alg.nonmodifying/alg.none_of/
Dnone_of.pass.cpp32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
48 const int ia[] = {1, 3, 5, 7}; in main() local
/external/libcxx/test/algorithms/alg.nonmodifying/alg.any_of/
Dany_of.pass.cpp32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
48 const int ia[] = {1, 3, 5, 7}; in main() local
/external/libcxx/test/algorithms/alg.nonmodifying/alg.all_of/
Dall_of.pass.cpp32 int ia[] = {2, 4, 6, 8}; in main() local
40 const int ia[] = {2, 4, 5, 8}; in main() local
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
Dremove.pass.cpp30 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
49 std::unique_ptr<int> ia[sa]; in test1() local
Dremove_if.pass.cpp31 int ia[] = {0, 1, 2, 3, 4, 2, 3, 4, 2}; in test() local
55 std::unique_ptr<int> ia[sa]; in test1() local
/external/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
Dcompare.pass.cpp24 const char ia[] = "1234"; in main() local
37 const wchar_t ia[] = L"1234"; in main() local
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/sort.heap/
Dsort_heap_comp.pass.cpp34 int* ia = new int [N]; in test() local
56 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/make.heap/
Dmake_heap_comp.pass.cpp34 int* ia = new int [N]; in test() local
55 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/push.heap/
Dpush_heap_comp.pass.cpp35 int* ia = new int [N]; in test() local
54 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
/external/libcxx/test/algorithms/alg.sorting/alg.heap.operations/pop.heap/
Dpop_heap_comp.pass.cpp34 int* ia = new int [N]; in test() local
55 std::unique_ptr<int>* ia = new std::unique_ptr<int> [N]; in main() local
/external/libcxx/test/algorithms/alg.modifying.operations/alg.move/
Dmove_backward.pass.cpp30 int ia[N]; in test() local
48 std::unique_ptr<int> ia[N]; in test1() local
Dmove.pass.cpp30 int ia[N]; in test() local
48 std::unique_ptr<int> ia[N]; in test1() local
/external/libcxx/test/algorithms/alg.sorting/alg.merge/
Dmerge.pass.cpp30 int* ia = new int[N]; in test() local
49 int* ia = new int[N]; in test() local
Dmerge_comp.pass.cpp33 int* ia = new int[N]; in test() local
54 int* ia = new int[N]; in test() local
Dinplace_merge_comp.pass.cpp40 int* ia = new int[N]; in test_one() local
96 std::unique_ptr<int>* ia = new std::unique_ptr<int>[N]; in main() local
/external/chromium_org/google_apis/gaia/
Doauth2_mint_token_flow_unittest.cc112 IssueAdviceInfo ia; in CreateIssueAdvice() local
255 IssueAdviceInfo ia; in TEST_F() local
263 IssueAdviceInfo ia; in TEST_F() local
271 IssueAdviceInfo ia; in TEST_F() local
326 IssueAdviceInfo ia(CreateIssueAdvice()); in TEST_F() local
/external/libcxx/test/algorithms/alg.modifying.operations/alg.fill/
Dfill_n.pass.cpp40 int ia[n] = {0}; in test_int() local
52 int ia[n] = {0}; in test_int_array() local
71 int ia[n] = {0}; in test_int_array_struct_source() local
/external/libcxx/test/numerics/numarray/template.indirect.array/
Ddefault.fail.cpp21 std::indirect_array<int> ia; in main() local
/external/libcxx/test/algorithms/alg.nonmodifying/alg.count/
Dcount_if.pass.cpp25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
Dcount.pass.cpp24 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local
/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/
Dadjacent_find_pred.pass.cpp25 int ia[] = {0, 1, 2, 2, 0, 1, 2, 3}; in main() local

1234567