/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/ |
H A D | regex_executor.h | 74 : _M_begin(__begin), 92 _M_current = _M_begin; 100 _M_current = _M_begin; 168 return _M_current == _M_begin 241 _BiIter _M_begin; member in class:__detail::_Executor
|
H A D | hashtable.h | 434 _M_begin() const function in class:_Hashtable 574 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); 591 { return iterator(_M_begin()); } 595 { return const_iterator(_M_begin()); } 607 { return const_iterator(_M_begin()); } 1109 this->_M_deallocate_nodes(_M_begin()); 1169 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); 1212 __node_type* __ht_n = __ht._M_begin(); 1267 this->_M_deallocate_nodes(_M_begin()); 1285 if (_M_begin()) [all...] |
H A D | stl_tree.h | 750 _M_begin() _GLIBCXX_NOEXCEPT 754 _M_begin() const _GLIBCXX_NOEXCEPT 899 _Link_type __root = _M_copy(__x._M_begin(), _M_end(), __gen); 993 { _M_erase(_M_begin()); } 1263 _M_erase(_M_begin()); 1279 { return _M_lower_bound(_M_begin(), _M_end(), __k); } 1283 { return _M_lower_bound(_M_begin(), _M_end(), __k); } 1287 { return _M_upper_bound(_M_begin(), _M_end(), __k); } 1291 { return _M_upper_bound(_M_begin(), _M_end(), __k); } 1343 auto __x = _M_begin(); [all...] |
H A D | regex.h | 1839 { return std::distance(_M_begin, (*this)[__sub].first); } 2022 swap(_M_begin, __that._M_begin); 2081 _Bi_iter _M_begin {}; 2667 : _M_begin(__a), _M_end(__b), _M_pregex(&__re), _M_flags(__m), _M_match() 2669 if (!regex_search(_M_begin, _M_end, _M_match, *_M_pregex, _M_flags)) 2733 _Bi_iter _M_begin {};
|
/netbsd-current/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/ |
H A D | find_selectors.h | 155 _FIterator _M_begin; member in struct:__gnu_parallel::__find_first_of_selector 160 : _M_begin(__begin), _M_end(__end) { } 171 for (_FIterator __pos_in_candidates = _M_begin; 191 _M_begin, _M_end, __pred,
|
H A D | multiway_mergesort.h | 51 _DifferenceType _M_begin; member in struct:__gnu_parallel::_Piece 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-current/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/ |
H A D | find_selectors.h | 155 _FIterator _M_begin; member in struct:__gnu_parallel::__find_first_of_selector 160 : _M_begin(__begin), _M_end(__end) { } 171 for (_FIterator __pos_in_candidates = _M_begin; 191 _M_begin, _M_end, __pred,
|
H A D | multiway_mergesort.h | 51 _DifferenceType _M_begin; member in struct:__gnu_parallel::_Piece 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-current/external/gpl3/gcc/dist/libstdc++-v3/include/bits/ |
H A D | regex_executor.h | 75 _M_begin(__begin), 93 _M_current = _M_begin; 101 _M_current = _M_begin; 169 if (_M_current == _M_begin) 171 // match_not_bol means ^ does not match [_M_begin,_M_begin) 174 // match_prev_avail means _M_begin is not the start of the input. 184 else // ^ matches at _M_begin 295 _BiIter _M_begin; member in class:__detail::_Executor
|
H A D | ranges_util.h | 236 _It _M_begin = _It(); member in class:ranges::subrange 260 : _M_begin(std::move(__i)), _M_end(__s) 269 : _M_begin(std::move(__i)), _M_end(__s) 312 { return _PairLike(_M_begin, _M_end); } 316 { return _M_begin; } 320 { return std::move(_M_begin); } 324 constexpr bool empty() const { return _M_begin == _M_end; } 332 return __detail::__to_unsigned_like(_M_end - _M_begin); 368 ranges::advance(_M_begin, __n); 375 auto __d = __n - ranges::advance(_M_begin, __ [all...] |
H A D | stl_tree.h | 740 _M_begin() _GLIBCXX_NOEXCEPT 744 _M_begin() const _GLIBCXX_NOEXCEPT 986 { _M_erase(_M_begin()); } 1256 _M_erase(_M_begin()); 1272 { return _M_lower_bound(_M_begin(), _M_end(), __k); } 1276 { return _M_lower_bound(_M_begin(), _M_end(), __k); } 1280 { return _M_upper_bound(_M_begin(), _M_end(), __k); } 1284 { return _M_upper_bound(_M_begin(), _M_end(), __k); } 1336 auto __x = _M_begin(); 1363 auto __x = _M_begin(); [all...] |
H A D | hashtable.h | 405 if (_M_begin()) 406 _M_buckets[_M_bucket_index(*_M_begin())] = &_M_before_begin; 465 _M_begin() const function in class:_Hashtable 600 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); 625 { return iterator(_M_begin()); } 629 { return const_iterator(_M_begin()); } 641 { return const_iterator(_M_begin()); } 1259 this->_M_deallocate_nodes(_M_begin()); 1319 __reuse_or_alloc_node_gen_t __roan(_M_begin(), *this); 1362 __node_ptr __ht_n = __ht._M_begin(); [all...] |
H A D | regex.h | 1922 { return std::distance(_M_begin, (*this)[__sub].first); } 2105 swap(_M_begin, __that._M_begin); 2164 _Bi_iter _M_begin {}; 2760 : _M_begin(__a), _M_end(__b), _M_pregex(&__re), _M_flags(__m), _M_match() 2762 if (!regex_search(_M_begin, _M_end, _M_match, *_M_pregex, _M_flags)) 2835 _Bi_iter _M_begin {};
|