• Home
  • Raw
  • Download

Lines Matching refs:__t

584   __get_key(__node_value_type const& __t) {
585 return __t.__get_value().first;
592 __get_key(_Up& __t) {
593 return __t.first;
598 __get_value(__node_value_type const& __t) {
599 return __t.__get_value();
606 __get_value(_Up& __t) {
607 return __t;
847 {__tree_iterator __t(*this); ++(*this); return __t;}
857 {__tree_iterator __t(*this); --(*this); return __t;}
929 {__tree_const_iterator __t(*this); ++(*this); return __t;}
940 {__tree_const_iterator __t(*this); --(*this); return __t;}
1094 __tree(const __tree& __t);
1095 __tree& operator=(const __tree& __t);
1100 __tree(__tree&& __t)
1104 __tree(__tree&& __t, const allocator_type& __a);
1105 __tree& operator=(__tree&& __t)
1129 void swap(__tree& __t)
1453 void __copy_assign_alloc(const __tree& __t)
1454 {__copy_assign_alloc(__t, integral_constant<bool,
1458 void __copy_assign_alloc(const __tree& __t, true_type)
1460 if (__node_alloc() != __t.__node_alloc())
1462 __node_alloc() = __t.__node_alloc();
1467 void __move_assign(__tree& __t, false_type);
1468 void __move_assign(__tree& __t, true_type)
1473 void __move_assign_alloc(__tree& __t)
1477 {__move_assign_alloc(__t, integral_constant<bool,
1481 void __move_assign_alloc(__tree& __t, true_type)
1483 {__node_alloc() = _VSTD::move(__t.__node_alloc());}
1489 explicit _DetachedTreeCache(__tree *__t) _NOEXCEPT : __t_(__t),
1490 __cache_root_(__detach_from_tree(__t)) {
1522 static __node_pointer __detach_from_tree(__tree *__t) _NOEXCEPT;
1568 __tree<_Tp, _Compare, _Allocator>::_DetachedTreeCache::__detach_from_tree(__tree *__t) _NOEXCEPT
1570 __node_pointer __cache = static_cast<__node_pointer>(__t->__begin_node());
1571 __t->__begin_node() = __t->__end_node();
1572 __t->__end_node()->__left_->__parent_ = nullptr;
1573 __t->__end_node()->__left_ = nullptr;
1574 __t->size() = 0;
1611 __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
1613 if (this != &__t)
1615 value_comp() = __t.value_comp();
1616 __copy_assign_alloc(__t);
1617 __assign_multi(__t.begin(), __t.end());
1670 __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
1672 …__pair1_(__default_init_tag(), __node_traits::select_on_container_copy_construction(__t.__node_all…
1673 __pair3_(0, __t.value_comp())
1679 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
1683 : __begin_node_(_VSTD::move(__t.__begin_node_)),
1684 __pair1_(_VSTD::move(__t.__pair1_)),
1685 __pair3_(_VSTD::move(__t.__pair3_))
1692 __t.__begin_node() = __t.__end_node();
1693 __t.__end_node()->__left_ = nullptr;
1694 __t.size() = 0;
1699 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
1701 __pair3_(0, _VSTD::move(__t.value_comp()))
1703 if (__a == __t.__alloc())
1705 if (__t.size() == 0)
1709 __begin_node() = __t.__begin_node();
1710 __end_node()->__left_ = __t.__end_node()->__left_;
1712 size() = __t.size();
1713 __t.__begin_node() = __t.__end_node();
1714 __t.__end_node()->__left_ = nullptr;
1715 __t.size() = 0;
1726 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
1731 __begin_node_ = __t.__begin_node_;
1732 __pair1_.first() = __t.__pair1_.first();
1733 __move_assign_alloc(__t);
1734 __pair3_ = _VSTD::move(__t.__pair3_);
1740 __t.__begin_node() = __t.__end_node();
1741 __t.__end_node()->__left_ = nullptr;
1742 __t.size() = 0;
1748 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
1750 if (__node_alloc() == __t.__node_alloc())
1751 __move_assign(__t, true_type());
1754 value_comp() = _VSTD::move(__t.value_comp());
1759 while (__cache.__get() != nullptr && __t.size() != 0) {
1760 __cache.__get()->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1765 while (__t.size() != 0)
1766 __insert_multi(__e, _NodeTypes::__move(__t.remove(__t.begin())->__value_));
1772 __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
1779 __move_assign(__t, integral_constant<bool,
1808 __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
1820 swap(__begin_node_, __t.__begin_node_);
1821 swap(__pair1_.first(), __t.__pair1_.first());
1822 _VSTD::__swap_allocator(__node_alloc(), __t.__node_alloc());
1823 __pair3_.swap(__t.__pair3_);
1828 if (__t.size() == 0)
1829 __t.__begin_node() = __t.__end_node();
1831 __t.__end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__t.__end_node());