williamr@4: /* williamr@4: * williamr@4: * Copyright (c) 1994 williamr@4: * Hewlett-Packard Company williamr@4: * williamr@4: * Copyright (c) 1996,1997 williamr@4: * Silicon Graphics Computer Systems, Inc. williamr@4: * williamr@4: * Copyright (c) 1997 williamr@4: * Moscow Center for SPARC Technology williamr@4: * williamr@4: * Copyright (c) 1999 williamr@4: * Boris Fomitchev williamr@4: * williamr@4: * This material is provided "as is", with absolutely no warranty expressed williamr@4: * or implied. Any use is at your own risk. williamr@4: * williamr@4: * Permission to use or copy this software for any purpose is hereby granted williamr@4: * without fee, provided the above notices are retained on all copies. williamr@4: * Permission to modify the code and to distribute modified code is granted, williamr@4: * provided the above notices are retained, and a notice that the code was williamr@4: * modified is included with the above copyright notice. williamr@4: * williamr@4: */ williamr@4: williamr@4: /* NOTE: This is an internal header file, included by other STL headers. williamr@4: * You should not attempt to use it directly. williamr@4: */ williamr@4: williamr@4: #ifndef _STLP_INTERNAL_SET_H williamr@4: #define _STLP_INTERNAL_SET_H williamr@4: williamr@4: #ifndef _STLP_INTERNAL_TREE_H williamr@4: # include williamr@4: #endif williamr@4: williamr@4: #if !defined (_STLP_USE_PTR_SPECIALIZATIONS) williamr@4: williamr@4: _STLP_BEGIN_NAMESPACE williamr@4: williamr@4: //Specific iterator traits creation williamr@4: _STLP_CREATE_ITERATOR_TRAITS(SetTraitsT, Const_traits) williamr@4: williamr@4: template ), williamr@4: _STLP_DEFAULT_ALLOCATOR_SELECT(_Key) > williamr@4: class set williamr@4: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) williamr@4: : public __stlport_class > williamr@4: #endif williamr@4: { williamr@4: typedef set<_Key, _Compare, _Alloc> _Self; williamr@4: public: williamr@4: // typedefs: williamr@4: typedef _Key key_type; williamr@4: typedef _Key value_type; williamr@4: typedef _Compare key_compare; williamr@4: typedef _Compare value_compare; williamr@4: williamr@4: private: williamr@4: //Specific iterator traits creation williamr@4: typedef _STLP_PRIV _SetTraitsT _SetTraits; williamr@4: williamr@4: public: williamr@4: //Following typedef have to be public for __move_traits specialization. williamr@4: typedef _STLP_PRIV _Rb_tree, williamr@4: _SetTraits, _Alloc> _Rep_type; williamr@4: williamr@4: typedef typename _Rep_type::pointer pointer; williamr@4: typedef typename _Rep_type::const_pointer const_pointer; williamr@4: typedef typename _Rep_type::reference reference; williamr@4: typedef typename _Rep_type::const_reference const_reference; williamr@4: typedef typename _Rep_type::iterator iterator; williamr@4: typedef typename _Rep_type::const_iterator const_iterator; williamr@4: typedef typename _Rep_type::reverse_iterator reverse_iterator; williamr@4: typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; williamr@4: typedef typename _Rep_type::size_type size_type; williamr@4: typedef typename _Rep_type::difference_type difference_type; williamr@4: typedef typename _Rep_type::allocator_type allocator_type; williamr@4: williamr@4: private: williamr@4: _Rep_type _M_t; // red-black tree representing set williamr@4: _STLP_KEY_TYPE_FOR_CONT_EXT(key_type) williamr@4: williamr@4: public: williamr@4: williamr@4: // allocation/deallocation williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM) williamr@4: explicit set(const _Compare& __comp = _Compare(), williamr@4: const allocator_type& __a = allocator_type()) williamr@4: #else williamr@4: set() williamr@4: : _M_t(_Compare(), allocator_type()) {} williamr@4: explicit set(const _Compare& __comp) williamr@4: : _M_t(__comp, allocator_type()) {} williamr@4: set(const _Compare& __comp, const allocator_type& __a) williamr@4: #endif williamr@4: : _M_t(__comp, __a) {} williamr@4: williamr@4: #if defined (_STLP_MEMBER_TEMPLATES) williamr@4: template williamr@4: set(_InputIterator __first, _InputIterator __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: williamr@4: # if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS) williamr@4: template williamr@4: set(_InputIterator __first, _InputIterator __last, const _Compare& __comp) williamr@4: : _M_t(__comp, allocator_type()) { _M_t.insert_unique(__first, __last); } williamr@4: # endif williamr@4: template williamr@4: set(_InputIterator __first, _InputIterator __last, const _Compare& __comp, williamr@4: const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) williamr@4: : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } williamr@4: #else williamr@4: set(const value_type* __first, const value_type* __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: williamr@4: set(const value_type* __first, williamr@4: const value_type* __last, const _Compare& __comp, williamr@4: const allocator_type& __a = allocator_type()) williamr@4: : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } williamr@4: williamr@4: set(const_iterator __first, const_iterator __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: williamr@4: set(const_iterator __first, const_iterator __last, const _Compare& __comp, williamr@4: const allocator_type& __a = allocator_type()) williamr@4: : _M_t(__comp, __a) { _M_t.insert_unique(__first, __last); } williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@4: williamr@4: set(const _Self& __x) : _M_t(__x._M_t) {} williamr@4: williamr@4: set(__move_source<_Self> src) williamr@4: : _M_t(__move_source<_Rep_type>(src.get()._M_t)) {} williamr@4: williamr@4: _Self& operator=(const _Self& __x) { williamr@4: _M_t = __x._M_t; williamr@4: return *this; williamr@4: } williamr@4: williamr@4: // accessors: williamr@4: key_compare key_comp() const { return _M_t.key_comp(); } williamr@4: value_compare value_comp() const { return _M_t.key_comp(); } williamr@4: allocator_type get_allocator() const { return _M_t.get_allocator(); } williamr@4: williamr@4: iterator begin() { return _M_t.begin(); } williamr@4: iterator end() { return _M_t.end(); } williamr@4: const_iterator begin() const { return _M_t.begin(); } williamr@4: const_iterator end() const { return _M_t.end(); } williamr@4: reverse_iterator rbegin() { return _M_t.rbegin(); } williamr@4: reverse_iterator rend() { return _M_t.rend(); } williamr@4: const_reverse_iterator rbegin() const { return _M_t.rbegin(); } williamr@4: const_reverse_iterator rend() const { return _M_t.rend(); } williamr@4: bool empty() const { return _M_t.empty(); } williamr@4: size_type size() const { return _M_t.size(); } williamr@4: size_type max_size() const { return _M_t.max_size(); } williamr@4: void swap(_Self& __x) { _M_t.swap(__x._M_t); } williamr@4: williamr@4: // insert/erase williamr@4: pair insert(const value_type& __x) williamr@4: { return _M_t.insert_unique(__x); } williamr@4: iterator insert(iterator __pos, const value_type& __x) williamr@4: { return _M_t.insert_unique( __pos , __x); } williamr@4: #if defined (_STLP_MEMBER_TEMPLATES) williamr@4: template williamr@4: void insert(_InputIterator __first, _InputIterator __last) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: #else williamr@4: void insert(const_iterator __first, const_iterator __last) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: void insert(const value_type* __first, const value_type* __last) williamr@4: { _M_t.insert_unique(__first, __last); } williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@4: void erase(iterator __pos) { _M_t.erase( __pos ); } williamr@4: size_type erase(const key_type& __x) { return _M_t.erase_unique(__x); } williamr@4: void erase(iterator __first, iterator __last) { _M_t.erase(__first, __last ); } williamr@4: void clear() { _M_t.clear(); } williamr@4: williamr@4: // set operations: williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator find(const _KT& __x) const { return _M_t.find(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator find(const _KT& __x) { return _M_t.find(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: size_type count(const _KT& __x) const williamr@4: { return _M_t.find(__x) == _M_t.end() ? 0 : 1 ; } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: pair equal_range(const _KT& __x) williamr@4: { return _M_t.equal_range_unique(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: pair equal_range(const _KT& __x) const williamr@4: { return _M_t.equal_range_unique(__x); } williamr@4: }; williamr@4: williamr@4: //Specific iterator traits creation williamr@4: _STLP_CREATE_ITERATOR_TRAITS(MultisetTraitsT, Const_traits) williamr@4: williamr@4: template ), williamr@4: _STLP_DEFAULT_ALLOCATOR_SELECT(_Key) > williamr@4: class multiset williamr@4: #if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) williamr@4: : public __stlport_class > williamr@4: #endif williamr@4: { williamr@4: typedef multiset<_Key, _Compare, _Alloc> _Self; williamr@4: public: williamr@4: // typedefs: williamr@4: williamr@4: typedef _Key key_type; williamr@4: typedef _Key value_type; williamr@4: typedef _Compare key_compare; williamr@4: typedef _Compare value_compare; williamr@4: williamr@4: private: williamr@4: //Specific iterator traits creation williamr@4: typedef _STLP_PRIV _MultisetTraitsT _MultisetTraits; williamr@4: williamr@4: public: williamr@4: //Following typedef have to be public for __move_traits specialization. williamr@4: typedef _STLP_PRIV _Rb_tree, williamr@4: _MultisetTraits, _Alloc> _Rep_type; williamr@4: williamr@4: typedef typename _Rep_type::pointer pointer; williamr@4: typedef typename _Rep_type::const_pointer const_pointer; williamr@4: typedef typename _Rep_type::reference reference; williamr@4: typedef typename _Rep_type::const_reference const_reference; williamr@4: typedef typename _Rep_type::iterator iterator; williamr@4: typedef typename _Rep_type::const_iterator const_iterator; williamr@4: typedef typename _Rep_type::reverse_iterator reverse_iterator; williamr@4: typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator; williamr@4: typedef typename _Rep_type::size_type size_type; williamr@4: typedef typename _Rep_type::difference_type difference_type; williamr@4: typedef typename _Rep_type::allocator_type allocator_type; williamr@4: williamr@4: private: williamr@4: _Rep_type _M_t; // red-black tree representing multiset williamr@4: _STLP_KEY_TYPE_FOR_CONT_EXT(key_type) williamr@4: williamr@4: public: williamr@4: #if !defined (_STLP_DONT_SUP_DFLT_PARAM) williamr@4: explicit multiset(const _Compare& __comp = _Compare(), williamr@4: const allocator_type& __a = allocator_type()) williamr@4: #else williamr@4: multiset() williamr@4: : _M_t(_Compare(), allocator_type()) {} williamr@4: explicit multiset(const _Compare& __comp) williamr@4: : _M_t(__comp, allocator_type()) {} williamr@4: multiset(const _Compare& __comp, const allocator_type& __a) williamr@4: #endif williamr@4: : _M_t(__comp, __a) {} williamr@4: williamr@4: #if defined (_STLP_MEMBER_TEMPLATES) williamr@4: template williamr@4: multiset(_InputIterator __first, _InputIterator __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: williamr@4: template williamr@4: multiset(_InputIterator __first, _InputIterator __last, williamr@4: const _Compare& __comp, williamr@4: const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL) williamr@4: : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } williamr@4: # if defined (_STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS) williamr@4: template williamr@4: multiset(_InputIterator __first, _InputIterator __last, williamr@4: const _Compare& __comp) williamr@4: : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } williamr@4: # endif williamr@4: #else williamr@4: multiset(const value_type* __first, const value_type* __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: williamr@4: multiset(const value_type* __first, const value_type* __last, williamr@4: const _Compare& __comp, williamr@4: const allocator_type& __a = allocator_type()) williamr@4: : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } williamr@4: williamr@4: multiset(const_iterator __first, const_iterator __last) williamr@4: : _M_t(_Compare(), allocator_type()) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: williamr@4: multiset(const_iterator __first, const_iterator __last, williamr@4: const _Compare& __comp, williamr@4: const allocator_type& __a = allocator_type()) williamr@4: : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@4: williamr@4: multiset(const _Self& __x) : _M_t(__x._M_t) {} williamr@4: _Self& operator=(const _Self& __x) { williamr@4: _M_t = __x._M_t; williamr@4: return *this; williamr@4: } williamr@4: williamr@4: multiset(__move_source<_Self> src) williamr@4: : _M_t(__move_source<_Rep_type>(src.get()._M_t)) {} williamr@4: williamr@4: // accessors: williamr@4: key_compare key_comp() const { return _M_t.key_comp(); } williamr@4: value_compare value_comp() const { return _M_t.key_comp(); } williamr@4: allocator_type get_allocator() const { return _M_t.get_allocator(); } williamr@4: williamr@4: iterator begin() { return _M_t.begin(); } williamr@4: iterator end() { return _M_t.end(); } williamr@4: const_iterator begin() const { return _M_t.begin(); } williamr@4: const_iterator end() const { return _M_t.end(); } williamr@4: reverse_iterator rbegin() { return _M_t.rbegin(); } williamr@4: reverse_iterator rend() { return _M_t.rend(); } williamr@4: const_reverse_iterator rbegin() const { return _M_t.rbegin(); } williamr@4: const_reverse_iterator rend() const { return _M_t.rend(); } williamr@4: bool empty() const { return _M_t.empty(); } williamr@4: size_type size() const { return _M_t.size(); } williamr@4: size_type max_size() const { return _M_t.max_size(); } williamr@4: void swap(_Self& __x) { _M_t.swap(__x._M_t); } williamr@4: williamr@4: // insert/erase williamr@4: iterator insert(const value_type& __x) williamr@4: { return _M_t.insert_equal(__x); } williamr@4: iterator insert(iterator __pos, const value_type& __x) williamr@4: { return _M_t.insert_equal(__pos, __x); } williamr@4: williamr@4: #if defined (_STLP_MEMBER_TEMPLATES) williamr@4: template williamr@4: void insert(_InputIterator __first, _InputIterator __last) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: #else williamr@4: void insert(const value_type* __first, const value_type* __last) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: void insert(const_iterator __first, const_iterator __last) williamr@4: { _M_t.insert_equal(__first, __last); } williamr@4: #endif /* _STLP_MEMBER_TEMPLATES */ williamr@4: void erase(iterator __pos) { _M_t.erase( __pos ); } williamr@4: size_type erase(const key_type& __x) { return _M_t.erase(__x); } williamr@4: void erase(iterator __first, iterator __last) { _M_t.erase( __first, __last ); } williamr@4: void clear() { _M_t.clear(); } williamr@4: williamr@4: // multiset operations: williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator find(const _KT& __x) { return _M_t.find(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator find(const _KT& __x) const { return _M_t.find(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: size_type count(const _KT& __x) const { return _M_t.count(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator lower_bound(const _KT& __x) { return _M_t.lower_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator lower_bound(const _KT& __x) const { return _M_t.lower_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: iterator upper_bound(const _KT& __x) { return _M_t.upper_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: const_iterator upper_bound(const _KT& __x) const { return _M_t.upper_bound(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: pair equal_range(const _KT& __x) { return _M_t.equal_range(__x); } williamr@4: _STLP_TEMPLATE_FOR_CONT_EXT williamr@4: pair equal_range(const _KT& __x) const { return _M_t.equal_range(__x); } williamr@4: }; williamr@4: williamr@4: #else williamr@4: # include williamr@4: _STLP_BEGIN_NAMESPACE williamr@4: #endif /* _STLP_USE_PTR_SPECIALIZATIONS */ williamr@4: williamr@4: #define _STLP_TEMPLATE_HEADER template williamr@4: #define _STLP_TEMPLATE_CONTAINER set<_Key,_Compare,_Alloc> williamr@4: #include williamr@4: #undef _STLP_TEMPLATE_CONTAINER williamr@4: #define _STLP_TEMPLATE_CONTAINER multiset<_Key,_Compare,_Alloc> williamr@4: #include williamr@4: #undef _STLP_TEMPLATE_CONTAINER williamr@4: #undef _STLP_TEMPLATE_HEADER williamr@4: williamr@4: #if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) williamr@4: template williamr@4: struct __move_traits > : williamr@4: _STLP_PRIV __move_traits_aux::_Rep_type> williamr@4: {}; williamr@4: williamr@4: template williamr@4: struct __move_traits > : williamr@4: _STLP_PRIV __move_traits_aux::_Rep_type> williamr@4: {}; williamr@4: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */ williamr@4: williamr@4: _STLP_END_NAMESPACE williamr@4: williamr@4: #endif /* _STLP_INTERNAL_SET_H */ williamr@4: williamr@4: // Local Variables: williamr@4: // mode:C++ williamr@4: // End: