Lines Matching refs:__v
567 static key_type const& __get_key(_Tp const& __v) {
568 return __v;
571 static __container_value_type const& __get_value(__node_value_type const& __v) {
572 return __v;
579 static __container_value_type&& __move(__node_value_type& __v) {
580 return _VSTD::move(__v);
625 static pair<key_type&&, mapped_type&&> __move(__node_value_type& __v) {
626 return __v.__move();
1254 pair<iterator, bool> __insert_unique(const __container_value_type& __v) {
1255 return __emplace_unique_key_args(_NodeTypes::__get_key(__v), __v);
1259 iterator __insert_unique(const_iterator __p, const __container_value_type& __v) {
1260 return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), __v).first;
1264 pair<iterator, bool> __insert_unique(__container_value_type&& __v) {
1265 return __emplace_unique_key_args(_NodeTypes::__get_key(__v), _VSTD::move(__v));
1269 iterator __insert_unique(const_iterator __p, __container_value_type&& __v) {
1270 … return __emplace_hint_unique_key_args(__p, _NodeTypes::__get_key(__v), _VSTD::move(__v)).first;
1276 pair<iterator, bool> __insert_unique(_Vp&& __v) {
1277 return __emplace_unique(_VSTD::forward<_Vp>(__v));
1283 iterator __insert_unique(const_iterator __p, _Vp&& __v) {
1284 return __emplace_hint_unique(__p, _VSTD::forward<_Vp>(__v));
1288 iterator __insert_multi(__container_value_type&& __v) {
1289 return __emplace_multi(_VSTD::move(__v));
1293 iterator __insert_multi(const_iterator __p, __container_value_type&& __v) {
1294 return __emplace_hint_multi(__p, _VSTD::move(__v));
1299 iterator __insert_multi(_Vp&& __v) {
1300 return __emplace_multi(_VSTD::forward<_Vp>(__v));
1305 iterator __insert_multi(const_iterator __p, _Vp&& __v) {
1306 return __emplace_hint_multi(__p, _VSTD::forward<_Vp>(__v));
1310 …pair<iterator, bool> __node_assign_unique(const __container_value_type& __v, __node_pointer __dest…
1363 iterator find(const _Key& __v);
1365 const_iterator find(const _Key& __v) const;
1374 iterator lower_bound(const _Key& __v)
1375 {return __lower_bound(__v, __root(), __end_node());}
1377 iterator __lower_bound(const _Key& __v,
1382 const_iterator lower_bound(const _Key& __v) const
1383 {return __lower_bound(__v, __root(), __end_node());}
1385 const_iterator __lower_bound(const _Key& __v,
1390 iterator upper_bound(const _Key& __v)
1391 {return __upper_bound(__v, __root(), __end_node());}
1393 iterator __upper_bound(const _Key& __v,
1398 const_iterator upper_bound(const _Key& __v) const
1399 {return __upper_bound(__v, __root(), __end_node());}
1401 const_iterator __upper_bound(const _Key& __v,
1424 __find_leaf_low(__parent_pointer& __parent, const key_type& __v);
1426 __find_leaf_high(__parent_pointer& __parent, const key_type& __v);
1429 __parent_pointer& __parent, const key_type& __v);
1434 __find_equal(__parent_pointer& __parent, const _Key& __v);
1437 __find_equal(__parent_pointer& __parent, const _Key& __v) const {
1438 return const_cast<__tree*>(this)->__find_equal(__parent, __v);
1444 const _Key& __v);
1849 const key_type& __v)
1856 if (value_comp()(__nd->__value_, __v))
1888 const key_type& __v)
1895 if (value_comp()(__v, __nd->__value_))
1931 const key_type& __v)
1933 if (__hint == end() || !value_comp()(*__hint, __v)) // check before
1935 // __v <= *__hint
1937 if (__prior == begin() || !value_comp()(__v, *--__prior))
1939 // *prev(__hint) <= __v <= *__hint
1951 // __v < *prev(__hint)
1952 return __find_leaf_high(__parent, __v);
1954 // else __v > *__hint
1955 return __find_leaf_low(__parent, __v);
1958 // Find place to insert if __v doesn't exist
1961 // If __v exists, set parent to node of __v and return reference to node of __v
1966 const _Key& __v)
1974 if (value_comp()(__v, __nd->__value_))
1984 else if (value_comp()(__nd->__value_, __v))
2005 // Find place to insert if __v doesn't exist
2011 // If __v exists, set parent to node of __v and return reference to node of __v
2018 const _Key& __v)
2020 if (__hint == end() || value_comp()(__v, *__hint)) // check before
2022 // __v < *__hint
2024 if (__prior == begin() || value_comp()(*--__prior, __v))
2026 // *prev(__hint) < __v < *__hint
2038 // __v <= *prev(__hint)
2039 return __find_equal(__parent, __v);
2041 else if (value_comp()(*__hint, __v)) // check after
2043 // *__hint < __v
2045 if (__next == end() || value_comp()(__v, *__next))
2047 // *__hint < __v < *_VSTD::next(__hint)
2059 // *next(__hint) <= __v
2060 return __find_equal(__parent, __v);
2062 // else __v == *__hint
2203 __tree<_Tp, _Compare, _Allocator>::__node_assign_unique(const __container_value_type& __v, __node_p…
2206 __node_base_pointer& __child = __find_equal(__parent, _NodeTypes::__get_key(__v));
2211 __nd->__value_ = __v;
2463 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v)
2465 iterator __p = __lower_bound(__v, __root(), __end_node());
2466 if (__p != end() && !value_comp()(__v, *__p))
2474 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const
2476 const_iterator __p = __lower_bound(__v, __root(), __end_node());
2477 if (__p != end() && !value_comp()(__v, *__p))
2530 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2536 if (!value_comp()(__root->__value_, __v))
2550 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2556 if (!value_comp()(__root->__value_, __v))
2570 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2576 if (value_comp()(__v, __root->__value_))
2590 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2596 if (value_comp()(__v, __root->__value_))