- Boost-announce - lists.preview.boost.org

Dynamic Bitset formal review results
by Mat Marcus 18 Jun '02

18 Jun '02

The formal review period for the Dynamic Bitset library by Jeremy Siek and Chuck Alison is now complete. The review ran from June 8th through June 17th. After some improvements to the documentation the reviewers achieved consensus to accept the library. Actually, there was a single "no" vote, but it was without technical basis. Thanks to all the pople who took the time to participate in the review. Thanks also goes out to the authors, who responded efficiently to the major issues raised. I believe that the major technical comments/concerns were resolved by the authors during the review. Please speak up if I missed something. Remaining suggestions: The group strongly urges the a name change, with several people suggesting dynamic_bitset. Several people suggest removing the truth tables from the documentation. Future consideration: There were several requests for iterators, especially if the standard provides finer granularity iterators in the future. Thanks again to all involved. And thanks to Dave Abrahams for the fine Cuban cigars ;-) - Mat

1 0

Dynamic Bitset formal review - half way point
by Mat Marcus 14 Jun '02

14 Jun '02

Reminder - We have just past the half way point for the formal review of dynamic bitset. So far we have: 1 formal yes vote 1 formal no vote Discussion regarding iterators for dynamic bitset and comparison to vector<bool>. Some minor corrections and updates. I would like to see more formal reviews (including a yes or no vote) before the review period ends on the 17th. Thanks, Mat ##### > The formal review of Dynamic Bitset by Chuck Alison and > Jeremy Siek will commence today Saturday June 8th and run > through Monday, June 17th. > > The library is currently available at > <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> > > > Below is an excerpt from the library's documentation: > > The dyn_bitset class represents a set of bits. It provides > accesses to the value of individual bits via an operator[] > and provides all of the bitwise operators that one can > apply to builtin integers, such as operator&& and > operator<<. The number of bits in the set is specified at > runtime via a parameter to the constructor of the > dyn_bitset. > > Each bit represents either the Boolean value true (set) or > false (reset). To toggle a bit is to change the value to > true if it is false and to false if it is true. Each bit > has a non-negative position pos. The position pos == 0 > corresponds to the least significant bit and pos == size() > - 1 is the most significant bit. When converting an > instance of dyn_bitset to or from an unsigned long, the > bit position pos corresponds to the bit value 1 << pos. > > The dyn_bitset class is nearly identical to the > std::bitset class. The difference is that the size of the > dyn_bitset (the number of bits) is specified at run-time > during the construction of a dyn_bitset object, whereas > the size of a std::bitset is specified at compile-time > through an integer template parameter. > > > For information about submitting a Formal Review, see > http://www.boost.org/more/formal_review_process.htm > > Please try out the library and comment during the review > period. Be sure to say whether or not you think the library > should be accepted by Boost. > > Compiler notes: This library has been tested using the > following compiler platforms: > > Gcc 2.95 and 3.01 > Kai C++ > Metrowerks Codewarrior 8 (beta, Mac) > Visual C++ 7.0 > Comeau > > The library presently requires template friend support and is > known not to compile with CodeWarrior 7.2 or Visual C++ 6.0. > > The library has not been tested with Borland. > > > The Formal Review manager is Mat Marcus. > > > > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost-announce

1 0

Dynamic Bitset Formal Review June 8-17
by Mat Marcus 08 Jun '02

08 Jun '02

The formal review of Dynamic Bitset by Chuck Alison and Jeremy Siek will commence today Saturday June 8th and run through Monday, June 17th. The library is currently available at <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> Below is an excerpt from the library's documentation: The dyn_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator&& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dyn_bitset. Each bit represents either the Boolean value true (set) or false (reset). To toggle a bit is to change the value to true if it is false and to false if it is true. Each bit has a non-negative position pos. The position pos == 0 corresponds to the least significant bit and pos == size() - 1 is the most significant bit. When converting an instance of dyn_bitset to or from an unsigned long, the bit position pos corresponds to the bit value 1 << pos. The dyn_bitset class is nearly identical to the std::bitset class. The difference is that the size of the dyn_bitset (the number of bits) is specified at run-time during the construction of a dyn_bitset object, whereas the size of a std::bitset is specified at compile-time through an integer template parameter. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm Please try out the library and comment during the review period. Be sure to say whether or not you think the library should be accepted by Boost. Compiler notes: This library has been tested using the following compiler platforms: Gcc 2.95 and 3.01 Kai C++ Metrowerks Codewarrior 8 (beta, Mac) Visual C++ 7.0 Comeau The library presently requires template friend support and is known not to compile with CodeWarrior 7.2 or Visual C++ 6.0. The library has not been tested with Borland. The Formal Review manager is Mat Marcus.

1 0

Dynamic Bitset - Upcoming Formal Review
by Mat Marcus 03 Jun '02

03 Jun '02

The formal review of Dynamic Bitset by Chuck Alison and Jeremy Siek will commence on Saturday June 8th and run through Monday, June 17th. The library is currently available at <http://groups.yahoo.com/group/boost/files/dyn_bitset.tar.gz> Below is an excerpt from the library's documentation: The dyn_bitset class represents a set of bits. It provides accesses to the value of individual bits via an operator[] and provides all of the bitwise operators that one can apply to builtin integers, such as operator&& and operator<<. The number of bits in the set is specified at runtime via a parameter to the constructor of the dyn_bitset. Each bit represents either the Boolean value true (set) or false (reset). To toggle a bit is to change the value to true if it is false and to false if it is true. Each bit has a non-negative position pos. The position pos == 0 corresponds to the least significant bit and pos == size() - 1 is the most significant bit. When converting an instance of dyn_bitset to or from an unsigned long, the bit position pos corresponds to the bit value 1 << pos. The dyn_bitset class is nearly identical to the std::bitset class. The difference is that the size of the dyn_bitset (the number of bits) is specified at run-time during the construction of a dyn_bitset object, whereas the size of a std::bitset is specified at compile-time through an integer template parameter. For information about submitting a Formal Review, see http://www.boost.org/more/formal_review_process.htm Please try out the library so that you will be prepared to to say whether or not you think the library should be accepted by Boost during the upcoming review period next week Compiler notes: This library has been tested using the following compiler platforms: Gcc 2.95 and 3.01 Kai C++ Metrowerks Codewarrior 8 (beta, Mac) The library presently requires template friend support and therfore is known not to compile with CodeWarrior 7.2. The library has not been tested with VC++ or Borland. The Formal Review manager will be Mat Marcus.

1 0