• Home
  • Raw
  • Download

Lines Matching refs:__t

582   __get_key(__node_value_type const& __t) {
583 return __t.__get_value().first;
590 __get_key(_Up& __t) {
591 return __t.first;
596 __get_value(__node_value_type const& __t) {
597 return __t.__get_value();
604 __get_value(_Up& __t) {
605 return __t;
844 {__tree_iterator __t(*this); ++(*this); return __t;}
854 {__tree_iterator __t(*this); --(*this); return __t;}
926 {__tree_const_iterator __t(*this); ++(*this); return __t;}
937 {__tree_const_iterator __t(*this); --(*this); return __t;}
1091 __tree(const __tree& __t);
1092 __tree& operator=(const __tree& __t);
1098 __tree(__tree&& __t)
1102 __tree(__tree&& __t, const allocator_type& __a);
1103 __tree& operator=(__tree&& __t)
1129 void swap(__tree& __t)
1478 void __copy_assign_alloc(const __tree& __t)
1479 {__copy_assign_alloc(__t, integral_constant<bool,
1483 void __copy_assign_alloc(const __tree& __t, true_type)
1485 if (__node_alloc() != __t.__node_alloc())
1487 __node_alloc() = __t.__node_alloc();
1492 void __move_assign(__tree& __t, false_type);
1493 void __move_assign(__tree& __t, true_type)
1498 void __move_assign_alloc(__tree& __t)
1502 {__move_assign_alloc(__t, integral_constant<bool,
1506 void __move_assign_alloc(__tree& __t, true_type)
1508 {__node_alloc() = _VSTD::move(__t.__node_alloc());}
1594 __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
1596 if (this != &__t)
1598 value_comp() = __t.value_comp();
1599 __copy_assign_alloc(__t);
1600 __assign_multi(__t.begin(), __t.end());
1697 __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
1699 …__pair1_(__second_tag(), __node_traits::select_on_container_copy_construction(__t.__node_alloc())),
1700 __pair3_(0, __t.value_comp())
1708 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
1712 : __begin_node_(_VSTD::move(__t.__begin_node_)),
1713 __pair1_(_VSTD::move(__t.__pair1_)),
1714 __pair3_(_VSTD::move(__t.__pair3_))
1721 __t.__begin_node() = __t.__end_node();
1722 __t.__end_node()->__left_ = nullptr;
1723 __t.size() = 0;
1728 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
1730 __pair3_(0, _VSTD::move(__t.value_comp()))
1732 if (__a == __t.__alloc())
1734 if (__t.size() == 0)
1738 __begin_node() = __t.__begin_node();
1739 __end_node()->__left_ = __t.__end_node()->__left_;
1741 size() = __t.size();
1742 __t.__begin_node() = __t.__end_node();
1743 __t.__end_node()->__left_ = nullptr;
1744 __t.size() = 0;
1755 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
1760 __begin_node_ = __t.__begin_node_;
1761 __pair1_.first() = __t.__pair1_.first();
1762 __move_assign_alloc(__t);
1763 __pair3_ = _VSTD::move(__t.__pair3_);
1769 __t.__begin_node() = __t.__end_node();
1770 __t.__end_node()->__left_ = nullptr;
1771 __t.size() = 0;
1777 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
1779 if (__node_alloc() == __t.__node_alloc())
1780 __move_assign(__t, true_type());
1783 value_comp() = _VSTD::move(__t.value_comp());
1792 while (__cache != nullptr && __t.size() != 0)
1794 __cache->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1816 while (__t.size() != 0)
1817 __insert_multi(__e, _NodeTypes::__move(__t.remove(__t.begin())->__value_));
1823 __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
1830 __move_assign(__t, integral_constant<bool,
1861 __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
1873 swap(__begin_node_, __t.__begin_node_);
1874 swap(__pair1_.first(), __t.__pair1_.first());
1875 __swap_allocator(__node_alloc(), __t.__node_alloc());
1876 __pair3_.swap(__t.__pair3_);
1881 if (__t.size() == 0)
1882 __t.__begin_node() = __t.__end_node();
1884 __t.__end_node()->__left_->__parent_ = static_cast<__parent_pointer>(__t.__end_node());