Re: [boost] Re: discrete_set class

From: Victor A. Wagner, Jr. (vawjr_at_[hidden])
Date: 2002-08-28 11:39:30

At Tuesday 2002/08/27 13:48, you wrote:
><spamjunk_at_[hidden]> wrote in message
>news:200208271941.g7RJfqC19789_at_mailout6.nyroc.rr.com...
> > [...]
> > I get the impression that you think the class requires a "small" set of
> > elements,
>
>I think he means that the set elements are "small" in that they are
>integral types (as opposed to arbitrarily large elements, a la std::set).
>There seems to be a similarity to bitset.
>
> > [...]
> > I also get the impression that you think adding iterators to the class (a
> > project for later) would be ill-advised.  I would love to hear you
>thoughts
> > on this.
>
>I suspect the same issues for bitset iterators or vector<bool> iterators
>apply here.

agreed...tho a for_all(yourset, yourfunc);  would be a nice addition.
I would define that loose enough that a compiler for a massively parallel 
machine could do them in any order and maybe even all at once (invocations 
of yourfunc).

>Dave
>
>
>
>
>
>_______________________________________________
>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"