From: Victor A. Wagner, Jr. (vawjr_at_[hidden])
Date: 2002-08-28 11:45:11
if you have a completely compile time "set" with a universe of at most 256
elements, by all means provide it here... I'm sure we could figure out some
nifty things to do with it.
At Tuesday 2002/08/27 16:11, you wrote:
>----- Original Message -----
>From: "spamjunk" <spamjunk_at_[hidden]>
> > They aren't always known at compile-time. You can create sets dynamically
> > at run-time, using the constructor. What SetOf allows you to do is, if all
> > the elements are compile-time constants, create the entire set as a
> > compile-time constant. You could use the same argument for SetOf, but it
> > would still have to be "converted" to an actual set of bits before
> > interacting with other sets, so you wouldn't actually be saving anything.
>No, on the contrary, you can use expression templates to make static
>sets interact with each other. I have an implementation that can
>conceptually hold 256 elements, can do all the set operations (i.e
>negation, union, intersection, difference and xor). I was hoping your
>set would be like this.
>Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Victor A. Wagner Jr. http://rudbek.com
PGP RSA fingerprint = 4D20 EBF6 0101 B069 3817 8DBF C846 E47A
PGP D-H fingerprint = 98BC 65E3 1A19 43EC 3908 65B9 F755 E6F4 63BB 9D93
The five most dangerous words in the English language:
"There oughta be a law"
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk