A SortedSet is a set that holds values in order. Any primitive value (and objects that implement Comparable or Ordered interfaces) can be used as values.
SortedSet
V
Creates a new SortedSet object.
Optional
Initialize the set with entries.
The compare function to sort keys.
compare
Returns the total number of elements in the set.
Inserts a new value in order in the Set, if the value doesn't exist.
Set
Returns the Set object.
Removes all values in the set.
Returns true if the value exists.
true
value
true if value is found, otherwise false.
false
Removes the value from the set and returns true if the value was found and removed.
true if the value was found and removed.
Check if there are no values in the set.
true if is empty.
Returns the largest value in the set.
Returns the smallest value in the set.
Returns a new iterator of all values in-order.
Generated using TypeDoc
A
SortedSetis a set that holds values in order. Any primitive value (and objects that implement Comparable or Ordered interfaces) can be used as values.See
Template
V