HomeSort by: relevance | last modified time | path
    Searched refs:_M_base (Results 1 - 25 of 37) sorted by relevancy

1 2

  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
queue.h 56 _Tp* _M_base;
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);
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
queue.h 56 _Tp* _M_base;
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);
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/debug/
safe_sequence.h 79 _Iterator _M_base;
84 : _M_base(__base), _M_n(__n) { }
88 { return __x - _M_base >= _M_n; }
142 this->_M_invalidate_if(_Not_equal(__seq._M_base().end()));
safe_unordered_container.h 69 auto __local_end = _M_cont()._M_base().cend(0);
95 _M_source._M_base().equal_range(_ExtractKey{}(*__it));
168 auto __end = _M_cont()._M_base().cend();
safe_container.h 124 __glibcxx_check_equal_allocs(this->_M_cont()._M_base(),
125 __x._M_cont()._M_base());
map.h 704 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
707 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
750 { return __lhs._M_base() == __rhs._M_base(); }
757 { return __lhs._M_base() <=> __rhs._M_base(); }
764 { return __lhs._M_base() != __rhs._M_base(); }
771 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
multimap.h 586 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
589 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
632 { return __lhs._M_base() == __rhs._M_base(); }
639 { return __lhs._M_base() <=> __rhs._M_base(); }
646 { return __lhs._M_base() != __rhs._M_base(); }
653 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
multiset.h 554 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
557 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
603 { return __lhs._M_base() == __rhs._M_base(); }
610 { return __lhs._M_base() <=> __rhs._M_base(); }
616 { return __lhs._M_base() != __rhs._M_base(); }
622 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
set.h 565 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
568 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
613 { return __lhs._M_base() == __rhs._M_base(); }
620 { return __lhs._M_base() <=> __rhs._M_base(); }
626 { return __lhs._M_base() != __rhs._M_base(); }
632 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
safe_local_iterator.h 364 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
368 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/debug/
safe_sequence.h 79 _Iterator _M_base;
84 : _M_base(__base), _M_n(__n) { }
88 { return __x - _M_base >= _M_n; }
142 this->_M_invalidate_if(_Not_equal(__seq._M_base().end()));
safe_unordered_container.h 69 auto __local_end = _M_cont()._M_base().cend(0);
95 _M_source._M_base().equal_range(_ExtractKey{}(*__it));
168 auto __end = _M_cont()._M_base().cend();
safe_container.h 138 __glibcxx_check_equal_allocs(this->_M_cont()._M_base(),
139 __x._M_cont()._M_base());
map.h 704 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
707 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
750 { return __lhs._M_base() == __rhs._M_base(); }
757 { return __lhs._M_base() <=> __rhs._M_base(); }
764 { return __lhs._M_base() != __rhs._M_base(); }
771 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
multimap.h 586 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
589 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
632 { return __lhs._M_base() == __rhs._M_base(); }
639 { return __lhs._M_base() <=> __rhs._M_base(); }
646 { return __lhs._M_base() != __rhs._M_base(); }
653 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
multiset.h 554 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
557 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
603 { return __lhs._M_base() == __rhs._M_base(); }
610 { return __lhs._M_base() <=> __rhs._M_base(); }
616 { return __lhs._M_base() != __rhs._M_base(); }
622 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
set.h 565 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
568 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
613 { return __lhs._M_base() == __rhs._M_base(); }
620 { return __lhs._M_base() <=> __rhs._M_base(); }
626 { return __lhs._M_base() != __rhs._M_base(); }
632 { return __lhs._M_base() < __rhs._M_base(); }
    [all...]
safe_local_iterator.h 364 { return base() == _M_get_sequence()->_M_base().begin(bucket()); }
368 { return base() == _M_get_sequence()->_M_base().end(bucket()); }
  /src/external/gpl3/gcc/dist/libstdc++-v3/include/bits/
unicode.h 566 _Range _M_base;
570 _Utf_view(_Range&& __r) : _M_base(std::forward<_Range>(__r)) { }
573 { return _M_begin(ranges::begin(_M_base), ranges::end(_M_base)); }
576 { return _M_end(ranges::begin(_M_base), ranges::end(_M_base)); }
578 constexpr bool empty() const { return ranges::empty(_M_base); }
749 // on increment, so operator* returns value_type(_M_base, _M_next).
756 : _M_base(__i)
778 const auto __end = _M_base.end()
    [all...]
stl_list.h 121 if (__x._M_base()->_M_next == __x._M_base())
125 this->_M_next->_M_prev = this->_M_prev->_M_next = this->_M_base();
133 _List_node_base* const __xnode = __x._M_base();
138 _List_node_base* const __node = this->_M_base();
160 _List_node_base* _M_base() { return this; }
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/
multiset.h 135 _M_base() = __x;
150 _M_base() = __l;
561 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
564 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
577 || (__hint == _M_base().end() && ++__res == _M_base().end())
578 || (__hint != _M_base().end() && (++__hint == __res
600 return __lhs._M_base() == __rhs._M_base();
610 return __lhs._M_base() < __rhs._M_base()
    [all...]
set.h 132 _M_base() = __x;
147 _M_base() = __l;
544 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
547 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
560 || (__hint == _M_base().end() && ++__res == _M_base().end())
561 || (__hint != _M_base().end() && (++__hint == __res
581 return __lhs._M_base() == __rhs._M_base();
591 return __lhs._M_base() < __rhs._M_base()
    [all...]
map.h 134 _M_base() = __x;
149 _M_base() = __l;
611 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
614 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
627 || (__hint == _M_base().end() && ++__res == _M_base().end())
628 || (__hint != _M_base().end() && (++__hint == __res
652 return __lhs._M_base() == __rhs._M_base();
663 return __lhs._M_base() < __rhs._M_base()
    [all...]
multimap.h 134 _M_base() = __x;
149 _M_base() = __l;
570 _M_base() _GLIBCXX_NOEXCEPT { return *this; }
573 _M_base() const _GLIBCXX_NOEXCEPT { return *this; }
586 || (__hint == _M_base().end() && ++__res == _M_base().end())
587 || (__hint != _M_base().end() && (++__hint == __res
610 return __lhs._M_base() == __rhs._M_base();
621 return __lhs._M_base() < __rhs._M_base()
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/bits/
stl_list.h 120 if (__x._M_base()->_M_next == __x._M_base())
124 this->_M_next->_M_prev = this->_M_prev->_M_next = this->_M_base();
132 _List_node_base* const __xnode = __x._M_base();
137 _List_node_base* const __node = this->_M_base();
159 _List_node_base* _M_base() { return this; }

Completed in 63 milliseconds

1 2