HomeSort by relevance Sort by last modified time
    Searched defs:make (Results 1 - 25 of 360) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/dagger2/compiler/src/it/functional-tests/src/main/java/test/tck/
CarShop.java 34 Car make(); method in interface:CarShop
  /external/libcxx/test/std/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));
  /external/libcxx/test/std/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/std/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));
  /external/libcxx/test/std/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/std/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));
  /ndk/sources/cxx-stl/llvm-libc++/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));
  /ndk/sources/cxx-stl/llvm-libc++/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));

Completed in 490 milliseconds

1 2 3 4 5 6 7 8 91011>>