(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) +
creates a new set. Use +=
to add an element to this set and return that set itself.
(Changed in version 2.8.0) ++
creates a new set. Use ++=
to add elements to this set and return that set itself.
(Changed in version 2.8.0) -
creates a new set. Use -=
to remove an element from this set and return that set itself.
(Changed in version 2.8.0) -
creates a new set. Use -=
to remove an element from this set and return that set itself.
(Changed in version 2.8.0) --
creates a new set. Use --=
to remove elements from this set and return that set itself.
Array containing the internal words.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
Summary of the words each of which formatted as <index>:<bitCount>.
All bits of all words.
All bits of all words.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(Since version 2.11.0) Scripting is deprecated.
(Since version 2.11.6) If this BitSet contains a value that is 128 or greater, the result of this method is an 'immutable' BitSet that shares state with this mutable BitSet. Thus, if the mutable BitSet is modified, it will violate the immutability of the result.