Lines Matching refs:__cache
1570 __node_pointer __cache = static_cast<__node_pointer>(__t->__begin_node());
1575 // __cache->__left_ == nullptr
1576 if (__cache->__right_ != nullptr)
1577 __cache = static_cast<__node_pointer>(__cache->__right_);
1578 // __cache->__left_ == nullptr
1579 // __cache->__right_ == nullptr
1580 return __cache;
1583 // Precondition: __cache != nullptr
1584 // __cache->left_ == nullptr
1585 // __cache->right_ == nullptr
1589 __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_next(__node_pointer __cache) _NOEXC…
1591 if (__cache->__parent_ == nullptr)
1593 if (__tree_is_left_child(static_cast<__node_base_pointer>(__cache)))
1595 __cache->__parent_->__left_ = nullptr;
1596 __cache = static_cast<__node_pointer>(__cache->__parent_);
1597 if (__cache->__right_ == nullptr)
1598 return __cache;
1599 return static_cast<__node_pointer>(__tree_leaf(__cache->__right_));
1601 // __cache is right child
1602 __cache->__parent_unsafe()->__right_ = nullptr;
1603 __cache = static_cast<__node_pointer>(__cache->__parent_);
1604 if (__cache->__left_ == nullptr)
1605 return __cache;
1606 return static_cast<__node_pointer>(__tree_leaf(__cache->__left_));
1635 _DetachedTreeCache __cache(this);
1636 for (; __cache.__get() != nullptr && __first != __last; ++__first) {
1637 if (__node_assign_unique(*__first, __cache.__get()).second)
1638 __cache.__advance();
1658 _DetachedTreeCache __cache(this);
1659 for (; __cache.__get() && __first != __last; ++__first) {
1660 __cache.__get()->__value_ = *__first;
1661 __node_insert_multi(__cache.__get());
1662 __cache.__advance();
1758 _DetachedTreeCache __cache(this);
1759 while (__cache.__get() != nullptr && __t.size() != 0) {
1760 __cache.__get()->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1761 __node_insert_multi(__cache.__get());
1762 __cache.__advance();