Searched defs:make (Results 1 - 25 of 125) sorted by relevance

12345

/external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/
H A D	ctor_comp_rcontainer.pass.cpp	23 make(int n) function 36 std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
H A D	assign_move.pass.cpp	23 make(int n) function 36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
H A D	ctor_comp_container.pass.cpp	20 make(int n) function 30 std::vector<int> v = make<std::vector<int> >(5);
H A D	ctor_move.pass.cpp	23 make(int n) function 36 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
H A D	assign_copy.pass.cpp	20 make(int n) function 30 std::vector<int> v = make<std::vector<int> >(5);
H A D	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/
H A D	ctor_rcontainer.pass.cpp	23 make(int n) function 36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	ctor_container.pass.cpp	19 make(int n) function 29 std::deque<int> d = make<std::deque<int> >(5);
H A D	ctor_copy.pass.cpp	19 make(int n) function 29 std::queue<int> q(make<std::deque<int> >(5));
H A D	ctor_move.pass.cpp	23 make(int n) function 36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/external/libcxx/test/containers/container.adaptors/stack/stack.cons/
H A D	ctor_rcontainer.pass.cpp	23 make(int n) function 36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	ctor_container.pass.cpp	19 make(int n) function 29 std::deque<int> d = make<std::deque<int> >(5);
H A D	ctor_copy.pass.cpp	19 make(int n) function 29 std::stack<int> q(make<std::deque<int> >(5));
H A D	ctor_move.pass.cpp	23 make(int n) function 36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/external/libcxx/test/containers/container.adaptors/queue/queue.defn/
H A D	assign_copy.pass.cpp	19 make(int n) function 29 std::queue<int> q(make<std::deque<int> >(5));
H A D	assign_move.pass.cpp	23 make(int n) function 36 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	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.defn/
H A D	assign_copy.pass.cpp	19 make(int n) function 29 std::stack<int> q(make<std::deque<int> >(5));
H A D	assign_move.pass.cpp	23 make(int n) function 36 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/external/javassist/sample/evolve/
H A D	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/
H A D	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);
H A D	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/
H A D	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/
H A D	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/container.adaptors/queue/queue.special/
H A D	swap.pass.cpp	20 make(int n) function 30 std::queue<int> q1 = make<std::queue<int> >(5); 31 std::queue<int> q2 = make<std::queue<int> >(10);

Completed in 123 milliseconds

12345

Indexes created Fri Mar 13 02:32:08 CET 2015