Lines Matching refs:__v
520 _LIBCPP_HIDE_FROM_ABI static key_type const& __get_key(_Tp const& __v) { return __v; }
521 …_ABI static __container_value_type const& __get_value(__node_value_type const& __v) { return __v; }
523 …_FROM_ABI static __container_value_type&& __move(__node_value_type& __v) { return std::move(__v); }
557 …_ABI static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) { return __v.__move(); }
1097 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(const __container_value_type& __v) {
1098 return __emplace_unique_key_args(_NodeTypes::__get_key(__v), __v);
1101 …CPP_HIDE_FROM_ABI iterator __insert_unique(const_iterator __p, const __container_value_type& __v) {
1102 return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), __v).first;
1105 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(__container_value_type&& __v) {
1106 return __emplace_unique_key_args(_NodeTypes::__get_key(__v), std::move(__v));
1109 _LIBCPP_HIDE_FROM_ABI iterator __insert_unique(const_iterator __p, __container_value_type&& __v) {
1110 return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), std::move(__v)).first;
1114 _LIBCPP_HIDE_FROM_ABI pair<iterator, bool> __insert_unique(_Vp&& __v) {
1115 return __emplace_unique(std::forward<_Vp>(__v));
1119 _LIBCPP_HIDE_FROM_ABI iterator __insert_unique(const_iterator __p, _Vp&& __v) {
1120 return __emplace_hint_unique(__p, std::forward<_Vp>(__v));
1123 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(__container_value_type&& __v) {
1124 return __emplace_multi(std::move(__v));
1127 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(const_iterator __p, __container_value_type&& __v) {
1128 return __emplace_hint_multi(__p, std::move(__v));
1132 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(_Vp&& __v) {
1133 return __emplace_multi(std::forward<_Vp>(__v));
1137 _LIBCPP_HIDE_FROM_ABI iterator __insert_multi(const_iterator __p, _Vp&& __v) {
1138 return __emplace_hint_multi(__p, std::forward<_Vp>(__v));
1142 __node_assign_unique(const __container_value_type& __v, __node_pointer __dest);
1181 _LIBCPP_HIDE_FROM_ABI iterator find(const _Key& __v);
1183 _LIBCPP_HIDE_FROM_ABI const_iterator find(const _Key& __v) const;
1191 _LIBCPP_HIDE_FROM_ABI iterator lower_bound(const _Key& __v) {
1192 return __lower_bound(__v, __root(), __end_node());
1195 …_LIBCPP_HIDE_FROM_ABI iterator __lower_bound(const _Key& __v, __node_pointer __root, __iter_pointe…
1197 _LIBCPP_HIDE_FROM_ABI const_iterator lower_bound(const _Key& __v) const {
1198 return __lower_bound(__v, __root(), __end_node());
1202 __lower_bound(const _Key& __v, __node_pointer __root, __iter_pointer __result) const;
1204 _LIBCPP_HIDE_FROM_ABI iterator upper_bound(const _Key& __v) {
1205 return __upper_bound(__v, __root(), __end_node());
1208 …_LIBCPP_HIDE_FROM_ABI iterator __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointe…
1210 _LIBCPP_HIDE_FROM_ABI const_iterator upper_bound(const _Key& __v) const {
1211 return __upper_bound(__v, __root(), __end_node());
1215 __upper_bound(const _Key& __v, __node_pointer __root, __iter_pointer __result) const;
1232 …IDE_FROM_ABI __node_base_pointer& __find_leaf_low(__parent_pointer& __parent, const key_type& __v);
1233 …DE_FROM_ABI __node_base_pointer& __find_leaf_high(__parent_pointer& __parent, const key_type& __v);
1235 __find_leaf(const_iterator __hint, __parent_pointer& __parent, const key_type& __v);
1239 …IBCPP_HIDE_FROM_ABI __node_base_pointer& __find_equal(__parent_pointer& __parent, const _Key& __v);
1241 …IDE_FROM_ABI __node_base_pointer& __find_equal(__parent_pointer& __parent, const _Key& __v) const {
1242 return const_cast<__tree*>(this)->__find_equal(__parent, __v);
1246 …(const_iterator __hint, __parent_pointer& __parent, __node_base_pointer& __dummy, const _Key& __v);
1583 __tree<_Tp, _Compare, _Allocator>::__find_leaf_low(__parent_pointer& __parent, const key_type& __v)…
1587 if (value_comp()(__nd->__value_, __v)) {
1613 __tree<_Tp, _Compare, _Allocator>::__find_leaf_high(__parent_pointer& __parent, const key_type& __v…
1617 if (value_comp()(__v, __nd->__value_)) {
1646 … _Allocator>::__find_leaf(const_iterator __hint, __parent_pointer& __parent, const key_type& __v) {
1647 if (__hint == end() || !value_comp()(*__hint, __v)) // check before
1649 // __v <= *__hint
1651 if (__prior == begin() || !value_comp()(__v, *--__prior)) {
1652 // *prev(__hint) <= __v <= *__hint
1661 // __v < *prev(__hint)
1662 return __find_leaf_high(__parent, __v);
1664 // else __v > *__hint
1665 return __find_leaf_low(__parent, __v);
1668 // Find place to insert if __v doesn't exist
1671 // If __v exists, set parent to node of __v and return reference to node of __v
1675 __tree<_Tp, _Compare, _Allocator>::__find_equal(__parent_pointer& __parent, const _Key& __v) {
1680 if (value_comp()(__v, __nd->__value_)) {
1688 } else if (value_comp()(__nd->__value_, __v)) {
1706 // Find place to insert if __v doesn't exist
1712 // If __v exists, set parent to node of __v and return reference to node of __v
1716 …const_iterator __hint, __parent_pointer& __parent, __node_base_pointer& __dummy, const _Key& __v) {
1717 if (__hint == end() || value_comp()(__v, *__hint)) // check before
1719 // __v < *__hint
1721 if (__prior == begin() || value_comp()(*--__prior, __v)) {
1722 // *prev(__hint) < __v < *__hint
1731 // __v <= *prev(__hint)
1732 return __find_equal(__parent, __v);
1733 } else if (value_comp()(*__hint, __v)) // check after
1735 // *__hint < __v
1737 if (__next == end() || value_comp()(__v, *__next)) {
1738 // *__hint < __v < *std::next(__hint)
1747 // *next(__hint) <= __v
1748 return __find_equal(__parent, __v);
1750 // else __v == *__hint
1875 __tree<_Tp, _Compare, _Allocator>::__node_assign_unique(const __container_value_type& __v, __node_p…
1877 __node_base_pointer& __child = __find_equal(__parent, _NodeTypes::__get_key(__v));
1881 __nd->__value_ = __v;
2080 …ree<_Tp, _Compare, _Allocator>::iterator __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) {
2081 iterator __p = __lower_bound(__v, __root(), __end_node());
2082 if (__p != end() && !value_comp()(__v, *__p))
2090 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const {
2091 const_iterator __p = __lower_bound(__v, __root(), __end_node());
2092 if (__p != end() && !value_comp()(__v, *__p))
2136 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v, __node_pointer __root, __iter_poi…
2138 if (!value_comp()(__root->__value_, __v)) {
2150 const _Key& __v, __node_pointer __root, __iter_pointer __result) const {
2152 if (!value_comp()(__root->__value_, __v)) {
2164 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v, __node_pointer __root, __iter_poi…
2166 if (value_comp()(__v, __root->__value_)) {
2178 const _Key& __v, __node_pointer __root, __iter_pointer __result) const {
2180 if (value_comp()(__v, __root->__value_)) {