1 // bit_vector and vector<bool> specialization -*- C++ -*-
3 // Copyright (C) 2001 Free Software Foundation, Inc.
5 // This file is part of the GNU ISO C++ Library. This library is free
6 // software; you can redistribute it and/or modify it under the
7 // terms of the GNU General Public License as published by the
8 // Free Software Foundation; either version 2, or (at your option)
11 // This library is distributed in the hope that it will be useful,
12 // but WITHOUT ANY WARRANTY; without even the implied warranty of
13 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 // GNU General Public License for more details.
16 // You should have received a copy of the GNU General Public License along
17 // with this library; see the file COPYING. If not, write to the Free
18 // Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
21 // As a special exception, you may use this file as part of a free software
22 // library without restriction. Specifically, if other files instantiate
23 // templates or use macros or inline functions from this file, or you compile
24 // this file and link it with other files to produce an executable, this
25 // file does not by itself cause the resulting executable to be covered by
26 // the GNU General Public License. This exception does not however
27 // invalidate any other reasons why the executable file might be covered by
28 // the GNU General Public License.
33 * Hewlett-Packard Company
35 * Permission to use, copy, modify, distribute and sell this software
36 * and its documentation for any purpose is hereby granted without fee,
37 * provided that the above copyright notice appear in all copies and
38 * that both that copyright notice and this permission notice appear
39 * in supporting documentation. Hewlett-Packard Company makes no
40 * representations about the suitability of this software for any
41 * purpose. It is provided "as is" without express or implied warranty.
44 * Copyright (c) 1996-1999
45 * Silicon Graphics Computer Systems, Inc.
47 * Permission to use, copy, modify, distribute and sell this software
48 * and its documentation for any purpose is hereby granted without fee,
49 * provided that the above copyright notice appear in all copies and
50 * that both that copyright notice and this permission notice appear
51 * in supporting documentation. Silicon Graphics makes no
52 * representations about the suitability of this software for any
53 * purpose. It is provided "as is" without express or implied warranty.
56 /* NOTE: This is an internal header file, included by other STL headers.
57 * You should not attempt to use it directly.
60 #ifndef __SGI_STL_INTERNAL_BVECTOR_H
61 #define __SGI_STL_INTERNAL_BVECTOR_H
66 static const int __WORD_BIT
= int(CHAR_BIT
*sizeof(unsigned int));
68 struct _Bit_reference
{
71 _Bit_reference(unsigned int* __x
, unsigned int __y
)
72 : _M_p(__x
), _M_mask(__y
) {}
75 _Bit_reference() : _M_p(0), _M_mask(0) {}
76 operator bool() const { return !(!(*_M_p
& _M_mask
)); }
77 _Bit_reference
& operator=(bool __x
)
79 if (__x
) *_M_p
|= _M_mask
;
80 else *_M_p
&= ~_M_mask
;
83 _Bit_reference
& operator=(const _Bit_reference
& __x
)
84 { return *this = bool(__x
); }
85 bool operator==(const _Bit_reference
& __x
) const
86 { return bool(*this) == bool(__x
); }
87 bool operator<(const _Bit_reference
& __x
) const {
88 return !bool(*this) && bool(__x
);
90 void flip() { *_M_p
^= _M_mask
; }
93 inline void swap(_Bit_reference __x
, _Bit_reference __y
)
100 struct _Bit_iterator_base
: public random_access_iterator
<bool, ptrdiff_t>
103 unsigned int _M_offset
;
105 _Bit_iterator_base(unsigned int* __x
, unsigned int __y
)
106 : _M_p(__x
), _M_offset(__y
) {}
109 if (_M_offset
++ == __WORD_BIT
- 1) {
114 void _M_bump_down() {
115 if (_M_offset
-- == 0) {
116 _M_offset
= __WORD_BIT
- 1;
121 void _M_incr(ptrdiff_t __i
) {
122 difference_type __n
= __i
+ _M_offset
;
123 _M_p
+= __n
/ __WORD_BIT
;
124 __n
= __n
% __WORD_BIT
;
126 _M_offset
= (unsigned int) __n
+ __WORD_BIT
;
129 _M_offset
= (unsigned int) __n
;
132 bool operator==(const _Bit_iterator_base
& __i
) const {
133 return _M_p
== __i
._M_p
&& _M_offset
== __i
._M_offset
;
135 bool operator<(const _Bit_iterator_base
& __i
) const {
136 return _M_p
< __i
._M_p
|| (_M_p
== __i
._M_p
&& _M_offset
< __i
._M_offset
);
138 bool operator!=(const _Bit_iterator_base
& __i
) const {
139 return !(*this == __i
);
141 bool operator>(const _Bit_iterator_base
& __i
) const {
144 bool operator<=(const _Bit_iterator_base
& __i
) const {
145 return !(__i
< *this);
147 bool operator>=(const _Bit_iterator_base
& __i
) const {
148 return !(*this < __i
);
153 operator-(const _Bit_iterator_base
& __x
, const _Bit_iterator_base
& __y
) {
154 return __WORD_BIT
* (__x
._M_p
- __y
._M_p
) + __x
._M_offset
- __y
._M_offset
;
158 struct _Bit_iterator
: public _Bit_iterator_base
160 typedef _Bit_reference reference
;
161 typedef _Bit_reference
* pointer
;
162 typedef _Bit_iterator iterator
;
164 _Bit_iterator() : _Bit_iterator_base(0, 0) {}
165 _Bit_iterator(unsigned int* __x
, unsigned int __y
)
166 : _Bit_iterator_base(__x
, __y
) {}
168 reference
operator*() const { return reference(_M_p
, 1U << _M_offset
); }
169 iterator
& operator++() {
173 iterator
operator++(int) {
174 iterator __tmp
= *this;
178 iterator
& operator--() {
182 iterator
operator--(int) {
183 iterator __tmp
= *this;
187 iterator
& operator+=(difference_type __i
) {
191 iterator
& operator-=(difference_type __i
) {
195 iterator
operator+(difference_type __i
) const {
196 iterator __tmp
= *this;
199 iterator
operator-(difference_type __i
) const {
200 iterator __tmp
= *this;
204 reference
operator[](difference_type __i
) { return *(*this + __i
); }
208 operator+(ptrdiff_t __n
, const _Bit_iterator
& __x
) { return __x
+ __n
; }
211 struct _Bit_const_iterator
: public _Bit_iterator_base
213 typedef bool reference
;
214 typedef bool const_reference
;
215 typedef const bool* pointer
;
216 typedef _Bit_const_iterator const_iterator
;
218 _Bit_const_iterator() : _Bit_iterator_base(0, 0) {}
219 _Bit_const_iterator(unsigned int* __x
, unsigned int __y
)
220 : _Bit_iterator_base(__x
, __y
) {}
221 _Bit_const_iterator(const _Bit_iterator
& __x
)
222 : _Bit_iterator_base(__x
._M_p
, __x
._M_offset
) {}
224 const_reference
operator*() const {
225 return _Bit_reference(_M_p
, 1U << _M_offset
);
227 const_iterator
& operator++() {
231 const_iterator
operator++(int) {
232 const_iterator __tmp
= *this;
236 const_iterator
& operator--() {
240 const_iterator
operator--(int) {
241 const_iterator __tmp
= *this;
245 const_iterator
& operator+=(difference_type __i
) {
249 const_iterator
& operator-=(difference_type __i
) {
253 const_iterator
operator+(difference_type __i
) const {
254 const_iterator __tmp
= *this;
257 const_iterator
operator-(difference_type __i
) const {
258 const_iterator __tmp
= *this;
261 const_reference
operator[](difference_type __i
) {
262 return *(*this + __i
);
266 inline _Bit_const_iterator
267 operator+(ptrdiff_t __n
, const _Bit_const_iterator
& __x
) { return __x
+ __n
; }
270 // Bit-vector base class, which encapsulates the difference between
271 // old SGI-style allocators and standard-conforming allocators.
273 // Base class for ordinary allocators.
274 template <class _Allocator
, bool __is_static
>
275 class _Bvector_alloc_base
{
277 typedef typename _Alloc_traits
<bool, _Allocator
>::allocator_type
279 allocator_type
get_allocator() const { return _M_data_allocator
; }
281 _Bvector_alloc_base(const allocator_type
& __a
)
282 : _M_data_allocator(__a
), _M_start(), _M_finish(), _M_end_of_storage(0) {}
285 unsigned int* _M_bit_alloc(size_t __n
)
286 { return _M_data_allocator
.allocate((__n
+ __WORD_BIT
- 1)/__WORD_BIT
); }
287 void _M_deallocate() {
289 _M_data_allocator
.deallocate(_M_start
._M_p
,
290 _M_end_of_storage
- _M_start
._M_p
);
293 typename _Alloc_traits
<unsigned int, _Allocator
>::allocator_type
295 _Bit_iterator _M_start
;
296 _Bit_iterator _M_finish
;
297 unsigned int* _M_end_of_storage
;
300 // Specialization for instanceless allocators.
301 template <class _Allocator
>
302 class _Bvector_alloc_base
<_Allocator
, true> {
304 typedef typename _Alloc_traits
<bool, _Allocator
>::allocator_type
306 allocator_type
get_allocator() const { return allocator_type(); }
308 _Bvector_alloc_base(const allocator_type
&)
309 : _M_start(), _M_finish(), _M_end_of_storage(0) {}
312 typedef typename _Alloc_traits
<unsigned int, _Allocator
>::_Alloc_type
315 unsigned int* _M_bit_alloc(size_t __n
)
316 { return _Alloc_type::allocate((__n
+ __WORD_BIT
- 1)/__WORD_BIT
); }
317 void _M_deallocate() {
319 _Alloc_type::deallocate(_M_start
._M_p
,
320 _M_end_of_storage
- _M_start
._M_p
);
323 _Bit_iterator _M_start
;
324 _Bit_iterator _M_finish
;
325 unsigned int* _M_end_of_storage
;
328 template <class _Alloc
>
330 : public _Bvector_alloc_base
<_Alloc
,
331 _Alloc_traits
<bool, _Alloc
>::_S_instanceless
>
333 typedef _Bvector_alloc_base
<_Alloc
,
334 _Alloc_traits
<bool, _Alloc
>::_S_instanceless
>
337 typedef typename
_Base::allocator_type allocator_type
;
339 _Bvector_base(const allocator_type
& __a
) : _Base(__a
) {}
340 ~_Bvector_base() { _Base::_M_deallocate(); }
345 // Declare a partial specialization of vector<T, Alloc>.
346 #include <bits/stl_vector.h>
350 template <typename _Alloc
>
351 class vector
<bool, _Alloc
> : public _Bvector_base
<_Alloc
>
354 typedef bool value_type
;
355 typedef size_t size_type
;
356 typedef ptrdiff_t difference_type
;
357 typedef _Bit_reference reference
;
358 typedef bool const_reference
;
359 typedef _Bit_reference
* pointer
;
360 typedef const bool* const_pointer
;
362 typedef _Bit_iterator iterator
;
363 typedef _Bit_const_iterator const_iterator
;
365 typedef reverse_iterator
<const_iterator
> const_reverse_iterator
;
366 typedef reverse_iterator
<iterator
> reverse_iterator
;
368 typedef typename _Bvector_base
<_Alloc
>::allocator_type allocator_type
;
369 allocator_type
get_allocator() const {
370 return _Bvector_base
<_Alloc
>::get_allocator();
374 using _Bvector_base
<_Alloc
>::_M_bit_alloc
;
375 using _Bvector_base
<_Alloc
>::_M_deallocate
;
376 using _Bvector_base
<_Alloc
>::_M_start
;
377 using _Bvector_base
<_Alloc
>::_M_finish
;
378 using _Bvector_base
<_Alloc
>::_M_end_of_storage
;
381 void _M_initialize(size_type __n
) {
382 unsigned int* __q
= _M_bit_alloc(__n
);
383 _M_end_of_storage
= __q
+ (__n
+ __WORD_BIT
- 1)/__WORD_BIT
;
384 _M_start
= iterator(__q
, 0);
385 _M_finish
= _M_start
+ difference_type(__n
);
387 void _M_insert_aux(iterator __position
, bool __x
) {
388 if (_M_finish
._M_p
!= _M_end_of_storage
) {
389 copy_backward(__position
, _M_finish
, _M_finish
+ 1);
394 size_type __len
= size() ? 2 * size() : __WORD_BIT
;
395 unsigned int* __q
= _M_bit_alloc(__len
);
396 iterator __i
= copy(begin(), __position
, iterator(__q
, 0));
398 _M_finish
= copy(__position
, end(), __i
);
400 _M_end_of_storage
= __q
+ (__len
+ __WORD_BIT
- 1)/__WORD_BIT
;
401 _M_start
= iterator(__q
, 0);
405 template <class _InputIterator
>
406 void _M_initialize_range(_InputIterator __first
, _InputIterator __last
,
407 input_iterator_tag
) {
408 _M_start
= iterator();
409 _M_finish
= iterator();
410 _M_end_of_storage
= 0;
411 for ( ; __first
!= __last
; ++__first
)
415 template <class _ForwardIterator
>
416 void _M_initialize_range(_ForwardIterator __first
, _ForwardIterator __last
,
417 forward_iterator_tag
) {
419 distance(__first
, __last
, __n
);
421 copy(__first
, __last
, _M_start
);
424 template <class _InputIterator
>
425 void _M_insert_range(iterator __pos
,
426 _InputIterator __first
, _InputIterator __last
,
427 input_iterator_tag
) {
428 for ( ; __first
!= __last
; ++__first
) {
429 __pos
= insert(__pos
, *__first
);
434 template <class _ForwardIterator
>
435 void _M_insert_range(iterator __position
,
436 _ForwardIterator __first
, _ForwardIterator __last
,
437 forward_iterator_tag
) {
438 if (__first
!= __last
) {
440 distance(__first
, __last
, __n
);
441 if (capacity() - size() >= __n
) {
442 copy_backward(__position
, end(), _M_finish
+ difference_type(__n
));
443 copy(__first
, __last
, __position
);
444 _M_finish
+= difference_type(__n
);
447 size_type __len
= size() + max(size(), __n
);
448 unsigned int* __q
= _M_bit_alloc(__len
);
449 iterator __i
= copy(begin(), __position
, iterator(__q
, 0));
450 __i
= copy(__first
, __last
, __i
);
451 _M_finish
= copy(__position
, end(), __i
);
453 _M_end_of_storage
= __q
+ (__len
+ __WORD_BIT
- 1)/__WORD_BIT
;
454 _M_start
= iterator(__q
, 0);
460 iterator
begin() { return _M_start
; }
461 const_iterator
begin() const { return _M_start
; }
462 iterator
end() { return _M_finish
; }
463 const_iterator
end() const { return _M_finish
; }
465 reverse_iterator
rbegin() { return reverse_iterator(end()); }
466 const_reverse_iterator
rbegin() const {
467 return const_reverse_iterator(end());
469 reverse_iterator
rend() { return reverse_iterator(begin()); }
470 const_reverse_iterator
rend() const {
471 return const_reverse_iterator(begin());
474 size_type
size() const { return size_type(end() - begin()); }
475 size_type
max_size() const { return size_type(-1); }
476 size_type
capacity() const {
477 return size_type(const_iterator(_M_end_of_storage
, 0) - begin());
479 bool empty() const { return begin() == end(); }
481 reference
operator[](size_type __n
)
482 { return *(begin() + difference_type(__n
)); }
483 const_reference
operator[](size_type __n
) const
484 { return *(begin() + difference_type(__n
)); }
486 void _M_range_check(size_type __n
) const {
487 if (__n
>= this->size())
488 __throw_out_of_range("vector<bool>");
491 reference
at(size_type __n
)
492 { _M_range_check(__n
); return (*this)[__n
]; }
493 const_reference
at(size_type __n
) const
494 { _M_range_check(__n
); return (*this)[__n
]; }
496 explicit vector(const allocator_type
& __a
= allocator_type())
497 : _Bvector_base
<_Alloc
>(__a
) {}
499 vector(size_type __n
, bool __value
,
500 const allocator_type
& __a
= allocator_type())
501 : _Bvector_base
<_Alloc
>(__a
)
504 fill(_M_start
._M_p
, _M_end_of_storage
, __value
? ~0 : 0);
507 explicit vector(size_type __n
)
508 : _Bvector_base
<_Alloc
>(allocator_type())
511 fill(_M_start
._M_p
, _M_end_of_storage
, 0);
514 vector(const vector
& __x
) : _Bvector_base
<_Alloc
>(__x
.get_allocator()) {
515 _M_initialize(__x
.size());
516 copy(__x
.begin(), __x
.end(), _M_start
);
519 // Check whether it's an integral type. If so, it's not an iterator.
521 template <class _Integer
>
522 void _M_initialize_dispatch(_Integer __n
, _Integer __x
, __true_type
) {
524 fill(_M_start
._M_p
, _M_end_of_storage
, __x
? ~0 : 0);
527 template <class _InputIterator
>
528 void _M_initialize_dispatch(_InputIterator __first
, _InputIterator __last
,
530 _M_initialize_range(__first
, __last
, __iterator_category(__first
));
533 template <class _InputIterator
>
534 vector(_InputIterator __first
, _InputIterator __last
,
535 const allocator_type
& __a
= allocator_type())
536 : _Bvector_base
<_Alloc
>(__a
)
538 typedef typename _Is_integer
<_InputIterator
>::_Integral _Integral
;
539 _M_initialize_dispatch(__first
, __last
, _Integral());
544 vector
& operator=(const vector
& __x
) {
545 if (&__x
== this) return *this;
546 if (__x
.size() > capacity()) {
548 _M_initialize(__x
.size());
550 copy(__x
.begin(), __x
.end(), begin());
551 _M_finish
= begin() + difference_type(__x
.size());
555 // assign(), a generalized assignment member function. Two
556 // versions: one that takes a count, and one that takes a range.
557 // The range version is a member template, so we dispatch on whether
558 // or not the type is an integer.
560 void _M_fill_assign(size_t __n
, bool __x
) {
562 fill(_M_start
._M_p
, _M_end_of_storage
, __x
? ~0 : 0);
563 insert(end(), __n
- size(), __x
);
566 erase(begin() + __n
, end());
567 fill(_M_start
._M_p
, _M_end_of_storage
, __x
? ~0 : 0);
571 void assign(size_t __n
, bool __x
) { _M_fill_assign(__n
, __x
); }
573 template <class _InputIterator
>
574 void assign(_InputIterator __first
, _InputIterator __last
) {
575 typedef typename _Is_integer
<_InputIterator
>::_Integral _Integral
;
576 _M_assign_dispatch(__first
, __last
, _Integral());
579 template <class _Integer
>
580 void _M_assign_dispatch(_Integer __n
, _Integer __val
, __true_type
)
581 { _M_fill_assign((size_t) __n
, (bool) __val
); }
583 template <class _InputIter
>
584 void _M_assign_dispatch(_InputIter __first
, _InputIter __last
, __false_type
)
585 { _M_assign_aux(__first
, __last
, __iterator_category(__first
)); }
587 template <class _InputIterator
>
588 void _M_assign_aux(_InputIterator __first
, _InputIterator __last
,
589 input_iterator_tag
) {
590 iterator __cur
= begin();
591 for ( ; __first
!= __last
&& __cur
!= end(); ++__cur
, ++__first
)
593 if (__first
== __last
)
596 insert(end(), __first
, __last
);
599 template <class _ForwardIterator
>
600 void _M_assign_aux(_ForwardIterator __first
, _ForwardIterator __last
,
601 forward_iterator_tag
) {
603 distance(__first
, __last
, __len
);
605 erase(copy(__first
, __last
, begin()), end());
607 _ForwardIterator __mid
= __first
;
608 advance(__mid
, size());
609 copy(__first
, __mid
, begin());
610 insert(end(), __mid
, __last
);
614 void reserve(size_type __n
) {
615 if (capacity() < __n
) {
616 unsigned int* __q
= _M_bit_alloc(__n
);
617 _M_finish
= copy(begin(), end(), iterator(__q
, 0));
619 _M_start
= iterator(__q
, 0);
620 _M_end_of_storage
= __q
+ (__n
+ __WORD_BIT
- 1)/__WORD_BIT
;
624 reference
front() { return *begin(); }
625 const_reference
front() const { return *begin(); }
626 reference
back() { return *(end() - 1); }
627 const_reference
back() const { return *(end() - 1); }
628 void push_back(bool __x
) {
629 if (_M_finish
._M_p
!= _M_end_of_storage
)
632 _M_insert_aux(end(), __x
);
634 void swap(vector
<bool, _Alloc
>& __x
) {
635 std::swap(_M_start
, __x
._M_start
);
636 std::swap(_M_finish
, __x
._M_finish
);
637 std::swap(_M_end_of_storage
, __x
._M_end_of_storage
);
639 iterator
insert(iterator __position
, bool __x
= bool()) {
640 difference_type __n
= __position
- begin();
641 if (_M_finish
._M_p
!= _M_end_of_storage
&& __position
== end())
644 _M_insert_aux(__position
, __x
);
645 return begin() + __n
;
648 // Check whether it's an integral type. If so, it's not an iterator.
650 template <class _Integer
>
651 void _M_insert_dispatch(iterator __pos
, _Integer __n
, _Integer __x
,
653 _M_fill_insert(__pos
, __n
, __x
);
656 template <class _InputIterator
>
657 void _M_insert_dispatch(iterator __pos
,
658 _InputIterator __first
, _InputIterator __last
,
660 _M_insert_range(__pos
, __first
, __last
, __iterator_category(__first
));
663 template <class _InputIterator
>
664 void insert(iterator __position
,
665 _InputIterator __first
, _InputIterator __last
) {
666 typedef typename _Is_integer
<_InputIterator
>::_Integral _Integral
;
667 _M_insert_dispatch(__position
, __first
, __last
, _Integral());
670 void _M_fill_insert(iterator __position
, size_type __n
, bool __x
) {
671 if (__n
== 0) return;
672 if (capacity() - size() >= __n
) {
673 copy_backward(__position
, end(), _M_finish
+ difference_type(__n
));
674 fill(__position
, __position
+ difference_type(__n
), __x
);
675 _M_finish
+= difference_type(__n
);
678 size_type __len
= size() + max(size(), __n
);
679 unsigned int* __q
= _M_bit_alloc(__len
);
680 iterator __i
= copy(begin(), __position
, iterator(__q
, 0));
681 fill_n(__i
, __n
, __x
);
682 _M_finish
= copy(__position
, end(), __i
+ difference_type(__n
));
684 _M_end_of_storage
= __q
+ (__len
+ __WORD_BIT
- 1)/__WORD_BIT
;
685 _M_start
= iterator(__q
, 0);
689 void insert(iterator __position
, size_type __n
, bool __x
) {
690 _M_fill_insert(__position
, __n
, __x
);
693 void pop_back() { --_M_finish
; }
694 iterator
erase(iterator __position
) {
695 if (__position
+ 1 != end())
696 copy(__position
+ 1, end(), __position
);
700 iterator
erase(iterator __first
, iterator __last
) {
701 _M_finish
= copy(__last
, end(), __first
);
704 void resize(size_type __new_size
, bool __x
= bool()) {
705 if (__new_size
< size())
706 erase(begin() + difference_type(__new_size
), end());
708 insert(end(), __new_size
- size(), __x
);
711 for (unsigned int* __p
= _M_start
._M_p
; __p
!= _M_end_of_storage
; ++__p
)
715 void clear() { erase(begin(), end()); }
718 // This typedef is non-standard. It is provided for backward compatibility.
719 typedef vector
<bool, alloc
> bit_vector
;
723 #endif /* __SGI_STL_INTERNAL_BVECTOR_H */