|
Boost : |
From: Chuck Allison (cda_at_[hidden])
Date: 2002-06-03 17:43:38
That would be much appreciated. Maybe that will solve the Borland problem
too (although the error message does not directly suggest that it would).
Thanks.
----- Original Message -----
From: "Giovanni Bajo" <giovannibajo_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Monday, June 03, 2002 3:42 PM
Subject: Re: [boost] Dynamic Bitset - Upcoming Formal Review
>
----------------------------------------------------------------------------
---- > Attached there is a patch to fix some standard compliance issues (mainly, > two missing 'typename' keywords, and a lot of lookup errors due to a base > class being a template). All the tests/examples work fine on Comeau 4.3 with > this patch. As for VC7, the main problem appears to be out-of-class > definitions of member templates, which are not supported. Moving the > definitions within the class definition should help a lot. Let me know if > you want me to do that, I'm quite interested in this library. > > Giovanni Bajo > > ----- Original Message ----- > From: "Mat Marcus" <mmarcus_at_[hidden]> > To: <boost_at_[hidden]>; <boost-users_at_[hidden]>; > <boost-announce_at_[hidden]> > Sent: Monday, June 03, 2002 4:09 PM > Subject: [boost] Dynamic Bitset - Upcoming Formal Review > > > > 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. > > > > > > > > > > > > _______________________________________________ > > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost > ---------------------------------------------------------------------------- ---- > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost >
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk