reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
224 { _M_t._M_insert_unique(__l.begin(), __l.end()); } 244 { _M_t._M_insert_unique(__l.begin(), __l.end()); } 251 { _M_t._M_insert_unique(__first, __last); } 267 { _M_t._M_insert_unique(__first, __last); } 286 { _M_t._M_insert_unique(__first, __last); } 311 operator=(const map&) = default; 315 operator=(map&&) = default; 331 _M_t._M_assign_unique(__l.begin(), __l.end()); 339 { return allocator_type(_M_t.get_allocator()); } 349 { return _M_t.begin(); } 358 { return _M_t.begin(); } 367 { return _M_t.end(); } 376 { return _M_t.end(); } 385 { return _M_t.rbegin(); } 394 { return _M_t.rbegin(); } 403 { return _M_t.rend(); } 412 { return _M_t.rend(); } 422 { return _M_t.begin(); } 431 { return _M_t.end(); } 440 { return _M_t.rbegin(); } 449 { return _M_t.rend(); } 458 { return _M_t.empty(); } 463 { return _M_t.size(); } 468 { return _M_t.max_size(); } 493 __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 512 __i = _M_t._M_emplace_hint_unique(__i, std::piecewise_construct, 569 { return _M_t._M_emplace_unique(std::forward<_Args>(__args)...); } 600 return _M_t._M_emplace_hint_unique(__pos, 796 { return _M_t._M_insert_unique(__x); } 803 { return _M_t._M_insert_unique(std::move(__x)); } 809 { return _M_t._M_emplace_unique(std::forward<_Pair>(__x)); } 856 { return _M_t._M_insert_unique_(__position, __x); } 863 { return _M_t._M_insert_unique_(__position, std::move(__x)); } 869 return _M_t._M_emplace_hint_unique(__position, 886 { _M_t._M_insert_unique(__first, __last); } 1025 { return _M_t.erase(__position); } 1031 { return _M_t.erase(__position); } 1062 { return _M_t.erase(__x); } 1082 { return _M_t.erase(__first, __last); } 1117 { _M_t.swap(__x._M_t); } 1127 { _M_t.clear(); } 1136 { return _M_t.key_comp(); } 1144 { return value_compare(_M_t.key_comp()); } 1163 { return _M_t.find(__x); } 1168 find(const _Kt& __x) -> decltype(_M_t._M_find_tr(__x)) 1169 { return _M_t._M_find_tr(__x); } 1188 { return _M_t.find(__x); } 1193 find(const _Kt& __x) const -> decltype(_M_t._M_find_tr(__x)) 1194 { return _M_t._M_find_tr(__x); } 1209 { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } 1209 { return _M_t.find(__x) == _M_t.end() ? 0 : 1; } 1214 count(const _Kt& __x) const -> decltype(_M_t._M_count_tr(__x)) 1215 { return _M_t._M_count_tr(__x); } 1233 { return _M_t.lower_bound(__x); } 1239 -> decltype(iterator(_M_t._M_lower_bound_tr(__x))) 1240 { return iterator(_M_t._M_lower_bound_tr(__x)); } 1258 { return _M_t.lower_bound(__x); } 1264 -> decltype(const_iterator(_M_t._M_lower_bound_tr(__x))) 1265 { return const_iterator(_M_t._M_lower_bound_tr(__x)); } 1278 { return _M_t.upper_bound(__x); } 1284 -> decltype(iterator(_M_t._M_upper_bound_tr(__x))) 1285 { return iterator(_M_t._M_upper_bound_tr(__x)); } 1298 { return _M_t.upper_bound(__x); } 1304 -> decltype(const_iterator(_M_t._M_upper_bound_tr(__x))) 1305 { return const_iterator(_M_t._M_upper_bound_tr(__x)); } 1327 { return _M_t.equal_range(__x); } 1333 -> decltype(pair<iterator, iterator>(_M_t._M_equal_range_tr(__x))) 1334 { return pair<iterator, iterator>(_M_t._M_equal_range_tr(__x)); } 1356 { return _M_t.equal_range(__x); } 1363 _M_t._M_equal_range_tr(__x))) 1366 _M_t._M_equal_range_tr(__x)); 1396 { return __x._M_t == __y._M_t; } 1396 { return __x._M_t == __y._M_t; } 1413 { return __x._M_t < __y._M_t; } 1413 { return __x._M_t < __y._M_t; }