Lines Matching refs:__cache

1582     __node_pointer __cache = static_cast<__node_pointer>(__t->__begin_node());
1587 // __cache->__left_ == nullptr
1588 if (__cache->__right_ != nullptr)
1589 __cache = static_cast<__node_pointer>(__cache->__right_);
1590 // __cache->__left_ == nullptr
1591 // __cache->__right_ == nullptr
1592 return __cache;
1595 // Precondition: __cache != nullptr
1596 // __cache->left_ == nullptr
1597 // __cache->right_ == nullptr
1601 __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_next(__node_pointer __cache) _NOEXC…
1603 if (__cache->__parent_ == nullptr)
1605 if (_VSTD::__tree_is_left_child(static_cast<__node_base_pointer>(__cache)))
1607 __cache->__parent_->__left_ = nullptr;
1608 __cache = static_cast<__node_pointer>(__cache->__parent_);
1609 if (__cache->__right_ == nullptr)
1610 return __cache;
1611 return static_cast<__node_pointer>(_VSTD::__tree_leaf(__cache->__right_));
1613 // __cache is right child
1614 __cache->__parent_unsafe()->__right_ = nullptr;
1615 __cache = static_cast<__node_pointer>(__cache->__parent_);
1616 if (__cache->__left_ == nullptr)
1617 return __cache;
1618 return static_cast<__node_pointer>(_VSTD::__tree_leaf(__cache->__left_));
1647 _DetachedTreeCache __cache(this);
1648 for (; __cache.__get() != nullptr && __first != __last; ++__first) {
1649 if (__node_assign_unique(*__first, __cache.__get()).second)
1650 __cache.__advance();
1670 _DetachedTreeCache __cache(this);
1671 for (; __cache.__get() && __first != __last; ++__first) {
1672 __cache.__get()->__value_ = *__first;
1673 __node_insert_multi(__cache.__get());
1674 __cache.__advance();
1770 _DetachedTreeCache __cache(this);
1771 while (__cache.__get() != nullptr && __t.size() != 0) {
1772 __cache.__get()->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1773 __node_insert_multi(__cache.__get());
1774 __cache.__advance();