diff --git a/dynamic_bitset.html b/dynamic_bitset.html index f52e40b..fcf5849 100644 --- a/dynamic_bitset.html +++ b/dynamic_bitset.html @@ -145,7 +145,7 @@ public: typedef Block block_type; typedef Allocator allocator_type; typedef implementation-defined size_type; - + static const int bits_per_block = implementation-defined; static const size_type Throws: An allocation error if n > capacity() and memory is exhausted (std::bad_alloc if -Allocator=std::allocator). +Allocator=std::allocator). 
@@ -1576,12 +1576,12 @@ precise specification, given in terms of "as if" rule: first, for each
 valid position i into the bitset b let's put:
 
  character_of(b[i)]) = b[i]? os.widen('1') : os.widen('0');
- 
+
 Let also s be a std::basic_string<Char, Traits>
 object, having length b.size() and such as, for each i
 in [0, b.size()),
 
- s[i] is character_of(b[i]) 
+ s[i] is character_of(b[i])
 
 Then, the output, the effects on os and the exception behavior
 is the same as outputting the object s to os (same
@@ -1625,7 +1625,7 @@ that is a bitset digit the corresponding bit value is
 appended to the less significant end of b (appending may throw - gps ).
 If is.width() is greater than zero and smaller than b.max_size()
 then the maximum number n of bits appended is is.width();
-otherwise n = b.max_size(). 
+otherwise n = b.max_size().
 
 Unless the extractor is exited via an exception, characters are extracted (and
 corresponding bits appended) until any of the following occurs:

@@ -1714,7 +1714,7 @@ applied to their corresponding dynamic_bitsets.
 General improvements
 


 Several optimizations to member and non-member functions and to the
-nested class reference. 
+nested class reference.
 
 

 
See also