| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| H A D | shrink_to_fit.pass.cpp | 52 testN(int start, int N) in testN() function 65 testN<std::deque<int> >(rng[i], rng[j]); in main() 73 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | resize_size.pass.cpp | 62 testN(int start, int N, int M) in testN() function 76 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 85 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| H A D | resize_size_value.pass.cpp | 62 testN(int start, int N, int M) in testN() function 76 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 85 testN<std::deque<int, min_allocator<int>>>(rng[i], rng[j], rng[k]); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| H A D | pop_back.pass.cpp | 58 testN(int start, int N) in testN() function 74 testN<std::deque<int> >(rng[i], rng[j]); in main() 82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | pop_front.pass.cpp | 58 testN(int start, int N) in testN() function 74 testN<std::deque<int> >(rng[i], rng[j]); in main() 82 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | push_front.pass.cpp | 60 testN(int start, int N) in testN() function 73 testN<std::deque<int> >(rng[i], rng[j]); in main() 81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | push_front_rvalue.pass.cpp | 64 testN(int start, int N) in testN() function 78 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main() 85 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
|
| H A D | emplace_front.pass.cpp | 71 testN(int start, int N) in testN() function 85 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main() 92 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| H A D | emplace_back.pass.cpp | 71 testN(int start, int N) in testN() function 84 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main() 91 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| H A D | emplace.pass.cpp | 61 testN(int start, int N) in testN() function 97 testN<std::deque<Emplaceable> >(rng[i], rng[j]); in main() 104 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[j]); in main()
|
| H A D | insert_rvalue.pass.cpp | 67 testN(int start, int N) in testN() function 102 testN<std::deque<MoveOnly> >(rng[i], rng[j]); in main() 109 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[j]); in main()
|
| H A D | erase_iter.pass.cpp | 81 testN(int start, int N) in testN() function 98 testN<std::deque<int> >(rng[i], rng[j]); in main() 106 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | insert_value.pass.cpp | 63 testN(int start, int N) in testN() function 124 testN<std::deque<int> >(rng[i], rng[j]); in main() 133 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | erase_iter_iter.pass.cpp | 84 testN(int start, int N) in testN() function 105 testN<std::deque<int> >(rng[i], rng[j]); in main() 113 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | insert_size_value.pass.cpp | 65 testN(int start, int N, int M) in testN() function 143 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 153 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| H A D | insert_iter_iter.pass.cpp | 107 testN(int start, int N, int M) in testN() function 270 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 283 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | assign_size_value.pass.cpp | 57 testN(int start, int N, int M) in testN() function 71 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 80 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| H A D | assign_iter_iter.pass.cpp | 58 testN(int start, int N, int M) in testN() function 93 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in basic_test() 103 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in basic_test()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.special/ |
| H A D | copy.pass.cpp | 47 void testN(int start, int N) in testN() function 77 testN<std::deque<int> >(rng[i], rng[j]); in main() 85 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | move.pass.cpp | 47 void testN(int start, int N) in testN() function 76 testN<std::deque<int> >(rng[i], rng[j]); in main() 84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | copy_backward.pass.cpp | 47 void testN(int start, int N) in testN() function 76 testN<std::deque<int> >(rng[i], rng[j]); in main() 84 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]); in main()
|
| H A D | move_backward.pass.cpp | 47 void testN(int start, int N) in testN() function 76 testN<std::deque<int> >(rng[i], rng[j]); in main() 84 testN<std::deque<int, min_allocator<int> > >(rng[i], rng[j]); in main()
|
| H A D | swap.pass.cpp | 43 void testN(int start, int N, int M) in testN() function 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main() 95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
|
| /llvm-project-15.0.7/clang/test/Sema/ |
| H A D | assign.c | 93 void testN(struct N1 *l) { in testN() function
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Thumb/ |
| H A D | inlineasm-imm-thumb.ll | 34 define i32 @testN(i32 %x) {
|