/external/libcxx/test/std/containers/unord/unord.set/unord.set.cnstr/ |
size_hash.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 16 // unordered_set(size_type n, const hasher& hf); 18 #include <unordered_set> 31 typedef std::unordered_set<NotConstructible, 51 typedef std::unordered_set<NotConstructible,
|
/frameworks/base/tools/aapt2/link/ |
Linkers.h | 21 #include <unordered_set> 114 explicit ProductFilter(std::unordered_set<std::string> products) : products_(products) { 126 std::unordered_set<std::string> products_;
|
/hardware/interfaces/graphics/mapper/2.0/vts/functional/ |
VtsHalGraphicsMapperTestUtils.h | 20 #include <unordered_set> 87 std::unordered_set<const native_handle_t*> mClonedBuffers; 88 std::unordered_set<const native_handle_t*> mImportedBuffers;
|
/hardware/libhardware/modules/sensors/dynamic_sensor/ |
HidRawDevice.h | 24 #include <unordered_set> 36 HidRawDevice(const std::string &devName, const std::unordered_set<unsigned int> &usageSet); 52 bool generateDigest(const std::unordered_set<uint32_t> &usage);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
emplace.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 19 #include <unordered_set> 29 typedef std::unordered_set<Emplaceable> C; 49 typedef std::unordered_set<Emplaceable, std::hash<Emplaceable>,
|
erase_const_iter.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 26 typedef std::unordered_set<int> C; 47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
find_const.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 26 typedef std::unordered_set<int> C; 47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
find_non_const.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 26 typedef std::unordered_set<int> C; 47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
insert_range.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 19 #include <unordered_set> 28 typedef std::unordered_set<int> C; 49 typedef std::unordered_set<int, std::hash<int>,
|
iterators.fail.cpp | 10 // <unordered_set> 14 // class unordered_set 23 #include <unordered_set> 29 typedef std::unordered_set<int> C; 50 typedef std::unordered_set<int> C;
|
rehash.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 36 typedef std::unordered_set<int> C; 63 typedef std::unordered_set<int, std::hash<int>,
|
reserve.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 36 typedef std::unordered_set<int> C; 63 typedef std::unordered_set<int, std::hash<int>,
|
eq.pass.cpp | 10 // <unordered_set> 14 // operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, 15 // const unordered_set<Key, Hash, Pred, Alloc>& y); 19 // operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, 20 // const unordered_set<Key, Hash, Pred, Alloc>& y); 22 #include <unordered_set> 30 typedef std::unordered_set<int> C; 49 typedef std::unordered_set<int> C; 68 typedef std::unordered_set<int> C; 95 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.cnstr/ |
size.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 16 // explicit unordered_set(size_type n); 18 #include <unordered_set> 30 typedef std::unordered_set<NotConstructible, 48 typedef std::unordered_set<NotConstructible,
|
size_hash.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 16 // unordered_set(size_type n, const hasher& hf); 18 #include <unordered_set> 30 typedef std::unordered_set<NotConstructible, 50 typedef std::unordered_set<NotConstructible,
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
emplace.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 19 #include <unordered_set> 29 typedef std::unordered_set<Emplaceable> C; 49 typedef std::unordered_set<Emplaceable, std::hash<Emplaceable>,
|
find_const.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 26 typedef std::unordered_set<int> C; 47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
find_non_const.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 18 #include <unordered_set> 26 typedef std::unordered_set<int> C; 47 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C;
|
insert_range.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 19 #include <unordered_set> 28 typedef std::unordered_set<int> C; 49 typedef std::unordered_set<int, std::hash<int>,
|
iterators.fail.cpp | 10 // <unordered_set> 14 // class unordered_set 23 #include <unordered_set> 29 typedef std::unordered_set<int> C; 50 typedef std::unordered_set<int> C;
|
eq.pass.cpp | 10 // <unordered_set> 14 // operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, 15 // const unordered_set<Key, Hash, Pred, Alloc>& y); 19 // operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, 20 // const unordered_set<Key, Hash, Pred, Alloc>& y); 22 #include <unordered_set> 30 typedef std::unordered_set<int> C; 49 typedef std::unordered_set<int> C; 68 typedef std::unordered_set<int> C; 95 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.cnstr/ |
size.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 16 // explicit unordered_set(size_type n); 18 #include <unordered_set> 30 typedef std::unordered_set<NotConstructible, 48 typedef std::unordered_set<NotConstructible,
|
size_hash.pass.cpp | 10 // <unordered_set> 14 // class unordered_set 16 // unordered_set(size_type n, const hasher& hf); 18 #include <unordered_set> 30 typedef std::unordered_set<NotConstructible, 50 typedef std::unordered_set<NotConstructible,
|
/bionic/linker/ |
linker_namespaces.h | 36 #include <unordered_set> 43 const std::unordered_set<std::string>& shared_lib_sonames) 51 const std::unordered_set<std::string>& shared_lib_sonames() const { 61 const std::unordered_set<std::string> shared_lib_sonames_; 108 const std::unordered_set<std::string>& shared_lib_sonames) {
|
/external/libcxx/test/std/containers/unord/unord.set/ |
eq.pass.cpp | 10 // <unordered_set> 14 // operator==(const unordered_set<Key, Hash, Pred, Alloc>& x, 15 // const unordered_set<Key, Hash, Pred, Alloc>& y); 19 // operator!=(const unordered_set<Key, Hash, Pred, Alloc>& x, 20 // const unordered_set<Key, Hash, Pred, Alloc>& y); 22 #include <unordered_set> 30 typedef std::unordered_set<int> C; 49 typedef std::unordered_set<int> C; 68 typedef std::unordered_set<int> C; 95 typedef std::unordered_set<int, std::hash<int>, std::equal_to<int>, min_allocator<int>> C [all...] |