Lines Matching defs:end
315 iterator end() { return _M_node; }
316 const_iterator end() const { return _M_node; }
319 { return reverse_iterator(end()); }
321 { return const_reverse_iterator(end()); }
331 distance(begin(), end(), __result);
338 reference back() { return *(--end()); }
339 const_reference back() const { return *(--end()); }
381 void push_back(const _Tp& __x) { insert(end(), __x); }
382 void push_back() {insert(end());}
401 iterator __tmp = end();
435 { insert(begin(), __x.begin(), __x.end()); }
486 transfer(__position, __x.begin(), __x.end());
535 return lexicographical_compare(__x.begin(), __x.end(),
536 __y.begin(), __y.end());
606 for ( ; __i != end() && __len < __new_size; ++__i, ++__len)
609 erase(__i, end());
610 else // __i == end()
611 insert(end(), __new_size - __len, __x);
619 iterator __last1 = end();
621 const_iterator __last2 = __x.end();
635 for ( ; __i != end() && __n > 0; ++__i, --__n)
638 insert(end(), __n, __val);
640 erase(__i, end());
651 iterator __last1 = end();
666 iterator __last = end();
679 iterator __last = end();
695 iterator __last1 = end();
697 iterator __last2 = __x.end();
717 while (__first != end()) {
757 iterator __last = end();
770 iterator __last = end();
787 iterator __last1 = end();
789 iterator __last2 = __x.end();