Lines Matching refs:__k
760 size_type erase(const key_type& __k)
761 {return __tree_.__erase_unique(__k);}
842 iterator find(const key_type& __k) {return __tree_.find(__k);}
844 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
849 find(const _K2& __k) {return __tree_.find(__k);}
853 find(const _K2& __k) const {return __tree_.find(__k);}
857 size_type count(const key_type& __k) const
858 {return __tree_.__count_unique(__k);}
863 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
868 bool contains(const key_type& __k) const {return find(__k) != end();}
872 contains(const _K2& __k) const { return find(__k) != end(); }
876 iterator lower_bound(const key_type& __k)
877 {return __tree_.lower_bound(__k);}
879 const_iterator lower_bound(const key_type& __k) const
880 {return __tree_.lower_bound(__k);}
885 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
890 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
894 iterator upper_bound(const key_type& __k)
895 {return __tree_.upper_bound(__k);}
897 const_iterator upper_bound(const key_type& __k) const
898 {return __tree_.upper_bound(__k);}
903 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
907 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
911 pair<iterator,iterator> equal_range(const key_type& __k)
912 {return __tree_.__equal_range_unique(__k);}
914 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
915 {return __tree_.__equal_range_unique(__k);}
920 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
924 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}
1292 size_type erase(const key_type& __k) {return __tree_.__erase_multi(__k);}
1374 iterator find(const key_type& __k) {return __tree_.find(__k);}
1376 const_iterator find(const key_type& __k) const {return __tree_.find(__k);}
1381 find(const _K2& __k) {return __tree_.find(__k);}
1385 find(const _K2& __k) const {return __tree_.find(__k);}
1389 size_type count(const key_type& __k) const
1390 {return __tree_.__count_multi(__k);}
1395 count(const _K2& __k) const {return __tree_.__count_multi(__k);}
1400 bool contains(const key_type& __k) const {return find(__k) != end();}
1404 contains(const _K2& __k) const { return find(__k) != end(); }
1408 iterator lower_bound(const key_type& __k)
1409 {return __tree_.lower_bound(__k);}
1411 const_iterator lower_bound(const key_type& __k) const
1412 {return __tree_.lower_bound(__k);}
1417 lower_bound(const _K2& __k) {return __tree_.lower_bound(__k);}
1422 lower_bound(const _K2& __k) const {return __tree_.lower_bound(__k);}
1426 iterator upper_bound(const key_type& __k)
1427 {return __tree_.upper_bound(__k);}
1429 const_iterator upper_bound(const key_type& __k) const
1430 {return __tree_.upper_bound(__k);}
1435 upper_bound(const _K2& __k) {return __tree_.upper_bound(__k);}
1439 upper_bound(const _K2& __k) const {return __tree_.upper_bound(__k);}
1443 pair<iterator,iterator> equal_range(const key_type& __k)
1444 {return __tree_.__equal_range_multi(__k);}
1446 pair<const_iterator,const_iterator> equal_range(const key_type& __k) const
1447 {return __tree_.__equal_range_multi(__k);}
1452 equal_range(const _K2& __k) {return __tree_.__equal_range_multi(__k);}
1456 equal_range(const _K2& __k) const {return __tree_.__equal_range_multi(__k);}