| /ndk/sources/cxx-stl/llvm-libc++/test/containers/ |
| stack_allocator.h | 8 class stack_allocator class
21 template <class U> struct rebind {typedef stack_allocator<U, N> other;};
23 stack_allocator() : ptr_(buf_) {} function in class:stack_allocator
26 stack_allocator(const stack_allocator&);// = delete;
27 stack_allocator& operator=(const stack_allocator&);// = delete;
50 swap(stack_allocator<T, N>& x, stack_allocator<T, N>& y) {}
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.cons/ |
| construct_iter_iter.pass.cpp | 18 #include "../../../stack_allocator.h"
41 test<std::vector<int, stack_allocator<int, 63> > >(input_iterator<const int*>(a), input_iterator<const int*>(an));
42 test<std::vector<int, stack_allocator<int, 18> > >(forward_iterator<const int*>(a), forward_iterator<const int*>(an));
43 test<std::vector<int, stack_allocator<int, 18> > >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an));
44 test<std::vector<int, stack_allocator<int, 18> > >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an));
45 test<std::vector<int, stack_allocator<int, 18> > >(a, an);
|
| construct_default.pass.cpp | 19 #include "../../../stack_allocator.h"
51 std::vector<int, stack_allocator<int, 10> > v;
|
| construct_size_value.pass.cpp | 17 #include "../../../stack_allocator.h"
33 test<std::vector<int, stack_allocator<int, 50> > >(50, 5);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.capacity/ |
| shrink_to_fit.pass.cpp | 16 #include "../../../stack_allocator.h"
28 std::vector<int, stack_allocator<int, 401> > v(100);
35 std::vector<int, stack_allocator<int, 400> > v(100);
|
| resize_size.pass.cpp | 16 #include "../../../stack_allocator.h"
32 std::vector<MoveOnly, stack_allocator<MoveOnly, 300> > v(100);
51 std::vector<int, stack_allocator<int, 300> > v(100);
|
| reserve.pass.cpp | 16 #include "../../../stack_allocator.h"
36 std::vector<int, stack_allocator<int, 250> > v(100);
|
| resize_size_value.pass.cpp | 16 #include "../../../stack_allocator.h"
35 std::vector<int, stack_allocator<int, 300> > v(100);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_comp.pass.cpp | 17 #include "../../../stack_allocator.h"
21 std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q((std::less<int>()));
|
| ctor_default.pass.cpp | 17 #include "../../../stack_allocator.h"
21 std::priority_queue<int, std::vector<int, stack_allocator<int, 10> > > q;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/queue/queue.cons/ |
| ctor_default.pass.cpp | 17 #include "../../../stack_allocator.h"
21 std::queue<int, std::vector<int, stack_allocator<int, 10> > > q;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_default.pass.cpp | 18 #include "../../../stack_allocator.h"
22 std::stack<int, std::vector<int, stack_allocator<int, 10> > > q;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/deque/deque.cons/ |
| default.pass.cpp | 17 #include "../../../stack_allocator.h"
31 test<NotConstructible, stack_allocator<NotConstructible, 1> >();
|
| size.pass.cpp | 17 #include "../../../stack_allocator.h"
54 test<DefaultOnly, stack_allocator<DefaultOnly, 4096> >(4095);
|
| size_value.pass.cpp | 17 #include "../../../stack_allocator.h"
46 test<int, stack_allocator<int, 4096> >(4095, 90);
|
| iter_iter.pass.cpp | 17 #include "../../../stack_allocator.h"
57 test<stack_allocator<int, 4096> >(ab, an);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.modifiers/ |
| insert_iter_rvalue.pass.cpp | 16 #include "../../../stack_allocator.h"
35 std::vector<MoveOnly, stack_allocator<MoveOnly, 300> > v(100);
36 std::vector<MoveOnly, stack_allocator<MoveOnly, 300> >::iterator i = v.insert(v.cbegin() + 10, MoveOnly(3));
|
| insert_iter_size_value.pass.cpp | 16 #include "../../../stack_allocator.h"
34 std::vector<int, stack_allocator<int, 300> > v(100);
35 std::vector<int, stack_allocator<int, 300> >::iterator i = v.insert(v.cbegin() + 10, 5, 1);
|
| insert_iter_value.pass.cpp | 16 #include "../../../stack_allocator.h"
33 std::vector<int, stack_allocator<int, 300> > v(100);
34 std::vector<int, stack_allocator<int, 300> >::iterator i = v.insert(v.cbegin() + 10, 1);
|
| emplace_back.pass.cpp | 16 #include "../../../stack_allocator.h"
71 std::vector<A, stack_allocator<A, 4> > c;
|
| push_back.pass.cpp | 16 #include "../../../stack_allocator.h"
44 std::vector<int, stack_allocator<int, 15> > c;
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.cons/ |
| default_stack_alloc.pass.cpp | 16 #include "../../../stack_allocator.h"
33 std::list<int, stack_allocator<int, 4> > l;
|
| size_type.pass.cpp | 17 #include "../../../stack_allocator.h"
33 std::list<int, stack_allocator<int, 3> > l(3);
|
| size_value_alloc.pass.cpp | 17 #include "../../../stack_allocator.h"
44 std::list<int, stack_allocator<int, 3> > l(3, 2);
|
| input_iterator.pass.cpp | 18 #include "../../../stack_allocator.h"
45 std::list<int, stack_allocator<int, sizeof(a)/sizeof(a[0])> > l(input_iterator<const int*>(a),
|
