Boost logo

Boost :

From: Jeremy Siek (jsiek_at_[hidden])
Date: 2001-03-09 13:38:52

So in std we have the static-length bitset which provides "set" operations
on bits, and we have a dynamic-length vector<bool> which provides
"container" operations on bits. But what about a dynamic-length class that
provides efficient "set" operations, or a static-length class that
provides "container" operations?

Anyone else ever felt the need for these capabilities? Has anyone
implemented such classes and would like to contribute them to boost?

My motivation for this comes from the BGL... the best graph isomorphism
algorithm (the C implementation is named "nauty") uses a dynamic-length
version of bitset implemented as an ugly set of macros.


 Jeremy Siek www:
 Ph.D. Candidate email: jsiek_at_[hidden]
 Univ. of Notre Dame work phone: (219) 631-3906

Boost list run by bdawes at, gregod at, cpdaniel at, john at