Home
last modified time | relevance | path

Searched refs:_M_begin (Results 1 – 13 of 13) sorted by relevance

/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
Dregex_executor.h75 _M_begin(__begin), in _GLIBCXX_VISIBILITY()
93 _M_current = _M_begin; in _GLIBCXX_VISIBILITY()
101 _M_current = _M_begin; in _GLIBCXX_VISIBILITY()
169 if (_M_current == _M_begin) in _GLIBCXX_VISIBILITY()
295 _BiIter _M_begin; in _GLIBCXX_VISIBILITY()
Dregex_executor.tcc47 while (_M_begin != _M_end) in _M_search()
49 ++_M_begin; in _M_search()
436 if (_M_current == _M_begin in _M_handle_accept()
454 || std::distance(_M_begin, in _M_handle_accept()
456 < std::distance(_M_begin, _M_current)) in _M_handle_accept()
466 if (_M_current == _M_begin in _M_handle_accept()
548 if (_M_current == _M_begin && (_M_flags & regex_constants::match_not_bow)) in _M_word_boundary()
554 if (_M_current != _M_begin in _M_word_boundary()
Dregex.tcc60 __m._M_begin = __s; in __regex_algo_impl()
506 && _M_begin == __rhs._M_begin in operator ==()
548 _M_match._M_begin = _M_begin; in operator ++()
563 _M_match._M_begin = _M_begin; in operator ++()
Dranges_util.h236 _It _M_begin = _It(); in _GLIBCXX_VISIBILITY() local
260 : _M_begin(std::move(__i)), _M_end(__s) in _GLIBCXX_VISIBILITY()
269 : _M_begin(std::move(__i)), _M_end(__s) in _GLIBCXX_VISIBILITY()
312 { return _PairLike(_M_begin, _M_end); } in _GLIBCXX_VISIBILITY()
316 { return _M_begin; } in _GLIBCXX_VISIBILITY()
320 { return std::move(_M_begin); } in _GLIBCXX_VISIBILITY()
324 constexpr bool empty() const { return _M_begin == _M_end; } in _GLIBCXX_VISIBILITY()
332 return __detail::__to_unsigned_like(_M_end - _M_begin); in _GLIBCXX_VISIBILITY()
368 ranges::advance(_M_begin, __n); in _GLIBCXX_VISIBILITY()
375 auto __d = __n - ranges::advance(_M_begin, __n, _M_end); in _GLIBCXX_VISIBILITY()
Dstl_tree.h740 _M_begin() _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
744 _M_begin() const _GLIBCXX_NOEXCEPT in _GLIBCXX_VISIBILITY()
986 { _M_erase(_M_begin()); } in _GLIBCXX_VISIBILITY()
1256 _M_erase(_M_begin()); in _GLIBCXX_VISIBILITY()
1272 { return _M_lower_bound(_M_begin(), _M_end(), __k); } in _GLIBCXX_VISIBILITY()
1276 { return _M_lower_bound(_M_begin(), _M_end(), __k); } in _GLIBCXX_VISIBILITY()
1280 { return _M_upper_bound(_M_begin(), _M_end(), __k); } in _GLIBCXX_VISIBILITY()
1284 { return _M_upper_bound(_M_begin(), _M_end(), __k); } in _GLIBCXX_VISIBILITY()
1336 auto __x = _M_begin(); in _GLIBCXX_VISIBILITY()
1363 auto __x = _M_begin(); in _GLIBCXX_VISIBILITY()
[all …]
Dhashtable.h405 if (_M_begin()) in _GLIBCXX_VISIBILITY()
406 _M_buckets[_M_bucket_index(*_M_begin())] = &_M_before_begin; in _GLIBCXX_VISIBILITY()
465 _M_begin() const in _GLIBCXX_VISIBILITY()
600 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); in _GLIBCXX_VISIBILITY()
625 { return iterator(_M_begin()); } in _GLIBCXX_VISIBILITY()
629 { return const_iterator(_M_begin()); } in _GLIBCXX_VISIBILITY()
641 { return const_iterator(_M_begin()); } in _GLIBCXX_VISIBILITY()
1259 this->_M_deallocate_nodes(_M_begin()); in _GLIBCXX_VISIBILITY()
1319 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); in _GLIBCXX_VISIBILITY()
1362 __node_ptr __ht_n = __ht._M_begin(); in _GLIBCXX_VISIBILITY()
[all …]
Dregex.h1922 { return std::distance(_M_begin, (*this)[__sub].first); } in _GLIBCXX_VISIBILITY()
2105 swap(_M_begin, __that._M_begin); in _GLIBCXX_VISIBILITY()
2164 _Bi_iter _M_begin {}; in _GLIBCXX_VISIBILITY()
2760 : _M_begin(__a), _M_end(__b), _M_pregex(&__re), _M_flags(__m), _M_match() in _GLIBCXX_VISIBILITY()
2762 if (!regex_search(_M_begin, _M_end, _M_match, *_M_pregex, _M_flags)) in _GLIBCXX_VISIBILITY()
2835 _Bi_iter _M_begin {}; in _GLIBCXX_VISIBILITY()
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
Dfind_selectors.h155 _FIterator _M_begin; member
160 : _M_begin(__begin), _M_end(__end) { } in __find_first_of_selector()
171 for (_FIterator __pos_in_candidates = _M_begin; in operator()
191 _M_begin, _M_end, __pred, in _M_sequential_algorithm()
Dmultiway_mergesort.h51 _DifferenceType _M_begin; member
175 __sd->_M_pieces[__iam][__seq]._M_begin =
179 __sd->_M_pieces[__iam][__seq]._M_begin = 0;
217 __sd->_M_pieces[__iam][__s]._M_begin =
227 __sd->_M_pieces[__iam][__s]._M_begin = 0;
355 - __sd->_M_pieces[__iam][__s]._M_begin);
356 __offset += __sd->_M_pieces[__iam][__s]._M_begin;
368 + __sd->_M_pieces[__iam][__s]._M_begin,
/netbsd/src/external/gpl3/gcc/dist/libstdc++-v3/
DChangeLog-2014366 regex_iterator<>::operator++): Set match_results::_M_begin as
626 * include/bits/regex_executor.h: Make _M_begin non const.
628 _M_begin in search algorithm, so that _M_begin is treated as
DChangeLog-20131625 _M_rightmost, _M_begin, _M_end, _S_left, _S_right, _S_minimum,
DChangeLog-2021328 (match_results::_M_begin): Add default member-initializer.
DChangeLog-20201075 (_Rb_tree<>::_M_begin): Use latter.