| /external/protobuf/m4/ |
| D | stl_hash.m4 | 2 # unordered_map/hash_map (we prefer the first form), and what
6 # HASH_NAMESPACE to the namespace the class (unordered_map or
8 # is named unordered_map, or leave it undefined if not.
17 # First try unordered_map, but not on gcc's before 4.2 -- I've
18 # seen unexplainable unordered_map bugs with -O2 on older gcc's.
20 # error GCC too old for unordered_map
26 for location in unordered_map tr1/unordered_map; do
31 [const ${namespace}::unordered_map<int, int> t;
35 ac_cv_cxx_hash_map_class="unordered_map";])
57 [the location of <unordered_map> or <hash_map>])
|
| /external/libcxx/include/ |
| D | unordered_map | 2 //===-------------------------- unordered_map -----------------------------===//
16 unordered_map synopsis
25 class unordered_map
47 unordered_map()
52 explicit unordered_map(size_type n, const hasher& hf = hasher(),
56 unordered_map(InputIterator f, InputIterator l,
60 explicit unordered_map(const allocator_type&);
61 unordered_map(const unordered_map&);
62 unordered_map(const unordered_map&, const Allocator&);
63 unordered_map(unordered_map&&)
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.swap/ |
| D | db_swap_1.pass.cpp | 32 std::unordered_map<int, int> c1(a1, a1+sizeof(a1)/sizeof(a1[0])); in main()
33 std::unordered_map<int, int> c2(a2, a2+sizeof(a2)/sizeof(a2[0])); in main()
34 std::unordered_map<int, int>::iterator i1 = c1.begin(); in main()
35 std::unordered_map<int, int>::iterator i2 = c2.begin(); in main()
39 std::unordered_map<int, int>::iterator j = i1; in main()
|
| D | swap_noexcept.pass.cpp | 45 typedef std::unordered_map<MoveOnly, MoveOnly> C; in main()
50 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
56 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
62 typedef std::unordered_map<MoveOnly, MoveOnly, some_hash<MoveOnly>> C; in main()
67 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.cnstr/ |
| D | move_noexcept.pass.cpp | 43 typedef std::unordered_map<MoveOnly, MoveOnly> C; in main()
47 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
52 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
57 typedef std::unordered_map<MoveOnly, MoveOnly, some_hash<MoveOnly>> C; in main()
61 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
|
| D | default_noexcept.pass.cpp | 47 typedef std::unordered_map<MoveOnly, MoveOnly> C; in main()
51 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
56 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
61 typedef std::unordered_map<MoveOnly, MoveOnly, some_hash<MoveOnly>> C; in main()
65 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
|
| D | dtor_noexcept.pass.cpp | 44 typedef std::unordered_map<MoveOnly, MoveOnly> C; in main()
48 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
53 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
58 typedef std::unordered_map<MoveOnly, MoveOnly, some_hash<MoveOnly>> C; in main()
62 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
|
| D | move_assign_noexcept.pass.cpp | 46 typedef std::unordered_map<MoveOnly, MoveOnly> C; in main()
50 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
55 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
60 typedef std::unordered_map<MoveOnly, MoveOnly, some_hash<MoveOnly>> C; in main()
64 typedef std::unordered_map<MoveOnly, MoveOnly, std::hash<MoveOnly>, in main()
|
| D | move.pass.cpp | 32 typedef std::unordered_map<int, std::string, in main()
68 typedef std::unordered_map<int, std::string, in main()
110 typedef std::unordered_map<int, std::string, in main()
146 typedef std::unordered_map<int, std::string, in main()
189 std::unordered_map<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}}; in main()
190 std::unordered_map<int, int>::iterator i = s1.begin(); in main()
192 std::unordered_map<int, int> s2 = std::move(s1); in main()
|
| D | assign_move.pass.cpp | 33 typedef std::unordered_map<int, std::string, in main()
78 typedef std::unordered_map<int, std::string, in main()
124 typedef std::unordered_map<int, std::string, in main()
171 typedef std::unordered_map<int, std::string, in main()
218 std::unordered_map<int, int> s1 = {{1, 1}, {2, 2}, {3, 3}}; in main()
219 std::unordered_map<int, int>::iterator i = s1.begin(); in main()
221 std::unordered_map<int, int> s2; in main()
|
| /external/libcxx/test/std/containers/unord/unord.map/ |
| D | compare.pass.cpp | 38 std::unordered_map<Key, int>::iterator it = in main()
39 std::unordered_map<Key, int>().find(Key(0)); in main()
40 std::pair<std::unordered_map<Key, int>::iterator, bool> result = in main()
41 std::unordered_map<Key, int>().insert(std::make_pair(Key(0), 0)); in main()
|
| D | max_load_factor.pass.cpp | 32 typedef std::unordered_map<int, std::string> C; in main()
38 typedef std::unordered_map<int, std::string> C; in main()
47 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
54 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
65 typedef std::unordered_map<int, std::string> C; in main()
|
| D | eq.pass.cpp | 31 typedef std::unordered_map<int, std::string> C; in main()
50 typedef std::unordered_map<int, std::string> C; in main()
69 typedef std::unordered_map<int, std::string> C; in main()
96 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
116 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
136 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
|
| D | load_factor.pass.cpp | 28 typedef std::unordered_map<int, std::string> C; in main()
45 typedef std::unordered_map<int, std::string> C; in main()
52 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
70 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
|
| D | bucket_count.pass.cpp | 27 typedef std::unordered_map<int, std::string> C; in main()
34 typedef std::unordered_map<int, std::string> C; in main()
53 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
61 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
|
| D | iterators.pass.cpp | 32 typedef std::unordered_map<int, std::string> C; in main()
51 typedef std::unordered_map<int, std::string> C; in main()
71 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
91 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
113 typedef std::unordered_map<int,double> C; in main()
|
| /external/google-breakpad/src/common/windows/ |
| D | pdb_source_line_writer.h | 50 using std::unordered_map;
195 unordered_map<wstring, DWORD>::iterator iter = unique_files_.find(file); in StoreDuplicateFileID()
207 unordered_map<DWORD, DWORD>::iterator iter = file_ids_.find(id); in GetRealFileID()
243 unordered_map<DWORD, DWORD> file_ids_;
245 unordered_map<wstring, DWORD> unique_files_;
|
| /external/libcxx/test/std/containers/unord/unord.map/unorder.map.modifiers/ |
| D | erase_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3); in main()
29 std::unordered_map<int, int> l2(a1, a1+3); in main()
30 std::unordered_map<int, int>::const_iterator i = l2.begin(); in main()
|
| D | erase_iter_iter_db3.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3); in main()
29 std::unordered_map<int, int> l2(a1, a1+3); in main()
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l2.cbegin())); in main()
|
| D | erase_iter_iter_db1.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3); in main()
29 std::unordered_map<int, int> l2(a1, a1+3); in main()
30 std::unordered_map<int, int>::iterator i = l1.erase(l2.cbegin(), next(l1.cbegin())); in main()
|
| D | erase_iter_iter_db2.pass.cpp | 28 std::unordered_map<int, int> l1(a1, a1+3); in main()
29 std::unordered_map<int, int> l2(a1, a1+3); in main()
30 std::unordered_map<int, int>::iterator i = l1.erase(l1.cbegin(), next(l2.cbegin())); in main()
|
| /external/google-breakpad/src/common/ |
| D | unordered.h | 45 struct unordered_map : public hash_map<T, U, H> {}; struct
52 using std::unordered_map;
58 using std::tr1::unordered_map;
|
| /external/libcxx/test/std/containers/unord/unord.map/unord.map.elem/ |
| D | at.pass.cpp | 29 typedef std::unordered_map<int, std::string> C; in main()
55 typedef std::unordered_map<int, std::string> C; in main()
81 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
108 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
|
| D | index.pass.cpp | 28 typedef std::unordered_map<int, std::string> C; in main()
49 typedef std::unordered_map<MoveOnly, std::string> C; in main()
71 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, in main()
93 … typedef std::unordered_map<MoveOnly, std::string, std::hash<MoveOnly>, std::equal_to<MoveOnly>, in main()
|
| /external/openfst/src/include/fst/ |
| D | label-reachable.h | 27 using std::tr1::unordered_map;
60 unordered_map<L, L> *Label2Index() { in Label2Index()
107 unordered_map<L, L> label2index_; // Finds index for a label.
203 unordered_map<Label, Label> &label2index = *data_->Label2Index(); in Relabel()
242 unordered_map<Label, Label> &label2index = *data_->Label2Index();
244 for (typename unordered_map<Label, Label>::const_iterator
252 typename unordered_map<Label, Label>::const_iterator
395 const unordered_map<Label, Label>& Label2Index() const { in Label2Index()
479 unordered_map<Label, Label> &label2index = *data_->Label2Index(); in FindIntervals()
480 for (typename unordered_map<Label, StateId>::const_iterator in FindIntervals()
[all …]
|