#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma set woff 1174
+#pragma set woff 1375
#endif
-struct __bit_reference {
- unsigned int* p;
- unsigned int mask;
- __bit_reference(unsigned int* x, unsigned int y) : p(x), mask(y) {}
+struct _Bit_reference {
+ unsigned int* _M_p;
+ unsigned int _M_mask;
+ _Bit_reference(unsigned int* __x, unsigned int __y)
+ : _M_p(__x), _M_mask(__y) {}
public:
- __bit_reference() : p(0), mask(0) {}
- operator bool() const { return !(!(*p & mask)); }
- __bit_reference& operator=(bool x) {
- if (x)
- *p |= mask;
- else
- *p &= ~mask;
+ _Bit_reference() : _M_p(0), _M_mask(0) {}
+ operator bool() const { return !(!(*_M_p & _M_mask)); }
+ _Bit_reference& operator=(bool __x)
+ {
+ if (__x) *_M_p |= _M_mask;
+ else *_M_p &= ~_M_mask;
return *this;
}
- __bit_reference& operator=(const __bit_reference& x) { return *this = bool(x); }
- bool operator==(const __bit_reference& x) const {
- return bool(*this) == bool(x);
+ _Bit_reference& operator=(const _Bit_reference& __x)
+ { return *this = bool(__x); }
+ bool operator==(const _Bit_reference& __x) const
+ { return bool(*this) == bool(__x); }
+ bool operator<(const _Bit_reference& __x) const {
+ return !bool(*this) && bool(__x);
}
- bool operator<(const __bit_reference& x) const {
- return bool(*this) < bool(x);
- }
- void flip() { *p ^= mask; }
+ void flip() { *_M_p ^= _M_mask; }
};
-inline void swap(__bit_reference x, __bit_reference y) {
- bool tmp = x;
- x = y;
- y = tmp;
+inline void swap(_Bit_reference __x, _Bit_reference __y)
+{
+ bool __tmp = __x;
+ __x = __y;
+ __y = __tmp;
}
-struct __bit_iterator : public random_access_iterator<bool, ptrdiff_t> {
- typedef __bit_reference reference;
- typedef __bit_reference* pointer;
- typedef __bit_iterator iterator;
+struct _Bit_iterator : public random_access_iterator<bool, ptrdiff_t> {
+ typedef _Bit_reference reference;
+ typedef _Bit_reference* pointer;
+ typedef _Bit_iterator iterator;
- unsigned int* p;
- unsigned int offset;
+ unsigned int* _M_p;
+ unsigned int _M_offset;
void bump_up() {
- if (offset++ == __WORD_BIT - 1) {
- offset = 0;
- ++p;
+ if (_M_offset++ == __WORD_BIT - 1) {
+ _M_offset = 0;
+ ++_M_p;
}
}
void bump_down() {
- if (offset-- == 0) {
- offset = __WORD_BIT - 1;
- --p;
+ if (_M_offset-- == 0) {
+ _M_offset = __WORD_BIT - 1;
+ --_M_p;
}
}
- __bit_iterator() : p(0), offset(0) {}
- __bit_iterator(unsigned int* x, unsigned int y) : p(x), offset(y) {}
- reference operator*() const { return reference(p, 1U << offset); }
+ _Bit_iterator() : _M_p(0), _M_offset(0) {}
+ _Bit_iterator(unsigned int* __x, unsigned int __y)
+ : _M_p(__x), _M_offset(__y) {}
+ reference operator*() const { return reference(_M_p, 1U << _M_offset); }
iterator& operator++() {
bump_up();
return *this;
}
iterator operator++(int) {
- iterator tmp = *this;
+ iterator __tmp = *this;
bump_up();
- return tmp;
+ return __tmp;
}
iterator& operator--() {
bump_down();
return *this;
}
iterator operator--(int) {
- iterator tmp = *this;
+ iterator __tmp = *this;
bump_down();
- return tmp;
- }
- iterator& operator+=(difference_type i) {
- difference_type n = i + offset;
- p += n / __WORD_BIT;
- n = n % __WORD_BIT;
- if (n < 0) {
- offset = (unsigned int) n + __WORD_BIT;
- --p;
+ return __tmp;
+ }
+ iterator& operator+=(difference_type __i) {
+ difference_type __n = __i + _M_offset;
+ _M_p += __n / __WORD_BIT;
+ __n = __n % __WORD_BIT;
+ if (__n < 0) {
+ _M_offset = (unsigned int) __n + __WORD_BIT;
+ --_M_p;
} else
- offset = (unsigned int) n;
+ _M_offset = (unsigned int) __n;
return *this;
}
- iterator& operator-=(difference_type i) {
- *this += -i;
+ iterator& operator-=(difference_type __i) {
+ *this += -__i;
return *this;
}
- iterator operator+(difference_type i) const {
- iterator tmp = *this;
- return tmp += i;
+ iterator operator+(difference_type __i) const {
+ iterator __tmp = *this;
+ return __tmp += __i;
}
- iterator operator-(difference_type i) const {
- iterator tmp = *this;
- return tmp -= i;
+ iterator operator-(difference_type __i) const {
+ iterator __tmp = *this;
+ return __tmp -= __i;
}
- difference_type operator-(iterator x) const {
- return __WORD_BIT * (p - x.p) + offset - x.offset;
+ difference_type operator-(iterator __x) const {
+ return __WORD_BIT * (_M_p - __x._M_p) + _M_offset - __x._M_offset;
}
- reference operator[](difference_type i) { return *(*this + i); }
- bool operator==(const iterator& x) const {
- return p == x.p && offset == x.offset;
+ reference operator[](difference_type __i) { return *(*this + __i); }
+ bool operator==(const iterator& __x) const {
+ return _M_p == __x._M_p && _M_offset == __x._M_offset;
}
- bool operator!=(const iterator& x) const {
- return p != x.p || offset != x.offset;
+ bool operator!=(const iterator& __x) const {
+ return _M_p != __x._M_p || _M_offset != __x._M_offset;
}
- bool operator<(iterator x) const {
- return p < x.p || (p == x.p && offset < x.offset);
+ bool operator<(iterator __x) const {
+ return _M_p < __x._M_p || (_M_p == __x._M_p && _M_offset < __x._M_offset);
}
};
-struct __bit_const_iterator
+struct _Bit_const_iterator
: public random_access_iterator<bool, ptrdiff_t>
{
typedef bool reference;
typedef bool const_reference;
typedef const bool* pointer;
- typedef __bit_const_iterator const_iterator;
+ typedef _Bit_const_iterator const_iterator;
- unsigned int* p;
- unsigned int offset;
+ unsigned int* _M_p;
+ unsigned int _M_offset;
void bump_up() {
- if (offset++ == __WORD_BIT - 1) {
- offset = 0;
- ++p;
+ if (_M_offset++ == __WORD_BIT - 1) {
+ _M_offset = 0;
+ ++_M_p;
}
}
void bump_down() {
- if (offset-- == 0) {
- offset = __WORD_BIT - 1;
- --p;
+ if (_M_offset-- == 0) {
+ _M_offset = __WORD_BIT - 1;
+ --_M_p;
}
}
- __bit_const_iterator() : p(0), offset(0) {}
- __bit_const_iterator(unsigned int* x, unsigned int y) : p(x), offset(y) {}
- __bit_const_iterator(const __bit_iterator& x) : p(x.p), offset(x.offset) {}
+ _Bit_const_iterator() : _M_p(0), _M_offset(0) {}
+ _Bit_const_iterator(unsigned int* __x, unsigned int __y)
+ : _M_p(__x), _M_offset(__y) {}
+ _Bit_const_iterator(const _Bit_iterator& __x)
+ : _M_p(__x._M_p), _M_offset(__x._M_offset) {}
const_reference operator*() const {
- return __bit_reference(p, 1U << offset);
+ return _Bit_reference(_M_p, 1U << _M_offset);
}
const_iterator& operator++() {
bump_up();
return *this;
}
const_iterator operator++(int) {
- const_iterator tmp = *this;
+ const_iterator __tmp = *this;
bump_up();
- return tmp;
+ return __tmp;
}
const_iterator& operator--() {
bump_down();
return *this;
}
const_iterator operator--(int) {
- const_iterator tmp = *this;
+ const_iterator __tmp = *this;
bump_down();
- return tmp;
- }
- const_iterator& operator+=(difference_type i) {
- difference_type n = i + offset;
- p += n / __WORD_BIT;
- n = n % __WORD_BIT;
- if (n < 0) {
- offset = (unsigned int) n + __WORD_BIT;
- --p;
+ return __tmp;
+ }
+ const_iterator& operator+=(difference_type __i) {
+ difference_type __n = __i + _M_offset;
+ _M_p += __n / __WORD_BIT;
+ __n = __n % __WORD_BIT;
+ if (__n < 0) {
+ _M_offset = (unsigned int) __n + __WORD_BIT;
+ --_M_p;
} else
- offset = (unsigned int) n;
+ _M_offset = (unsigned int) __n;
return *this;
}
- const_iterator& operator-=(difference_type i) {
- *this += -i;
+ const_iterator& operator-=(difference_type __i) {
+ *this += -__i;
return *this;
}
- const_iterator operator+(difference_type i) const {
- const_iterator tmp = *this;
- return tmp += i;
+ const_iterator operator+(difference_type __i) const {
+ const_iterator __tmp = *this;
+ return __tmp += __i;
}
- const_iterator operator-(difference_type i) const {
- const_iterator tmp = *this;
- return tmp -= i;
+ const_iterator operator-(difference_type __i) const {
+ const_iterator __tmp = *this;
+ return __tmp -= __i;
}
- difference_type operator-(const_iterator x) const {
- return __WORD_BIT * (p - x.p) + offset - x.offset;
+ difference_type operator-(const_iterator __x) const {
+ return __WORD_BIT * (_M_p - __x._M_p) + _M_offset - __x._M_offset;
}
- const_reference operator[](difference_type i) {
- return *(*this + i);
+ const_reference operator[](difference_type __i) {
+ return *(*this + __i);
}
- bool operator==(const const_iterator& x) const {
- return p == x.p && offset == x.offset;
+ bool operator==(const const_iterator& __x) const {
+ return _M_p == __x._M_p && _M_offset == __x._M_offset;
}
- bool operator!=(const const_iterator& x) const {
- return p != x.p || offset != x.offset;
+ bool operator!=(const const_iterator& __x) const {
+ return _M_p != __x._M_p || _M_offset != __x._M_offset;
}
- bool operator<(const_iterator x) const {
- return p < x.p || (p == x.p && offset < x.offset);
+ bool operator<(const_iterator __x) const {
+ return _M_p < __x._M_p || (_M_p == __x._M_p && _M_offset < __x._M_offset);
}
};
+// Bit-vector base class, which encapsulates the difference between
+// old SGI-style allocators and standard-conforming allocators.
+
+#ifdef __STL_USE_STD_ALLOCATORS
+
+// Base class for ordinary allocators.
+template <class _Allocator, bool __is_static>
+class _Bvector_alloc_base {
+public:
+ typedef typename _Alloc_traits<bool, _Allocator>::allocator_type
+ allocator_type;
+ allocator_type get_allocator() const { return _M_data_allocator; }
+
+ _Bvector_alloc_base(const allocator_type& __a)
+ : _M_data_allocator(__a), _M_start(), _M_finish(), _M_end_of_storage(0) {}
+
+protected:
+ unsigned int* _M_bit_alloc(size_t __n)
+ { return _M_data_allocator.allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
+ void _M_deallocate() {
+ if (_M_start._M_p)
+ _M_data_allocator.deallocate(_M_start._M_p,
+ _M_end_of_storage - _M_start._M_p);
+ }
+
+ typename _Alloc_traits<unsigned int, _Allocator>::allocator_type
+ _M_data_allocator;
+ _Bit_iterator _M_start;
+ _Bit_iterator _M_finish;
+ unsigned int* _M_end_of_storage;
+};
+
+// Specialization for instanceless allocators.
+template <class _Allocator>
+class _Bvector_alloc_base<_Allocator, true> {
+public:
+ typedef typename _Alloc_traits<bool, _Allocator>::allocator_type
+ allocator_type;
+ allocator_type get_allocator() const { return allocator_type(); }
+
+ _Bvector_alloc_base(const allocator_type&)
+ : _M_start(), _M_finish(), _M_end_of_storage(0) {}
+
+protected:
+ typedef typename _Alloc_traits<unsigned int, _Allocator>::_Alloc_type
+ _Alloc_type;
+
+ unsigned int* _M_bit_alloc(size_t __n)
+ { return _Alloc_type::allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
+ void _M_deallocate() {
+ if (_M_start._M_p)
+ _Alloc_type::deallocate(_M_start._M_p,
+ _M_end_of_storage - _M_start._M_p);
+ }
+
+ _Bit_iterator _M_start;
+ _Bit_iterator _M_finish;
+ unsigned int* _M_end_of_storage;
+};
+
+template <class _Alloc>
+class _Bvector_base
+ : public _Bvector_alloc_base<_Alloc,
+ _Alloc_traits<bool, _Alloc>::_S_instanceless>
+{
+ typedef _Bvector_alloc_base<_Alloc,
+ _Alloc_traits<bool, _Alloc>::_S_instanceless>
+ _Base;
+public:
+ typedef typename _Base::allocator_type allocator_type;
+
+ _Bvector_base(const allocator_type& __a) : _Base(__a) {}
+ ~_Bvector_base() { _Base::_M_deallocate(); }
+};
+
+#else /* __STL_USE_STD_ALLOCATORS */
+
+template <class _Alloc>
+class _Bvector_base
+{
+public:
+ typedef _Alloc allocator_type;
+ allocator_type get_allocator() const { return allocator_type(); }
+
+ _Bvector_base(const allocator_type&)
+ : _M_start(), _M_finish(), _M_end_of_storage(0) {}
+ ~_Bvector_base() { _M_deallocate(); }
+
+protected:
+ typedef simple_alloc<unsigned int, _Alloc> _Alloc_type;
+
+ unsigned int* _M_bit_alloc(size_t __n)
+ { return _Alloc_type::allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
+ void _M_deallocate() {
+ if (_M_start._M_p)
+ _Alloc_type::deallocate(_M_start._M_p,
+ _M_end_of_storage - _M_start._M_p);
+ }
+
+ _Bit_iterator _M_start;
+ _Bit_iterator _M_finish;
+ unsigned int* _M_end_of_storage;
+};
+
+#endif /* __STL_USE_STD_ALLOCATORS */
+
// The next few lines are confusing. What we're doing is declaring a
// partial specialization of vector<T, Alloc> if we have the necessary
// compiler support. Otherwise, we define a class bit_vector which uses
-// the default allocator. In either case, we typedef "data_allocator"
-// appropriately.
+// the default allocator.
-#if defined(__STL_CLASS_PARTIAL_SPECIALIZATION) && !defined(__STL_NEED_BOOL)
+#if defined(__STL_CLASS_PARTIAL_SPECIALIZATION) && !defined(__STL_NO_BOOL)
#define __SGI_STL_VECBOOL_TEMPLATE
#define __BVECTOR vector
#else
__STL_END_NAMESPACE
# include <stl_vector.h>
__STL_BEGIN_NAMESPACE
-template<class Alloc> class vector<bool, Alloc>
+template<class _Alloc> class vector<bool,_Alloc>
+ : public _Bvector_base<_Alloc>
# else /* __SGI_STL_VECBOOL_TEMPLATE */
class bit_vector
+ : public _Bvector_base<__STL_DEFAULT_ALLOCATOR(bool) >
# endif /* __SGI_STL_VECBOOL_TEMPLATE */
{
# ifdef __SGI_STL_VECBOOL_TEMPLATE
- typedef simple_alloc<unsigned int, Alloc> data_allocator;
+ typedef _Bvector_base<_Alloc> _Base;
# else /* __SGI_STL_VECBOOL_TEMPLATE */
- typedef simple_alloc<unsigned int, alloc> data_allocator;
+ typedef _Bvector_base<__STL_DEFAULT_ALLOCATOR(bool) > _Base;
# endif /* __SGI_STL_VECBOOL_TEMPLATE */
public:
typedef bool value_type;
typedef size_t size_type;
typedef ptrdiff_t difference_type;
- typedef __bit_reference reference;
+ typedef _Bit_reference reference;
typedef bool const_reference;
- typedef __bit_reference* pointer;
+ typedef _Bit_reference* pointer;
typedef const bool* const_pointer;
- typedef __bit_iterator iterator;
- typedef __bit_const_iterator const_iterator;
+ typedef _Bit_iterator iterator;
+ typedef _Bit_const_iterator const_iterator;
#ifdef __STL_CLASS_PARTIAL_SPECIALIZATION
typedef reverse_iterator<const_iterator> const_reverse_iterator;
reverse_iterator;
#endif /* __STL_CLASS_PARTIAL_SPECIALIZATION */
+ typedef typename _Base::allocator_type allocator_type;
+ allocator_type get_allocator() const { return _Base::get_allocator(); }
+
+protected:
+#ifdef __STL_USE_NAMESPACES
+ using _Base::_M_bit_alloc;
+ using _Base::_M_deallocate;
+ using _Base::_M_start;
+ using _Base::_M_finish;
+ using _Base::_M_end_of_storage;
+#endif /* __STL_USE_NAMESPACES */
+
protected:
- iterator start;
- iterator finish;
- unsigned int* end_of_storage;
- unsigned int* bit_alloc(size_type n) {
- return data_allocator::allocate((n + __WORD_BIT - 1)/__WORD_BIT);
- }
- void deallocate() {
- if (start.p)
- data_allocator::deallocate(start.p, end_of_storage - start.p);
- }
- void initialize(size_type n) {
- unsigned int* q = bit_alloc(n);
- end_of_storage = q + (n + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
- finish = start + difference_type(n);
- }
- void insert_aux(iterator position, bool x) {
- if (finish.p != end_of_storage) {
- copy_backward(position, finish, finish + 1);
- *position = x;
- ++finish;
+ void _M_initialize(size_type __n) {
+ unsigned int* __q = _M_bit_alloc(__n);
+ _M_end_of_storage = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
+ _M_finish = _M_start + difference_type(__n);
+ }
+ void _M_insert_aux(iterator __position, bool __x) {
+ if (_M_finish._M_p != _M_end_of_storage) {
+ copy_backward(__position, _M_finish, _M_finish + 1);
+ *__position = __x;
+ ++_M_finish;
}
else {
- size_type len = size() ? 2 * size() : __WORD_BIT;
- unsigned int* q = bit_alloc(len);
- iterator i = copy(begin(), position, iterator(q, 0));
- *i++ = x;
- finish = copy(position, end(), i);
- deallocate();
- end_of_storage = q + (len + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
+ size_type __len = size() ? 2 * size() : __WORD_BIT;
+ unsigned int* __q = _M_bit_alloc(__len);
+ iterator __i = copy(begin(), __position, iterator(__q, 0));
+ *__i++ = __x;
+ _M_finish = copy(__position, end(), __i);
+ _M_deallocate();
+ _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
}
}
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- void initialize_range(InputIterator first, InputIterator last,
- input_iterator_tag) {
- start = iterator();
- finish = iterator();
- end_of_storage = 0;
- for ( ; first != last; ++first)
- push_back(*first);
- }
-
- template <class ForwardIterator>
- void initialize_range(ForwardIterator first, ForwardIterator last,
- forward_iterator_tag) {
- size_type n = 0;
- distance(first, last, n);
- initialize(n);
- copy(first, last, start);
- }
-
- template <class InputIterator>
- void insert_range(iterator pos,
- InputIterator first, InputIterator last,
- input_iterator_tag) {
- for ( ; first != last; ++first) {
- pos = insert(pos, *first);
- ++pos;
+ template <class _InputIterator>
+ void _M_initialize_range(_InputIterator __first, _InputIterator __last,
+ input_iterator_tag) {
+ _M_start = iterator();
+ _M_finish = iterator();
+ _M_end_of_storage = 0;
+ for ( ; __first != __last; ++__first)
+ push_back(*__first);
+ }
+
+ template <class _ForwardIterator>
+ void _M_initialize_range(_ForwardIterator __first, _ForwardIterator __last,
+ forward_iterator_tag) {
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ _M_initialize(__n);
+ copy(__first, __last, _M_start);
+ }
+
+ template <class _InputIterator>
+ void _M_insert_range(iterator __pos,
+ _InputIterator __first, _InputIterator __last,
+ input_iterator_tag) {
+ for ( ; __first != __last; ++__first) {
+ __pos = insert(__pos, *__first);
+ ++__pos;
}
}
- template <class ForwardIterator>
- void insert_range(iterator position,
- ForwardIterator first, ForwardIterator last,
- forward_iterator_tag) {
- if (first != last) {
- size_type n = 0;
- distance(first, last, n);
- if (capacity() - size() >= n) {
- copy_backward(position, end(), finish + difference_type(n));
- copy(first, last, position);
- finish += difference_type(n);
+ template <class _ForwardIterator>
+ void _M_insert_range(iterator __position,
+ _ForwardIterator __first, _ForwardIterator __last,
+ forward_iterator_tag) {
+ if (__first != __last) {
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ if (capacity() - size() >= __n) {
+ copy_backward(__position, end(), _M_finish + difference_type(__n));
+ copy(__first, __last, __position);
+ _M_finish += difference_type(__n);
}
else {
- size_type len = size() + max(size(), n);
- unsigned int* q = bit_alloc(len);
- iterator i = copy(begin(), position, iterator(q, 0));
- i = copy(first, last, i);
- finish = copy(position, end(), i);
- deallocate();
- end_of_storage = q + (len + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
+ size_type __len = size() + max(size(), __n);
+ unsigned int* __q = _M_bit_alloc(__len);
+ iterator __i = copy(begin(), __position, iterator(__q, 0));
+ __i = copy(__first, __last, __i);
+ _M_finish = copy(__position, end(), __i);
+ _M_deallocate();
+ _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
}
}
}
#endif /* __STL_MEMBER_TEMPLATES */
public:
- iterator begin() { return start; }
- const_iterator begin() const { return start; }
- iterator end() { return finish; }
- const_iterator end() const { return finish; }
+ iterator begin() { return _M_start; }
+ const_iterator begin() const { return _M_start; }
+ iterator end() { return _M_finish; }
+ const_iterator end() const { return _M_finish; }
reverse_iterator rbegin() { return reverse_iterator(end()); }
const_reverse_iterator rbegin() const {
size_type size() const { return size_type(end() - begin()); }
size_type max_size() const { return size_type(-1); }
size_type capacity() const {
- return size_type(const_iterator(end_of_storage, 0) - begin());
+ return size_type(const_iterator(_M_end_of_storage, 0) - begin());
}
bool empty() const { return begin() == end(); }
- reference operator[](size_type n) {
- return *(begin() + difference_type(n));
- }
- const_reference operator[](size_type n) const {
- return *(begin() + difference_type(n));
+ reference operator[](size_type __n) {
+ return *(begin() + difference_type(__n));
}
- __BVECTOR() : start(iterator()), finish(iterator()), end_of_storage(0) {}
- __BVECTOR(size_type n, bool value) {
- initialize(n);
- fill(start.p, end_of_storage, value ? ~0 : 0);
+ const_reference operator[](size_type __n) const {
+ return *(begin() + difference_type(__n));
}
- __BVECTOR(int n, bool value) {
- initialize(n);
- fill(start.p, end_of_storage, value ? ~0 : 0);
- }
- __BVECTOR(long n, bool value) {
- initialize(n);
- fill(start.p, end_of_storage, value ? ~0 : 0);
+
+ explicit __BVECTOR(const allocator_type& __a = allocator_type())
+ : _Base(__a) {}
+
+ __BVECTOR(size_type __n, bool __value,
+ const allocator_type& __a = allocator_type())
+ : _Base(__a)
+ {
+ _M_initialize(__n);
+ fill(_M_start._M_p, _M_end_of_storage, __value ? ~0 : 0);
}
- explicit __BVECTOR(size_type n) {
- initialize(n);
- fill(start.p, end_of_storage, 0);
+
+ explicit __BVECTOR(size_type __n)
+ : _Base(allocator_type())
+ {
+ _M_initialize(__n);
+ fill(_M_start._M_p, _M_end_of_storage, 0);
}
- __BVECTOR(const __BVECTOR& x) {
- initialize(x.size());
- copy(x.begin(), x.end(), start);
+
+ __BVECTOR(const __BVECTOR& __x) : _Base(__x.get_allocator()) {
+ _M_initialize(__x.size());
+ copy(__x.begin(), __x.end(), _M_start);
}
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator>
- __BVECTOR(InputIterator first, InputIterator last) {
- initialize_range(first, last, iterator_category(first));
+ // Check whether it's an integral type. If so, it's not an iterator.
+ template <class _InputIterator>
+ __BVECTOR(_InputIterator __first, _InputIterator __last,
+ const allocator_type& __a = allocator_type())
+ : _Base(__a)
+ {
+ typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
+ _M_initialize_dispatch(__first, __last, _Integral());
+ }
+
+ template <class _Integer>
+ void _M_initialize_dispatch(_Integer __n, _Integer __x, __true_type) {
+ _M_initialize(__n);
+ fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
+ }
+
+ template <class _InputIterator>
+ void _M_initialize_dispatch(_InputIterator __first, _InputIterator __last,
+ __false_type) {
+ _M_initialize_range(__first, __last, __ITERATOR_CATEGORY(__first));
}
#else /* __STL_MEMBER_TEMPLATES */
- __BVECTOR(const_iterator first, const_iterator last) {
- size_type n = 0;
- distance(first, last, n);
- initialize(n);
- copy(first, last, start);
- }
- __BVECTOR(const bool* first, const bool* last) {
- size_type n = 0;
- distance(first, last, n);
- initialize(n);
- copy(first, last, start);
+ __BVECTOR(const_iterator __first, const_iterator __last,
+ const allocator_type& __a = allocator_type())
+ : _Base(__a)
+ {
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ _M_initialize(__n);
+ copy(__first, __last, _M_start);
+ }
+ __BVECTOR(const bool* __first, const bool* __last,
+ const allocator_type& __a = allocator_type())
+ : _Base(__a)
+ {
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ _M_initialize(__n);
+ copy(__first, __last, _M_start);
}
#endif /* __STL_MEMBER_TEMPLATES */
- ~__BVECTOR() { deallocate(); }
- __BVECTOR& operator=(const __BVECTOR& x) {
- if (&x == this) return *this;
- if (x.size() > capacity()) {
- deallocate();
- initialize(x.size());
+ ~__BVECTOR() { }
+
+ __BVECTOR& operator=(const __BVECTOR& __x) {
+ if (&__x == this) return *this;
+ if (__x.size() > capacity()) {
+ _M_deallocate();
+ _M_initialize(__x.size());
}
- copy(x.begin(), x.end(), begin());
- finish = begin() + difference_type(x.size());
+ copy(__x.begin(), __x.end(), begin());
+ _M_finish = begin() + difference_type(__x.size());
return *this;
}
- void reserve(size_type n) {
- if (capacity() < n) {
- unsigned int* q = bit_alloc(n);
- finish = copy(begin(), end(), iterator(q, 0));
- deallocate();
- start = iterator(q, 0);
- end_of_storage = q + (n + __WORD_BIT - 1)/__WORD_BIT;
+
+ // assign(), a generalized assignment member function. Two
+ // versions: one that takes a count, and one that takes a range.
+ // The range version is a member template, so we dispatch on whether
+ // or not the type is an integer.
+
+ void assign(size_t __n, bool __x) {
+ if (__n > size()) {
+ fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
+ insert(end(), __n - size(), __x);
+ }
+ else {
+ erase(begin() + __n, end());
+ fill(_M_start._M_p, _M_end_of_storage, __x ? ~0 : 0);
}
}
+
+#ifdef __STL_MEMBER_TEMPLATES
+
+ template <class _InputIterator>
+ void assign(_InputIterator __first, _InputIterator __last) {
+ typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
+ _M_assign_dispatch(__first, __last, _Integral());
+ }
+
+ template <class _Integer>
+ void _M_assign_dispatch(_Integer __n, _Integer __val, __true_type)
+ { assign((size_t) __n, (bool) __val); }
+
+ template <class _InputIter>
+ void _M_assign_dispatch(_InputIter __first, _InputIter __last, __false_type)
+ { _M_assign_aux(__first, __last, __ITERATOR_CATEGORY(__first)); }
+
+ template <class _InputIterator>
+ void _M_assign_aux(_InputIterator __first, _InputIterator __last,
+ input_iterator_tag) {
+ iterator __cur = begin();
+ for ( ; __first != __last && __cur != end(); ++__cur, ++__first)
+ *__cur = *__first;
+ if (__first == __last)
+ erase(__cur, end());
+ else
+ insert(end(), __first, __last);
+ }
+
+ template <class _ForwardIterator>
+ void _M_assign_aux(_ForwardIterator __first, _ForwardIterator __last,
+ forward_iterator_tag) {
+ size_type __len = 0;
+ distance(__first, __last, __len);
+ if (__len < size())
+ erase(copy(__first, __last, begin()), end());
+ else {
+ _ForwardIterator __mid = __first;
+ advance(__mid, size());
+ copy(__first, __mid, begin());
+ insert(end(), __mid, __last);
+ }
+ }
+
+#endif /* __STL_MEMBER_TEMPLATES */
+
+ void reserve(size_type __n) {
+ if (capacity() < __n) {
+ unsigned int* __q = _M_bit_alloc(__n);
+ _M_finish = copy(begin(), end(), iterator(__q, 0));
+ _M_deallocate();
+ _M_start = iterator(__q, 0);
+ _M_end_of_storage = __q + (__n + __WORD_BIT - 1)/__WORD_BIT;
+ }
+ }
+
reference front() { return *begin(); }
const_reference front() const { return *begin(); }
reference back() { return *(end() - 1); }
const_reference back() const { return *(end() - 1); }
- void push_back(bool x) {
- if (finish.p != end_of_storage)
- *finish++ = x;
+ void push_back(bool __x) {
+ if (_M_finish._M_p != _M_end_of_storage)
+ *_M_finish++ = __x;
else
- insert_aux(end(), x);
+ _M_insert_aux(end(), __x);
}
- void swap(__BVECTOR& x) {
- __STD::swap(start, x.start);
- __STD::swap(finish, x.finish);
- __STD::swap(end_of_storage, x.end_of_storage);
+ void swap(__BVECTOR& __x) {
+ __STD::swap(_M_start, __x._M_start);
+ __STD::swap(_M_finish, __x._M_finish);
+ __STD::swap(_M_end_of_storage, __x._M_end_of_storage);
}
- iterator insert(iterator position, bool x = bool()) {
- difference_type n = position - begin();
- if (finish.p != end_of_storage && position == end())
- *finish++ = x;
+ iterator insert(iterator __position, bool __x = bool()) {
+ difference_type __n = __position - begin();
+ if (_M_finish._M_p != _M_end_of_storage && __position == end())
+ *_M_finish++ = __x;
else
- insert_aux(position, x);
- return begin() + n;
+ _M_insert_aux(__position, __x);
+ return begin() + __n;
}
#ifdef __STL_MEMBER_TEMPLATES
- template <class InputIterator> void insert(iterator position,
- InputIterator first,
- InputIterator last) {
- insert_range(position, first, last, iterator_category(first));
+ // Check whether it's an integral type. If so, it's not an iterator.
+ template <class _InputIterator>
+ void insert(iterator __position,
+ _InputIterator __first, _InputIterator __last) {
+ typedef typename _Is_integer<_InputIterator>::_Integral _Integral;
+ _M_insert_dispatch(__position, __first, __last, _Integral());
+ }
+
+ template <class _Integer>
+ void _M_insert_dispatch(iterator __pos, _Integer __n, _Integer __x,
+ __true_type) {
+ insert(__pos, (size_type) __n, (bool) __x);
+ }
+
+ template <class _InputIterator>
+ void _M_insert_dispatch(iterator __pos,
+ _InputIterator __first, _InputIterator __last,
+ __false_type) {
+ _M_insert_range(__pos, __first, __last, __ITERATOR_CATEGORY(__first));
}
#else /* __STL_MEMBER_TEMPLATES */
- void insert(iterator position, const_iterator first,
- const_iterator last) {
- if (first == last) return;
- size_type n = 0;
- distance(first, last, n);
- if (capacity() - size() >= n) {
- copy_backward(position, end(), finish + n);
- copy(first, last, position);
- finish += n;
+ void insert(iterator __position,
+ const_iterator __first, const_iterator __last) {
+ if (__first == __last) return;
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ if (capacity() - size() >= __n) {
+ copy_backward(__position, end(), _M_finish + __n);
+ copy(__first, __last, __position);
+ _M_finish += __n;
}
else {
- size_type len = size() + max(size(), n);
- unsigned int* q = bit_alloc(len);
- iterator i = copy(begin(), position, iterator(q, 0));
- i = copy(first, last, i);
- finish = copy(position, end(), i);
- deallocate();
- end_of_storage = q + (len + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
+ size_type __len = size() + max(size(), __n);
+ unsigned int* __q = _M_bit_alloc(__len);
+ iterator __i = copy(begin(), __position, iterator(__q, 0));
+ __i = copy(__first, __last, __i);
+ _M_finish = copy(__position, end(), __i);
+ _M_deallocate();
+ _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
}
}
- void insert(iterator position, const bool* first, const bool* last) {
- if (first == last) return;
- size_type n = 0;
- distance(first, last, n);
- if (capacity() - size() >= n) {
- copy_backward(position, end(), finish + n);
- copy(first, last, position);
- finish += n;
+ void insert(iterator __position, const bool* __first, const bool* __last) {
+ if (__first == __last) return;
+ size_type __n = 0;
+ distance(__first, __last, __n);
+ if (capacity() - size() >= __n) {
+ copy_backward(__position, end(), _M_finish + __n);
+ copy(__first, __last, __position);
+ _M_finish += __n;
}
else {
- size_type len = size() + max(size(), n);
- unsigned int* q = bit_alloc(len);
- iterator i = copy(begin(), position, iterator(q, 0));
- i = copy(first, last, i);
- finish = copy(position, end(), i);
- deallocate();
- end_of_storage = q + (len + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
+ size_type __len = size() + max(size(), __n);
+ unsigned int* __q = _M_bit_alloc(__len);
+ iterator __i = copy(begin(), __position, iterator(__q, 0));
+ __i = copy(__first, __last, __i);
+ _M_finish = copy(__position, end(), __i);
+ _M_deallocate();
+ _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
}
}
#endif /* __STL_MEMBER_TEMPLATES */
- void insert(iterator position, size_type n, bool x) {
- if (n == 0) return;
- if (capacity() - size() >= n) {
- copy_backward(position, end(), finish + difference_type(n));
- fill(position, position + difference_type(n), x);
- finish += difference_type(n);
+ void insert(iterator __position, size_type __n, bool __x) {
+ if (__n == 0) return;
+ if (capacity() - size() >= __n) {
+ copy_backward(__position, end(), _M_finish + difference_type(__n));
+ fill(__position, __position + difference_type(__n), __x);
+ _M_finish += difference_type(__n);
}
else {
- size_type len = size() + max(size(), n);
- unsigned int* q = bit_alloc(len);
- iterator i = copy(begin(), position, iterator(q, 0));
- fill_n(i, n, x);
- finish = copy(position, end(), i + difference_type(n));
- deallocate();
- end_of_storage = q + (len + __WORD_BIT - 1)/__WORD_BIT;
- start = iterator(q, 0);
+ size_type __len = size() + max(size(), __n);
+ unsigned int* __q = _M_bit_alloc(__len);
+ iterator __i = copy(begin(), __position, iterator(__q, 0));
+ fill_n(__i, __n, __x);
+ _M_finish = copy(__position, end(), __i + difference_type(__n));
+ _M_deallocate();
+ _M_end_of_storage = __q + (__len + __WORD_BIT - 1)/__WORD_BIT;
+ _M_start = iterator(__q, 0);
}
}
- void insert(iterator pos, int n, bool x) { insert(pos, (size_type)n, x); }
- void insert(iterator pos, long n, bool x) { insert(pos, (size_type)n, x); }
-
- void pop_back() { --finish; }
- iterator erase(iterator position) {
- if (position + 1 != end())
- copy(position + 1, end(), position);
- --finish;
- return position;
+ void pop_back() { --_M_finish; }
+ iterator erase(iterator __position) {
+ if (__position + 1 != end())
+ copy(__position + 1, end(), __position);
+ --_M_finish;
+ return __position;
}
- iterator erase(iterator first, iterator last) {
- finish = copy(last, end(), first);
- return first;
+ iterator erase(iterator __first, iterator __last) {
+ _M_finish = copy(__last, end(), __first);
+ return __first;
}
- void resize(size_type new_size, bool x = bool()) {
- if (new_size < size())
- erase(begin() + difference_type(new_size), end());
+ void resize(size_type __new_size, bool __x = bool()) {
+ if (__new_size < size())
+ erase(begin() + difference_type(__new_size), end());
else
- insert(end(), new_size - size(), x);
+ insert(end(), __new_size - size(), __x);
}
void clear() { erase(begin(), end()); }
};
#else /* __SGI_STL_VECBOOL_TEMPLATE */
-inline bool operator==(const bit_vector& x, const bit_vector& y) {
- return x.size() == y.size() && equal(x.begin(), x.end(), y.begin());
+inline bool
+operator==(const bit_vector& __x, const bit_vector& __y)
+{
+ return (__x.size() == __y.size() &&
+ equal(__x.begin(), __x.end(), __y.begin()));
}
-inline bool operator<(const bit_vector& x, const bit_vector& y) {
- return lexicographical_compare(x.begin(), x.end(), y.begin(), y.end());
+inline bool
+operator<(const bit_vector& __x, const bit_vector& __y)
+{
+ return lexicographical_compare(__x.begin(), __x.end(),
+ __y.begin(), __y.end());
}
#endif /* __SGI_STL_VECBOOL_TEMPLATE */
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
#pragma reset woff 1174
+#pragma reset woff 1375
#endif
__STL_END_NAMESPACE
OSDN Git Service
