Defined in header <vector> | ||
|---|---|---|
template<class Allocator> class vector<bool, Allocator>; |
std::vector<bool> is a possibly space-efficient specialization of std::vector for the type bool.
The manner in which std::vector<bool> is made space efficient (as well as whether it is optimized at all) is implementation defined. One potential optimization involves coalescing vector elements such that each element occupies a single bit instead of sizeof(bool) bytes.
std::vector<bool> behaves similarly to std::vector, but in order to be space efficient, it:
&v[0] + n != &v[n]) std::vector<bool>::reference as a method of accessing individual bits. In particular, objects of this class are returned by operator[] by value. std::allocator_traits::construct to construct bit values. | Member type | Definition |
|---|---|
value_type | bool |
allocator_type | Allocator |
size_type | implementation-defined |
difference_type | implementation-defined |
| proxy class representing a reference to a single bool (class) |
|
const_reference | bool |
pointer | implementation-defined |
const_pointer | implementation-defined |
iterator | implementation-defined |
const_iterator | implementation-defined |
reverse_iterator | std::reverse_iterator<iterator> |
const_reverse_iterator | std::reverse_iterator<const_iterator> |
constructs the vector (public member function of std::vector<T,Allocator>) |
|
destructs the vector (public member function of std::vector<T,Allocator>) |
|
| assigns values to the container (public member function of std::vector<T,Allocator>) |
|
| assigns values to the container (public member function of std::vector<T,Allocator>) |
|
| returns the associated allocator (public member function of std::vector<T,Allocator>) |
|
Element access |
|
| access specified element with bounds checking (public member function of std::vector<T,Allocator>) |
|
| access specified element (public member function of std::vector<T,Allocator>) |
|
| access the first element (public member function of std::vector<T,Allocator>) |
|
| access the last element (public member function of std::vector<T,Allocator>) |
|
Iterators |
|
| returns an iterator to the beginning (public member function of std::vector<T,Allocator>) |
|
| returns an iterator to the end (public member function of std::vector<T,Allocator>) |
|
| returns a reverse iterator to the beginning (public member function of std::vector<T,Allocator>) |
|
| returns a reverse iterator to the end (public member function of std::vector<T,Allocator>) |
|
Capacity |
|
| checks whether the container is empty (public member function of std::vector<T,Allocator>) |
|
| returns the number of elements (public member function of std::vector<T,Allocator>) |
|
| returns the maximum possible number of elements (public member function of std::vector<T,Allocator>) |
|
| reserves storage (public member function of std::vector<T,Allocator>) |
|
| returns the number of elements that can be held in currently allocated storage (public member function of std::vector<T,Allocator>) |
|
Modifiers |
|
| clears the contents (public member function of std::vector<T,Allocator>) |
|
| inserts elements (public member function of std::vector<T,Allocator>) |
|
|
(C++14) | constructs element in-place (public member function of std::vector<T,Allocator>) |
| erases elements (public member function of std::vector<T,Allocator>) |
|
| adds an element to the end (public member function of std::vector<T,Allocator>) |
|
|
(C++14) | constructs elements in-place at the end (public member function of std::vector<T,Allocator>) |
| removes the last element (public member function of std::vector<T,Allocator>) |
|
| changes the number of elements stored (public member function of std::vector<T,Allocator>) |
|
| swaps the contents (public member function of std::vector<T,Allocator>) |
|
|
|
| flips all the bits (public member function) |
|
|
[static] | swaps two std::vector<bool>::references (public static member function) |
| lexicographically compares the values in the vector (function template) |
|
specializes the std::swap algorithm (function template) |
|
(C++11) | hash support for std::vector<bool> (class template specialization) |
If the size of the bitset is known at compile time, std::bitset may be used, which offers a richer set of member functions. In addition, boost::dynamic_bitset exists as an alternative to std::vector<bool>.
Since its representation may by optimized, std::vector<bool> does not necessarily meet all Container or SequenceContainer requirements. For example, because std::vector<bool>::iterator is implementation-defined, it may not satisfy the LegacyForwardIterator requirement. Use of algorithms such as std::search that require LegacyForwardIterators may result in either compile-time or run-time errors.
The Boost.Container version of vector does not specialize for bool.
© cppreference.com
Licensed under the Creative Commons Attribution-ShareAlike Unported License v3.0.
http://en.cppreference.com/w/cpp/container/vector_bool