| /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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| unordered_map.h | 1 // TR1 unordered_map implementation -*- C++ -*-
25 /** @file tr1/unordered_map.h
27 * Do not attempt to use it directly. @headername{tr1/unordered_map}
180 class unordered_map class in namespace:tr1
193 unordered_map(size_type __n = 10, function in class:tr1::unordered_map
201 unordered_map(_InputIterator __f, _InputIterator __l, function in class:tr1::unordered_map
266 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
267 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| unordered_map.h | 1 // TR1 unordered_map implementation -*- C++ -*-
25 /** @file tr1/unordered_map.h
27 * Do not attempt to use it directly. @headername{tr1/unordered_map}
180 class unordered_map class in namespace:tr1
193 unordered_map(size_type __n = 10, function in class:tr1::unordered_map
201 unordered_map(_InputIterator __f, _InputIterator __l, function in class:tr1::unordered_map
266 swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
267 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| unordered_map.h | 0 // unordered_map implementation -*- C++ -*-
25 /** @file bits/unordered_map.h
27 * Do not attempt to use it directly. @headername{unordered_map}
37 /// Base types for unordered_map.
97 class unordered_map : __check_copy_constructible<_Alloc> class in inherits:__check_copy_constructible
138 unordered_map(size_type __n = 10, function in class:unordered_map
146 * @brief Builds an %unordered_map from a range.
154 * Create an %unordered_map consisting of copies of the elements from
159 unordered_map(_InputIterator __f, _InputIterator __l, function in class:unordered_map
168 unordered_map(const unordered_map&) = default
184 unordered_map(initializer_list<value_type> __l, function in class:unordered_map
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| unordered_map.h | 0 // unordered_map implementation -*- C++ -*-
25 /** @file bits/unordered_map.h
27 * Do not attempt to use it directly. @headername{unordered_map}
37 /// Base types for unordered_map.
97 class unordered_map : __check_copy_constructible<_Alloc> class in inherits:__check_copy_constructible
138 unordered_map(size_type __n = 10, function in class:unordered_map
146 * @brief Builds an %unordered_map from a range.
154 * Create an %unordered_map consisting of copies of the elements from
159 unordered_map(_InputIterator __f, _InputIterator __l, function in class:unordered_map
168 unordered_map(const unordered_map&) = default
184 unordered_map(initializer_list<value_type> __l, function in class:unordered_map
[all...] |
| /external/clang/test/SemaTemplate/ |
| default-expr-arguments.cpp | 321 struct unordered_map { struct in namespace:PR13758
322 explicit unordered_map(int n = 42);
323 unordered_map(move_from<K> other);
327 new unordered_map<void>();
328 new unordered_map<void>;
|
