⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 _list.h

📁 symbian 上的stl_port进过编译的。
💻 H
📖 第 1 页 / 共 2 页
字号:
    _Invalidate_iterator(end());    _M_non_dbg_impl.pop_back();  }  void push_front(const_reference __x) { _M_non_dbg_impl.push_front(__x); }  void pop_front() {    _STLP_VERBOSE_ASSERT(!empty(), _StlMsg_EMPTY_CONTAINER)    _Invalidate_iterator(begin());    _M_non_dbg_impl.pop_front();  }  iterator erase(iterator __pos) {    _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__pos))    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))    _Invalidate_iterator(__pos);    return iterator(&_M_iter_list,_M_non_dbg_impl.erase(__pos._M_iterator));  }  iterator erase(iterator __first, iterator __last) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last, begin(), end()))    _Invalidate_iterators(__first, __last);    return iterator (&_M_iter_list, _M_non_dbg_impl.erase(__first._M_iterator, __last._M_iterator));  }#if !defined(_STLP_DONT_SUP_DFLT_PARAM)  void resize(size_type __new_size, const _Tp& __x = _Tp()) {#else  void resize(size_type __new_size, const _Tp& __x) {#endif /*_STLP_DONT_SUP_DFLT_PARAM*/    _Base_iterator __i = _M_non_dbg_impl.begin();    size_type __len = 0;    for ( ; __i != _M_non_dbg_impl.end() && __len < __new_size; ++__i, ++__len);    if (__len == __new_size)      erase(iterator(&_M_iter_list, __i), end());    else                          // __i == end()      _M_non_dbg_impl.insert(_M_non_dbg_impl.end(), __new_size - __len, __x);  }#if defined(_STLP_DONT_SUP_DFLT_PARAM)  void resize(size_type __new_size) { resize(__new_size, _STLP_DEFAULT_CONSTRUCTED(_Tp)); }#endif /*_STLP_DONT_SUP_DFLT_PARAM*/#if defined (_STLP_MEMBER_TEMPLATES)private:  template <class _Integer>  void _M_assign_dispatch(_Integer __n, _Integer __val,                          const __true_type& /*_IsIntegral*/) {    _M_check_assign(__n);    _M_non_dbg_impl.assign(__n, __val);  }  template <class _InputIter>  void _M_assign_dispatch(_InputIter __first, _InputIter __last,                          const __false_type& /*_IsIntegral*/) {    size_type __len = distance(__first, __last);    _M_check_assign(__len);    _M_non_dbg_impl.assign(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));  }public:  template <class _InputIterator>  void assign(_InputIterator __first, _InputIterator __last) {    typedef typename _IsIntegral<_InputIterator>::_Ret _Integral;    _M_assign_dispatch(__first, __last, _Integral());  }#else  void assign(const _Tp* __first, const _Tp* __last) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__first, __last))    _M_non_dbg_impl.assign(__first, __last);  }  void assign(const_iterator __first, const_iterator __last) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last))    _M_non_dbg_impl.assign(__first._M_iterator, __last._M_iterator);  }#endifprivate:  void _M_check_assign(size_type __n) {    size_type __size = size();    if (__n < __size) {      iterator __it = begin();      advance(__it, __n + 1);      _Invalidate_iterators(__it, end());    }  }public:  void assign(size_type __n, const _Tp& __val) {    _M_check_assign(__n);    _M_non_dbg_impl.assign(__n, __val);  }  void remove(const _Tp& __x) {    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();    while (__first != __last) {      _Base_iterator __next = __first;      ++__next;      if (__x == *__first) {        _Invalidate_iterator(iterator(&_M_iter_list, __first));        _M_non_dbg_impl.erase(__first);      }      __first = __next;    }  }  void clear() {    _Invalidate_iterators(begin(), end());    _M_non_dbg_impl.clear();  }public:  void splice(iterator __pos, _Self& __x) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl);#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)    if (get_allocator() == __x.get_allocator())      __x._M_iter_list._Set_owner(_M_iter_list);    else#endif      // Std: 23.2.2.4:4      // end iterator is not invalidated:      __x._Invalidate_iterators(__x.begin(), __x.end());  }  void splice(iterator __pos, _Self& __x, iterator __i) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list,__pos))    _STLP_DEBUG_CHECK(_STLP_PRIV _Dereferenceable(__i))    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&(__x._M_iter_list),__i))    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __i._M_iterator);#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)    if (get_allocator() == __x.get_allocator())      _STLP_PRIV __change_ite_owner(__i, &_M_iter_list);    else#endif      // Std: 23.2.2.4:7      __x._Invalidate_iterator(__i);  }  void splice(iterator __pos, _Self& __x, iterator __first, iterator __last) {    _STLP_DEBUG_CHECK(_STLP_PRIV __check_if_owner(&_M_iter_list, __pos))    _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__first, __last, __x.begin(), __x.end()))    _STLP_DEBUG_CHECK(this == &__x ? !_STLP_PRIV __check_range(__pos, __first, __last) : true)#if (_STLP_DEBUG_LEVEL != _STLP_STANDARD_DBG_LEVEL)    if (this->get_allocator() == __x.get_allocator())      _STLP_PRIV __change_range_owner(__first, __last, &_M_iter_list);    else#endif      // Std: 23.2.2.4:12      __x._Invalidate_iterators(__first, __last);    _M_non_dbg_impl.splice(__pos._M_iterator, __x._M_non_dbg_impl, __first._M_iterator, __last._M_iterator);  }  void merge(_Self& __x) {#if !defined (_STLP_NO_EXTENSIONS)    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(begin()._M_iterator, end()._M_iterator))    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(__x.begin()._M_iterator, __x.end()._M_iterator))#endif    _M_non_dbg_impl.merge(__x._M_non_dbg_impl);    if (this->get_allocator() == __x.get_allocator()) {      __x._M_iter_list._Set_owner(_M_iter_list);    }    else {      __x._Invalidate_iterators(__x.begin(), __x.end());    }  }  void reverse() {    _M_non_dbg_impl.reverse();  }  void unique() {    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();    if (__first == __last) return;    _Base_iterator __next = __first;    while (++__next != __last) {      if (*__first == *__next) {        _Invalidate_iterator(iterator(&_M_iter_list, __next));        _M_non_dbg_impl.erase(__next);      }      else        __first = __next;      __next = __first;    }  }  void sort() {    _M_non_dbg_impl.sort();  }#if defined (_STLP_MEMBER_TEMPLATES)  template <class _Predicate>  void remove_if(_Predicate __pred) {    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();    while (__first != __last) {      _Base_iterator __next = __first;      ++__next;      if (__pred(*__first)) {        _Invalidate_iterator(iterator(&_M_iter_list, __first));        _M_non_dbg_impl.erase(__first);      }      __first = __next;    }  }  template <class _BinaryPredicate>  void unique(_BinaryPredicate __binary_pred) {    _Base_iterator __first = _M_non_dbg_impl.begin(), __last = _M_non_dbg_impl.end();    if (__first == __last) return;    _Base_iterator __next = __first;    while (++__next != __last) {      if (__binary_pred(*__first, *__next)) {        _Invalidate_iterator(iterator(&_M_iter_list, __next));        _M_non_dbg_impl.erase(__next);      }      else        __first = __next;      __next = __first;    }  }  template <class _StrictWeakOrdering>  void merge(_Self& __x, _StrictWeakOrdering __comp) {#if !defined (_STLP_NO_EXTENSIONS)    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(_M_non_dbg_impl.begin(), _M_non_dbg_impl.end(), __comp))    _STLP_DEBUG_CHECK(_STLP_STD::is_sorted(__x.begin()._M_iterator, __x.end()._M_iterator, __comp))#endif    _M_non_dbg_impl.merge(__x._M_non_dbg_impl, __comp);    if (this->get_allocator() == __x.get_allocator()) {      __x._M_iter_list._Set_owner(_M_iter_list);    }    else {      __x._Invalidate_iterators(__x.begin(), __x.end());    }  }  template <class _StrictWeakOrdering>  void sort(_StrictWeakOrdering __comp) {    _M_non_dbg_impl.sort(__comp);  }#endif};_STLP_END_NAMESPACE#undef _STLP_NON_DBG_LIST#endif /* _STLP_INTERNAL_LIST_H */// Local Variables:// mode:C++// End:

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -