Lines Matching full:this
6 // This file is part of the GNU ISO C++ Library. This library is free
12 // This library is distributed in the hope that it will be useful,
18 // with this library; see the file COPYING. If not, write to the Free
22 // As a special exception, you may use this file as part of a free software
24 // templates or use macros or inline functions from this file, or you compile
25 // this file and link it with other files to produce an executable, this
27 // the GNU General Public License. This exception does not however
36 * Permission to use, copy, modify, distribute and sell this software
39 * that both that copyright notice and this permission notice appear
41 * representations about the suitability of this software for any
48 * Permission to use, copy, modify, distribute and sell this software
51 * that both that copyright notice and this permission notice appear
53 * representations about the suitability of this software for any
58 * This is an internal header file, included by other library headers.
73 if (&__x != this) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
77 this->_M_impl._M_start)); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
81 std::copy(__x.begin(), __mid, this->_M_impl._M_start); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
82 insert(this->_M_impl._M_finish, __mid, __x.end()); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
85 return *this; in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
93 if (__position._M_cur == this->_M_impl._M_start._M_cur) in insert()
96 return this->_M_impl._M_start; in insert()
98 else if (__position._M_cur == this->_M_impl._M_finish._M_cur) in insert()
101 iterator __tmp = this->_M_impl._M_finish; in insert()
183 if (__pos._M_cur == this->_M_impl._M_start._M_cur) in _M_fill_insert()
188 std::__uninitialized_fill_a(__new_start, this->_M_impl._M_start, in _M_fill_insert()
190 this->_M_impl._M_start = __new_start; in _M_fill_insert()
195 this->_M_impl._M_start._M_node); in _M_fill_insert()
199 else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) in _M_fill_insert()
204 std::__uninitialized_fill_a(this->_M_impl._M_finish, in _M_fill_insert()
207 this->_M_impl._M_finish = __new_finish; in _M_fill_insert()
211 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_fill_insert()
228 for (__cur = this->_M_impl._M_start._M_node; in _M_fill_initialize()
229 __cur < this->_M_impl._M_finish._M_node; in _M_fill_initialize()
233 std::__uninitialized_fill_a(this->_M_impl._M_finish._M_first, in _M_fill_initialize()
234 this->_M_impl._M_finish._M_cur, in _M_fill_initialize()
239 std::_Destroy(this->_M_impl._M_start, iterator(*__cur, __cur), in _M_fill_initialize()
252 this->_M_initialize_map(0); in _M_range_initialize()
273 this->_M_initialize_map(__n); in _M_range_initialize()
278 for (__cur_node = this->_M_impl._M_start._M_node; in _M_range_initialize()
279 __cur_node < this->_M_impl._M_finish._M_node; in _M_range_initialize()
289 this->_M_impl._M_finish._M_first, in _M_range_initialize()
294 std::_Destroy(this->_M_impl._M_start, in _M_range_initialize()
309 *(this->_M_impl._M_finish._M_node + 1) = this->_M_allocate_node(); in _M_push_back_aux()
312 this->_M_impl.construct(this->_M_impl._M_finish._M_cur, __t_copy); in _M_push_back_aux()
313 this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node in _M_push_back_aux()
315 this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_first; in _M_push_back_aux()
319 _M_deallocate_node(*(this->_M_impl._M_finish._M_node + 1)); in _M_push_back_aux()
332 *(this->_M_impl._M_start._M_node - 1) = this->_M_allocate_node(); in _M_push_front_aux()
335 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node in _M_push_front_aux()
337 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_last - 1; in _M_push_front_aux()
338 this->_M_impl.construct(this->_M_impl._M_start._M_cur, __t_copy); in _M_push_front_aux()
342 ++this->_M_impl._M_start; in _M_push_front_aux()
343 _M_deallocate_node(*(this->_M_impl._M_start._M_node - 1)); in _M_push_front_aux()
353 _M_deallocate_node(this->_M_impl._M_finish._M_first); in _M_pop_back_aux()
354 this->_M_impl._M_finish._M_set_node(this->_M_impl._M_finish._M_node - 1); in _M_pop_back_aux()
355 this->_M_impl._M_finish._M_cur = this->_M_impl._M_finish._M_last - 1; in _M_pop_back_aux()
356 this->_M_impl.destroy(this->_M_impl._M_finish._M_cur); in _M_pop_back_aux()
360 // Note that if the deque has at least one element (a precondition for this
368 this->_M_impl.destroy(this->_M_impl._M_start._M_cur); in _M_pop_front_aux()
369 _M_deallocate_node(this->_M_impl._M_start._M_first); in _M_pop_front_aux()
370 this->_M_impl._M_start._M_set_node(this->_M_impl._M_start._M_node + 1); in _M_pop_front_aux()
371 this->_M_impl._M_start._M_cur = this->_M_impl._M_start._M_first; in _M_pop_front_aux()
381 { std::copy(__first, __last, std::inserter(*this, __pos)); } in _M_range_insert_aux()
392 if (__pos._M_cur == this->_M_impl._M_start._M_cur) in _M_range_insert_aux()
399 this->_M_impl._M_start = __new_start; in _M_range_insert_aux()
404 this->_M_impl._M_start._M_node); in _M_range_insert_aux()
408 else if (__pos._M_cur == this->_M_impl._M_finish._M_cur) in _M_range_insert_aux()
414 this->_M_impl._M_finish, in _M_range_insert_aux()
416 this->_M_impl._M_finish = __new_finish; in _M_range_insert_aux()
420 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_range_insert_aux()
434 difference_type __index = __pos - this->_M_impl._M_start; in _M_insert_aux()
439 iterator __front1 = this->_M_impl._M_start; in _M_insert_aux()
443 __pos = this->_M_impl._M_start + __index; in _M_insert_aux()
451 iterator __back1 = this->_M_impl._M_finish; in _M_insert_aux()
455 __pos = this->_M_impl._M_start + __index; in _M_insert_aux()
467 const difference_type __elems_before = __pos - this->_M_impl._M_start; in _M_insert_aux()
468 const size_type __length = this->size(); in _M_insert_aux()
473 iterator __old_start = this->_M_impl._M_start; in _M_insert_aux()
474 __pos = this->_M_impl._M_start + __elems_before; in _M_insert_aux()
479 iterator __start_n = (this->_M_impl._M_start in _M_insert_aux()
481 std::__uninitialized_copy_a(this->_M_impl._M_start, in _M_insert_aux()
484 this->_M_impl._M_start = __new_start; in _M_insert_aux()
490 std::__uninitialized_copy_fill(this->_M_impl._M_start, in _M_insert_aux()
492 this->_M_impl._M_start, in _M_insert_aux()
495 this->_M_impl._M_start = __new_start; in _M_insert_aux()
502 this->_M_impl._M_start._M_node); in _M_insert_aux()
509 iterator __old_finish = this->_M_impl._M_finish; in _M_insert_aux()
512 __pos = this->_M_impl._M_finish - __elems_after; in _M_insert_aux()
517 iterator __finish_n = (this->_M_impl._M_finish in _M_insert_aux()
520 this->_M_impl._M_finish, in _M_insert_aux()
521 this->_M_impl._M_finish, in _M_insert_aux()
523 this->_M_impl._M_finish = __new_finish; in _M_insert_aux()
529 std::__uninitialized_fill_copy(this->_M_impl._M_finish, in _M_insert_aux()
532 this->_M_impl._M_finish, in _M_insert_aux()
534 this->_M_impl._M_finish = __new_finish; in _M_insert_aux()
540 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_insert_aux()
555 const difference_type __elemsbefore = __pos - this->_M_impl._M_start; in _M_insert_aux()
560 iterator __old_start = this->_M_impl._M_start; in _M_insert_aux()
561 __pos = this->_M_impl._M_start + __elemsbefore; in _M_insert_aux()
566 iterator __start_n = (this->_M_impl._M_start in _M_insert_aux()
568 std::__uninitialized_copy_a(this->_M_impl._M_start, in _M_insert_aux()
571 this->_M_impl._M_start = __new_start; in _M_insert_aux()
579 std::__uninitialized_copy_copy(this->_M_impl._M_start, in _M_insert_aux()
583 this->_M_impl._M_start = __new_start; in _M_insert_aux()
590 this->_M_impl._M_start._M_node); in _M_insert_aux()
597 iterator __old_finish = this->_M_impl._M_finish; in _M_insert_aux()
600 __pos = this->_M_impl._M_finish - __elemsafter; in _M_insert_aux()
605 iterator __finish_n = (this->_M_impl._M_finish in _M_insert_aux()
608 this->_M_impl._M_finish, in _M_insert_aux()
609 this->_M_impl._M_finish, in _M_insert_aux()
611 this->_M_impl._M_finish = __new_finish; in _M_insert_aux()
620 this->_M_impl._M_finish, in _M_insert_aux()
621 this->_M_impl._M_finish, in _M_insert_aux()
623 this->_M_impl._M_finish = __new_finish; in _M_insert_aux()
629 _M_destroy_nodes(this->_M_impl._M_finish._M_node + 1, in _M_insert_aux()
663 if (this->max_size() - this->size() < __new_elems) in _M_new_elements_at_front()
673 *(this->_M_impl._M_start._M_node - __i) = this->_M_allocate_node(); in _M_new_elements_at_front()
678 _M_deallocate_node(*(this->_M_impl._M_start._M_node - __j)); in _M_new_elements_at_front()
688 if (this->max_size() - this->size() < __new_elems) in _M_new_elements_at_back()
698 *(this->_M_impl._M_finish._M_node + __i) = this->_M_allocate_node(); in _M_new_elements_at_back()
703 _M_deallocate_node(*(this->_M_impl._M_finish._M_node + __j)); in _M_new_elements_at_back()
714 = this->_M_impl._M_finish._M_node - this->_M_impl._M_start._M_node + 1; in _M_reallocate_map()
718 if (this->_M_impl._M_map_size > 2 * __new_num_nodes) in _M_reallocate_map()
720 __new_nstart = this->_M_impl._M_map + (this->_M_impl._M_map_size in _M_reallocate_map()
723 if (__new_nstart < this->_M_impl._M_start._M_node) in _M_reallocate_map()
724 std::copy(this->_M_impl._M_start._M_node, in _M_reallocate_map()
725 this->_M_impl._M_finish._M_node + 1, in _M_reallocate_map()
728 std::copy_backward(this->_M_impl._M_start._M_node, in _M_reallocate_map()
729 this->_M_impl._M_finish._M_node + 1, in _M_reallocate_map()
734 size_type __new_map_size = this->_M_impl._M_map_size in _M_reallocate_map()
735 + std::max(this->_M_impl._M_map_size, in _M_reallocate_map()
738 _Map_pointer __new_map = this->_M_allocate_map(__new_map_size); in _M_reallocate_map()
741 std::copy(this->_M_impl._M_start._M_node, in _M_reallocate_map()
742 this->_M_impl._M_finish._M_node + 1, in _M_reallocate_map()
744 _M_deallocate_map(this->_M_impl._M_map, this->_M_impl._M_map_size); in _M_reallocate_map()
746 this->_M_impl._M_map = __new_map; in _M_reallocate_map()
747 this->_M_impl._M_map_size = __new_map_size; in _M_reallocate_map()
750 this->_M_impl._M_start._M_set_node(__new_nstart); in _M_reallocate_map()
751 this->_M_impl._M_finish._M_set_node(__new_nstart + __old_num_nodes - 1); in _M_reallocate_map()