Lines Matching refs:end
199 iterator end() { return _M_finish; }
200 const_iterator end() const { return _M_finish; }
203 { return reverse_iterator(end()); }
205 { return const_reverse_iterator(end()); }
212 { return size_type(end() - begin()); }
218 { return begin() == end(); }
249 { _M_finish = uninitialized_copy(__x.begin(), __x.end(), _M_start); }
330 reference back() { return *(end() - 1); }
331 const_reference back() const { return *(end() - 1); }
339 _M_insert_aux(end(), __x);
347 _M_insert_aux(end());
357 if (_M_finish != _M_end_of_storage && __position == end()) {
367 if (_M_finish != _M_end_of_storage && __position == end()) {
407 if (__position + 1 != end())
422 erase(begin() + __new_size, end());
424 insert(end(), __new_size - size(), __x);
427 void clear() { erase(begin(), end()); }
496 equal(__x.begin(), __x.end(), __y.begin());
503 return lexicographical_compare(__x.begin(), __x.end(),
504 __y.begin(), __y.end());
524 iterator __tmp = _M_allocate_and_copy(__xlen, __x.begin(), __x.end());
531 iterator __i = copy(__x.begin(), __x.end(), begin());
536 uninitialized_copy(__x.begin() + size(), __x.end(), _M_finish);
550 fill(begin(), end(), __val);
554 erase(fill_n(begin(), __n, __val), end());
563 for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
566 erase(__cur, end());
568 insert(end(), __first, __last);
624 destroy(begin(), end());
655 destroy(begin(), end());