Lines Matching refs:__c
248 explicit __list_iterator(__node_pointer __p, const void* __c) _NOEXCEPT
251 __get_db()->__insert_ic(this, __c);
381 explicit __list_const_iterator(__node_pointer __p, const void* __c) _NOEXCEPT
384 __get_db()->__insert_ic(this, __c);
608 void swap(__list_imp& __c)
613 void __copy_assign_alloc(const __list_imp& __c)
614 {__copy_assign_alloc(__c, integral_constant<bool,
618 void __move_assign_alloc(__list_imp& __c)
622 {__move_assign_alloc(__c, integral_constant<bool,
645 void __copy_assign_alloc(const __list_imp& __c, true_type)
647 if (__node_alloc() != __c.__node_alloc())
649 __node_alloc() = __c.__node_alloc();
653 void __copy_assign_alloc(const __list_imp& __c, false_type)
657 void __move_assign_alloc(__list_imp& __c, true_type)
660 __node_alloc() = _VSTD::move(__c.__node_alloc());
664 void __move_assign_alloc(__list_imp& __c, false_type)
724 __c_node* __c = __get_db()->__find_c_and_lock(this);
725 for (__i_node** __p = __c->end_; __p != __c->beg_; )
732 if (--__c->end_ != __p)
733 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
743 __list_imp<_Tp, _Alloc>::swap(__list_imp& __c)
748 this->__node_alloc() == __c.__node_alloc(),
752 __swap_alloc(__node_alloc(), __c.__node_alloc());
753 swap(__sz(), __c.__sz());
754 swap(__end_, __c.__end_);
762 if (__c.__sz() == 0)
763 __c.__end_.__next_ = __c.__end_.__prev_
765 pointer_traits<__node_base_pointer>::pointer_to(__c.__end_));
767 __c.__end_.__prev_->__next_ = __c.__end_.__next_->__prev_
769 pointer_traits<__node_base_pointer>::pointer_to(__c.__end_));
773 __c_node* __cn2 = __db->__find_c(&__c);
782 pointer_traits<__node_base_pointer>::pointer_to(__c.__end_)))
865 list(const list& __c);
866 list(const list& __c, const allocator_type& __a);
867 list& operator=(const list& __c);
873 list(list&& __c)
875 list(list&& __c, const allocator_type& __a);
876 list& operator=(list&& __c)
993 void swap(list& __c)
996 {base::swap(__c);}
1009 void splice(const_iterator __p, list& __c);
1012 void splice(const_iterator __p, list&& __c) {splice(__p, __c);}
1014 void splice(const_iterator __p, list& __c, const_iterator __i);
1017 void splice(const_iterator __p, list&& __c, const_iterator __i)
1018 {splice(__p, __c, __i);}
1020 void splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l);
1023 void splice(const_iterator __p, list&& __c, const_iterator __f, const_iterator __l)
1024 {splice(__p, __c, __f, __l);}
1032 void merge(list& __c);
1035 void merge(list&& __c) {merge(__c);}
1038 void merge(list& __c, _Comp __comp);
1042 void merge(list&& __c, _Comp __comp) {merge(__c, __comp);}
1067 void __move_assign(list& __c, true_type)
1069 void __move_assign(list& __c, false_type);
1170 list<_Tp, _Alloc>::list(const list& __c)
1173 __c.__node_alloc())))
1178 for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
1183 list<_Tp, _Alloc>::list(const list& __c, const allocator_type& __a)
1189 for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
1223 list<_Tp, _Alloc>::operator=(const list& __c)
1225 if (this != &__c)
1227 base::__copy_assign_alloc(__c);
1228 assign(__c.begin(), __c.end());
1237 list<_Tp, _Alloc>::list(list&& __c)
1239 : base(allocator_type(_VSTD::move(__c.__node_alloc())))
1244 splice(end(), __c);
1249 list<_Tp, _Alloc>::list(list&& __c, const allocator_type& __a)
1255 if (__a == __c.get_allocator())
1256 splice(end(), __c);
1260 assign(_Ip(__c.begin()), _Ip(__c.end()));
1267 list<_Tp, _Alloc>::operator=(list&& __c)
1272 __move_assign(__c, integral_constant<bool,
1279 list<_Tp, _Alloc>::__move_assign(list& __c, false_type)
1281 if (base::__node_alloc() != __c.__node_alloc())
1284 assign(_Ip(__c.begin()), _Ip(__c.end()));
1287 __move_assign(__c, true_type());
1292 list<_Tp, _Alloc>::__move_assign(list& __c, true_type)
1296 base::__move_assign_alloc(__c);
1297 splice(end(), __c);
1645 __c_node* __c = __get_db()->__find_c_and_lock(this);
1646 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1653 if (--__c->end_ != __p)
1654 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1673 __c_node* __c = __get_db()->__find_c_and_lock(this);
1674 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1681 if (--__c->end_ != __p)
1682 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1708 __c_node* __c = __get_db()->__find_c_and_lock(this);
1709 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1716 if (--__c->end_ != __p)
1717 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1750 __c_node* __c = __get_db()->__find_c_and_lock(this);
1751 for (__i_node** __p = __c->end_; __p != __c->beg_; )
1758 if (--__c->end_ != __p)
1759 memmove(__p, __p+1, (__c->end_ - __p)*sizeof(__i_node*));
1897 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c)
1899 _LIBCPP_ASSERT(this != &__c,
1906 if (!__c.empty())
1908 __node_pointer __f = __c.__end_.__next_;
1909 __node_pointer __l = __c.__end_.__prev_;
1912 base::__sz() += __c.__sz();
1913 __c.__sz() = 0;
1917 __c_node* __cn2 = __db->__find_c(&__c);
1923 pointer_traits<__node_base_pointer>::pointer_to(__c.__end_)))
1938 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __i)
1944 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__i) == &__c,
1956 --__c.__sz();
1961 __c_node* __cn2 = __db->__find_c(&__c);
1981 list<_Tp, _Alloc>::splice(const_iterator __p, list& __c, const_iterator __f, const_iterator __l)
1987 _LIBCPP_ASSERT(__get_const_db()->__find_c_from_i(&__f) == &__c,
1990 if (this == &__c)
2001 if (this != &__c)
2004 __c.__sz() -= __s;
2015 __c_node* __cn2 = __db->__find_c(&__c);
2100 list<_Tp, _Alloc>::merge(list& __c)
2102 merge(__c, __less<value_type>());
2108 list<_Tp, _Alloc>::merge(list& __c, _Comp __comp)
2110 if (this != &__c)
2114 iterator __f2 = __c.begin();
2115 iterator __e2 = __c.end();
2125 __c.__sz() -= __ds;
2137 splice(__e1, __c);
2141 __c_node* __cn2 = __db->__find_c(&__c);
2147 pointer_traits<__node_base_pointer>::pointer_to(__c.__end_)))