Searched refs:_M_base (Results 1 - 20 of 20) sorted by relevance

/haiku-buildtools/gcc/libstdc++-v3/include/debug/
H A Dsafe_unordered_container.h69 auto __local_end = _M_cont()._M_base().end(0);
71 [__local_end](__decltype(_M_cont()._M_base().cend(0)) __it)
78 auto __end = _M_cont()._M_base().end();
80 [__end](__decltype(_M_cont()._M_base().cend()) __it)
H A Dsafe_sequence.h82 _Iterator _M_base; member in class:__gnu_debug::_After_nth_from
87 : _M_base(__base), _M_n(__n) { }
91 { return __x - _M_base >= _M_n; }
145 this->_M_invalidate_if(_Not_equal(__seq._M_base().end()));
H A Dsafe_container.h114 __glibcxx_check_equal_allocs(this->_M_cont()._M_base(),
115 __x._M_cont()._M_base());
H A Dmap.h109 _Base(std::move(__m._M_base()), __a) { }
146 _M_base() = __x;
159 _M_base() = __l;
456 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
459 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
467 { return __lhs._M_base() == __rhs._M_base(); }
474 { return __lhs._M_base() != __rhs._M_base(); }
481 { return __lhs._M_base() < __rh
[all...]
H A Dmultimap.h109 _Base(std::move(__m._M_base()), __a) { }
145 _M_base() = __x;
158 _M_base() = __l;
437 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
440 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
448 { return __lhs._M_base() == __rhs._M_base(); }
455 { return __lhs._M_base() != __rhs._M_base(); }
462 { return __lhs._M_base() < __rh
[all...]
H A Dmultiset.h108 _Base(std::move(__m._M_base()), __a) { }
145 _M_base() = __x;
158 _M_base() = __l;
432 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
435 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
442 { return __lhs._M_base() == __rhs._M_base(); }
448 { return __lhs._M_base() != __rhs._M_base(); }
454 { return __lhs._M_base() < __rh
[all...]
H A Dset.h108 _Base(std::move(__x._M_base()), __a) { }
144 _M_base() = __x;
157 _M_base() = __l;
439 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
442 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
449 { return __lhs._M_base() == __rhs._M_base(); }
455 { return __lhs._M_base() != __rhs._M_base(); }
461 { return __lhs._M_base() < __rh
[all...]
H A Dsafe_iterator.h55 { return __it.base() == __it._M_get_sequence()->_M_base().begin(); }
470 return ++__base != _M_get_sequence()->_M_base().end();
504 { return base() == _M_get_sequence()->_M_base().begin(); }
509 { return base() == _M_get_sequence()->_M_base().end(); }
H A Dsafe_local_iterator.h342 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
346 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
H A Dfunctions.h195 const _PointerType __begin = std::__addressof(*__seq->_M_base().begin());
196 const _PointerType __end = std::__addressof(*(__seq->_M_base().end()-1));
/haiku-buildtools/gcc/libstdc++-v3/include/parallel/
H A Dqueue.h56 _Tp* _M_base; member in class:__gnu_parallel::_RestrictedBoundedConcurrentQueue
71 _M_base = new _Tp[__max_size];
78 { delete[] _M_base; }
88 *(_M_base + __former_front % _M_max_size) = __t;
115 __t = *(_M_base + (__former_front - 1) % _M_max_size);
142 __t = *(_M_base + __former_back % _M_max_size);
/haiku-buildtools/gcc/libstdc++-v3/include/profile/
H A Dmultiset.h135 _M_base() = __x;
150 _M_base() = __l;
457 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
460 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
473 || (__hint == _M_base().end() && ++__res == _M_base().end())
474 || (__hint != _M_base().end() && (++__hint == __res
496 return __lhs._M_base() == __rhs._M_base();
506 return __lhs._M_base() < __rh
[all...]
H A Dmap.h134 _M_base() = __x;
149 _M_base() = __l;
499 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
502 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
515 || (__hint == _M_base().end() && ++__res == _M_base().end())
516 || (__hint != _M_base().end() && (++__hint == __res
540 return __lhs._M_base() == __rhs._M_base();
551 return __lhs._M_base() < __rh
[all...]
H A Dmultimap.h134 _M_base() = __x;
149 _M_base() = __l;
458 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
461 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
474 || (__hint == _M_base().end() && ++__res == _M_base().end())
475 || (__hint != _M_base().end() && (++__hint == __res
498 return __lhs._M_base() == __rhs._M_base();
509 return __lhs._M_base() < __rh
[all...]
H A Dset.h132 _M_base() = __x;
147 _M_base() = __l;
440 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
443 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
456 || (__hint == _M_base().end() && ++__res == _M_base().end())
457 || (__hint != _M_base().end() && (++__hint == __res
477 return __lhs._M_base() == __rhs._M_base();
487 return __lhs._M_base() < __rh
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/bits/
H A Dregex.h97 _BaseType _M_base; member in struct:regex_traits::_RegexMask
104 : _M_base(__base), _M_extended(__extended)
110 return _RegexMask(_M_base & __other._M_base,
117 return _RegexMask(_M_base | __other._M_base,
124 return _RegexMask(_M_base ^ __other._M_base,
130 { return _RegexMask(~_M_base, ~_M_extended); }
149 && _M_base
[all...]
/haiku-buildtools/legacy/gcc/libstdc++/stl/
H A Dstl_rope.h667 _Rope_RopeRep<_CharT,_Alloc>* _M_base; // not 0 member in struct:_Rope_RopeSubstring
671 switch(_M_base->_M_tag) {
676 ((_Rope_RopeFunction<_CharT,_Alloc>*)_M_base)->_M_fn;
678 __stl_assert(_M_start + _M_size <= _M_base->_M_size);
685 ((_Rope_RopeLeaf<_CharT,_Alloc>*)_M_base)->_M_data;
697 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a), _M_base(__b)
703 _M_base->_M_ref_nonnil();
710 _M_base->_M_unref_nonnil();
H A Dropeimpl.h709 _S_new_RopeSubstring(__old->_M_base,
/haiku-buildtools/gcc/libstdc++-v3/include/ext/
H A Dbitmap_allocator.h468 _M_base() const throw() function in class:__detail::_Bitmap_counter
475 * ((reinterpret_cast<size_t*>(this->_M_base())
897 (_S_last_request._M_base() + _S_last_request._M_offset() + __nz_bit);
H A Dropeimpl.h796 _S_new_RopeSubstring(__old->_M_base,

Completed in 294 milliseconds