Optimization hints controlling the growth of the underlying scala.collection.mutable.Array.
(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.
For isArray == true
, the current capacity of the internal array else 0.
For isArray == true
, the current capacity of the internal array else 0.
Compacts the current representation depending on ArraySet.Hints.compactUpToUsed.
Compacts the current representation depending on ArraySet.Hints.compactUpToUsed.
Optimization hints controlling the growth of the underlying scala.collection.mutable.Array.
Optimization hints controlling the growth of the underlying scala.collection.mutable.Array.
Whether the internal representation is currently based on Array
.
Whether the internal representation is currently based on Array
.
(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.
Sorts this ArraaySet
according to the Ordering which results from transforming
an implicitly given Ordering with a transformation function in place.
Sorts this ArraaySet
according to the Ordering which results from transforming
an implicitly given Ordering with a transformation function in place.
scala.collection.SeqLike
Sorts this ArraaySet
according to a comparison function in place.
Sorts this ArraaySet
according to a comparison function in place.
scala.collection.SeqLike
Sorts this ArraaySet
according to an Ordering in place.
Sorts this ArraaySet
according to an Ordering in place.
scala.collection.SeqLike
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
A basic ArraySet implementation suitable for efficient add operations. Element removal could be optimized by another implementation.