Home
last modified time | relevance | path

Searched refs:__begin (Results 1 – 6 of 6) sorted by relevance

/freebsd-12.1/contrib/libstdc++/include/debug/
H A Dsafe_iterator.tcc53 const_iterator __begin = in _M_can_advance() local
56 this->_M_get_distance(__begin, *this); in _M_can_advance()
H A Dformatter.h136 __begin, // dereferenceable, and at the beginning
235 _M_variant._M_iterator._M_state = __begin;
H A Dstring113 basic_string(_InputIterator __begin, _InputIterator __end,
115 : _Base(__gnu_debug::__check_valid_range(__begin, __end), __end, __a)
/freebsd-12.1/contrib/libstdc++/include/ext/
H A Dropeimpl.h927 const _RopeRep* __r, size_t __begin, size_t __end) in _S_apply_to_pieces() argument
938 if (__begin < __left_len) in _S_apply_to_pieces()
941 if (!_S_apply_to_pieces(__c, __left, __begin, __left_end)) in _S_apply_to_pieces()
947 size_t __right_start = std::max(__left_len, __begin); in _S_apply_to_pieces()
958 return __c(__l->_M_data + __begin, __end - __begin); in _S_apply_to_pieces()
964 size_t __len = __end - __begin; in _S_apply_to_pieces()
970 (*(__f->_M_fn))(__begin, __len, __buffer); in _S_apply_to_pieces()
H A Drope1543 size_t __begin, size_t __end);
1594 apply_to_pieces(size_t __begin, size_t __end,
1596 { _S_apply_to_pieces(__c, this->_M_tree_ptr, __begin, __end); }
/freebsd-12.1/contrib/libstdc++/include/bits/
H A Dstl_algo.h2127 _ForwardIterator __begin = std::__inplace_stable_partition(__first, in __inplace_stable_partition() local
2135 std::rotate(__begin, __middle, __end); in __inplace_stable_partition()
2136 std::advance(__begin, std::distance(__middle, __end)); in __inplace_stable_partition()
2137 return __begin; in __inplace_stable_partition()
2176 _ForwardIterator __begin = in __stable_partition_adaptive() local
2184 std::rotate(__begin, __middle, __end); in __stable_partition_adaptive()
2185 std::advance(__begin, std::distance(__middle, __end)); in __stable_partition_adaptive()
2186 return __begin; in __stable_partition_adaptive()