Lines Matching refs:__v
612 explicit __tree_node(const value_type& __v)
613 : __value_(__v) {}
949 pair<iterator, bool> __insert_unique(_Vp&& __v);
951 iterator __insert_unique(const_iterator __p, _Vp&& __v);
953 iterator __insert_multi(_Vp&& __v);
955 iterator __insert_multi(const_iterator __p, _Vp&& __v);
958 pair<iterator, bool> __insert_unique(const value_type& __v);
959 iterator __insert_unique(const_iterator __p, const value_type& __v);
960 iterator __insert_multi(const value_type& __v);
961 iterator __insert_multi(const_iterator __p, const value_type& __v);
982 iterator find(const _Key& __v);
984 const_iterator find(const _Key& __v) const;
993 iterator lower_bound(const _Key& __v)
994 {return __lower_bound(__v, __root(), __end_node());}
996 iterator __lower_bound(const _Key& __v,
1001 const_iterator lower_bound(const _Key& __v) const
1002 {return __lower_bound(__v, __root(), __end_node());}
1004 const_iterator __lower_bound(const _Key& __v,
1009 iterator upper_bound(const _Key& __v)
1010 {return __upper_bound(__v, __root(), __end_node());}
1012 iterator __upper_bound(const _Key& __v,
1017 const_iterator upper_bound(const _Key& __v) const
1018 {return __upper_bound(__v, __root(), __end_node());}
1020 const_iterator __upper_bound(const _Key& __v,
1043 __find_leaf_low(typename __node_base::pointer& __parent, const value_type& __v);
1045 __find_leaf_high(typename __node_base::pointer& __parent, const value_type& __v);
1048 typename __node_base::pointer& __parent, const value_type& __v);
1051 __find_equal(typename __node_base::pointer& __parent, const _Key& __v);
1055 const _Key& __v);
1061 __node_holder __construct_node(const value_type& __v);
1489 const value_type& __v)
1496 if (value_comp()(__nd->__value_, __v))
1528 const value_type& __v)
1535 if (value_comp()(__v, __nd->__value_))
1571 const value_type& __v)
1573 if (__hint == end() || !value_comp()(*__hint, __v)) // check before
1575 // __v <= *__hint
1577 if (__prior == begin() || !value_comp()(__v, *--__prior))
1579 // *prev(__hint) <= __v <= *__hint
1591 // __v < *prev(__hint)
1592 return __find_leaf_high(__parent, __v);
1594 // else __v > *__hint
1595 return __find_leaf_low(__parent, __v);
1598 // Find place to insert if __v doesn't exist
1601 // If __v exists, set parent to node of __v and return reference to node of __v
1606 const _Key& __v)
1613 if (value_comp()(__v, __nd->__value_))
1623 else if (value_comp()(__nd->__value_, __v))
1644 // Find place to insert if __v doesn't exist
1650 // If __v exists, set parent to node of __v and return reference to node of __v
1656 const _Key& __v)
1658 if (__hint == end() || value_comp()(__v, *__hint)) // check before
1660 // __v < *__hint
1662 if (__prior == begin() || value_comp()(*--__prior, __v))
1664 // *prev(__hint) < __v < *__hint
1676 // __v <= *prev(__hint)
1677 return __find_equal(__parent, __v);
1679 else if (value_comp()(*__hint, __v)) // check after
1681 // *__hint < __v
1683 if (__next == end() || value_comp()(__v, *__next))
1685 // *__hint < __v < *_VSTD::next(__hint)
1697 // *next(__hint) <= __v
1698 return __find_equal(__parent, __v);
1700 // else __v == *__hint
1802 __tree<_Tp, _Compare, _Allocator>::__insert_unique(_Vp&& __v)
1804 __node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
1814 __tree<_Tp, _Compare, _Allocator>::__insert_unique(const_iterator __p, _Vp&& __v)
1816 __node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
1826 __tree<_Tp, _Compare, _Allocator>::__insert_multi(_Vp&& __v)
1828 __node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
1838 __tree<_Tp, _Compare, _Allocator>::__insert_multi(const_iterator __p, _Vp&& __v)
1840 __node_holder __h = __construct_node(_VSTD::forward<_Vp>(__v));
1851 __tree<_Tp, _Compare, _Allocator>::__construct_node(const value_type& __v)
1855 __node_traits::construct(__na, _VSTD::addressof(__h->__value_), __v);
1864 __tree<_Tp, _Compare, _Allocator>::__insert_unique(const value_type& __v)
1867 __node_base_pointer& __child = __find_equal(__parent, __v);
1872 __node_holder __h = __construct_node(__v);
1882 __tree<_Tp, _Compare, _Allocator>::__insert_unique(const_iterator __p, const value_type& __v)
1885 __node_base_pointer& __child = __find_equal(__p, __parent, __v);
1889 __node_holder __h = __construct_node(__v);
1898 __tree<_Tp, _Compare, _Allocator>::__insert_multi(const value_type& __v)
1901 __node_base_pointer& __child = __find_leaf_high(__parent, __v);
1902 __node_holder __h = __construct_node(__v);
1909 __tree<_Tp, _Compare, _Allocator>::__insert_multi(const_iterator __p, const value_type& __v)
1912 __node_base_pointer& __child = __find_leaf(__p, __parent, __v);
1913 __node_holder __h = __construct_node(__v);
2026 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v)
2028 iterator __p = __lower_bound(__v, __root(), __end_node());
2029 if (__p != end() && !value_comp()(__v, *__p))
2037 __tree<_Tp, _Compare, _Allocator>::find(const _Key& __v) const
2039 const_iterator __p = __lower_bound(__v, __root(), __end_node());
2040 if (__p != end() && !value_comp()(__v, *__p))
2095 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2101 if (!value_comp()(__root->__value_, __v))
2115 __tree<_Tp, _Compare, _Allocator>::__lower_bound(const _Key& __v,
2121 if (!value_comp()(__root->__value_, __v))
2135 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2141 if (value_comp()(__v, __root->__value_))
2155 __tree<_Tp, _Compare, _Allocator>::__upper_bound(const _Key& __v,
2161 if (value_comp()(__v, __root->__value_))