Lines Matching refs:end

99   iterator end() { return End; }
100 const_iterator end() const { return End; }
103 reverse_iterator rbegin() { return reverse_iterator(end()); }
104 const_reverse_iterator rbegin() const{ return const_reverse_iterator(end()); }
128 return end()[-1];
131 return end()[-1];
182 /// append - Add the specified range to the end of the SmallVector.
191 if (NumInputs > size_type(this->capacity_ptr()-this->end()))
197 std::uninitialized_copy(in_start, in_end, this->end());
198 this->setEnd(this->end() + NumInputs);
201 /// append - Add the specified range to the end of the SmallVector.
204 if (NumInputs > size_type(this->capacity_ptr()-this->end()))
208 std::uninitialized_fill_n(this->end(), NumInputs, Elt);
209 this->setEnd(this->end() + NumInputs);
220 if (I == this->end()) { // Important special case for empty vector.
222 return this->end()-1;
227 new (this->end()) T(this->back());
228 this->setEnd(this->end()+1);
230 std::copy_backward(I, this->end()-1, this->end());
245 if (I == this->end()) { // Important special case for empty vector.
256 // If there are more elements between the insertion point and the end of the
260 if (size_t(this->end()-I) >= NumToInsert) {
261 T *OldEnd = this->end();
262 append(C, this->end()-NumToInsert, this->end());
272 // not inserting at the end.
275 T *OldEnd = this->end();
276 this->setEnd(this->end() + NumToInsert);
278 this->uninitialized_copy(I, OldEnd, this->end()-NumOverwritten);
293 if (I == this->end()) { // Important special case for empty vector.
306 // If there are more elements between the insertion point and the end of the
310 if (size_t(this->end()-I) >= NumToInsert) {
311 T *OldEnd = this->end();
312 append(C, this->end()-NumToInsert, this->end());
322 // not inserting at the end.
325 T *OldEnd = this->end();
326 this->setEnd(this->end() + NumToInsert);
328 this->uninitialized_copy(I, OldEnd, this->end()-NumOverwritten);
343 this->destroy_range(this->begin()+N, this->end());
348 construct_range(this->end(), this->begin()+N, NV);