Lines Matching refs:__h

105     unsigned __h = __tree_sub_invariant(__x->__left_);
106     if (__h == 0)
108     if (__h != __tree_sub_invariant(__x->__right_))
110     return __h + __x->__is_black_;  // return black height of this node
2157         __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2159         __node_holder __h = __construct_node(__args);
2161         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2162         __r = __h.release();
2190         __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2192         __node_holder __h = __construct_node(__args);
2194         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2195         __r = __h.release();
2211     __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2212 …__node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), _VSTD::forward<_Args>(__args)…
2213     __h.get_deleter().__value_constructed = true;
2214     return __h;
2223     __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2225     __node_base_pointer& __child = __find_equal(__parent, __h->__value_);
2230         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2231         __r = __h.release();
2242     __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2245     __node_base_pointer& __child = __find_equal(__p, __parent, __dummy, __h->__value_);
2249         __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2250         __r = __h.release();
2260     __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2262     __node_base_pointer& __child = __find_leaf_high(__parent, _NodeTypes::__get_key(__h->__value_));
2263     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2264     return iterator(static_cast<__node_pointer>(__h.release()));
2273     __node_holder __h = __construct_node(_VSTD::forward<_Args>(__args)...);
2275     __node_base_pointer& __child = __find_leaf(__p, __parent, _NodeTypes::__get_key(__h->__value_));
2276     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2277     return iterator(static_cast<__node_pointer>(__h.release()));
2288     __node_holder __h(__node_traits::allocate(__na, 1), _Dp(__na));
2289     __node_traits::construct(__na, _NodeTypes::__get_ptr(__h->__value_), __v);
2290     __h.get_deleter().__value_constructed = true;
2291     return _LIBCPP_EXPLICIT_MOVE(__h);  // explicitly moved for C++03
2303     __node_holder __h = __construct_node(__v);
2304     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2305     return iterator(__h.release());
2314     __node_holder __h = __construct_node(__v);
2315     __insert_node_at(__parent, __child, static_cast<__node_base_pointer>(__h.get()));
2316     return iterator(__h.release());