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_BVECTOR_H
williamr@2: #define _STLP_INTERNAL_BVECTOR_H
williamr@2: 
williamr@2: #ifndef _STLP_INTERNAL_VECTOR_H
williamr@2: # include <stl/_vector.h>
williamr@2: # endif
williamr@2: 
williamr@2: #ifndef __WORD_BIT
williamr@2: #define __WORD_BIT (int(CHAR_BIT*sizeof(unsigned int)))
williamr@2: #endif
williamr@2: 
williamr@2: _STLP_BEGIN_NAMESPACE 
williamr@2: 
williamr@2: struct _Bit_reference {
williamr@2:   unsigned int* _M_p;
williamr@2:   unsigned int _M_mask;
williamr@2:   _Bit_reference(unsigned int* __x, unsigned int __y) 
williamr@2:     : _M_p(__x), _M_mask(__y) {}
williamr@2: 
williamr@2: public:
williamr@2:   _Bit_reference() : _M_p(0), _M_mask(0) {}
williamr@2: 
williamr@2:   operator bool() const { 
williamr@2: 	  return !(!(*_M_p & _M_mask)); 
williamr@2:   }
williamr@2:   _Bit_reference& operator=(bool __x) {
williamr@2:     if (__x)  *_M_p |= _M_mask;
williamr@2:     else      *_M_p &= ~_M_mask;
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Bit_reference& operator=(const _Bit_reference& __x) {
williamr@2: 	  return *this = bool(__x); 
williamr@2:   }
williamr@2:   bool operator==(const _Bit_reference& __x) const {
williamr@2: 	  return bool(*this) == bool(__x); 
williamr@2:   }
williamr@2:   bool operator<(const _Bit_reference& __x) const {
williamr@2:     return !bool(*this) && bool(__x);
williamr@2:   }
williamr@2: 
williamr@2:   _Bit_reference& operator |= (bool __x) {
williamr@2: 	  if (__x)
williamr@2: 		  *_M_p |= _M_mask;
williamr@2: 	  return *this;
williamr@2:   }
williamr@2:   _Bit_reference& operator &= (bool __x) {
williamr@2: 	  if (!__x)
williamr@2: 		  *_M_p &= ~_M_mask;
williamr@2: 	  return *this;
williamr@2:   }
williamr@2:   void flip() { *_M_p ^= _M_mask; }
williamr@2: };
williamr@2: 
williamr@2: 
williamr@2: inline void swap(_Bit_reference& __x, _Bit_reference& __y)
williamr@2: {
williamr@2:   bool __tmp = (bool)__x;
williamr@2:   __x = __y;
williamr@2:   __y = __tmp;
williamr@2: }
williamr@2: 
williamr@2: struct _Bit_iterator_base;
williamr@2: 
williamr@2: struct _Bit_iterator_base
williamr@2: {
williamr@2:   typedef ptrdiff_t difference_type;
williamr@2: 
williamr@2:   unsigned int* _M_p;
williamr@2:   unsigned int  _M_offset;
williamr@2: 
williamr@2:   void _M_bump_up() {
williamr@2:     if (_M_offset++ == __WORD_BIT - 1) {
williamr@2:       _M_offset = 0;
williamr@2:       ++_M_p;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   void _M_bump_down() {
williamr@2:     if (_M_offset-- == 0) {
williamr@2:       _M_offset = __WORD_BIT - 1;
williamr@2:       --_M_p;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   _Bit_iterator_base() : _M_p(0), _M_offset(0) {}
williamr@2:   _Bit_iterator_base(unsigned int* __x, unsigned int __y) : _M_p(__x), _M_offset(__y) {}
williamr@2:   //  _Bit_iterator_base( const _Bit_iterator_base& __x) : _M_p(__x._M_p), _M_offset(__x._M_offset) {}
williamr@2:   //  _Bit_iterator_base& operator = ( const _Bit_iterator_base& __x) { _M_p = __x._M_p ; _M_offset = __x._M_offset ; return *this; }
williamr@2: 
williamr@2:   void _M_advance (difference_type __i) {
williamr@2:     difference_type __n = __i + _M_offset;
williamr@2:     _M_p += __n / __WORD_BIT;
williamr@2:     __n = __n % __WORD_BIT;
williamr@2:     if (__n < 0) {
williamr@2:       _M_offset = (unsigned int) __n + __WORD_BIT;
williamr@2:       --_M_p;
williamr@2:     } else
williamr@2:       _M_offset = (unsigned int) __n;
williamr@2:   }
williamr@2: 
williamr@2:   difference_type _M_subtract(const _Bit_iterator_base& __x) const {
williamr@2:     return __WORD_BIT * (_M_p - __x._M_p) + _M_offset - __x._M_offset;
williamr@2:   }
williamr@2: };
williamr@2: 
williamr@2: inline bool  _STLP_CALL operator==(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) {
williamr@2:   return __y._M_p == __x._M_p && __y._M_offset == __x._M_offset;
williamr@2: }
williamr@2: inline bool  _STLP_CALL operator!=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) {
williamr@2:   return __y._M_p != __x._M_p || __y._M_offset != __x._M_offset;
williamr@2: }
williamr@2: 
williamr@2: inline bool _STLP_CALL operator<(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) {
williamr@2:   return __x._M_p < __y._M_p || (__x._M_p == __y._M_p && __x._M_offset < __y._M_offset);
williamr@2: }
williamr@2: 
williamr@2: inline bool _STLP_CALL operator>(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y)  { 
williamr@2:   return operator <(__y , __x); 
williamr@2: }
williamr@2: inline bool _STLP_CALL operator<=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { 
williamr@2:   return !(__y < __x); 
williamr@2: }
williamr@2: inline bool _STLP_CALL operator>=(const _Bit_iterator_base& __x, const _Bit_iterator_base& __y) { 
williamr@2:   return !(__x < __y); 
williamr@2: }
williamr@2: 
williamr@2: template <class _Ref, class _Ptr>
williamr@2: struct _Bit_iter : public _Bit_iterator_base
williamr@2: {
williamr@2:   typedef _Ref  reference;
williamr@2:   typedef _Ptr  pointer;
williamr@2:   typedef _Bit_iter<_Ref, _Ptr> _Self;
williamr@2:   typedef random_access_iterator_tag iterator_category;
williamr@2:   typedef bool value_type;
williamr@2:   typedef ptrdiff_t difference_type;
williamr@2:   typedef size_t size_type;
williamr@2: 
williamr@2:   _Bit_iter(unsigned int* __x, unsigned int __y) : _Bit_iterator_base(__x, __y) {}
williamr@2:   _Bit_iter() {}
williamr@2: 
williamr@2:   _Bit_iter(const _Bit_iter<_Bit_reference, _Bit_reference*>& __x): 
williamr@2:     _Bit_iterator_base((const _Bit_iterator_base&)__x) {}
williamr@2: 
williamr@2:   //  _Self& operator = (const _Bit_iter<_Bit_reference, _Bit_reference*>& __x)
williamr@2:   //   { (_Bit_iterator_base&)*this = (const _Bit_iterator_base&)__x; return *this; }
williamr@2: 
williamr@2:   reference operator*() const { 
williamr@2:     return _Bit_reference(_M_p, 1UL << _M_offset); 
williamr@2:   }
williamr@2:   _Self& operator++() {
williamr@2:     _M_bump_up();
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Self operator++(int) {
williamr@2:     _Self __tmp = *this;
williamr@2:     _M_bump_up();
williamr@2:     return __tmp;
williamr@2:   }
williamr@2:   _Self& operator--() {
williamr@2:     _M_bump_down();
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Self operator--(int) {
williamr@2:     _Self __tmp = *this;
williamr@2:     _M_bump_down();
williamr@2:     return __tmp;
williamr@2:   }
williamr@2:   _Self& operator+=(difference_type __i) {
williamr@2:     _M_advance(__i);
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Self& operator-=(difference_type __i) {
williamr@2:     *this += -__i;
williamr@2:     return *this;
williamr@2:   }
williamr@2:   _Self operator+(difference_type __i) const {
williamr@2:     _Self __tmp = *this;
williamr@2:     return __tmp += __i;
williamr@2:   }
williamr@2:   _Self operator-(difference_type __i) const {
williamr@2:     _Self __tmp = *this;
williamr@2:     return __tmp -= __i;
williamr@2:   }
williamr@2:   difference_type operator-(const _Self& __x) const {
williamr@2:     return _M_subtract(__x);
williamr@2:   }
williamr@2:   reference operator[](difference_type __i) { return *(*this + __i); }
williamr@2: };
williamr@2: 
williamr@2: template <class _Ref, class _Ptr>
williamr@2: inline _Bit_iter<_Ref,_Ptr>  _STLP_CALL
williamr@2: operator+(ptrdiff_t __n, const _Bit_iter<_Ref, _Ptr>& __x) {
williamr@2:    return __x + __n;
williamr@2: }
williamr@2: 
williamr@2: # ifdef _STLP_USE_OLD_HP_ITERATOR_QUERIES
williamr@2: inline random_access_iterator_tag  iterator_category(const _Bit_iterator_base&) {return random_access_iterator_tag();}
williamr@2: inline ptrdiff_t* distance_type(const _Bit_iterator_base&) {return (ptrdiff_t*)0;}
williamr@2: inline bool* value_type(const _Bit_iter<_Bit_reference, _Bit_reference*>&) {return (bool*)0;}
williamr@2: inline bool* value_type(const _Bit_iter<bool, const bool*>&) {return (bool*)0;}
williamr@2: # endif
williamr@2: 
williamr@2: typedef _Bit_iter<bool, const bool*> _Bit_const_iterator;
williamr@2: typedef _Bit_iter<_Bit_reference, _Bit_reference*> _Bit_iterator;
williamr@2: 
williamr@2: // Bit-vector base class, which encapsulates the difference between
williamr@2: //  old SGI-style allocators and standard-conforming allocators.
williamr@2: 
williamr@2: 
williamr@2: template <class _Alloc>
williamr@2: class _Bvector_base
williamr@2: {
williamr@2: public:
williamr@2:   _STLP_FORCE_ALLOCATORS(bool, _Alloc)
williamr@2:   typedef typename _Alloc_traits<bool, _Alloc>::allocator_type allocator_type;
williamr@2:   typedef unsigned int __chunk_type;
williamr@2:   typedef typename _Alloc_traits<__chunk_type, 
williamr@2:           _Alloc>::allocator_type __chunk_allocator_type;
williamr@2:   allocator_type get_allocator() const { 
williamr@2:     return _STLP_CONVERT_ALLOCATOR((const __chunk_allocator_type&)_M_end_of_storage, bool); 
williamr@2:   }
williamr@2:   static allocator_type __get_dfl_allocator() { return allocator_type(); }
williamr@2:    
williamr@2:   _Bvector_base(const allocator_type& __a)
williamr@2:     : _M_start(), _M_finish(), _M_end_of_storage(_STLP_CONVERT_ALLOCATOR(__a, __chunk_type),
williamr@2: 						 (__chunk_type*)0) {
williamr@2:   }
williamr@2:   ~_Bvector_base() { _M_deallocate();
williamr@2:   }
williamr@2: 
williamr@2: protected:
williamr@2: 
williamr@2:   unsigned int* _M_bit_alloc(size_t __n) 
williamr@2:     { return _M_end_of_storage.allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
williamr@2:   void _M_deallocate() {
williamr@2:     if (_M_start._M_p)
williamr@2:       _M_end_of_storage.deallocate(_M_start._M_p,
williamr@2: 				   _M_end_of_storage._M_data - _M_start._M_p);
williamr@2:   }
williamr@2: 
williamr@2:   _Bit_iterator _M_start;
williamr@2:   _Bit_iterator _M_finish;
williamr@2:   _STLP_alloc_proxy<__chunk_type*, __chunk_type, __chunk_allocator_type> _M_end_of_storage;  
williamr@2: };
williamr@2: 
williamr@2: 
williamr@2: // The next few lines are confusing.  What we're doing is declaring a
williamr@2: //  partial specialization of vector<T, Alloc> if we have the necessary
williamr@2: //  compiler support.  Otherwise, we define a class bit_vector which uses
williamr@2: //  the default allocator. 
williamr@2: 
williamr@2: #if defined(_STLP_CLASS_PARTIAL_SPECIALIZATION) && ! defined(_STLP_NO_BOOL) && ! defined (__SUNPRO_CC)
williamr@2: # define _STLP_VECBOOL_TEMPLATE
williamr@2: # define __BVEC_TMPL_HEADER template <class _Alloc>
williamr@2: #else
williamr@2: # undef _STLP_VECBOOL_TEMPLATE
williamr@2: # ifdef _STLP_NO_BOOL
williamr@2: #  define __BVEC_TMPL_HEADER
williamr@2: # else
williamr@2: #  define __BVEC_TMPL_HEADER _STLP_TEMPLATE_NULL
williamr@2: # endif
williamr@2: # if !(defined(__MRC__)||(defined(__SC__)&&!defined(__DMC__)))			//*TY 12/17/2000 - 
williamr@2: #  define _Alloc _STLP_DEFAULT_ALLOCATOR(bool)
williamr@2: # else
williamr@2: #  define _Alloc allocator<bool>
williamr@2: # endif
williamr@2: #endif
williamr@2: 
williamr@2: #ifdef _STLP_NO_BOOL
williamr@2: # define __BVECTOR_QUALIFIED bit_vector
williamr@2: # define __BVECTOR           bit_vector
williamr@2: #else
williamr@2: # ifdef _STLP_VECBOOL_TEMPLATE
williamr@2: #  define __BVECTOR_QUALIFIED __WORKAROUND_DBG_RENAME(vector) <bool, _Alloc>
williamr@2: # else
williamr@2: #  define __BVECTOR_QUALIFIED __WORKAROUND_DBG_RENAME(vector) <bool, allocator<bool> >
williamr@2: # endif
williamr@2: #if defined (_STLP_PARTIAL_SPEC_NEEDS_TEMPLATE_ARGS)
williamr@2: # define __BVECTOR __BVECTOR_QUALIFIED
williamr@2: #else
williamr@2: # define __BVECTOR __WORKAROUND_DBG_RENAME(vector)
williamr@2: #endif
williamr@2: #endif
williamr@2: 
williamr@2: 
williamr@2: __BVEC_TMPL_HEADER
williamr@2: class __BVECTOR_QUALIFIED : public _Bvector_base<_Alloc >
williamr@2: {
williamr@2:   typedef _Bvector_base<_Alloc > _Base;
williamr@2:   typedef __BVECTOR_QUALIFIED _Self;
williamr@2: public:
williamr@2:   typedef bool value_type;
williamr@2:   typedef size_t size_type;
williamr@2:   typedef ptrdiff_t difference_type; 
williamr@2:   typedef _Bit_reference reference;
williamr@2:   typedef bool const_reference;
williamr@2:   typedef _Bit_reference* pointer;
williamr@2:   typedef const bool* const_pointer;
williamr@2:   typedef random_access_iterator_tag _Iterator_category;
williamr@2: 
williamr@2:   typedef _Bit_iterator                iterator;
williamr@2:   typedef _Bit_const_iterator          const_iterator;
williamr@2: 
williamr@2: #if defined ( _STLP_CLASS_PARTIAL_SPECIALIZATION )
williamr@2:   typedef _STLP_STD::reverse_iterator<const_iterator> const_reverse_iterator;
williamr@2:   typedef _STLP_STD::reverse_iterator<iterator> reverse_iterator;
williamr@2: #else /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: # if defined (_STLP_MSVC50_COMPATIBILITY)
williamr@2:   typedef _STLP_STD::reverse_iterator<const_iterator, value_type, const_reference, 
williamr@2:   const_pointer, difference_type> const_reverse_iterator;
williamr@2:   typedef _STLP_STD::reverse_iterator<iterator, value_type, reference, reference*, 
williamr@2:   difference_type> reverse_iterator;
williamr@2: # else
williamr@2:   typedef _STLP_STD::reverse_iterator<const_iterator, value_type, const_reference, 
williamr@2:                                   difference_type> const_reverse_iterator;
williamr@2:   typedef _STLP_STD::reverse_iterator<iterator, value_type, reference, difference_type>
williamr@2:           reverse_iterator;
williamr@2: # endif
williamr@2: #endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */
williamr@2: 
williamr@2: # ifdef _STLP_VECBOOL_TEMPLATE
williamr@2:   typedef typename _Bvector_base<_Alloc >::allocator_type allocator_type;
williamr@2:   typedef typename _Bvector_base<_Alloc >::__chunk_type __chunk_type ;
williamr@2: # else
williamr@2:   typedef _Bvector_base<_Alloc >::allocator_type allocator_type;
williamr@2:   typedef _Bvector_base<_Alloc >::__chunk_type __chunk_type ;
williamr@2: # endif
williamr@2: 
williamr@2: protected:
williamr@2: 
williamr@2:   void _M_initialize(size_type __n) {
williamr@2:     unsigned int* __q = this->_M_bit_alloc(__n);
williamr@2:     this->_M_end_of_storage._M_data = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:     this->_M_start = iterator(__q, 0);
williamr@2:     this->_M_finish = this->_M_start + difference_type(__n);
williamr@2:   }
williamr@2:   void _M_insert_aux(iterator __position, bool __x) {
williamr@2:     if (this->_M_finish._M_p != this->_M_end_of_storage._M_data) {
williamr@2:       __copy_backward(__position, this->_M_finish, this->_M_finish + 1, random_access_iterator_tag(), (difference_type*)0 );
williamr@2:       *__position = __x;
williamr@2:       ++this->_M_finish;
williamr@2:     }
williamr@2:     else {
williamr@2:       size_type __len = size() ? 2 * size() : __WORD_BIT;
williamr@2:       unsigned int* __q = this->_M_bit_alloc(__len);
williamr@2:       iterator __i = copy(begin(), __position, iterator(__q, 0));
williamr@2:       *__i++ = __x;
williamr@2:       this->_M_finish = copy(__position, end(), __i);
williamr@2:       this->_M_deallocate();
williamr@2:       this->_M_end_of_storage._M_data = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:       this->_M_start = iterator(__q, 0);
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2:   template <class _InputIterator>
williamr@2:   void _M_initialize_range(_InputIterator __first, _InputIterator __last,
williamr@2: 			const input_iterator_tag &) {
williamr@2:     this->_M_start = iterator();
williamr@2:     this->_M_finish = iterator();
williamr@2:     this->_M_end_of_storage._M_data = 0;
williamr@2:     for ( ; __first != __last; ++__first) 
williamr@2:       push_back(*__first);
williamr@2:   }
williamr@2: 
williamr@2:   template <class _ForwardIterator>
williamr@2:   void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
williamr@2:                            const forward_iterator_tag &) {
williamr@2:     size_type __n = distance(__first, __last);
williamr@2:     _M_initialize(__n);
williamr@2:     //    copy(__first, __last, _M_start);
williamr@2:     copy(__first, __last, this->_M_start); // dwa 12/22/99 -- resolving ambiguous reference.
williamr@2:   }
williamr@2: 
williamr@2:   template <class _InputIterator>
williamr@2:   void _M_insert_range(iterator __pos,
williamr@2:                        _InputIterator __first, _InputIterator __last,
williamr@2:                        const input_iterator_tag &) {
williamr@2:     for ( ; __first != __last; ++__first) {
williamr@2:       __pos = insert(__pos, *__first);
williamr@2:       ++__pos;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   template <class _ForwardIterator>
williamr@2:   void _M_insert_range(iterator __position,
williamr@2:                        _ForwardIterator __first, _ForwardIterator __last,
williamr@2:                        const forward_iterator_tag &) {
williamr@2:     if (__first != __last) {
williamr@2:       size_type __n = distance(__first, __last);
williamr@2:       if (capacity() - size() >= __n) {
williamr@2:         __copy_backward(__position, end(), this->_M_finish + difference_type(__n), random_access_iterator_tag(), (difference_type*)0 );
williamr@2:         copy(__first, __last, __position);
williamr@2:         this->_M_finish += difference_type(__n);
williamr@2:       }
williamr@2:       else {
williamr@2:         size_type __len = size() + (max)(size(), __n);
williamr@2:         unsigned int* __q = this->_M_bit_alloc(__len);
williamr@2:         iterator __i = copy(begin(), __position, iterator(__q, 0));
williamr@2:         __i = copy(__first, __last, __i);
williamr@2:         this->_M_finish = copy(__position, end(), __i);
williamr@2:         this->_M_deallocate();
williamr@2:         this->_M_end_of_storage._M_data = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:         this->_M_start = iterator(__q, 0);
williamr@2:       }
williamr@2:     }
williamr@2:   }      
williamr@2: 
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2: public:
williamr@2:   iterator begin() { return this->_M_start; }
williamr@2:   const_iterator begin() const { return this->_M_start; }
williamr@2:   iterator end() { return this->_M_finish; }
williamr@2:   const_iterator end() const { return this->_M_finish; }
williamr@2: 
williamr@2:   reverse_iterator rbegin() { 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() { return reverse_iterator(begin()); }
williamr@2:   const_reverse_iterator rend() const { 
williamr@2:     return const_reverse_iterator(begin()); 
williamr@2:   }
williamr@2: 
williamr@2:   size_type size() const { return size_type(end() - begin()); }
williamr@2:   size_type max_size() const { return size_type(-1); }
williamr@2:   size_type capacity() const {
williamr@2:     return size_type(const_iterator(this->_M_end_of_storage._M_data, 0) - begin());
williamr@2:   }
williamr@2:   bool empty() const { return begin() == end(); }
williamr@2:   reference operator[](size_type __n) 
williamr@2:   { return *(begin() + difference_type(__n)); }
williamr@2:   const_reference operator[](size_type __n) const 
williamr@2:   { return *(begin() + difference_type(__n)); }
williamr@2: 
williamr@2:   void _M_range_check(size_type __n) const {
williamr@2:     if (__n >= this->size())
williamr@2:       __stl_throw_range_error("vector<bool>");
williamr@2:   }
williamr@2: 
williamr@2:   reference at(size_type __n)
williamr@2:     { _M_range_check(__n); return (*this)[__n]; }
williamr@2:   const_reference at(size_type __n) const
williamr@2:     { _M_range_check(__n); return (*this)[__n]; }
williamr@2: 
williamr@2:   explicit __BVECTOR(const allocator_type& __a = allocator_type())
williamr@2:     : _Bvector_base<_Alloc >(__a) {
williamr@2:     _STLP_POP_IF_CHECK
williamr@2:   }
williamr@2: 
williamr@2:   __BVECTOR(size_type __n, bool __val,
williamr@2:             const allocator_type& __a = 
williamr@2: 	    allocator_type())
williamr@2:     : _Bvector_base<_Alloc >(__a)
williamr@2:   {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize(__n);
williamr@2:     fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), __val ? ~0 : 0);
williamr@2:     _STLP_POP_CLEANUP_ITEM	  
williamr@2:   }
williamr@2: 
williamr@2:   explicit __BVECTOR(size_type __n)
williamr@2:     : _Bvector_base<_Alloc >(allocator_type())
williamr@2:   {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize(__n);
williamr@2:     fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), 0);
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2: 
williamr@2:   __BVECTOR(const _Self& __x) : _Bvector_base<_Alloc >(__x.get_allocator()) {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize(__x.size());
williamr@2:     copy(__x.begin(), __x.end(), this->_M_start);
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2: 
williamr@2: #if defined (_STLP_MEMBER_TEMPLATES)
williamr@2:   template <class _Integer>
williamr@2:   void _M_initialize_dispatch(_Integer __n, _Integer __x, const __true_type&) {
williamr@2:     _M_initialize(__n);
williamr@2:     fill(this->_M_start._M_p, this->_M_end_of_storage._M_data, __x ? ~0 : 0);
williamr@2:   }
williamr@2:     
williamr@2:   template <class _InputIterator>
williamr@2:   void _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
williamr@2:                               const __false_type&) {
williamr@2:     _M_initialize_range(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
williamr@2:   }
williamr@2: # ifdef _STLP_NEEDS_EXTRA_TEMPLATE_CONSTRUCTORS
williamr@2:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@2:   template <class _InputIterator>
williamr@2:   __BVECTOR(_InputIterator __first, _InputIterator __last)
williamr@2:     : _Base(allocator_type())
williamr@2:   {
williamr@2:     typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize_dispatch(__first, __last, _Integral());
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2: # endif
williamr@2:   template <class _InputIterator>
williamr@2:   __BVECTOR(_InputIterator __first, _InputIterator __last,
williamr@2:             const allocator_type& __a _STLP_ALLOCATOR_TYPE_DFL)
williamr@2:     : _Base(__a)
williamr@2:   {
williamr@2:     typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize_dispatch(__first, __last, _Integral());
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2:   __BVECTOR(const_iterator __first, const_iterator __last,
williamr@2:             const allocator_type& __a = allocator_type())
williamr@2:     : _Bvector_base<_Alloc >(__a)
williamr@2:   {
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     size_type __n = distance(__first, __last);
williamr@2:     _M_initialize(__n);
williamr@2:     copy(__first, __last, this->_M_start);
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2:   __BVECTOR(const bool* __first, const bool* __last,
williamr@2:             const allocator_type& __a = allocator_type())
williamr@2:     : _Bvector_base<_Alloc >(__a)
williamr@2:   {
williamr@2:     size_type __n = distance(__first, __last);
williamr@2:     _STLP_PUSH_CLEANUP_ITEM(_Base, this)  
williamr@2:     _M_initialize(__n);
williamr@2:     copy(__first, __last, this->_M_start);
williamr@2:     _STLP_POP_CLEANUP_ITEM  
williamr@2:   }
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   ~__BVECTOR() { }
williamr@2: 
williamr@2:   __BVECTOR_QUALIFIED& operator=(const __BVECTOR_QUALIFIED& __x) {
williamr@2:     if (&__x == this) return *this;
williamr@2:     if (__x.size() > capacity()) {
williamr@2:       this->_M_deallocate();
williamr@2:       _M_initialize(__x.size());
williamr@2:     }
williamr@2:     copy(__x.begin(), __x.end(), begin());
williamr@2:     this->_M_finish = begin() + difference_type(__x.size());
williamr@2:     return *this;
williamr@2:   }
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<bool>::_NewLC(__n); }
williamr@2:   static void* operator new (size_t __n) { return _STLP_StackHelper<bool>::_NewLC(__n); }
williamr@2: #endif
williamr@2: 
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 _M_fill_assign(size_t __n, bool __x) {
williamr@2:     if (__n > size()) {
williamr@2:       fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), __x ? ~0 : 0);
williamr@2:       insert(end(), __n - size(), __x);
williamr@2:     }
williamr@2:     else {
williamr@2:       erase(begin() + __n, end());
williamr@2:       fill(this->_M_start._M_p, (__chunk_type*)(this->_M_end_of_storage._M_data), __x ? ~0 : 0);
williamr@2:     }
williamr@2:   }
williamr@2:   void assign(size_t __n, bool __x) { _M_fill_assign(__n, __x); }
williamr@2: 
williamr@2: #ifdef _STLP_MEMBER_TEMPLATES
williamr@2: 
williamr@2:   template <class _InputIterator>
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 <class _Integer>
williamr@2:   void _M_assign_dispatch(_Integer __n, _Integer __val, const __true_type&)
williamr@2:     { _M_fill_assign((size_t) __n, (bool) __val); }
williamr@2: 
williamr@2:   template <class _InputIter>
williamr@2:   void _M_assign_dispatch(_InputIter __first, _InputIter __last, const __false_type&)
williamr@2:     { _M_assign_aux(__first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIter)); }
williamr@2: 
williamr@2:   template <class _InputIterator>
williamr@2:   void _M_assign_aux(_InputIterator __first, _InputIterator __last,
williamr@2:                      const input_iterator_tag &) {
williamr@2:     iterator __cur = begin();
williamr@2:     for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
williamr@2:       *__cur = *__first;
williamr@2:     if (__first == __last)
williamr@2:       erase(__cur, end());
williamr@2:     else
williamr@2:       insert(end(), __first, __last);
williamr@2:   }
williamr@2: 
williamr@2:   template <class _ForwardIterator>
williamr@2:   void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
williamr@2:                      const forward_iterator_tag &) {
williamr@2:     size_type __len = distance(__first, __last);
williamr@2:     if (__len < size())
williamr@2:       erase(copy(__first, __last, begin()), end());
williamr@2:     else {
williamr@2:       _ForwardIterator __mid = __first;
williamr@2:       advance(__mid, size());
williamr@2:       copy(__first, __mid, begin());
williamr@2:       insert(end(), __mid, __last);
williamr@2:     }
williamr@2:   }    
williamr@2: 
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2: 
williamr@2:   void reserve(size_type __n) {
williamr@2:     if (capacity() < __n) {
williamr@2:       unsigned int* __q = this->_M_bit_alloc(__n);
williamr@2:       _Bit_iterator __z(__q, 0);
williamr@2:       this->_M_finish = copy(begin(), end(), __z);
williamr@2:       this->_M_deallocate();
williamr@2:       this->_M_start = iterator(__q, 0);
williamr@2:       this->_M_end_of_storage._M_data = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   reference front() { return *begin(); }
williamr@2:   const_reference front() const { return *begin(); }
williamr@2:   reference back() { return *(end() - 1); }
williamr@2:   const_reference back() const { return *(end() - 1); }
williamr@2:   void push_back(bool __x) {
williamr@2:     if (this->_M_finish._M_p != this->_M_end_of_storage._M_data) {
williamr@2:       *(this->_M_finish) = __x;
williamr@2:       ++this->_M_finish;
williamr@2:     }
williamr@2:     else
williamr@2:       _M_insert_aux(end(), __x);
williamr@2:   }
williamr@2:   void swap(__BVECTOR_QUALIFIED& __x) {
williamr@2:     _STLP_STD::swap(this->_M_start, __x._M_start);
williamr@2:     _STLP_STD::swap(this->_M_finish, __x._M_finish);
williamr@2:     _STLP_STD::swap(this->_M_end_of_storage, __x._M_end_of_storage);
williamr@2:   }
williamr@2:   iterator insert(iterator __position, bool __x = bool()) {
williamr@2:     difference_type __n = __position - begin();
williamr@2:     if (this->_M_finish._M_p != this->_M_end_of_storage._M_data && __position == end()) {
williamr@2:       *(this->_M_finish) = __x;
williamr@2:       ++this->_M_finish;
williamr@2:     }
williamr@2:     else
williamr@2:       _M_insert_aux(__position, __x);
williamr@2:     return begin() + __n;
williamr@2:   }
williamr@2: 
williamr@2: #if defined ( _STLP_MEMBER_TEMPLATES )
williamr@2: 
williamr@2:   template <class _Integer>
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, (bool) __x);
williamr@2:   }
williamr@2: 
williamr@2:   template <class _InputIterator>
williamr@2:   void _M_insert_dispatch(iterator __pos,
williamr@2:                           _InputIterator __first, _InputIterator __last,
williamr@2:                           const __false_type&) {
williamr@2:     _M_insert_range(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
williamr@2:   }
williamr@2: 
williamr@2:   // Check whether it's an integral type.  If so, it's not an iterator.
williamr@2:   template <class _InputIterator>
williamr@2:   void insert(iterator __position,
williamr@2:               _InputIterator __first, _InputIterator __last) {
williamr@2:     typedef typename _Is_integer<_InputIterator>::_Integral _Is_Integral;
williamr@2:     _M_insert_dispatch(__position, __first, __last, _Is_Integral());
williamr@2:   }
williamr@2: #else /* _STLP_MEMBER_TEMPLATES */
williamr@2:   void insert(iterator __position,
williamr@2:               const_iterator __first, const_iterator __last) {
williamr@2:     if (__first == __last) return;
williamr@2:     size_type __n = distance(__first, __last);
williamr@2:     if (capacity() - size() >= __n) {
williamr@2:       __copy_backward(__position, end(), this->_M_finish + __n,
williamr@2:                       random_access_iterator_tag(), (difference_type*)0 );
williamr@2:       copy(__first, __last, __position);
williamr@2:       this->_M_finish += __n;
williamr@2:     }
williamr@2:     else {
williamr@2:       size_type __len = size() + (max)(size(), __n);
williamr@2:       unsigned int* __q = this->_M_bit_alloc(__len);
williamr@2:       iterator __i = copy(begin(), __position, iterator(__q, 0));
williamr@2:       __i = copy(__first, __last, __i);
williamr@2:       this->_M_finish = copy(__position, end(), __i);
williamr@2:       this->_M_deallocate();
williamr@2:       this->_M_end_of_storage._M_data = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:       this->_M_start = iterator(__q, 0);
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   void insert(iterator __position, const bool* __first, const bool* __last) {
williamr@2:     if (__first == __last) return;
williamr@2:     size_type __n = distance(__first, __last);
williamr@2:     if (capacity() - size() >= __n) {
williamr@2:       __copy_backward(__position, end(), this->_M_finish + __n, 
williamr@2:                       random_access_iterator_tag(), (difference_type*)0 );
williamr@2:       copy(__first, __last, __position);
williamr@2:       this->_M_finish += __n;
williamr@2:     }
williamr@2:     else {
williamr@2:       size_type __len = size() + (max)(size(), __n);
williamr@2:       unsigned int* __q = this->_M_bit_alloc(__len);
williamr@2:       iterator __i = copy(begin(), __position, iterator(__q, 0));
williamr@2:       __i = copy(__first, __last, __i);
williamr@2:       this->_M_finish = copy(__position, end(), __i);
williamr@2:       this->_M_deallocate();
williamr@2:       this->_M_end_of_storage._M_data = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:       this->_M_start = iterator(__q, 0);
williamr@2:     }
williamr@2:   }
williamr@2: #endif /* _STLP_MEMBER_TEMPLATES */
williamr@2:   
williamr@2:   void _M_fill_insert(iterator __position, size_type __n, bool __x) {
williamr@2:     if (__n == 0) return;
williamr@2:     if (capacity() - size() >= __n) {
williamr@2:       __copy_backward(__position, end(), this->_M_finish + difference_type(__n), random_access_iterator_tag(), (difference_type*)0 );
williamr@2:       fill(__position, __position + difference_type(__n), __x);
williamr@2:       this->_M_finish += difference_type(__n);
williamr@2:     }
williamr@2:     else {
williamr@2:       size_type __len = size() + (max)(size(), __n);
williamr@2:       unsigned int* __q = this->_M_bit_alloc(__len);
williamr@2:       iterator __i = copy(begin(), __position, iterator(__q, 0));
williamr@2:       fill_n(__i, __n, __x);
williamr@2:       this->_M_finish = copy(__position, end(), __i + difference_type(__n));
williamr@2:       this->_M_deallocate();
williamr@2:       this->_M_end_of_storage._M_data = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
williamr@2:       this->_M_start = iterator(__q, 0);
williamr@2:     }
williamr@2:   }
williamr@2: 
williamr@2:   void insert(iterator __position, size_type __n, bool __x) {
williamr@2:     _M_fill_insert(__position, __n, __x);
williamr@2:   }
williamr@2: 
williamr@2:   void pop_back() {
williamr@2:       --this->_M_finish; 
williamr@2:   }
williamr@2:   iterator erase(iterator __position) {
williamr@2:     if (__position + 1 != end())
williamr@2:       copy(__position + 1, end(), __position);
williamr@2:       --this->_M_finish;
williamr@2:     return __position;
williamr@2:   }
williamr@2:   iterator erase(iterator __first, iterator __last) {
williamr@2:     this->_M_finish = copy(__last, end(), __first);
williamr@2:     return __first;
williamr@2:   }
williamr@2:   void resize(size_type __new_size, bool __x = bool()) {
williamr@2:     if (__new_size < size()) 
williamr@2:       erase(begin() + difference_type(__new_size), end());
williamr@2:     else
williamr@2:       insert(end(), __new_size - size(), __x);
williamr@2:   }
williamr@2:   void flip() {
williamr@2:     for (unsigned int* __p = this->_M_start._M_p; __p != this->_M_end_of_storage._M_data; ++__p)
williamr@2:       *__p = ~*__p;
williamr@2:   }
williamr@2: 
williamr@2:   void clear() { erase(begin(), end()); }
williamr@2: };
williamr@2: 
williamr@2: # if defined  ( _STLP_NO_BOOL ) || defined (__HP_aCC) // fixed soon (03/17/2000)
williamr@2:  
williamr@2: #define _STLP_TEMPLATE_HEADER __BVEC_TMPL_HEADER
williamr@2: #define _STLP_TEMPLATE_CONTAINER __BVECTOR_QUALIFIED
williamr@2: #include <stl/_relops_cont.h>
williamr@2: #undef _STLP_TEMPLATE_CONTAINER
williamr@2: #undef _STLP_TEMPLATE_HEADER
williamr@2:   
williamr@2: # endif /* NO_BOOL */
williamr@2:   
williamr@2: #if !defined (_STLP_NO_BOOL)
williamr@2: // This typedef is non-standard.  It is provided for backward compatibility.
williamr@2:   typedef __WORKAROUND_DBG_RENAME(vector) <bool, allocator<bool> > bit_vector;
williamr@2: #endif
williamr@2: 
williamr@2: _STLP_END_NAMESPACE
williamr@2: 
williamr@2: #undef _Alloc
williamr@2: #undef _STLP_VECBOOL_TEMPLATE
williamr@2: #undef __BVECTOR
williamr@2: #undef __BVECTOR_QUALIFIED
williamr@2: #undef __BVEC_TMPL_HEADER
williamr@2: 
williamr@2: # undef __WORD_BIT
williamr@2: 
williamr@2: #endif /* _STLP_INTERNAL_BVECTOR_H */
williamr@2: 
williamr@2: // Local Variables:
williamr@2: // mode:C++
williamr@2: // End:
williamr@2: