Lines Matching refs:__k
1006 mapped_type& operator[](const key_type& __k);
1008 mapped_type& operator[](key_type&& __k);
1011 mapped_type& at(const key_type& __k);
1012 const mapped_type& at(const key_type& __k) const;
1076 size_type erase(const key_type& __k)
1077 {return __tree_.__erase_unique(__k);}
1090 iterator find(const key_type& __k) {return __tree_.find(__k);}
1092 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1097 find(const _K2& __k) {return __tree_.find(__k);}
1101 find(const _K2& __k) const {return __tree_.find(__k);}
1105 size_type count(const key_type& __k) const
1106 {return __tree_.__count_unique(__k);}
1108 iterator lower_bound(const key_type& __k)
1109 {return __tree_.lower_bound(__k);}
1111 const_iterator lower_bound(const key_type& __k) const
1112 {return __tree_.lower_bound(__k);}
1117 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1122 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1126 iterator upper_bound(const key_type& __k)
1127 {return __tree_.upper_bound(__k);}
1129 const_iterator upper_bound(const key_type& __k) const
1130 {return __tree_.upper_bound(__k);}
1135 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1139 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1143 pair<iterator,iterator> equal_range(const key_type& __k)
1144 {return __tree_.__equal_range_unique(__k);}
1146 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1147 {return __tree_.__equal_range_unique(__k);}
1152 equal_range(const _K2& __k) {return __tree_.__equal_range_unique(__k);}
1156 equal_range(const _K2& __k) const {return __tree_.__equal_range_unique(__k);}
1173 __node_holder __construct_node_with_key(key_type&& __k);
1179 __node_holder __construct_node_with_key(const key_type& __k);
1182 __find_equal_key(__node_base_pointer& __parent, const key_type& __k);
1184 __find_equal_key(__node_base_const_pointer& __parent, const key_type& __k) const;
1187 // Find place to insert if __k doesn't exist
1190 // If __k exists, set parent to node of __k and return reference to node of __k
1194 const key_type& __k)
1201 if (__tree_.value_comp().key_comp()(__k, __nd->__value_.__cc.first))
1211 else if (__tree_.value_comp().key_comp()(__nd->__value_.__cc.first, __k))
1232 // Find __k
1234 // return reference to null leaf iv __k does not exist.
1235 // If __k exists, set parent to node of __k and return reference to node of __k
1239 const key_type& __k) const
1246 if (__tree_.value_comp().key_comp()(__k, __nd->__value_.__cc.first))
1256 else if (__tree_.value_comp().key_comp()(__nd->__value_.__cc.first, __k))
1320 map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(key_type&& __k)
1324 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), _VSTD::move(__k));
1354 map<_Key, _Tp, _Compare, _Allocator>::__construct_node_with_key(const key_type& __k)
1358 __node_traits::construct(__na, _VSTD::addressof(__h->__value_.__cc.first), __k);
1367 map<_Key, _Tp, _Compare, _Allocator>::operator[](const key_type& __k)
1370 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1374 __node_holder __h = __construct_node_with_key(__k);
1385 map<_Key, _Tp, _Compare, _Allocator>::operator[](key_type&& __k)
1388 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1392 __node_holder __h = __construct_node_with_key(_VSTD::move(__k));
1403 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k)
1406 __node_base_pointer& __child = __find_equal_key(__parent, __k);
1416 map<_Key, _Tp, _Compare, _Allocator>::at(const key_type& __k) const
1419 __node_base_const_pointer __child = __find_equal_key(__parent, __k);
1807 size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
1820 iterator find(const key_type& __k) {return __tree_.find(__k);}
1822 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1827 find(const _K2& __k) {return __tree_.find(__k);}
1831 find(const _K2& __k) const {return __tree_.find(__k);}
1835 size_type count(const key_type& __k) const
1836 {return __tree_.__count_multi(__k);}
1838 iterator lower_bound(const key_type& __k)
1839 {return __tree_.lower_bound(__k);}
1841 const_iterator lower_bound(const key_type& __k) const
1842 {return __tree_.lower_bound(__k);}
1847 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1852 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1856 iterator upper_bound(const key_type& __k)
1857 {return __tree_.upper_bound(__k);}
1859 const_iterator upper_bound(const key_type& __k) const
1860 {return __tree_.upper_bound(__k);}
1865 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1869 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1873 pair<iterator,iterator> equal_range(const key_type& __k)
1874 {return __tree_.__equal_range_multi(__k);}
1876 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1877 {return __tree_.__equal_range_multi(__k);}
1882 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
1886 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}