| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 27 int ib[] = {1, 1, 0}; in test_constexpr() local
43 const int ib[] = {0}; in main() local
70 const int ib[] = {1}; in main() local
85 const int ib[] = {0, 0}; in main() local
103 const int ib[] = {0, 1}; in main() local
117 const int ib[] = {1, 0}; in main() local
131 const int ib[] = {1, 1}; in main() local
145 const int ib[] = {0, 0}; in main() local
159 const int ib[] = {0, 1}; in main() local
177 const int ib[] = {1, 0}; in main() local
[all …]
|
| D | is_permutation_pred.pass.cpp | 34 int ib[] = {1, 1, 0}; in test_constexpr() local
51 const int ib[] = {0}; in main() local
76 const int ib[] = {1}; in main() local
93 const int ib[] = {0, 0}; in main() local
114 const int ib[] = {0, 1}; in main() local
130 const int ib[] = {1, 0}; in main() local
146 const int ib[] = {1, 1}; in main() local
162 const int ib[] = {0, 0}; in main() local
178 const int ib[] = {0, 1}; in main() local
199 const int ib[] = {1, 0}; in main() local
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 27 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
41 int ib[] = {1, 2, 3}; in test() local
|
| D | lexicographical_compare_comp.pass.cpp | 29 int ib[] = {1, 3, 5, 2, 4, 6}; in test_constexpr() local
44 int ib[] = {1, 2, 3}; in test() local
|
| /external/mesa3d/src/mesa/drivers/dri/i965/ |
| D | brw_primitive_restart.c | 45 const struct _mesa_index_buffer *ib) in can_cut_index_handle_restart_index()
80 const struct _mesa_index_buffer *ib) in can_cut_index_handle_prims()
132 const struct _mesa_index_buffer *ib, in brw_handle_primitive_restart()
|
| /external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 26 const char ib[] = "123"; in main() local
39 const wchar_t ib[] = L"123"; in main() local
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| D | equal.pass.cpp | 31 int ib[] = {1, 3}; in test_constexpr() local
52 int ib[s] = {0, 1, 2, 5, 4, 5}; in main() local
|
| D | equal_pred.pass.cpp | 38 int ib[] = {1, 3}; in test_constexpr() local
66 int ib[s] = {0, 1, 2, 5, 4, 5}; in main() local
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.replace/ |
| D | replace_copy.pass.cpp | 30 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
48 int ib[sa] = {0}; in test() local
|
| D | replace_copy_if.pass.cpp | 33 int ib[] = {0, 0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
51 int ib[sa] = {0}; in test() local
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| D | binary_transform.pass.cpp | 28 const int ib[] = {2, 4, 7, 8}; in test_constexpr() local
49 int ib[sa] = {1, 2, 3, 4, 5}; in test() local
|
| D | unary_transform.pass.cpp | 31 int ib[] = {0, 0, 0, 0, 0}; // one bigger in test_constexpr() local
50 int ib[sa] = {0}; in test() local
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/ |
| D | find_first_of.pass.cpp | 26 int ib[] = {7, 8, 9}; in test_constexpr() local
46 int ib[] = {1, 3, 5, 7}; in main() local
|
| D | find_first_of_pred.pass.cpp | 28 int ib[] = {7, 8, 9}; in test_constexpr() local
48 int ib[] = {1, 3, 5, 7}; in main() local
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.remove/ |
| D | remove_copy.pass.cpp | 26 int ib[std::size(ia)] = {0}; in test_constexpr() local
43 int ib[sa]; in test() local
|
| D | remove_copy_if.pass.cpp | 30 int ib[std::size(ia)] = {0}; in test_constexpr() local
47 int ib[sa]; in test() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 27 int ib[] = {2, 4}; in test_constexpr() local
42 int ib[] = {2, 4}; in test() local
|
| D | includes_comp.pass.cpp | 28 int ib[] = {2, 4}; in test_constexpr() local
45 int ib[] = {2, 4}; in test() local
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| D | move_backward.pass.cpp | 32 int ib[N] = {0}; in test() local
49 std::unique_ptr<int> ib[N]; in test1() local
|
| D | move.pass.cpp | 32 int ib[N] = {0}; in test() local
49 std::unique_ptr<int> ib[N]; in test1() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.merge/ |
| D | merge.pass.cpp | 53 int* ib = new int[N]; in test() local
72 int* ib = new int[N]; in test() local
|
| D | merge_comp.pass.cpp | 58 int* ib = new int[N]; in test() local
81 int* ib = new int[N]; in test() local
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| D | set_intersection.pass.cpp | 30 const int ib[] = {2, 4, 4, 6}; in test_constexpr() local
51 int ib[] = {2, 4, 4, 6}; in test() local
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| D | u_index_modify.c | 30 struct pipe_index_buffer *ib, in util_shorten_ubyte_elts_to_userptr()
65 struct pipe_index_buffer *ib, in util_rebuild_ushort_elts_to_userptr()
99 struct pipe_index_buffer *ib, in util_rebuild_uint_elts_to_userptr()
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch.pass.cpp | 30 int ib[] = {1, 3}; in test_constexpr() local
66 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
|