Lines Matching refs:__k
1202 mapped_type& operator[](const key_type& __k);
1204 mapped_type& operator[](key_type&& __k);
1207 mapped_type& at(const key_type& __k);
1208 const mapped_type& at(const key_type& __k) const;
1279 pair<iterator, bool> try_emplace(const key_type& __k, _Args&&... __args)
1281 return __tree_.__emplace_unique_key_args(__k,
1283 _VSTD::forward_as_tuple(__k),
1289 pair<iterator, bool> try_emplace(key_type&& __k, _Args&&... __args)
1291 return __tree_.__emplace_unique_key_args(__k,
1293 _VSTD::forward_as_tuple(_VSTD::move(__k)),
1299 iterator try_emplace(const_iterator __h, const key_type& __k, _Args&&... __args)
1301 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1303 _VSTD::forward_as_tuple(__k),
1309 iterator try_emplace(const_iterator __h, key_type&& __k, _Args&&... __args)
1311 return __tree_.__emplace_hint_unique_key_args(__h.__i_, __k,
1313 _VSTD::forward_as_tuple(_VSTD::move(__k)),
1319 pair<iterator, bool> insert_or_assign(const key_type& __k, _Vp&& __v)
1321 iterator __p = lower_bound(__k);
1322 if ( __p != end() && !key_comp()(__k, __p->first))
1327 return _VSTD::make_pair(emplace_hint(__p, __k, _VSTD::forward<_Vp>(__v)), true);
1332 pair<iterator, bool> insert_or_assign(key_type&& __k, _Vp&& __v)
1334 iterator __p = lower_bound(__k);
1335 if ( __p != end() && !key_comp()(__k, __p->first))
1340 … return _VSTD::make_pair(emplace_hint(__p, _VSTD::move(__k), _VSTD::forward<_Vp>(__v)), true);
1345 const key_type& __k,
1348 __h.__i_, __k, __k, _VSTD::forward<_Vp>(__v));
1358 key_type&& __k,
1361 __h.__i_, __k, _VSTD::move(__k), _VSTD::forward<_Vp>(__v));
1376 size_type erase(const key_type& __k)
1377 {return __tree_.__erase_unique(__k);}
1451 iterator find(const key_type& __k) {return __tree_.find(__k);}
1453 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1458 find(const _K2& __k) {return __tree_.find(__k);}
1462 find(const _K2& __k) const {return __tree_.find(__k);}
1466 size_type count(const key_type& __k) const
1467 {return __tree_.__count_unique(__k);}
1472 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
1477 bool contains(const key_type& __k) const {return find(__k) != end();}
1481 contains(const _K2& __k) const { return find(__k) != end(); }
1485 iterator lower_bound(const key_type& __k)
1486 {return __tree_.lower_bound(__k);}
1488 const_iterator lower_bound(const key_type& __k) const
1489 {return __tree_.lower_bound(__k);}
1494 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1499 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1503 iterator upper_bound(const key_type& __k)
1504 {return __tree_.upper_bound(__k);}
1506 const_iterator upper_bound(const key_type& __k) const
1507 {return __tree_.upper_bound(__k);}
1512 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1516 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1520 pair<iterator,iterator> equal_range(const key_type& __k)
1521 {return __tree_.__equal_range_unique(__k);}
1523 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1524 {return __tree_.__equal_range_unique(__k);}
1529 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
1533 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
1547 __node_holder __construct_node_with_key(const key_type& __k);
1596 map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
1598 return __tree_.__emplace_unique_key_args(__k,
1600 _VSTD::forward_as_tuple(__k),
1606 map<_Key, _Tp, _Compare, _Allocator>::operator[](key_type&& __k)
1608 return __tree_.__emplace_unique_key_args(__k,
1610 _VSTD::forward_as_tuple(_VSTD::move(__k)),
1618 map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k)
1622 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__get_value().first), __k);
1631 map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
1634 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1638 __node_holder __h = __construct_node_with_key(__k);
1649 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k)
1652 __node_base_pointer& __child = __tree_.__find_equal(__parent, __k);
1660 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const
1663 __node_base_pointer __child = __tree_.__find_equal(__parent, __k);
2047 size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
2123 iterator find(const key_type& __k) {return __tree_.find(__k);}
2125 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
2130 find(const _K2& __k) {return __tree_.find(__k);}
2134 find(const _K2& __k) const {return __tree_.find(__k);}
2138 size_type count(const key_type& __k) const
2139 {return __tree_.__count_multi(__k);}
2144 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
2149 bool contains(const key_type& __k) const {return find(__k) != end();}
2153 contains(const _K2& __k) const { return find(__k) != end(); }
2157 iterator lower_bound(const key_type& __k)
2158 {return __tree_.lower_bound(__k);}
2160 const_iterator lower_bound(const key_type& __k) const
2161 {return __tree_.lower_bound(__k);}
2166 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
2171 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
2175 iterator upper_bound(const key_type& __k)
2176 {return __tree_.upper_bound(__k);}
2178 const_iterator upper_bound(const key_type& __k) const
2179 {return __tree_.upper_bound(__k);}
2184 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
2188 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
2192 pair<iterator,iterator> equal_range(const key_type& __k)
2193 {return __tree_.__equal_range_multi(__k);}
2195 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
2196 {return __tree_.__equal_range_multi(__k);}
2201 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
2205 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}