add docs

Author: WadeGao

dynamic_bitset.html

@@ -240,6 +240,29 @@ <h3><a id ="synopsis">Synopsis</a></h3>
     size_type <a href="#find_first">find_first</a>() const;
     size_type <a href="#find_next">find_next</a>(size_type pos) const;
 
+    iterator <a href="#begin">begin</a>();
+    const iterator <a href="#begin">begin</a>() const;
+
+    const_iterator <a href="#cbegin">cbegin</a>();
+    const const_iterator <a href="#cbegin">cbegin</a>() const;
+
+    iterator <a href="#end">end</a>();
+    const iterator <a href="#end">end</a>() const;
+
+    const_iterator <a href="#cend">cend</a>();
+    const const_iterator <a href="#cend">cend</a>() const;
+    
+    reverse_iterator <a href="#rbegin">rbegin</a>();
+    const reverse_iterator <a href="#rbegin">rbegin</a>() const;
+
+    const_reverse_iterator <a href="#crbegin">crbegin</a>();
+    const const_reverse_iterator <a href="#crbegin">crbegin</a>() const;
+    
+    reverse_iterator <a href="#rend">rend</a>();
+    const reverse_iterator <a href="#rend">rend</a>() const;
+
+    const_reverse_iterator <a href="#crend">crend</a>();
+    const const_reverse_iterator <a href="#rend">rend</a>() const;
 };
 
 
@@ -553,6 +576,26 @@ <h3><a id="nested-type-names">Nested type names</a></h3>
 </pre>
 The same type as <tt>Allocator</tt>.
 
+<pre>
+<a id="iterator">dynamic_bitset::iterator</a>
+</pre>
+Return a random access iterator to reference.
+
+<pre>
+<a id="reverse_iterator">dynamic_bitset::reverse_iterator</a>
+</pre>
+Return boost::reverse_iterator&lt;iterator&gt;.
+
+<pre>
+<a id="const_iterator">dynamic_bitset::const_iterator</a>
+</pre>
+Return a random access iterator to const_reference.
+
+<pre>
+<a id="const_reverse_iterator">dynamic_bitset::const_reverse_iterator</a>
+</pre>
+Return boost::reverse_iterator&lt;const_iterator&gt;.
+
 
 <hr />
 <h3><a id="public-data-members">Public data members</a></h3>
@@ -1382,6 +1425,67 @@ <h3><a id="member-functions">Member Functions</a></h3>
 <tt>pos</tt> such as bit <tt>i</tt> is set, or <tt>npos</tt> if
 no such index exists.
 
+<hr />
+<pre>
+iterator <a id="begin">begin</a>();
+</pre>
+
+<b>Returns:</b> an iterator pointing to the first element in the bitset. If 
+the bitset is empty, the returned iterator value shall not be dereferenced.
+
+<hr />
+<pre>
+iterator <a id="cbegin">cbegin</a>();
+</pre>
+
+<b>Returns:</b> the same as <a id="begin">begin</a>(), but read only on this bitset
+
+<hr />
+<pre>
+iterator <a id="end">end</a>();
+</pre>
+
+<b>Returns:</b> an iterator pointing to the last element in the bitset. 
+The returned iterator value shall not be dereferenced.
+
+<hr />
+<pre>
+iterator <a id="cend">cend</a>();
+</pre>
+
+<b>Returns:</b> the same as <a id="end">end</a>(), but read only on this bitset
+
+<hr />
+<pre>
+iterator <a id="rbegin">rbegin</a>();
+</pre>
+
+<b>Returns:</b> an reversed iterator pointing to the last element in the bitset.
+The returned reversed iterator value shall not be dereferenced.
+
+<hr />
+<pre>
+iterator <a id="rend">rend</a>();
+</pre>
+
+<b>Returns:</b> an reversed iterator pointing to the first element in the bitset.
+The returned reversed iterator value shall not be dereferenced.
+
+<hr />
+<pre>
+iterator <a id="crbegin">crbegin</a>();
+</pre>
+
+<b>Returns:</b> the same as <a id="rbegin">rbegin</a>(), but read only on this bitset
+
+<hr />
+<pre>
+iterator <a id="crend">crend</a>();
+</pre>
+
+<b>Returns:</b> the same as <a id="rend">rend</a>(), but read only on this bitset
+
+
 <hr />
 <pre>
 bool <a id=

include/boost/dynamic_bitset/dynamic_bitset.hpp

@@ -2167,6 +2167,7 @@ bool dynamic_bitset<Block, Allocator>::m_check_invariants() const
 
 }
 
+
 } // namespace boost
 
 #undef BOOST_BITSET_CHAR

include/boost/dynamic_bitset/dynamic_bitset_iterator.hpp

@@ -164,7 +164,7 @@ dbs_iterator<Container_t> dbs_iterator<Container_t>::operator--(int)
 
 template <typename Container_t>
 dbs_iterator<Container_t> dbs_iterator<Container_t>::operator+(
-    dbs_iterator<Container_t>::difference_type n) const
+    typename dbs_iterator<Container_t>::difference_type n) const
 {
   dbs_iterator<Container_t> temp(*this);
   temp += n;
@@ -173,15 +173,15 @@ dbs_iterator<Container_t> dbs_iterator<Container_t>::operator+(
 
 template <typename Container_t>
 dbs_iterator<Container_t>& dbs_iterator<Container_t>::operator+=(
-    dbs_iterator<Container_t>::difference_type n) 
+    typename dbs_iterator<Container_t>::difference_type n) 
 {
   m_pos += n;
   return *this;
 }
 
 template <typename Container_t>
 dbs_iterator<Container_t> dbs_iterator<Container_t>::operator-(
-    dbs_iterator<Container_t>::difference_type n) const
+    typename dbs_iterator<Container_t>::difference_type n) const
 {
   dbs_iterator<Container_t> temp(*this);
   temp -= n;
@@ -190,7 +190,7 @@ dbs_iterator<Container_t> dbs_iterator<Container_t>::operator-(
 
 template <typename Container_t>
 dbs_iterator<Container_t>& dbs_iterator<Container_t>::operator-=(
-    dbs_iterator<Container_t>::difference_type n)
+    typename dbs_iterator<Container_t>::difference_type n)
 {
   *this += -n;
   return *this;
@@ -272,4 +272,4 @@ operator-(const dbs_iterator<Container_t>& lhs,
 }
 
 } // namespace boost
-#endif // include guard
+#endif // include guard

test/bitset_test.hpp

@@ -15,7 +15,6 @@
 #define BOOST_BITSET_TEST_HPP_GP_20040319
 
 #include <boost/config.hpp>
-#include <cstddef>
 #if !defined (BOOST_NO_STD_LOCALE)
 # include <locale>
 #endif
@@ -25,7 +24,7 @@
 #include <string>    // for (basic_string and) getline()
 #include <algorithm> // for std::min
 #include <assert.h>  // <cassert> is sometimes macro-guarded :-(
-#include <numeric>   // std::accumulate
+#include <cstddef>   // std::ptrdiff_t 
 
 #include <boost/limits.hpp>
 #include <boost/dynamic_bitset/dynamic_bitset.hpp>
@@ -1516,6 +1515,7 @@ struct bitset_test {
             typename Bitset::iterator it = b.begin();
             for (std::size_t i = 0; i < b.size(); ++i) {
                 BOOST_TEST(*it == b[i]);
+                BOOST_TEST((*it).flip() == b[i]);
                 ++it;
             }
         }