58   void setEnd(T *P) { this->End = P; }  in setEnd()
184     if (NumInputs > size_type(this->capacity_ptr()-this->end()))  in append()
185       this->grow(C, this->size()+NumInputs);  in append()
190     std::uninitialized_copy(in_start, in_end, this->end());  in append()
191     this->setEnd(this->end() + NumInputs);  in append()
198     if (NumInputs > size_type(this->capacity_ptr()-this->end()))  in append()
199       this->grow(C, this->size()+NumInputs);  in append()
202     std::uninitialized_fill_n(this->end(), NumInputs, Elt);  in append()
203     this->setEnd(this->end() + NumInputs);  in append()
214     if (I == this->end()) {  // Important special case for empty vector.  in insert()
216       return this->end()-1;  in insert()
219     if (this->EndX < this->CapacityX) {  in insert()
221       new (this->end()) T(this->back());  in insert()
222       this->setEnd(this->end()+1);  in insert()
224       std::copy_backward(I, this->end()-1, this->end());  in insert()
228     size_t EltNo = I-this->begin();  in insert()
229     this->grow(C);  in insert()
230     I = this->begin()+EltNo;  in insert()
236     if (I == this->end()) {  // Important special case for empty vector.  in insert()
238       return this->end()-1;  in insert()
242     size_t InsertElt = I - this->begin();  in insert()
245     reserve(C, static_cast<unsigned>(this->size() + NumToInsert));  in insert()
248     I = this->begin()+InsertElt;  in insert()
254     if (size_t(this->end()-I) >= NumToInsert) {  in insert()
255       T *OldEnd = this->end();  in insert()
256       append(C, this->end()-NumToInsert, this->end());  in insert()
269     T *OldEnd = this->end();  in insert()
270     this->setEnd(this->end() + NumToInsert);  in insert()
272     this->uninitialized_copy(I, OldEnd, this->end()-NumOverwritten);  in insert()
284     if (I == this->end()) {  // Important special case for empty vector.  in insert()
286       return this->end()-1;  in insert()
291     size_t InsertElt = I - this->begin();  in insert()
294     reserve(C, static_cast<unsigned>(this->size() + NumToInsert));  in insert()
297     I = this->begin()+InsertElt;  in insert()
303     if (size_t(this->end()-I) >= NumToInsert) {  in insert()
304       T *OldEnd = this->end();  in insert()
305       append(C, this->end()-NumToInsert, this->end());  in insert()
318     T *OldEnd = this->end();  in insert()
319     this->setEnd(this->end() + NumToInsert);  in insert()
321     this->uninitialized_copy(I, OldEnd, this->end()-NumOverwritten);  in insert()
330     this->uninitialized_copy(From, To, OldEnd);  in insert()
335     if (N < this->size()) {  in resize()
336       this->destroy_range(this->begin()+N, this->end());  in resize()
337       this->setEnd(this->begin()+N);  in resize()
338     } else if (N > this->size()) {  in resize()
339       if (this->capacity() < N)  in resize()
340         this->grow(C, N);  in resize()
341       construct_range(this->end(), this->begin()+N, NV);  in resize()
342       this->setEnd(this->begin()+N);  in resize()
364   iterator capacity_ptr() { return (iterator)this->Capacity; }  in capacity_ptr()