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

1234567891011>>

/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/priority.queue/priqueue.cons/
H A D	ctor_comp_rcontainer.pass.cpp	24 make(int n) function 35 std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
H A D	assign_move.pass.cpp	24 make(int n) function 35 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	24 make(int n) function 35 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/
H A D	ctor_rcontainer.pass.cpp	24 make(int n) function 35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	ctor_container.pass.cpp	20 make(int n) function 30 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	24 make(int n) function 35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/stack/stack.cons/
H A D	ctor_rcontainer.pass.cpp	24 make(int n) function 35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	ctor_container.pass.cpp	20 make(int n) function 30 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	24 make(int n) function 35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/priority.queue/priqueue.cons/
H A D	ctor_comp_rcontainer.pass.cpp	24 make(int n) function 35 std::priority_queue<MoveOnly> q(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
H A D	assign_move.pass.cpp	24 make(int n) function 35 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	24 make(int n) function 35 std::priority_queue<MoveOnly> qo(std::less<MoveOnly>(), make<std::vector<MoveOnly> >(5));
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/
H A D	ctor_rcontainer.pass.cpp	24 make(int n) function 35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
H A D	ctor_container.pass.cpp	20 make(int n) function 30 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	24 make(int n) function 35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/stack/stack.cons/
H A D	ctor_rcontainer.pass.cpp	24 make(int n) function 35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/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	24 make(int n) function 35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/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	24 make(int n) function 35 std::stack<MoveOnly> q(make<std::deque<MoveOnly> >(5));

Completed in 218 milliseconds

1234567891011>>

Indexes created Sun Aug 12 02:23:12 CEST 2018