Home
last modified time | relevance | path

Searched refs:__position (Results 1 – 25 of 43) sorted by relevance

12

/openbsd-src/gnu/lib/libstdc++/libstdc++/include/bits/
H A Dvector.tcc88 insert(iterator __position, const value_type& __x) in insert() argument
90 size_type __n = __position - begin(); in insert()
91 if (_M_finish != _M_end_of_storage && __position == end()) in insert()
97 _M_insert_aux(__position, __x); in insert()
104 erase(iterator __position) in erase() argument
106 if (__position + 1 != end()) in erase()
107 copy(__position + 1, end(), __position); in erase()
110 return __position; in erase()
222 _M_insert_aux(iterator __position, const _Tp& __x) in _M_insert_aux() argument
229 copy_backward(__position, iterator(_M_finish-2), iterator(_M_finish-1)); in _M_insert_aux()
[all …]
H A Dstl_bvector.h381 void _M_insert_aux(iterator __position, bool __x) { in _M_insert_aux() argument
383 copy_backward(__position, _M_finish, _M_finish + 1); in _M_insert_aux()
384 *__position = __x; in _M_insert_aux()
391 iterator __i = copy(begin(), __position, iterator(__q, 0)); in _M_insert_aux()
393 _M_finish = copy(__position, end(), __i); in _M_insert_aux()
429 void _M_insert_range(iterator __position, in _M_insert_range() argument
435 copy_backward(__position, end(), _M_finish + difference_type(__n)); in _M_insert_range()
436 copy(__first, __last, __position); in _M_insert_range()
442 iterator __i = copy(begin(), __position, iterator(__q, 0)); in _M_insert_range()
444 _M_finish = copy(__position, end(), __i); in _M_insert_range()
[all …]
H A Dstl_list.h795 insert(iterator __position, const value_type& __x);
814 insert(iterator __position) { return insert(__position, value_type()); } in insert() argument
871 erase(iterator __position);
926 splice(iterator __position, list& __x) in splice() argument
929 this->_M_transfer(__position, __x.begin(), __x.end()); in splice()
936 splice(iterator __position, list&, iterator __i) in splice() argument
940 if (__position == __i || __position == __j) return; in splice()
941 this->_M_transfer(__position, __i, __j); in splice()
948 splice(iterator __position, list&, iterator __first, iterator __last) in splice() argument
951 this->_M_transfer(__position, __first, __last); in splice()
[all …]
H A Dlist.tcc87 insert(iterator __position, const value_type& __x) in insert() argument
90 __tmp->_M_next = __position._M_node; in insert()
91 __tmp->_M_prev = __position._M_node->_M_prev; in insert()
92 __position._M_node->_M_prev->_M_next = __tmp; in insert()
93 __position._M_node->_M_prev = __tmp; in insert()
100 erase(iterator __position) in erase() argument
102 _List_node_base* __next_node = __position._M_node->_M_next; in erase()
103 _List_node_base* __prev_node = __position._M_node->_M_prev; in erase()
104 _Node* __n = static_cast<_Node*>(__position._M_node); in erase()
H A Dstl_tree.h817 insert_unique(iterator __position, const value_type& __x);
820 insert_equal(iterator __position, const value_type& __x);
831 erase(iterator __position);
1061 insert_unique(iterator __position, const _Val& __v) in insert_unique() argument
1063 if (__position._M_node == _M_header->_M_left) in insert_unique()
1067 _M_key_compare(_KeyOfValue()(__v), _S_key(__position._M_node))) in insert_unique()
1068 return _M_insert(__position._M_node, __position._M_node, __v); in insert_unique()
1073 else if (__position._M_node == _M_header) in insert_unique()
1083 iterator __before = __position; in insert_unique()
1086 && _M_key_compare(_KeyOfValue()(__v),_S_key(__position._M_node))) in insert_unique()
[all …]
H A Dstl_vector.h633 insert(iterator __position, const value_type& __x);
652 insert(iterator __position) in insert() argument
653 { return insert(__position, value_type()); } in insert()
712 erase(iterator __position);
915 _M_insert_aux(iterator __position, const value_type& __x);
919 void _M_insert_aux(iterator __position);
/openbsd-src/gnu/gcc/libstdc++-v3/include/bits/
H A Dvector.tcc92 insert(iterator __position, const value_type& __x) in insert() argument
94 const size_type __n = __position - begin(); in insert()
96 && __position == end()) in insert()
102 _M_insert_aux(__position, __x); in insert()
109 erase(iterator __position) in erase() argument
111 if (__position + 1 != end()) in erase()
112 std::copy(__position + 1, end(), __position); in erase()
115 return __position; in erase()
245 _M_insert_aux(iterator __position, const _Tp& __x) in _M_insert_aux() argument
253 std::copy_backward(__position.base(), in _M_insert_aux()
[all …]
H A Dstl_tree.h671 _M_insert_unique(iterator __position, const value_type& __x);
674 _M_insert_unique(const_iterator __position, const value_type& __x);
677 _M_insert_equal(iterator __position, const value_type& __x);
680 _M_insert_equal(const_iterator __position, const value_type& __x);
691 erase(iterator __position);
694 erase(const_iterator __position);
998 _M_insert_unique(iterator __position, const _Val& __v)
1001 if (__position._M_node == _M_end())
1011 _S_key(__position._M_node)))
1014 iterator __before = __position;
[all …]
H A Dstl_list.h91 hook(_List_node_base * const __position);
793 insert(iterator __position, const value_type& __x);
808 insert(iterator __position, size_type __n, const value_type& __x) in insert() argument
811 splice(__position, __tmp); in insert()
829 insert(iterator __position, _InputIterator __first, in insert() argument
833 splice(__position, __tmp); in insert()
852 erase(iterator __position);
926 splice(iterator __position, list& __x) in splice() argument
932 this->_M_transfer(__position, __x.begin(), __x.end()); in splice()
946 splice(iterator __position, list& __x, iterator __i) in splice() argument
[all …]
H A Dstl_bvector.h704 insert(iterator __position, const bool& __x = bool()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
706 const difference_type __n = __position - begin(); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
708 && __position == end()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
711 _M_insert_aux(__position, __x); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
717 insert(iterator __position, in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
721 _M_insert_dispatch(__position, __first, __last, _Integral()); in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
725 insert(iterator __position, size_type __n, const bool& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
726 { _M_fill_insert(__position, __n, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
733 erase(iterator __position) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
735 if (__position + 1 != end()) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
[all …]
H A Ddeque.tcc91 insert(iterator __position, const value_type& __x) in insert() argument
93 if (__position._M_cur == this->_M_impl._M_start._M_cur) in insert()
98 else if (__position._M_cur == this->_M_impl._M_finish._M_cur) in insert()
106 return _M_insert_aux(__position, __x); in insert()
112 erase(iterator __position) in erase() argument
114 iterator __next = __position; in erase()
116 const difference_type __index = __position - begin(); in erase()
119 if (__position != begin()) in erase()
120 std::copy_backward(begin(), __position, __next); in erase()
126 std::copy(__next, end(), __position); in erase()
H A Dlist.tcc86 insert(iterator __position, const value_type& __x) in insert() argument
89 __tmp->hook(__position._M_node); in insert()
96 erase(iterator __position) in erase() argument
98 iterator __ret = iterator(__position._M_node->_M_next); in erase()
99 _M_erase(__position); in erase()
H A Dstl_vector.h636 insert(iterator __position, const value_type& __x);
652 insert(iterator __position, size_type __n, const value_type& __x) in insert() argument
653 { _M_fill_insert(__position, __n, __x); } in insert()
671 insert(iterator __position, _InputIterator __first, in insert() argument
676 _M_insert_dispatch(__position, __first, __last, _Integral()); in insert()
695 erase(iterator __position);
912 _M_insert_aux(iterator __position, const value_type& __x);
H A Dstl_multiset.h318 insert(iterator __position, const value_type& __x) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
319 { return _M_t._M_insert_equal(__position, __x); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
345 erase(iterator __position) in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
346 { _M_t.erase(__position); } in _GLIBCXX_BEGIN_NESTED_NAMESPACE()
/openbsd-src/gnu/gcc/libstdc++-v3/include/std/
H A Dstd_bitset.h756 size_t __position = 0)
759 if (__position > __s.size())
762 _M_copy_from_string(__s, __position,
777 size_t __position, size_t __n)
780 if (__position > __s.size())
783 _M_copy_from_string(__s, __position, __n);
824 operator<<=(size_t __position)
826 if (__builtin_expect(__position < _Nb, 1))
828 this->_M_do_left_shift(__position);
837 operator>>=(size_t __position)
[all …]
/openbsd-src/gnu/gcc/libstdc++-v3/include/debug/
H A Dlist268 insert(iterator __position, const _Tp& __x)
270 __glibcxx_check_insert(__position);
271 return iterator(_Base::insert(__position.base(), __x), this);
275 insert(iterator __position, size_type __n, const _Tp& __x)
277 __glibcxx_check_insert(__position);
278 _Base::insert(__position.base(), __n, __x);
283 insert(iterator __position, _InputIterator __first,
286 __glibcxx_check_insert_range(__position, __first, __last);
287 _Base::insert(__position.base(), __first, __last);
291 erase(iterator __position)
[all …]
H A Ddeque235 insert(iterator __position, const _Tp& __x)
237 __glibcxx_check_insert(__position);
238 typename _Base::iterator __res = _Base::insert(__position.base(), __x);
244 insert(iterator __position, size_type __n, const _Tp& __x)
246 __glibcxx_check_insert(__position);
247 _Base::insert(__position.base(), __n, __x);
253 insert(iterator __position,
256 __glibcxx_check_insert_range(__position, __first, __last);
257 _Base::insert(__position.base(), __first, __last);
281 erase(iterator __position)
[all …]
H A Dvector264 insert(iterator __position, const _Tp& __x)
266 __glibcxx_check_insert(__position);
268 difference_type __offset = __position - begin();
269 typename _Base::iterator __res = _Base::insert(__position.base(),__x);
279 insert(iterator __position, size_type __n, const _Tp& __x)
281 __glibcxx_check_insert(__position);
283 difference_type __offset = __position - begin();
284 _Base::insert(__position.base(), __n, __x);
294 insert(iterator __position,
297 __glibcxx_check_insert_range(__position, __first, __last);
[all …]
H A Dset.h155 insert(iterator __position, const value_type& __x) in insert() argument
157 __glibcxx_check_insert(__position); in insert()
158 return iterator(_Base::insert(__position.base(), __x), this); in insert()
170 erase(iterator __position) in erase() argument
172 __glibcxx_check_erase(__position); in erase()
173 __position._M_invalidate(); in erase()
174 _Base::erase(__position.base()); in erase()
H A Dmultiset.h150 insert(iterator __position, const value_type& __x) in insert() argument
152 __glibcxx_check_insert(__position); in insert()
153 return iterator(_Base::insert(__position.base(), __x), this); in insert()
165 erase(iterator __position) in erase() argument
167 __glibcxx_check_erase(__position); in erase()
168 __position._M_invalidate(); in erase()
169 _Base::erase(__position.base()); in erase()
H A Dmultimap.h152 insert(iterator __position, const value_type& __x) in insert() argument
154 __glibcxx_check_insert(__position); in insert()
155 return iterator(_Base::insert(__position.base(), __x), this); in insert()
167 erase(iterator __position) in erase() argument
169 __glibcxx_check_erase(__position); in erase()
170 __position._M_invalidate(); in erase()
171 _Base::erase(__position.base()); in erase()
H A Dmap.h166 insert(iterator __position, const value_type& __x) in insert() argument
168 __glibcxx_check_insert(__position); in insert()
169 return iterator(_Base::insert(__position.base(), __x), this); in insert()
181 erase(iterator __position) in erase() argument
183 __glibcxx_check_erase(__position); in erase()
184 __position._M_invalidate(); in erase()
185 _Base::erase(__position.base()); in erase()
/openbsd-src/gnu/gcc/libstdc++-v3/src/
H A Dlist.cc124 _List_node_base::hook(_List_node_base* const __position) in hook() argument
126 this->_M_next = __position; in hook()
127 this->_M_prev = __position->_M_prev; in hook()
128 __position->_M_prev->_M_next = this; in hook()
129 __position->_M_prev = this; in hook()
/openbsd-src/gnu/llvm/libcxx/include/
H A Dvector606 …_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, con…
608 …_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator insert(const_iterator __position, val…
610 …_LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator emplace(const_iterator __position, _A…
613 iterator insert(const_iterator __position, size_type __n, const_reference __x);
620 insert(const_iterator __position, _InputIterator __first, _InputIterator __last);
628 insert(const_iterator __position, _ForwardIterator __first, _ForwardIterator __last);
632 iterator insert(const_iterator __position, initializer_list<value_type> __il)
633 {return insert(__position, __il.begin(), __il.end());}
636 _LIBCPP_CONSTEXPR_SINCE_CXX20 _LIBCPP_HIDE_FROM_ABI iterator erase(const_iterator __position);
1623 vector<_Tp, _Allocator>::erase(const_iterator __position)
[all …]
/openbsd-src/gnu/llvm/libcxx/include/__format/
H A Dunicode.h90 _LIBCPP_HIDE_FROM_ABI constexpr const char* __position() const noexcept { return __first_; } in __position() function
234 _LIBCPP_HIDE_FROM_ABI constexpr const wchar_t* __position() const noexcept { return __first_; } in __position() function
416 return {__code_point, __code_point_view_.__position()}; in __consume()
429 … const _CharT* __result = __code_point_view_.__position(); in __get_break()
461 _LIBCPP_HIDE_FROM_ABI constexpr const _CharT* __position() const noexcept { return __first_; } in __position() function

12