/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/ |
H A D | insert_and_emplace_allocator_requirements.pass.cpp | 10 // <unordered_map> 12 // class unordered_map 20 #include <unordered_map> 27 testMapInsert<TCT::unordered_map<> >(); 28 testMapInsertHint<TCT::unordered_map<> >(); 29 testMapEmplace<TCT::unordered_map<> >(); 30 testMapEmplaceHint<TCT::unordered_map<> >();
|
H A D | 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();
|
H A D | 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();
|
H A D | 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());
|
H A D | 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()));
|
H A D | 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()));
|
H A D | 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/libcxx/test/std/containers/unord/unord.map/ |
H A D | empty.fail.cpp | 11 // <unordered_map> 13 // class unordered_map 20 #include <unordered_map> 26 std::unordered_map<int, int> c;
|
H A D | allocator_mismatch.fail.cpp | 10 // <unordered_map> 13 #include <unordered_map> 17 std::unordered_map<int, int, std::hash<int>, std::less<int>, std::allocator<long> > m;
|
H A D | max_bucket_count.pass.cpp | 10 // <unordered_map> 14 // class unordered_map 18 #include <unordered_map> 28 typedef std::unordered_map<int, std::string> C; 34 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.elem/ |
H A D | index_tuple.pass.cpp | 12 // <unordered_map> 16 // class unordered_map 22 #include <unordered_map> 34 unordered_map<tuple<int,int>, size_t, my_hash> m;
|
/external/libcxx/test/libcxx/containers/unord/unord.map/ |
H A D | version.pass.cpp | 10 // <unordered_map> 12 #include <unordered_map>
|
/external/libcxx/test/std/containers/unord/unord.multimap/ |
H A D | empty.fail.cpp | 11 // <unordered_map> 20 #include <unordered_map>
|
H A D | 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;
|
H A D | allocator_mismatch.fail.cpp | 10 // <unordered_map> 13 #include <unordered_map>
|
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/ |
H A D | insert_allocator_requirements.pass.cpp | 10 // <unordered_map> 18 #include <unordered_map>
|
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
H A D | compare_copy_constructible.fail.cpp | 13 // <unordered_map> 15 // Check that std::unordered_map fails to instantiate if the comparison predicate is 18 #include <unordered_map> 31 std::unordered_map<int, int, std::hash<int>, Comp<int> > m;
|
H A D | hash_copy_constructible.fail.cpp | 13 // <unordered_map> 15 // Check that std::unordered_map fails to instantiate if the hash function is 18 #include <unordered_map> 31 std::unordered_map<int, int, Hash<int> > m;
|
/external/libcxx/test/libcxx/experimental/memory/memory.resource.aliases/ |
H A D | header_unordered_map_libcpp_version.pass.cpp | 12 // <experimental/unordered_map> 14 #include <experimental/unordered_map>
|
/external/tensorflow/tensorflow/core/grappler/optimizers/ |
H A D | static_schedule.h | 19 #include <unordered_map> 36 std::unordered_map<const NodeDef*, Costs::NanoSeconds>* execution_times); 43 const std::unordered_map<const NodeDef*, Costs::NanoSeconds>& 45 std::unordered_map<const NodeDef*, Costs::NanoSeconds>* required_times);
|
/external/tensorflow/tensorflow/core/grappler/utils/ |
H A D | scc.h | 19 #include <unordered_map> 34 const GraphDef& graph, std::unordered_map<const NodeDef*, int>* components, 41 std::unordered_map<const NodeDef*, std::vector<int>>* loops);
|
/external/google-breakpad/src/common/ |
H A D | 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/ |
H A D | 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<in [all...] |
/external/tensorflow/tensorflow/compiler/xla/service/ |
H A D | name_uniquer.h | 20 #include <unordered_map> 53 std::unordered_map<string, int64> generated_names_;
|
/external/tensorflow/tensorflow/core/common_runtime/gpu/ |
H A D | gpu_stream_util.h | 19 #include <unordered_map> 40 std::unordered_map<int, int>* node_to_stream_id);
|