Searched refs:unordered_map (Results 1 - 25 of 735) sorted by relevance

1234567891011>>

/external/libcxx/test/std/containers/unord/unord.map/unord.map.modifiers/
H A Dinsert_and_emplace_allocator_requirements.pass.cpp10 // <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 Derase_iter_db2.pass.cpp10 // <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 Derase_iter_db1.pass.cpp10 // <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 Derase_iter_iter_db4.pass.cpp10 // <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 Derase_iter_iter_db1.pass.cpp10 // <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 Derase_iter_iter_db2.pass.cpp10 // <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 Derase_iter_iter_db3.pass.cpp10 // <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 Dempty.fail.cpp11 // <unordered_map>
13 // class unordered_map
20 #include <unordered_map>
26 std::unordered_map<int, int> c;
H A Dallocator_mismatch.fail.cpp10 // <unordered_map>
13 #include <unordered_map>
17 std::unordered_map<int, int, std::hash<int>, std::less<int>, std::allocator<long> > m;
H A Dmax_bucket_count.pass.cpp10 // <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 Dindex_tuple.pass.cpp12 // <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 Dversion.pass.cpp10 // <unordered_map>
12 #include <unordered_map>
/external/libcxx/test/std/containers/unord/unord.multimap/
H A Dempty.fail.cpp11 // <unordered_map>
20 #include <unordered_map>
H A Dscary.pass.cpp10 // <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 Dallocator_mismatch.fail.cpp10 // <unordered_map>
13 #include <unordered_map>
/external/libcxx/test/std/containers/unord/unord.multimap/unord.multimap.modifiers/
H A Dinsert_allocator_requirements.pass.cpp10 // <unordered_map>
18 #include <unordered_map>
/external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/
H A Dcompare_copy_constructible.fail.cpp13 // <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 Dhash_copy_constructible.fail.cpp13 // <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 Dheader_unordered_map_libcpp_version.pass.cpp12 // <experimental/unordered_map>
14 #include <experimental/unordered_map>
/external/tensorflow/tensorflow/core/grappler/optimizers/
H A Dstatic_schedule.h19 #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 Dscc.h19 #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 Dunordered.h30 // 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 Ddb_swap_1.pass.cpp10 // <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 Dname_uniquer.h20 #include <unordered_map>
53 std::unordered_map<string, int64> generated_names_;
/external/tensorflow/tensorflow/core/common_runtime/gpu/
H A Dgpu_stream_util.h19 #include <unordered_map>
40 std::unordered_map<int, int>* node_to_stream_id);

Completed in 516 milliseconds

1234567891011>>