| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/ |
| erase_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::const_iterator i = l2.begin();
|
| erase_iter_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int> l2(a1, a1+3);
29 std::unordered_set<int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| erase_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
25 std::unordered_set<int> l1(a1, a1+3);
26 std::unordered_set<int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| max_size.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 std::unordered_set<int> u;
31 std::unordered_set<int, std::hash<int>,
|
| max_load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
23 #include <unordered_set>
31 typedef std::unordered_set<int> C;
37 typedef std::unordered_set<int> C;
46 typedef std::unordered_set<int, std::hash<int>,
53 typedef std::unordered_set<int, std::hash<int>,
64 typedef std::unordered_set<int> C;
|
| /external/libcxx/test/std/containers/unord/unord.set/ |
| erase_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
25 std::unordered_set<int> l1(a1, a1+3);
26 std::unordered_set<int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| max_load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
23 #include <unordered_set>
31 typedef std::unordered_set<int> C;
36 typedef std::unordered_set<int> C;
44 typedef std::unordered_set<int, std::hash<int>,
50 typedef std::unordered_set<int, std::hash<int>,
60 typedef std::unordered_set<int> C;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/ |
| erase_iter_db1.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
25 std::unordered_set<int> l1(a1, a1+3);
26 std::unordered_set<int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <unordered_set>
18 #include <unordered_set>
27 std::unordered_set<int> l1(a1, a1+3);
28 std::unordered_set<int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| max_bucket_count.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 typedef std::unordered_set<int> C;
32 typedef std::unordered_set<int, std::hash<int>,
|
| max_size.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
18 #include <unordered_set>
26 std::unordered_set<int> u;
31 std::unordered_set<int, std::hash<int>,
|
| max_load_factor.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
23 #include <unordered_set>
31 typedef std::unordered_set<int> C;
37 typedef std::unordered_set<int> C;
46 typedef std::unordered_set<int, std::hash<int>,
53 typedef std::unordered_set<int, std::hash<int>,
64 typedef std::unordered_set<int> C;
|
| /external/google-breakpad/src/common/ |
| unordered.h | 30 // Include this file to use unordered_map and unordered_set. If tr1
47 struct unordered_set : public hash_set<T, H> {}; struct in inherits:hash_set
51 #include <unordered_set>
53 using std::unordered_set;
57 #include <tr1/unordered_set>
59 using std::tr1::unordered_set;
|
| /external/libcxx/test/libcxx/containers/unord/unord.set/ |
| missing_hash_specialization.fail.cpp | 17 // <unordered_set>
22 #include <unordered_set>
49 using Set = std::unordered_set<VT>;
59 using Set = std::unordered_set<int, BadHashNoCopy>;
63 using Set = std::unordered_set<int, BadHashNoCall>;
67 using Set = std::unordered_set<int, GoodHashNoDefault>;
|
| /external/libcxx/test/std/containers/unord/unord.set/unord.set.swap/ |
| db_swap_1.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
16 // void swap(unordered_set& x, unordered_set& y);
22 #include <unordered_set>
31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 std::unordered_set<int>::iterator i1 = c1.begin();
34 std::unordered_set<int>::iterator i2 = c2.begin();
38 std::unordered_set<int>::iterator j = i1
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| unordered_set.h | 5 #include <unordered_set>
7 #include <tr1/unordered_set>
13 using std::unordered_set;
15 using std::tr1::unordered_set;
18 typedef std::tr1::unordered_set<void *> voidptr_unordered_set;
21 class unordered_set : public voidptr_unordered_set {
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.set/unord.set.swap/ |
| db_swap_1.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
16 // void swap(unordered_set& x, unordered_set& y);
22 #include <unordered_set>
31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 std::unordered_set<int>::iterator i1 = c1.begin();
34 std::unordered_set<int>::iterator i2 = c2.begin();
38 std::unordered_set<int>::iterator j = i1
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.set/unord.set.swap/ |
| db_swap_1.pass.cpp | 10 // <unordered_set>
14 // class unordered_set
16 // void swap(unordered_set& x, unordered_set& y);
22 #include <unordered_set>
31 std::unordered_set<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
32 std::unordered_set<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
33 std::unordered_set<int>::iterator i1 = c1.begin();
34 std::unordered_set<int>::iterator i2 = c2.begin();
38 std::unordered_set<int>::iterator j = i1
[all...] |
| /bionic/tools/versioner/src/ |
| SymbolDatabase.h | 22 #include <unordered_set>
26 using LibrarySymbolDatabase = std::unordered_set<std::string>;
27 std::unordered_set<std::string> getSymbols(const std::string& filename);
|
