| /external/libcxx/test/std/containers/unord/unord.map/ |
| version.pass.cpp | 10 // <unordered_map>
12 #include <unordered_map>
|
| compare.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
19 #include <unordered_map>
38 std::unordered_map<Key, int>::iterator it =
39 std::unordered_map<Key, int>().find(Key(0));
40 std::pair<std::unordered_map<Key, int>::iterator, bool> result =
41 std::unordered_map<Key, int>().insert(std::make_pair(Key(0), 0));
|
| max_size.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
18 #include <unordered_map>
26 std::unordered_map<int, int> u;
31 std::unordered_map<int, int, std::hash<int>, std::equal_to<int>,
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/ |
| version.pass.cpp | 10 // <unordered_map>
12 #include <unordered_map>
|
| compare.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
19 #include <unordered_map>
38 std::unordered_map<Key, int>::iterator it =
39 std::unordered_map<Key, int>().find(Key(0));
40 std::pair<std::unordered_map<Key, int>::iterator, bool> result =
41 std::unordered_map<Key, int>().insert(std::make_pair(Key(0), 0));
|
| max_size.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
18 #include <unordered_map>
26 std::unordered_map<int, int> u;
31 std::unordered_map<int, int, std::hash<int>, std::equal_to<int>,
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.elem/ |
| index_tuple.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
20 #include <unordered_map>
38 unordered_map<tuple<int,int>, size_t, my_hash> m;
|
| /external/libcxx/test/std/containers/unord/unord.multimap/ |
| scary.pass.cpp | 10 // <unordered_map>
12 // class unordered_map class unordered_multimap
14 // Extension: SCARY/N2913 iterator compatibility between unordered_map and unordered_multimap
16 #include <unordered_map>
20 typedef std::unordered_map<int, int> M1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.elem/ |
| index_tuple.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
20 #include <unordered_map>
38 unordered_map<tuple<int,int>, size_t, my_hash> m;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multimap/ |
| scary.pass.cpp | 10 // <unordered_map>
12 // class unordered_map class unordered_multimap
14 // Extension: SCARY/N2913 iterator compatibility between unordered_map and unordered_multimap
16 #include <unordered_map>
20 typedef std::unordered_map<int, int> M1;
|
| /external/libcxx/test/std/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_db2.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::const_iterator i = l2.begin();
|
| erase_iter_db1.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| erase_iter_iter_db1.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unorder.map.modifiers/ |
| erase_iter_db2.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::const_iterator i = l2.begin();
|
| erase_iter_db1.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
26 std::unordered_map<int, int> l1(a1, a1+3);
27 std::unordered_map<int, int>::const_iterator i = l1.end();
|
| erase_iter_iter_db4.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int>::iterator i = l1.erase(next(l1.cbegin()), l1.cbegin());
|
| erase_iter_iter_db1.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin()));
|
| erase_iter_iter_db2.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin()));
|
| erase_iter_iter_db3.pass.cpp | 10 // <unordered_map>
18 #include <unordered_map>
28 std::unordered_map<int, int> l1(a1, a1+3);
29 std::unordered_map<int, int> l2(a1, a1+3);
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin()));
|
| /external/google-breakpad/src/common/ |
| unordered.h | 30 // Include this file to use unordered_map and unordered_set. If tr1
45 struct unordered_map : public hash_map<T, U, H> {}; struct in inherits:hash_map
50 #include <unordered_map>
52 using std::unordered_map;
56 #include <tr1/unordered_map>
58 using std::tr1::unordered_map;
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| db_swap_1.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
16 // void swap(unordered_map& x, unordered_map& y);
22 #include <unordered_map>
32 std::unordered_map<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 std::unordered_map<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 std::unordered_map<int, int>::iterator i1 = c1.begin();
35 std::unordered_map<int, int>::iterator i2 = c2.begin();
39 std::unordered_map<int, int>::iterator j = i1
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.map/unord.map.swap/ |
| db_swap_1.pass.cpp | 10 // <unordered_map>
14 // class unordered_map
16 // void swap(unordered_map& x, unordered_map& y);
22 #include <unordered_map>
32 std::unordered_map<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
33 std::unordered_map<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
34 std::unordered_map<int, int>::iterator i1 = c1.begin();
35 std::unordered_map<int, int>::iterator i2 = c2.begin();
39 std::unordered_map<int, int>::iterator j = i1
[all...] |
