williamr@2: /* williamr@2: * williamr@2: * Copyright (c) 1994 williamr@2: * Hewlett-Packard Company williamr@2: * williamr@2: * Copyright (c) 1996,1997 williamr@2: * Silicon Graphics Computer Systems, Inc. williamr@2: * williamr@2: * Copyright (c) 1997 williamr@2: * Moscow Center for SPARC Technology williamr@2: * williamr@2: * Copyright (c) 1999 williamr@2: * Boris Fomitchev williamr@2: * williamr@2: * This material is provided "as is", with absolutely no warranty expressed williamr@2: * or implied. Any use is at your own risk. williamr@2: * williamr@2: * Permission to use or copy this software for any purpose is hereby granted williamr@2: * without fee, provided the above notices are retained on all copies. williamr@2: * Permission to modify the code and to distribute modified code is granted, williamr@2: * provided the above notices are retained, and a notice that the code was williamr@2: * modified is included with the above copyright notice. williamr@2: * williamr@2: */ williamr@2: williamr@2: /* NOTE: This is an internal header file, included by other STL headers. williamr@2: * You should not attempt to use it directly. williamr@2: */ williamr@2: williamr@2: #ifndef _STLP_INTERNAL_LIST_H williamr@2: #define _STLP_INTERNAL_LIST_H williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALGOBASE_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ALLOC_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_ITERATOR_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_CONSTRUCT_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: # ifndef _STLP_INTERNAL_FUNCTION_BASE_H williamr@2: # include williamr@2: # endif williamr@2: williamr@2: _STLP_BEGIN_NAMESPACE williamr@2: williamr@2: # undef list williamr@2: # define list __WORKAROUND_DBG_RENAME(list) williamr@2: williamr@2: struct _List_node_base { williamr@2: _List_node_base* _M_next; williamr@2: _List_node_base* _M_prev; williamr@2: }; williamr@2: williamr@2: template williamr@2: class _List_global { williamr@2: public: williamr@2: typedef _List_node_base _Node; williamr@2: static void _STLP_CALL _Transfer(_List_node_base* __position, williamr@2: _List_node_base* __first, _List_node_base* __last); williamr@2: }; williamr@2: williamr@2: # if defined (_STLP_USE_TEMPLATE_EXPORT) williamr@2: _STLP_EXPORT_TEMPLATE_CLASS _List_global; williamr@2: # endif williamr@2: typedef _List_global _List_global_inst; williamr@2: williamr@2: template williamr@2: struct _List_node : public _List_node_base { williamr@2: _Tp _M_data; williamr@2: __TRIVIAL_STUFF(_List_node) williamr@2: williamr@2: #ifdef __DMC__ williamr@2: // for some reason, Digital Mars C++ needs a constructor... williamr@2: private: williamr@2: _List_node(); williamr@2: #endif williamr@2: }; williamr@2: williamr@2: struct _List_iterator_base { williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: typedef bidirectional_iterator_tag iterator_category; williamr@2: williamr@2: _List_node_base* _M_node; williamr@2: williamr@2: _List_iterator_base(_List_node_base* __x) : _M_node(__x) {} williamr@2: _List_iterator_base() {} williamr@2: williamr@2: void _M_incr() { _M_node = _M_node->_M_next; } williamr@2: void _M_decr() { _M_node = _M_node->_M_prev; } williamr@2: bool operator==(const _List_iterator_base& __y ) const { williamr@2: return _M_node == __y._M_node; williamr@2: } williamr@2: bool operator!=(const _List_iterator_base& __y ) const { williamr@2: return _M_node != __y._M_node; williamr@2: } williamr@2: }; williamr@2: williamr@2: williamr@2: williamr@2: williamr@2: template williamr@2: struct _List_iterator : public _List_iterator_base { williamr@2: typedef _Tp value_type; williamr@2: typedef typename _Traits::pointer pointer; williamr@2: typedef typename _Traits::reference reference; williamr@2: williamr@2: typedef _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; williamr@2: typedef _List_iterator<_Tp, _Const_traits<_Tp> > const_iterator; williamr@2: typedef _List_iterator<_Tp, _Traits> _Self; williamr@2: williamr@2: typedef bidirectional_iterator_tag iterator_category; williamr@2: typedef _List_node<_Tp> _Node; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: williamr@2: _List_iterator(_Node* __x) : _List_iterator_base(__x) {} williamr@2: _List_iterator() {} williamr@2: _List_iterator(const iterator& __x) : _List_iterator_base(__x._M_node) {} williamr@2: williamr@2: reference operator*() const { return ((_Node*)_M_node)->_M_data; } williamr@2: williamr@2: _STLP_DEFINE_ARROW_OPERATOR williamr@2: williamr@2: _Self& operator++() { williamr@2: this->_M_incr(); williamr@2: return *this; williamr@2: } williamr@2: _Self operator++(int) { williamr@2: _Self __tmp = *this; williamr@2: this->_M_incr(); williamr@2: return __tmp; williamr@2: } williamr@2: _Self& operator--() { williamr@2: this->_M_decr(); williamr@2: return *this; williamr@2: } williamr@2: _Self operator--(int) { williamr@2: _Self __tmp = *this; williamr@2: this->_M_decr(); williamr@2: return __tmp; williamr@2: } williamr@2: }; williamr@2: williamr@2: williamr@2: #ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES williamr@2: template williamr@2: inline _Tp* value_type(const _List_iterator<_Tp, _Traits>&) { return 0; } williamr@2: inline bidirectional_iterator_tag iterator_category(const _List_iterator_base&) { return bidirectional_iterator_tag();} williamr@2: inline ptrdiff_t* distance_type(const _List_iterator_base&) { return 0; } williamr@2: #endif williamr@2: williamr@2: williamr@2: // Base class that encapsulates details of allocators and helps williamr@2: // to simplify EH williamr@2: williamr@2: template williamr@2: class _List_base williamr@2: { williamr@2: protected: williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef _List_node<_Tp> _Node; williamr@2: typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type williamr@2: _Node_allocator_type; williamr@2: public: williamr@2: typedef typename _Alloc_traits<_Tp, _Alloc>::allocator_type williamr@2: allocator_type; williamr@2: williamr@2: allocator_type get_allocator() const { williamr@2: return _STLP_CONVERT_ALLOCATOR((const _Node_allocator_type&)_M_node, _Tp); williamr@2: } williamr@2: williamr@2: _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), (_Node*)0) { williamr@2: _Node* __n = _M_node.allocate(1); williamr@2: __n->_M_next = __n; williamr@2: __n->_M_prev = __n; williamr@2: _M_node._M_data = __n; williamr@2: } williamr@2: ~_List_base() { williamr@2: clear(); williamr@2: _M_node.deallocate(_M_node._M_data, 1); williamr@2: } williamr@2: williamr@2: void clear(); williamr@2: williamr@2: public: williamr@2: _STLP_alloc_proxy<_Node*, _Node, _Node_allocator_type> _M_node; williamr@2: }; williamr@2: williamr@2: template williamr@2: class list; williamr@2: williamr@2: // helper functions to reduce code duplication williamr@2: template williamr@2: void _S_remove_if(list<_Tp, _Alloc>& __that, _Predicate __pred); williamr@2: williamr@2: template williamr@2: void _S_unique(list<_Tp, _Alloc>& __that, _BinaryPredicate __binary_pred); williamr@2: williamr@2: template williamr@2: void _S_merge(list<_Tp, _Alloc>& __that, list<_Tp, _Alloc>& __x, williamr@2: _StrictWeakOrdering __comp); williamr@2: williamr@2: template williamr@2: void _S_sort(list<_Tp, _Alloc>& __that, _StrictWeakOrdering __comp); williamr@2: williamr@2: template williamr@2: class list : public _List_base<_Tp, _Alloc> { williamr@2: typedef _List_base<_Tp, _Alloc> _Base; williamr@2: typedef list<_Tp, _Alloc> _Self; williamr@2: public: williamr@2: typedef _Tp value_type; williamr@2: typedef value_type* pointer; williamr@2: typedef const value_type* const_pointer; williamr@2: typedef value_type& reference; williamr@2: typedef const value_type& const_reference; williamr@2: typedef _List_node<_Tp> _Node; williamr@2: typedef size_t size_type; williamr@2: typedef ptrdiff_t difference_type; williamr@2: _STLP_FORCE_ALLOCATORS(_Tp, _Alloc) williamr@2: typedef typename _Base::allocator_type allocator_type; williamr@2: typedef bidirectional_iterator_tag _Iterator_category; williamr@2: williamr@2: public: williamr@2: typedef _List_iterator<_Tp, _Nonconst_traits<_Tp> > iterator; williamr@2: typedef _List_iterator<_Tp, _Const_traits<_Tp> > const_iterator; williamr@2: _STLP_DECLARE_BIDIRECTIONAL_REVERSE_ITERATORS; williamr@2: williamr@2: protected: williamr@2: _Node* _M_create_node(const _Tp& __x) williamr@2: { williamr@2: _Node* __p = this->_M_node.allocate(1); williamr@2: _STLP_TRY { williamr@2: _Construct(&__p->_M_data, __x); williamr@2: } williamr@2: _STLP_UNWIND(this->_M_node.deallocate(__p, 1)); williamr@2: return __p; williamr@2: } williamr@2: williamr@2: _Node* _M_create_node() williamr@2: { williamr@2: _Node* __p = this->_M_node.allocate(1); williamr@2: _STLP_TRY { williamr@2: _Construct(&__p->_M_data); williamr@2: } williamr@2: _STLP_UNWIND(this->_M_node.deallocate(__p, 1)); williamr@2: return __p; williamr@2: } williamr@2: williamr@2: public: williamr@2: # if !(defined(__MRC__)||(defined(__SC__) && !defined(__DMC__))) williamr@2: explicit williamr@2: # endif williamr@2: list(const allocator_type& __a = allocator_type()) : williamr@2: _List_base<_Tp, _Alloc>(__a) { williamr@2: _STLP_POP_IF_CHECK williamr@2: } williamr@2: williamr@2: iterator begin() { return iterator((_Node*)(this->_M_node._M_data->_M_next)); } williamr@2: const_iterator begin() const { return const_iterator((_Node*)(this->_M_node._M_data->_M_next)); } williamr@2: williamr@2: iterator end() { return this->_M_node._M_data; } williamr@2: const_iterator end() const { return this->_M_node._M_data; } williamr@2: williamr@2: reverse_iterator rbegin() williamr@2: { return reverse_iterator(end()); } williamr@2: const_reverse_iterator rbegin() const williamr@2: { return const_reverse_iterator(end()); } williamr@2: williamr@2: reverse_iterator rend() williamr@2: { return reverse_iterator(begin()); } williamr@2: const_reverse_iterator rend() const williamr@2: { return const_reverse_iterator(begin()); } williamr@2: williamr@2: bool empty() const { return this->_M_node._M_data->_M_next == this->_M_node._M_data; } williamr@2: size_type size() const { williamr@2: size_type __result = distance(begin(), end()); williamr@2: return __result; williamr@2: } williamr@2: size_type max_size() const { return size_type(-1); } williamr@2: williamr@2: reference front() { return *begin(); } williamr@2: const_reference front() const { return *begin(); } williamr@2: reference back() { return *(--end()); } williamr@2: const_reference back() const { return *(--end()); } williamr@2: williamr@2: void swap(list<_Tp, _Alloc>& __x) { williamr@2: _STLP_STD::swap(this->_M_node, __x._M_node); williamr@2: } williamr@2: williamr@2: iterator insert(iterator __position, const _Tp& __x) { williamr@2: williamr@2: _Node* __tmp = _M_create_node(__x); williamr@2: _List_node_base* __n = __position._M_node; williamr@2: _List_node_base* __p = __n->_M_prev; williamr@2: __tmp->_M_next = __n; williamr@2: __tmp->_M_prev = __p; williamr@2: __p->_M_next = __tmp; williamr@2: __n->_M_prev = __tmp; williamr@2: return __tmp; williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template williamr@2: void insert(iterator __pos, _InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_insert_dispatch(__pos, __first, __last, _Integral()); williamr@2: } williamr@2: // Check whether it's an integral type. If so, it's not an iterator. williamr@2: template williamr@2: void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x, williamr@2: const __true_type&) { williamr@2: _M_fill_insert(__pos, (size_type) __n, (_Tp) __x); williamr@2: } williamr@2: template williamr@2: void williamr@2: _M_insert_dispatch(iterator __position, williamr@2: _InputIter __first, _InputIter __last, williamr@2: const __false_type&) williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: void insert(iterator __position, const _Tp* __first, const _Tp* __last) { williamr@2: for ( ; __first != __last; ++__first) williamr@2: insert(__position, *__first); williamr@2: } williamr@2: void insert(iterator __position, const_iterator __first, const_iterator __last) williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: { williamr@2: for ( ; __first != __last; ++__first) williamr@2: insert(__position, *__first); williamr@2: } williamr@2: void insert(iterator __pos, size_type __n, const _Tp& __x) { _M_fill_insert(__pos, __n, __x); } williamr@2: williamr@2: void _M_fill_insert(iterator __pos, size_type __n, const _Tp& __x) { williamr@2: for ( ; __n > 0; --__n) williamr@2: insert(__pos, __x); williamr@2: } williamr@2: void push_front(const _Tp& __x) { insert(begin(), __x); } williamr@2: void push_back(const _Tp& __x) { insert(end(), __x); } williamr@2: williamr@2: # ifndef _STLP_NO_ANACHRONISMS williamr@2: iterator insert(iterator __position) { return insert(__position, _Tp()); } williamr@2: void push_front() {insert(begin());} williamr@2: void push_back() {insert(end());} williamr@2: # endif williamr@2: williamr@2: iterator erase(iterator __position) { williamr@2: _List_node_base* __next_node = __position._M_node->_M_next; williamr@2: _List_node_base* __prev_node = __position._M_node->_M_prev; williamr@2: _Node* __n = (_Node*) __position._M_node; williamr@2: __prev_node->_M_next = __next_node; williamr@2: __next_node->_M_prev = __prev_node; williamr@2: _STLP_STD::_Destroy(&__n->_M_data); williamr@2: this->_M_node.deallocate(__n, 1); williamr@2: return iterator((_Node*)__next_node); williamr@2: } williamr@2: williamr@2: iterator erase(iterator __first, iterator __last) { williamr@2: while (__first != __last) williamr@2: erase(__first++); williamr@2: return __last; williamr@2: } williamr@2: williamr@2: void resize(size_type __new_size, _Tp __x); williamr@2: void resize(size_type __new_size) { this->resize(__new_size, _Tp()); } williamr@2: williamr@2: void pop_front() { erase(begin()); } williamr@2: void pop_back() { williamr@2: iterator __tmp = end(); williamr@2: erase(--__tmp); williamr@2: } williamr@2: list(size_type __n, const _Tp& __val, williamr@2: const allocator_type& __a = allocator_type()) williamr@2: : _List_base<_Tp, _Alloc>(__a) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: this->insert(begin(), __n, __val); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: explicit list(size_type __n) williamr@2: : _List_base<_Tp, _Alloc>(allocator_type()) williamr@2: { williamr@2: # ifdef _STLP_USE_TRAP_LEAVE williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: _Tp __p; williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Tp, &__p) williamr@2: this->insert(begin(), __n, __p); williamr@2: // unconditional for __p williamr@2: CleanupStack::Pop(); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: # else williamr@2: this->insert(begin(), __n, _Tp()); williamr@2: # endif williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: // We don't need any dispatching tricks here, because insert does all of williamr@2: // that anyway. williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS williamr@2: template williamr@2: list(_InputIterator __first, _InputIterator __last) williamr@2: : _List_base<_Tp, _Alloc>(allocator_type()) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: insert(begin(), __first, __last); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: # endif williamr@2: williamr@2: template williamr@2: list(_InputIterator __first, _InputIterator __last, williamr@2: const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) williamr@2: : _List_base<_Tp, _Alloc>(__a) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: insert(begin(), __first, __last); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: #else /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: list(const _Tp* __first, const _Tp* __last, williamr@2: const allocator_type& __a = allocator_type()) williamr@2: : _List_base<_Tp, _Alloc>(__a) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: insert(begin(), __first, __last); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: list(const_iterator __first, const_iterator __last, williamr@2: const allocator_type& __a = allocator_type()) williamr@2: : _List_base<_Tp, _Alloc>(__a) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: insert(begin(), __first, __last); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: list(const list<_Tp, _Alloc>& __x) : _List_base<_Tp, _Alloc>(__x.get_allocator()) williamr@2: { williamr@2: _STLP_PUSH_CLEANUP_ITEM(_Base, this) williamr@2: insert(begin(), __x.begin(), __x.end()); williamr@2: _STLP_POP_CLEANUP_ITEM williamr@2: } williamr@2: williamr@2: ~list() { } williamr@2: williamr@2: list<_Tp, _Alloc>& operator=(const list<_Tp, _Alloc>& __x); williamr@2: williamr@2: public: williamr@2: // assign(), a generalized assignment member function. Two williamr@2: // versions: one that takes a count, and one that takes a range. williamr@2: // The range version is a member template, so we dispatch on whether williamr@2: // or not the type is an integer. williamr@2: williamr@2: void assign(size_type __n, const _Tp& __val) { _M_fill_assign(__n, __val); } williamr@2: williamr@2: void _M_fill_assign(size_type __n, const _Tp& __val); williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: williamr@2: template williamr@2: void assign(_InputIterator __first, _InputIterator __last) { williamr@2: typedef typename _Is_integer<_InputIterator>::_Integral _Integral; williamr@2: _M_assign_dispatch(__first, __last, _Integral()); williamr@2: } williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&) williamr@2: { assign((size_type) __n, (_Tp) __val); } williamr@2: williamr@2: template williamr@2: void _M_assign_dispatch(_InputIterator __first2, _InputIterator __last2, williamr@2: const __false_type&) { williamr@2: iterator __first1 = begin(); williamr@2: iterator __last1 = end(); williamr@2: for ( ; __first1 != __last1 && __first2 != __last2; ++__first1, ++__first2) williamr@2: *__first1 = *__first2; williamr@2: if (__first2 == __last2) williamr@2: erase(__first1, __last1); williamr@2: else williamr@2: insert(__last1, __first2, __last2); williamr@2: } williamr@2: williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: public: williamr@2: void splice(iterator __position, _Self& __x) { williamr@2: if (!__x.empty()) williamr@2: _List_global_inst::_Transfer(__position._M_node, __x.begin()._M_node, __x.end()._M_node); williamr@2: } williamr@2: void splice(iterator __position, _Self&, iterator __i) { williamr@2: iterator __j = __i; williamr@2: ++__j; williamr@2: if (__position == __i || __position == __j) return; williamr@2: _List_global_inst::_Transfer(__position._M_node, __i._M_node, __j._M_node); williamr@2: } williamr@2: void splice(iterator __position, _Self&, iterator __first, iterator __last) { williamr@2: if (__first != __last) williamr@2: _List_global_inst::_Transfer(__position._M_node, __first._M_node, __last._M_node); williamr@2: } williamr@2: williamr@2: void remove(const _Tp& __val) { williamr@2: iterator __first = begin(); williamr@2: iterator __last = end(); williamr@2: while (__first != __last) { williamr@2: iterator __next = __first; williamr@2: ++__next; williamr@2: if (__val == *__first) erase(__first); williamr@2: __first = __next; williamr@2: } williamr@2: } williamr@2: williamr@2: void unique() { williamr@2: _S_unique(*this, equal_to<_Tp>()); williamr@2: } williamr@2: williamr@2: void merge(_Self& __x) { williamr@2: _S_merge(*this, __x, less<_Tp>()); williamr@2: } williamr@2: williamr@2: void reverse() { williamr@2: _List_node_base* __p = this->_M_node._M_data; williamr@2: _List_node_base* __tmp = __p; williamr@2: do { williamr@2: _STLP_STD::swap(__tmp->_M_next, __tmp->_M_prev); williamr@2: __tmp = __tmp->_M_prev; // Old next node is now prev. williamr@2: } while (__tmp != __p); williamr@2: } williamr@2: williamr@2: void sort() { williamr@2: _S_sort(*this, less<_Tp>()); williamr@2: } williamr@2: williamr@2: #ifdef _STLP_MEMBER_TEMPLATES williamr@2: template void remove_if(_Predicate __pred) { williamr@2: _S_remove_if(*this, __pred); williamr@2: } williamr@2: template williamr@2: void unique(_BinaryPredicate __binary_pred) { williamr@2: _S_unique(*this, __binary_pred); williamr@2: } williamr@2: williamr@2: template williamr@2: void merge(list<_Tp, _Alloc>& __x, williamr@2: _StrictWeakOrdering __comp) { williamr@2: _S_merge(*this, __x, __comp); williamr@2: } williamr@2: williamr@2: template williamr@2: void sort(_StrictWeakOrdering __comp) { williamr@2: _S_sort(*this, __comp); williamr@2: } williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@2: williamr@2: #ifdef _STLP_USE_TRAP_LEAVE williamr@2: public: williamr@2: static void* operator new (size_t __n, TLeave) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: static void* operator new (size_t __n) { return _STLP_StackHelper::_NewLC(__n); } williamr@2: #endif williamr@2: williamr@2: }; williamr@2: williamr@2: template williamr@2: _STLP_INLINE_LOOP bool _STLP_CALL williamr@2: operator==(const list<_Tp,_Alloc>& __x, const list<_Tp,_Alloc>& __y) williamr@2: { williamr@2: typedef typename list<_Tp,_Alloc>::const_iterator const_iterator; williamr@2: const_iterator __end1 = __x.end(); williamr@2: const_iterator __end2 = __y.end(); williamr@2: williamr@2: const_iterator __i1 = __x.begin(); williamr@2: const_iterator __i2 = __y.begin(); williamr@2: while (__i1 != __end1 && __i2 != __end2 && *__i1 == *__i2) { williamr@2: ++__i1; williamr@2: ++__i2; williamr@2: } williamr@2: return __i1 == __end1 && __i2 == __end2; williamr@2: } williamr@2: williamr@2: # define _STLP_EQUAL_OPERATOR_SPECIALIZED williamr@2: # define _STLP_TEMPLATE_HEADER template williamr@2: # define _STLP_TEMPLATE_CONTAINER list<_Tp, _Alloc> williamr@2: # include williamr@2: # undef _STLP_TEMPLATE_CONTAINER williamr@2: # undef _STLP_TEMPLATE_HEADER williamr@2: # undef _STLP_EQUAL_OPERATOR_SPECIALIZED williamr@2: williamr@2: _STLP_END_NAMESPACE williamr@2: williamr@2: # if !defined (_STLP_LINK_TIME_INSTANTIATION) williamr@2: # include williamr@2: # endif williamr@2: williamr@2: // do a cleanup williamr@2: # undef list williamr@2: # define __list__ __FULL_NAME(list) williamr@2: williamr@2: #if defined (_STLP_DEBUG) williamr@2: # include williamr@2: #endif williamr@2: williamr@2: #if defined (_STLP_USE_WRAPPER_FOR_ALLOC_PARAM) williamr@2: # include williamr@2: #endif williamr@2: williamr@2: #endif /* _STLP_INTERNAL_LIST_H */ williamr@2: williamr@2: // Local Variables: williamr@2: // mode:C++ williamr@2: // End: