| /haiku/headers/cpp/ |
| H A D | stl_vector.h | 193 void _M_insert_aux(iterator __position, const _Tp& __x);
194 void _M_insert_aux(iterator __position);
355 iterator insert(iterator __position, const _Tp& __x) { argument
356 size_type __n = __position - begin();
357 if (_M_finish != _M_end_of_storage && __position == end()) {
362 _M_insert_aux(__position, __x);
365 iterator insert(iterator __position) { argument
366 size_type __n = __position - begin();
367 if (_M_finish != _M_end_of_storage && __position == end()) {
372 _M_insert_aux(__position);
406 erase(iterator __position) argument
602 _M_insert_aux(iterator __position, const _Tp& __x) argument
634 _M_insert_aux(iterator __position) argument
664 insert(iterator __position, size_type __n, const _Tp& __x) argument
725 _M_range_insert(iterator __position, _ForwardIterator __first, _ForwardIterator __last, forward_iterator_tag) argument
778 insert(iterator __position, const_iterator __first, const_iterator __last) argument
[all...] |
| H A D | stl_bvector.h | 420 void _M_insert_aux(iterator __position, bool __x) { argument
422 copy_backward(__position, _M_finish, _M_finish + 1);
423 *__position = __x;
429 iterator __i = copy(begin(), __position, iterator(__q, 0));
431 _M_finish = copy(__position, end(), __i);
469 void _M_insert_range(iterator __position, argument
476 copy_backward(__position, end(), _M_finish + difference_type(__n));
477 copy(__first, __last, __position);
483 iterator __i = copy(begin(), __position, iterator(__q, 0));
485 _M_finish = copy(__position, en
688 insert(iterator __position, bool __x = bool()) argument
700 insert(iterator __position, _InputIterator __first, _InputIterator __last) argument
719 insert(iterator __position, const_iterator __first, const_iterator __last) argument
741 insert(iterator __position, const bool* __first, const bool* __last) argument
763 insert(iterator __position, size_type __n, bool __x) argument
783 erase(iterator __position) argument
[all...] |
| H A D | stl_list.h | 343 iterator insert(iterator __position, const _Tp& __x) { argument
345 __tmp->_M_next = __position._M_node;
346 __tmp->_M_prev = __position._M_node->_M_prev;
347 ((_Node*) (__position._M_node->_M_prev))->_M_next = __tmp;
348 __position._M_node->_M_prev = __tmp;
351 iterator insert(iterator __position) { return insert(__position, _Tp()); } argument
373 void insert(iterator __position, const _Tp* __first, const _Tp* __last);
374 void insert(iterator __position,
384 iterator erase(iterator __position) { argument
468 transfer(iterator __position, iterator __first, iterator __last) argument
484 splice(iterator __position, list& __x) argument
488 splice(iterator __position, list&, iterator __i) argument
494 splice(iterator __position, list&, iterator __first, iterator __last) argument
554 _M_insert_dispatch(iterator __position, _InputIter __first, _InputIter __last, __false_type) argument
566 insert(iterator __position, const _Tp* __first, const _Tp* __last) argument
575 insert(iterator __position, const_iterator __first, const_iterator __last) argument
586 insert(iterator __position, size_type __n, const _Tp& __x) argument
[all...] |
| H A D | stl_multiset.h | 141 iterator insert(iterator __position, const value_type& __x) { argument
143 return _M_t.insert_equal((_Rep_iterator&)__position, __x);
159 void erase(iterator __position) { argument
161 _M_t.erase((_Rep_iterator&)__position);
|
| H A D | stl_set.h | 136 iterator insert(iterator __position, const value_type& __x) { argument
138 return _M_t.insert_unique((_Rep_iterator&)__position, __x);
153 void erase(iterator __position) { argument
155 _M_t.erase((_Rep_iterator&)__position);
|
| H A D | stl_tree.h | 713 iterator insert_unique(iterator __position, const value_type& __x);
714 iterator insert_equal(iterator __position, const value_type& __x);
728 void erase(iterator __position);
903 ::insert_unique(iterator __position, const _Val& __v) argument
905 if (__position._M_node == _M_header->_M_left) { // begin()
907 _M_key_compare(_KeyOfValue()(__v), _S_key(__position._M_node)))
908 return _M_insert(__position._M_node, __position._M_node, __v);
912 } else if (__position._M_node == _M_header) { // end()
918 iterator __before = __position;
936 insert_equal(iterator __position, const _Val& __v) argument
1026 erase(iterator __position) argument
[all...] |
| H A D | stl_multimap.h | 152 iterator insert(iterator __position, const value_type& __x) { argument
153 return _M_t.insert_equal(__position, __x);
168 void erase(iterator __position) { _M_t.erase(__position); } argument
|
| H A D | stl_map.h | 179 void erase(iterator __position) { _M_t.erase(__position); } argument
|
| H A D | stl_deque.h | 767 iterator insert(iterator __position) argument
768 { return insert(__position, value_type()); }
|