Lines Matching refs:__t
593 __get_key(__node_value_type const& __t) {
594 return __t.__cc.first;
601 __get_key(_Up& __t) {
602 return __t.first;
607 __get_value(__node_value_type const& __t) {
608 return __t.__cc;
615 __get_value(_Up& __t) {
616 return __t;
845 {__tree_iterator __t(*this); ++(*this); return __t;}
855 {__tree_iterator __t(*this); --(*this); return __t;}
927 {__tree_const_iterator __t(*this); ++(*this); return __t;}
938 {__tree_const_iterator __t(*this); --(*this); return __t;}
1104 __tree(const __tree& __t);
1105 __tree& operator=(const __tree& __t);
1111 __tree(__tree&& __t)
1115 __tree(__tree&& __t, const allocator_type& __a);
1116 __tree& operator=(__tree&& __t)
1142 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());}
1569 __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
1571 if (this != &__t)
1573 value_comp() = __t.value_comp();
1574 __copy_assign_alloc(__t);
1575 __assign_multi(__t.begin(), __t.end());
1672 __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
1674 …__pair1_(__second_tag(), __node_traits::select_on_container_copy_construction(__t.__node_alloc())),
1675 __pair3_(0, __t.value_comp())
1683 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
1687 : __begin_node_(_VSTD::move(__t.__begin_node_)),
1688 __pair1_(_VSTD::move(__t.__pair1_)),
1689 __pair3_(_VSTD::move(__t.__pair3_))
1696 __t.__begin_node() = __t.__end_node();
1697 __t.__end_node()->__left_ = nullptr;
1698 __t.size() = 0;
1703 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
1705 __pair3_(0, _VSTD::move(__t.value_comp()))
1707 if (__a == __t.__alloc())
1709 if (__t.size() == 0)
1713 __begin_node() = __t.__begin_node();
1714 __end_node()->__left_ = __t.__end_node()->__left_;
1716 size() = __t.size();
1717 __t.__begin_node() = __t.__end_node();
1718 __t.__end_node()->__left_ = nullptr;
1719 __t.size() = 0;
1730 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
1735 __begin_node_ = __t.__begin_node_;
1736 __pair1_.first() = __t.__pair1_.first();
1737 __move_assign_alloc(__t);
1738 __pair3_ = _VSTD::move(__t.__pair3_);
1744 __t.__begin_node() = __t.__end_node();
1745 __t.__end_node()->__left_ = nullptr;
1746 __t.size() = 0;
1752 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
1754 if (__node_alloc() == __t.__node_alloc())
1755 __move_assign(__t, true_type());
1758 value_comp() = _VSTD::move(__t.value_comp());
1767 while (__cache != nullptr && __t.size() != 0)
1769 __cache->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1791 while (__t.size() != 0)
1792 __insert_multi(__e, _NodeTypes::__move(__t.remove(__t.begin())->__value_));
1798 __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
1805 __move_assign(__t, integral_constant<bool,
1840 __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
1852 swap(__begin_node_, __t.__begin_node_);
1853 swap(__pair1_.first(), __t.__pair1_.first());
1854 __swap_allocator(__node_alloc(), __t.__node_alloc());
1855 __pair3_.swap(__t.__pair3_);
1860 if (__t.size() == 0)
1861 __t.__begin_node() = __t.__end_node();
1863 __t.__end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__t.__end_node());