>Next, what subset of the set-theory should be implemented. Obviously you >refer to the basic and / or / xor, but in real practice, the other operators >can be very useful. Chaining operators (especially with array-based-sets) >can be a performance nightmare. Unless you use bitwise operators on bit vectors! Which, on rare occasion, I have certainly used. It is unbelievably fast and unbelievably compact. I think that there are modules that do this sort of thing. The listwise union/intersection/symmetric difference code in the Ram uses hashes for all this, though. --tom
- RFC 179 (v1) More functions from set theory to manipul... Perl6 RFC Librarian
- Re: RFC 179 (v1) More functions from set theory t... Tom Christiansen
- Re: RFC 179 (v1) More functions from set theory t... Michael Maraist
- Re: RFC 179 (v1) More functions from set theo... Tom Christiansen
- Re: RFC 179 (v1) More functions from set theo... Gael Pegliasco
- Re: RFC 179 (v1) More functions from set ... Jeremy Howard
- Re: RFC 179 (v1) More functions from ... Gael Pegliasco
- Re: RFC 179 (v1) More functions ... Tom Christiansen
- Re: RFC 179 (v1) More functi... Tom Christiansen
- Re: RFC 179 (v1) More fu... Gael Pegliasco
- Re: RFC 179 (v1) More fu... Buddha Buck
- Re: RFC 179 (v1) More fu... John Porter
- Re: RFC 179 (v1) More fu... Tom Christiansen
- proto-RFC: keys(HASH) as... John Porter