Lines Matching refs:__t

660         {__tree_iterator __t(*this); ++(*this); return __t;}
668         {__tree_iterator __t(*this); --(*this); return __t;}
751         {__tree_const_iterator __t(*this); ++(*this); return __t;}
759         {__tree_const_iterator __t(*this); --(*this); return __t;}
889     __tree(const __tree& __t);
890     __tree& operator=(const __tree& __t);
896     __tree(__tree&& __t)
900     __tree(__tree&& __t, const allocator_type& __a);
901     __tree& operator=(__tree&& __t)
925     void swap(__tree& __t)
1067     void __copy_assign_alloc(const __tree& __t)
1068         {__copy_assign_alloc(__t, integral_constant<bool,
1072     void __copy_assign_alloc(const __tree& __t, true_type)
1073         {__node_alloc() = __t.__node_alloc();}
1075     void __copy_assign_alloc(const __tree& __t, false_type) {}
1077     void __move_assign(__tree& __t, false_type);
1078     void __move_assign(__tree& __t, true_type)
1083     void __move_assign_alloc(__tree& __t)
1087         {__move_assign_alloc(__t, integral_constant<bool,
1091     void __move_assign_alloc(__tree& __t, true_type)
1093         {__node_alloc() = _VSTD::move(__t.__node_alloc());}
1095     void __move_assign_alloc(__tree& __t, false_type) _NOEXCEPT {}
1198 __tree<_Tp, _Compare, _Allocator>::operator=(const __tree& __t)
1200     if (this != &__t)
1202         value_comp() = __t.value_comp();
1203         __copy_assign_alloc(__t);
1204         __assign_multi(__t.begin(), __t.end());
1290 __tree<_Tp, _Compare, _Allocator>::__tree(const __tree& __t)
1292       __pair1_(__node_traits::select_on_container_copy_construction(__t.__node_alloc())),
1293       __pair3_(0, __t.value_comp())
1301 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t)
1305     : __begin_node_(_VSTD::move(__t.__begin_node_)),
1306       __pair1_(_VSTD::move(__t.__pair1_)),
1307       __pair3_(_VSTD::move(__t.__pair3_))
1314         __t.__begin_node() = __t.__end_node();
1315         __t.__end_node()->__left_ = nullptr;
1316         __t.size() = 0;
1321 __tree<_Tp, _Compare, _Allocator>::__tree(__tree&& __t, const allocator_type& __a)
1323       __pair3_(0, _VSTD::move(__t.value_comp()))
1325     if (__a == __t.__alloc())
1327         if (__t.size() == 0)
1331             __begin_node() = __t.__begin_node();
1332             __end_node()->__left_ = __t.__end_node()->__left_;
1334             size() = __t.size();
1335             __t.__begin_node() = __t.__end_node();
1336             __t.__end_node()->__left_ = nullptr;
1337             __t.size() = 0;
1348 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, true_type)
1353     __begin_node_ = __t.__begin_node_;
1354     __pair1_.first() = __t.__pair1_.first();
1355     __move_assign_alloc(__t);
1356     __pair3_ = _VSTD::move(__t.__pair3_);
1362         __t.__begin_node() = __t.__end_node();
1363         __t.__end_node()->__left_ = nullptr;
1364         __t.size() = 0;
1370 __tree<_Tp, _Compare, _Allocator>::__move_assign(__tree& __t, false_type)
1372     if (__node_alloc() == __t.__node_alloc())
1373         __move_assign(__t, true_type());
1376         value_comp() = _VSTD::move(__t.value_comp());
1385                 while (__cache != nullptr && __t.size() != 0)
1387                     __cache->__value_ = _VSTD::move(__t.remove(__t.begin())->__value_);
1409         while (__t.size() != 0)
1410             __insert_multi(__e, _VSTD::move(__t.remove(__t.begin())->__value_));
1416 __tree<_Tp, _Compare, _Allocator>::operator=(__tree&& __t)
1423     __move_assign(__t, integral_constant<bool,
1452 __tree<_Tp, _Compare, _Allocator>::swap(__tree& __t)
1459     swap(__begin_node_, __t.__begin_node_);
1460     swap(__pair1_.first(), __t.__pair1_.first());
1461     __swap_alloc(__node_alloc(), __t.__node_alloc());
1462     __pair3_.swap(__t.__pair3_);
1467     if (__t.size() == 0)
1468         __t.__begin_node() = __t.__end_node();
1470         __t.__end_node()->__left_->__parent_ = static_cast<__node_base_pointer>(__t.__end_node());