| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| assign_move.pass.cpp | 23 make(int n) function
36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| ctor_comp_container.pass.cpp | 20 make(int n) function
30 std::vector<int> v = make<std::vector<int> >(5);
|
| ctor_comp_rcontainer.pass.cpp | 23 make(int n) function
36 std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| ctor_move.pass.cpp | 23 make(int n) function
36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
|
| assign_copy.pass.cpp | 20 make(int n) function
30 std::vector<int> v = make<std::vector<int> >(5);
|
| ctor_copy.pass.cpp | 20 make(int n) function
30 std::vector<int> v = make<std::vector<int> >(5);
|
| /external/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
| ctor_container.pass.cpp | 19 make(int n) function
29 std::deque<int> d = make<std::deque<int> >(5);
|
| ctor_copy.pass.cpp | 19 make(int n) function
29 std::queue<int> q(make<std::deque<int> >(5));
|
| ctor_move.pass.cpp | 23 make(int n) function
36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| ctor_rcontainer.pass.cpp | 23 make(int n) function
36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| /external/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| assign_copy.pass.cpp | 19 make(int n) function
29 std::queue<int> q(make<std::deque<int> >(5));
|
| assign_move.pass.cpp | 23 make(int n) function
36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| swap.pass.cpp | 19 make(int n) function
29 std::queue<int> q1 = make<std::queue<int> >(5);
30 std::queue<int> q2 = make<std::queue<int> >(10);
|
| /external/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
| ctor_container.pass.cpp | 19 make(int n) function
29 std::deque<int> d = make<std::deque<int> >(5);
|
| ctor_copy.pass.cpp | 19 make(int n) function
29 std::stack<int> q(make<std::deque<int> >(5));
|
| ctor_move.pass.cpp | 23 make(int n) function
36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| ctor_rcontainer.pass.cpp | 23 make(int n) function
36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| /external/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| assign_copy.pass.cpp | 19 make(int n) function
29 std::stack<int> q(make<std::deque<int> >(5));
|
| assign_move.pass.cpp | 23 make(int n) function
36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
|
| /external/javassist/sample/evolve/ |
| Sample.java | 9 public static Object make(Object[] args) {
method in class:Sample
10 return VersionManager.make(_version, args);
|
| /external/libcxx/test/containers/container.adaptors/queue/queue.ops/ |
| lt.pass.cpp | 29 make(int n) function
39 std::queue<int> q1 = make<std::queue<int> >(5);
40 std::queue<int> q2 = make<std::queue<int> >(10);
|
| eq.pass.cpp | 23 make(int n) function
33 std::queue<int> q1 = make<std::queue<int> >(5);
34 std::queue<int> q2 = make<std::queue<int> >(10);
|
| /external/libcxx/test/containers/container.adaptors/stack/stack.ops/ |
| lt.pass.cpp | 29 make(int n) function
39 std::stack<int> q1 = make<std::stack<int> >(5);
40 std::stack<int> q2 = make<std::stack<int> >(10);
|
| /external/libcxx/test/containers/sequences/deque/deque.capacity/ |
| access.pass.cpp | 31 make(int size, int start = 0 ) function
54 std::deque<int> c = make<std::deque<int> >(10);
63 const std::deque<int> c = make<std::deque<int> >(10);
73 std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
82 const std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10);
|
| /external/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| erase_iter.pass.cpp | 21 make(int size, int start = 0 ) function
67 C c1 = make<C>(N, start);
|
