Name: diC59631 Date: 11/25/98


A very efficient method for doing a bitwise
complement of a BitSet could be implemented,
and would certainly be useful in certain
situations.
Actually, in the evaluation of Bug #4143252, this
idea is mentioned as "mak[ing] no sense". This
is clearly untrue, as the BitSet is a logical
entity, and as such should sensibly implement
any and every logical operation, most especially
basic ones such as 'not', 'and', and 'or'. ('and'
and 'or' are, of course, already implemented, as
is an 'andNot' operation, giving more support
to this RFE).
(Review ID: 43405)
======================================================================