diff --git a/dynamic_bitset.html b/dynamic_bitset.html index a73cd2a..82d0b08 100644 --- a/dynamic_bitset.html +++ b/dynamic_bitset.html @@ -91,7 +91,7 @@ constructor of the dynamic_bitset.

The dynamic_bitset class is nearly identical to the std::bitset +"https://boost.org/sgi/stl/bitset.html">std::bitset class. The difference is that the size of the dynamic_bitset (the number of bits) is specified at run-time during the construction of a dynamic_bitset @@ -340,7 +340,7 @@ input/output and some bitwise operations).

Rationale

dynamic_bitset is not a Container and +"https://boost.org/sgi/stl/Container.html">Container and does not provide iterators for the following reason:

@@ -355,7 +355,7 @@ people try to use iterators from std::vector<bool> with a Standard algorithm such as std::search. The std::search requirements say that the iterator must be a Forward +"https://boost.org/sgi/stl/ForwardIterator.html">Forward Iterator, but the std::vector<bool>::iterator does not meet this requirement because of the proxy reference. Depending on the implementation, they may or not be a compile @@ -367,7 +367,7 @@ by not pretending to be a container.

Some people prefer the name "toggle" to "flip". The name "flip" was chosen because that is the name used in std::bitset. +"https://boost.org/sgi/stl/bitset.html">std::bitset. In fact, most of the function names for dynamic_bitset were chosen for this reason.

@@ -409,13 +409,13 @@ in the header

Concepts Modeled

Assignable, Assignable, Default +"https://boost.org/sgi/stl/DefaultConstructible.html">Default Constructible, Equality +"https://boost.org/sgi/stl/EqualityComparable.html">Equality Comparable, LessThan +"https://boost.org/sgi/stl/LessThanComparable.html">LessThan Comparable.

Type requirements

@@ -581,7 +581,7 @@ operations such as resize to allocate memory.
(std::bad_alloc if Allocator=std::allocator).
(Required by Default +"https://boost.org/sgi/stl/DefaultConstructible.html">Default Constructible.)
@@ -637,7 +637,7 @@ allocator in x.
(std::bad_alloc if Allocator=std::allocator).
(Required by Assignable.) +"https://boost.org/sgi/stl/Assignable.html">Assignable.) 
@@ -720,7 +720,7 @@ position (b * bits_per_block + i) in the bitset (where
 

 Requires: BlockInputIterator must be either an
 integral type or a model of Input
+    "https://boost.org/sgi/stl/InputIterator.html">Input
     Iterator whose value_type is the same type as
 Block.
 Throws: An allocation error if
 memory is exhausted (std::bad_alloc if
@@ -731,11 +731,11 @@ memory is exhausted (std::bad_alloc if
 template<typename Char, typename Traits, typename Alloc>
 explicit
 dynamic_bitset(const std::basic_string<Char,Traits,Alloc>& s,
+"https://boost.org/sgi/stl/basic_string.html">std::basic_string<Char,Traits,Alloc>& s,
                typename std::basic_string<CharT, Traits, Alloc>::size_type pos = 0,
                typename std::basic_string<CharT, Traits, Alloc>::size_type n = std::basic_string<Char,Traits,Alloc>::npos,
+"https://boost.org/sgi/stl/basic_string.html">std::basic_string<Char,Traits,Alloc>::npos,
                const Allocator& alloc = Allocator())
@@ -794,7 +794,7 @@ dynamic_bitset& Returns: *this.
Throws: nothing.
(Required by Assignable.) +"https://boost.org/sgi/stl/Assignable.html">Assignable.) 
@@ -897,7 +897,7 @@ for (; first != last; ++first)
 
 Requires: The BlockInputIterator type must be a
 model of Input
+"https://boost.org/sgi/stl/InputIterator.html">Input
 Iterator and the value_type must be the same type as
 Block.

  Throws: An allocation error if memory is exhausted
@@ -1360,7 +1360,7 @@ rhs.size() and if for all i in the range
 returns false.

  Throws: nothing.

  (Required by Equality
+"https://boost.org/sgi/stl/EqualityComparable.html">Equality
 Comparable.)
 
 

@@ -1372,7 +1372,7 @@ bool Returns: !((*this) == rhs)

 Throws: nothing.

 (Required by Equality
+"https://boost.org/sgi/stl/EqualityComparable.html">Equality
 Comparable.)
 
 

@@ -1384,11 +1384,11 @@ bool Returns: true if this bitset is lexicographically
 less than rhs, and returns false otherwise.
 (See the description of lexicographical_compare
+"https://boost.org/sgi/stl/lexicographical_compare.html">lexicographical_compare
 for a definition of lexicographic ordering). 

 Throws: nothing.

 (Required by Less Than
+"https://boost.org/sgi/stl/LessThanComparable.html">Less Than
 Comparable.)
 
 

@@ -1401,7 +1401,7 @@ bool 

 Throws: nothing.

 (Required by Less Than
+"https://boost.org/sgi/stl/LessThanComparable.html">Less Than
 Comparable.)
 
 

@@ -1413,7 +1413,7 @@ bool Returns: (*this) < rhs || (*this) == rhs

 Throws: nothing.

 (Required by Less Than
+"https://boost.org/sgi/stl/LessThanComparable.html">Less Than
 Comparable.)
 
 

@@ -1425,7 +1425,7 @@ bool Returns: (*this) > rhs || (*this) == rhs

 Throws: nothing.

 (Required by Less Than
+"https://boost.org/sgi/stl/LessThanComparable.html">Less Than
 Comparable.)
 
 

@@ -1485,7 +1485,7 @@ template <typename CharT, typename Alloc>
 void to_string(const dynamic_bitset<Block, Allocator>& b,
                std::basic_string<Char,Traits,Alloc>& s)
+"https://boost.org/sgi/stl/basic_string.html">std::basic_string<Char,Traits,Alloc>& s)
Effects: Copies a representation of b into the @@ -1523,7 +1523,7 @@ block bval written, the bit (bval >> i) & + i) in the bitset.
Requires: The type BlockOutputIterator must be a model of Output +"https://boost.org/sgi/stl/OutputIterator.html">Output Iterator and its value_type must be the same type as Block. Further, the size of the output range must be greater or equal b.num_blocks(). @@ -1539,7 +1539,7 @@ void Effects: Reads blocks from the iterator range into the bitset.
Requires: The type BlockIterator must be a model -of Input +of Input Iterator and its value_type must be the same type as Block. The size of the iterator range must be less or equal to b.num_blocks(). @@ -1723,9 +1723,9 @@ nested class reference.

See also

std::bitset, +"https://boost.org/sgi/stl/bitset.html">std::bitset, std::vector, +"https://boost.org/sgi/stl/Vector.html">std::vector,

Acknowledgements