Scaladoc for scala.collection.SortedSet

Inherits

SortedSetLike
Sorted
Set
SetLike
Subtractable
Addable
GenericSetTemplate
Iterable
IterableLike
Equals
Traversable
GenericTraversableTemplate
TraversableLike
HasNewBuilder
Function1
AnyRef
Any

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations

Value Members

def &(that: Set[A]): SortedSet[A]

Computes the intersection between this set and another set

Computes the intersection between this set and another set.

that
the set to intersect with.
returns
a new set consisting of all elements that are both in this set and in the given set that.

definition classes: SetLike
def &~(that: Set[A]): SortedSet[A]

The difference of this set and another set

The difference of this set and another set.

that
the set of elements to exclude.
returns
a set containing those elements of this set that are not also contained in the given set that.

definition classes: SetLike
def **(that: Set[A]): SortedSet[A]

This method is an alias for intersect

This method is an alias for intersect. It computes an intersection with set that. It removes all the elements that are not present in that.

that
the set to intersect with

definition classes: SetLike
def +(elem1: A, elem2: A, elems: A*): SortedSet[A]

Creates a new set with additional elements

Creates a new set with additional elements.
This method takes two or more elements to be added. Another overloaded variant of this method handles the case where a single element is added.

elem1
the first element to add.
elem2
the second element to add.
elems
the remaining elements to add.
returns
a new set with the given elements added.

definition classes: Addable
def +(elem: A): SortedSet[A]

Creates a new set with an additional element, unless the element is already present

Creates a new set with an additional element, unless the element is already present.

elem
the element to be added
returns
a new set that contains all elements of this set and that also contains elem.

attributes: abstract

definition classes: SetLike ⇐ Addable
def ++(iter: Iterator[A]): SortedSet[A]

Creates a new set by adding all elements produced by an iterator to this set

Creates a new set by adding all elements produced by an iterator to this set.

iter
the iterator producing the added elements.
returns
a new set with the given elements added.

definition classes: Addable
def ++(elems: Traversable[A]): SortedSet[A]

Creates a new set by adding all elements contained in another collection to this set

Creates a new set by adding all elements contained in another collection to this set.

elems
the collection containing the added elements.
returns
a new set with the given elements added.

definition classes: Addable
def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

Concatenates this set with the elements of an iterator

Concatenates this set with the elements of an iterator.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the iterator to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this set followed by all elements of that.

definition classes: TraversableLike
def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

Concatenates this set with the elements of a traversable collection

Concatenates this set with the elements of a traversable collection.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
that
the traversable to append.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That which contains all elements of this set followed by all elements of that.

definition classes: TraversableLike
def -(elem1: A, elem2: A, elems: A*): SortedSet[A]

Creates a new set from this set with some elements removed

Creates a new set from this set with some elements removed.
This method takes two or more elements to be removed. Another overloaded variant of this method handles the case where a single element is removed.

elem1
the first element to remove.
elem2
the second element to remove.
elems
the remaining elements to remove.
returns
a new set that contains all elements of the current set except one less occurrence of each of the given elements.

definition classes: Subtractable
def -(elem: A): SortedSet[A]

Creates a new set with a given element removed from this set

Creates a new set with a given element removed from this set.

elem
the element to be removed
returns
a new set that contains all elements of this set but that does not contain elem.

attributes: abstract

definition classes: SetLike ⇐ Subtractable
def --(iter: Iterator[A]): SortedSet[A]

Creates a new set from this set by removing all elements produced by an iterator

Creates a new set from this set by removing all elements produced by an iterator.

iter
the iterator producing the removed elements.
returns
a new set that contains all elements of the current set except one less occurrence of each of the elements produced by iter.

definition classes: Subtractable
def --(elems: Traversable[A]): SortedSet[A]

Creates a new set from this set by removing all elements of another collection

Creates a new set from this set by removing all elements of another collection.

elems
the collection containing the removed elements.
returns
a new set that contains all elements of the current set except one less occurrence of each of the elements of elems.

definition classes: Subtractable
def /:[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this set, going left to right

Applies a binary operator to a start value and all elements of this set, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this set$, going left to right with the start value z on the left: {{{ op(...op(op(z, x₁), x₂), ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: TraversableLike
def :\[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this set and a start value, going right to left

Applies a binary operator to all elements of this set and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value
op
the binary operator
returns
the result of inserting op between consecutive elements of this set$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: TraversableLike
def addString(b: StringBuilder): StringBuilder

Appends all elements of this set to a string builder

Appends all elements of this set to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this set without any separator string.

b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this set to a string builder using a separator string

Appends all elements of this set to a string builder using a separator string. The written text consists of the string representations (w.r.t. the method toString) of all elements of this set, separated by the string sep.

b
the string builder to which elements are appended.
sep
the separator string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all elements of this set to a string builder using start, end, and separator strings

Appends all elements of this set to a string builder using start, end, and separator strings. The written text begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

b
the string builder to which elements are appended.
start
the starting string.
sep
the separator string.
end
the ending string.
returns
the string builder b to which elements were appended.

definition classes: TraversableLike
def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

(f andThen g)(x) == g(f(x))

(f andThen g)(x) == g(f(x))

definition classes: Function1
def apply(elem: A): Boolean

Tests if some element is contained in this set

Tests if some element is contained in this set.
This method is equivalent to contains. It allows sets to be interpreted as predicates.

elem
the element to test for membership.
returns
true if elem is contained in this set, false otherwise.

definition classes: SetLike
def canEqual(that: Any): Boolean

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind

Method called from equality methods, so that user-defined subclasses can refuse to be equal to other collections of the same kind.

that
The object with which this set should be compared
returns
true, if this set can possibly equal that, false otherwise. The test takes into consideration only the run-time types of objects but ignores their elements.

definition classes: IterableLike ⇐ Equals
def companion: GenericCompanion[Set[A][A]]

The factory companion object that builds instances of class Set

The factory companion object that builds instances of class Set.

definition classes: Set ⇐ Iterable ⇐ Traversable ⇐ GenericTraversableTemplate
def compare(k0: A, k1: A): Int

Comparison function that orders keys

Comparison function that orders keys.

definition classes: Sorted
def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

(f compose g)(x) == f(g(x))

(f compose g)(x) == f(g(x))

definition classes: Function1
def contains(elem: A): Boolean

Tests if some element is contained in this set

Tests if some element is contained in this set.

elem
the element to test for membership.
returns
true if elem is contained in this set, false otherwise.

attributes: abstract

definition classes: SetLike
def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

Copies elements of this set to an array

Copies elements of this set to an array. Fills the given array xs with at most len elements of this set, starting at position start. Copying will stop once either the end of the current set is reached, or the end of the array is reached, or len elements have been copied.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.
len
the maximal number of elements to copy.

definition classes: IterableLike ⇐ TraversableLike
def copyToArray[B >: A](xs: Array[B]): Unit

Copies elements of this set to an array

Copies elements of this set to an array. Fills the given array xs with all elements of this set, starting at position 0. Copying will stop once either the end of the current set is reached, or the end of the array is reached.

B
the type of the elements of the array.
xs
the array to fill.

definition classes: TraversableLike
def copyToArray[B >: A](xs: Array[B], start: Int): Unit

Copies elements of this set to an array

Copies elements of this set to an array. Fills the given array xs with all elements of this set, starting at position start. Copying will stop once either the end of the current set is reached, or the end of the array is reached.

B
the type of the elements of the array.
xs
the array to fill.
start
the starting index.

definition classes: TraversableLike
def copyToBuffer[B >: A](dest: Buffer[B]): Unit

Copies all elements of this set to a buffer

Copies all elements of this set to a buffer.

dest
The buffer to which elements are copied.

definition classes: TraversableLike
def count(p: (A) ⇒ Boolean): Int

Counts the number of elements in the set which satisfy a predicate

Counts the number of elements in the set which satisfy a predicate.

p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

definition classes: TraversableLike
def diff(that: Set[A]): SortedSet[A]

Computes the difference of this set and another set

Computes the difference of this set and another set.

that
the set of elements to exclude.
returns
a set containing those elements of this set that are not also contained in the given set that.

definition classes: SetLike
def drop(n: Int): SortedSet[A]

Selects all elements except first n ones

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the number of elements to drop from this set.
returns
a set consisting of all elements of this set except the first n ones, or else the empty set, if this set has less than n elements.

definition classes: TraversableLike
def dropRight(n: Int): SortedSet[A]

Selects all elements except first n ones

Selects all elements except first n ones.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
The number of elements to take
returns
a set consisting of all elements of this set except the first n ones, or else the empty set, if this set has less than n elements.

definition classes: IterableLike
def dropWhile(p: (A) ⇒ Boolean): SortedSet[A]

Drops longest prefix of elements that satisfy a predicate

Drops longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
The predicate used to test elements.
returns
the longest suffix of this set whose first element does not satisfy the predicate p.

definition classes: TraversableLike
def elements: Iterator[A]
def empty: SortedSet[A]

Needs to be overridden in subclasses

Needs to be overridden in subclasses.
def equals(that: Any): Boolean

Compares this set with another object for equality

Compares this set with another object for equality.

that
the other object
returns
true if that is a set which contains the same elements as this set.

definition classes: SetLike ⇐ Equals ⇐ AnyRef ⇐ Any
def exists(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for some of the elements of this set

Tests whether a predicate holds for some of the elements of this set.

p
the predicate used to test elements.
returns
true if the given predicate p holds for some of the elements of this set, otherwise false.

definition classes: IterableLike ⇐ TraversableLike
def filter(p: (A) ⇒ Boolean): SortedSet[A]

Selects all elements of this set which satisfy a predicate

Selects all elements of this set which satisfy a predicate.

p
the predicate used to test elements.
returns
a new set consisting of all elements of this set that satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike
def filterNot(p: (A) ⇒ Boolean): SortedSet[A]

Selects all elements of this set which do not satisfy a predicate

Selects all elements of this set which do not satisfy a predicate.

p
the predicate used to test elements.
returns
a new set consisting of all elements of this set that do not satisfy the given predicate p. The order of the elements is preserved.

definition classes: TraversableLike
def find(p: (A) ⇒ Boolean): Option[A]

Finds the first element of the set satisfying a predicate, if any

Finds the first element of the set satisfying a predicate, if any.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the predicate used to test elements.
returns
an option value containing the first element in the set that satisfies p, or None if none exists.

definition classes: IterableLike ⇐ TraversableLike
def first: A
def firstKey: A

Returns the first key of the collection

Returns the first key of the collection.

definition classes: SortedSetLike ⇐ Sorted
def firstOption: Option[A]

None if iterable is empty

None if iterable is empty.

definition classes: IterableLike
def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

Builds a new collection by applying a function to all elements of this set and concatenating the results

Builds a new collection by applying a function to all elements of this set and concatenating the results.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given collection-valued function f to each element of this set and concatenating the results.

definition classes: TraversableLike
def flatten[B](asTraversable: (A) ⇒ Traversable[B]): Set[B]

Converts this set of traversable collections into a set in which all element collections are concatenated

Converts this set of traversable collections into a set in which all element collections are concatenated.

B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this set is a Traversable.
returns
a new set resulting from concatenating all element sets.

definition classes: GenericTraversableTemplate
def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

Applies a binary operator to a start value and all elements of this set, going left to right

Applies a binary operator to a start value and all elements of this set, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this set$, going left to right with the start value z on the left: {{{ op(...op(z, x₁), x₂, ..., x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: TraversableLike
def foldRight[B](z: B)(op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this set and a start value, going right to left

Applies a binary operator to all elements of this set and a start value, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
z
the start value.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this set$, going right to left with the start value z on the right: {{{ op(x₁, op(x₂, ... op(x_n, z)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: IterableLike ⇐ TraversableLike
def forall(p: (A) ⇒ Boolean): Boolean

Tests whether a predicate holds for all elements of this set

Tests whether a predicate holds for all elements of this set.

p
the predicate used to test elements.
returns
true if the given predicate p holds for all elements of this set, otherwise false.

definition classes: IterableLike ⇐ TraversableLike
def foreach[U](f: (A) ⇒ U): Unit

Applies a function f to all elements of this set

Applies a function f to all elements of this set.
Note: this method underlies the implementation of most other bulk operations. Subclasses should re-implement this method if a more efficient implementation exists.

U
the type parameter describing the result of function f. This result will always be ignored. Typically U is Unit, but this is not necessary.
f
the function that is applied for its side-effect to every element. The result of function f is discarded.

definition classes: IterableLike ⇐ TraversableLike
def from(from: A): SortedSet[A]

Creates a ranged projection of this collection with no upper-bound

Creates a ranged projection of this collection with no upper-bound.

from
The lower-bound (inclusive) of the ranged projection.

definition classes: SortedSetLike ⇐ Sorted
def genericBuilder[B]: Builder[B, Set[B]]

The generic builder that builds instances of Set at arbitrary element types

The generic builder that builds instances of Set at arbitrary element types.

definition classes: GenericTraversableTemplate
def groupBy[K](f: (A) ⇒ K): Map[K, SortedSet[A]]

Partitions this set into a map of sets according to some discriminator function

Partitions this set into a map of sets according to some discriminator function.
Note: this method is not re-implemented by views. This means when applied to a view it will always force the view and return a new set.

K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to sets such that the following invariant holds: {{{ (xs partition f)(k) = xs filter (x => f(x) == k) }}} That is, every key k is bound to a set of those elements x for which f(x) equals k.

definition classes: TraversableLike
def hasDefiniteSize: Boolean

Tests whether this set is known to have a finite size

Tests whether this set is known to have a finite size. All strict collections are known to have finite size. For a non-strict collection such as Stream, the predicate returns true if all elements have been computed. It returns false if the stream is not yet evaluated to the end.
Note: many collection methods will not work on collections of infinite sizes.

definition classes: TraversableLike
def hashCode(): Int

Returns a hash code value for the object

Returns a hash code value for the object.
The default hashing algorithm is platform dependent.
Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

definition classes: SetLike ⇐ AnyRef ⇐ Any
def head: A

Selects the first element of this set

Selects the first element of this set.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: IterableLike ⇐ TraversableLike
def headOption: Option[A]

Optionally selects the first element

Optionally selects the first element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def init: SortedSet[A]

Selects all elements except the last

Selects all elements except the last.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def intersect(that: Set[A]): SortedSet[A]

Computes the intersection between this set and another set

Computes the intersection between this set and another set.

that
the set to intersect with.
returns
a new set consisting of all elements that are both in this set and in the given set that.

definition classes: SetLike
def isEmpty: Boolean

Tests if this set is empty

Tests if this set is empty.

definition classes: SetLike ⇐ IterableLike ⇐ TraversableLike
def iterator: Iterator[A]

Creates a new iterator over all elements contained in this iterable object

Creates a new iterator over all elements contained in this iterable object.

attributes: abstract

definition classes: IterableLike
def keySet: SortedSet[A]

return as a projection the set of keys in this collection

return as a projection the set of keys in this collection

definition classes: SortedSetLike ⇐ Sorted
def last: A

Selects the last element

Selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def lastKey: A

Returns the last key of the collection

Returns the last key of the collection.

definition classes: SortedSetLike ⇐ Sorted
def lastOption: Option[A]

Optionally selects the last element

Optionally selects the last element.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[SortedSet[A], B, That]): That

Builds a new collection by applying a function to all elements of this set

Builds a new collection by applying a function to all elements of this set.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
f
the function to apply to each element.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the given function f to each element of this set and collecting the results.

definition classes: TraversableLike
def max[B >: A](cmp: Ordering[B]): A

Finds the largest element

Finds the largest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the largest element of this set with respect to the ordering cmp.

definition classes: TraversableLike
def min[B >: A](cmp: Ordering[B]): A

Finds the smallest element

Finds the smallest element.

B
The type over which the ordering is defined.
cmp
An ordering to be used for comparing elements.
returns
the smallest element of this set with respect to the ordering cmp.

definition classes: TraversableLike
def mkString: String

Displays all elements of this set in a string

Displays all elements of this set in a string.

definition classes: TraversableLike
def mkString(sep: String): String

Displays all elements of this set in a string using a separator string

Displays all elements of this set in a string using a separator string.

sep
the separator string.
returns
a string representation of this set. In the resulting string the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

definition classes: TraversableLike
def mkString(start: String, sep: String, end: String): String

Displays all elements of this set in a string using start, end, and separator strings

Displays all elements of this set in a string using start, end, and separator strings.

start
the starting string.
sep
the separator string.
end
the ending string.
returns
a string representation of this set. The resulting string begins with the string start and ends with the string end. Inside, the string representations (w.r.t. the method toString) of all elements of this set are separated by the string sep.

definition classes: TraversableLike
def nonEmpty: Boolean

Tests whether the set is not empty

Tests whether the set is not empty.

definition classes: TraversableLike
def ordering: Ordering[A]
def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

Builds a new collection by applying a partial function to all elements of this set on which the function is defined

Builds a new collection by applying a partial function to all elements of this set on which the function is defined.

B
the element type of the returned collection.
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type B being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, B, That] is found.
pf
the partial function which filters and maps the set.
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and and the new element type B.
returns
a new collection of type That resulting from applying the partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

definition classes: TraversableLike
def partition(p: (A) ⇒ Boolean): (SortedSet[A], SortedSet[A])

Partitions this set in two sets according to a predicate

Partitions this set in two sets according to a predicate.

p
the predicate on which to partition.
returns
a pair of sets: the first set consists of all elements that satisfy the predicate p and the second set consists of all elements that don't. The relative order of the elements in the resulting sets is the same as in the original set.

definition classes: TraversableLike
def product[B >: A](num: Numeric[B]): B

Multiplies up the elements of this collection

Multiplies up the elements of this collection.

B
the result type of the * operator.
num
an implicit parameter defining a set of numeric operations which includes the * operator to be used in forming the product.
returns
the product of all elements of this set with respect to the * operator in num.

definition classes: TraversableLike
def projection: IterableView[A, SortedSet[A]]

returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection

returns a projection that can be used to call non-strict filter,map, and flatMap methods that build projections of the collection.

definition classes: IterableLike
def range(from: A, until: A): SortedSet[A]

Creates a ranged projection of this collection with both a lower-bound and an upper-bound

Creates a ranged projection of this collection with both a lower-bound and an upper-bound.

from
The upper-bound (exclusive) of the ranged projection.
until
...
returns
...

definition classes: SortedSetLike ⇐ Sorted
def rangeImpl(from: Option[A], until: Option[A]): SortedSet[A]

Creates a ranged projection of this collection

Creates a ranged projection of this collection. Any mutations in the ranged projection will update this collection and vice versa. Note: keys are not garuanteed to be consistent between this collection and the projection. This is the case for buffers where indexing is relative to the projection.

from
The lower-bound (inclusive) of the ranged projection. None if there is no lower bound.
until
The upper-bound (exclusive) of the ranged projection. None if there is no upper bound.

attributes: abstract

definition classes: SortedSetLike ⇐ Sorted
def reduceLeft[B >: A](op: (B, A) ⇒ B): B

Applies a binary operator to all elements of this set, going left to right

Applies a binary operator to all elements of this set, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this set$, going left to right: {{{ op(...(op(x₁, x₂), ... ) , x_n) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: TraversableLike
def reduceLeftOption[B >: A](op: (B, A) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this set, going left to right

Optionally applies a binary operator to all elements of this set, going left to right.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this set is nonempty, None otherwise.

definition classes: TraversableLike
def reduceRight[B >: A](op: (A, B) ⇒ B): B

Applies a binary operator to all elements of this set, going right to left

Applies a binary operator to all elements of this set, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this set$, going right to left: {{{ op(x₁, op(x₂, ..., op(x_n-1, x_n)...)) }}} where x,,1,,, ..., x,,n,, are the elements of this set.

definition classes: IterableLike ⇐ TraversableLike
def reduceRightOption[B >: A](op: (A, B) ⇒ B): Option[B]

Optionally applies a binary operator to all elements of this set, going right to left

Optionally applies a binary operator to all elements of this set, going right to left.
Note: might return different results for different runs, unless the underlying collection type is ordered. or the operator is associative and commutative.

B
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this set is nonempty, None otherwise.

definition classes: TraversableLike
def repr: SortedSet[A]

The collection of type set underlying this TraversableLike object

The collection of type set underlying this TraversableLike object. By default this is implemented as the TraversableLike object itself, but this can be overridden.

definition classes: TraversableLike
def sameElements[B >: A](that: Iterable[B]): Boolean

Checks if the other iterable collection contains the same elements in the same order as this set

Checks if the other iterable collection contains the same elements in the same order as this set.
Note: might return different results for different runs, unless the underlying collection type is ordered.

B
the type of the elements of collection that.
that
the collection to compare with.
returns
true, if both collections contain the same elements in the same order, false otherwise.

definition classes: IterableLike
def size: Int

The size of this set

The size of this set.

definition classes: TraversableLike
def slice(from: Int, until: Int): SortedSet[A]

Selects an interval of elements

Selects an interval of elements.
Note: c.slice(from, to) is equivalent to (but possibly more efficient than) c.drop(from).take(to - from)
Note: might return different results for different runs, unless the underlying collection type is ordered.

from
the index of the first returned element in this set.
until
the index one past the last returned element in this set.
returns
a set containing the elements starting at index from and extending up to (but not including) index until of this set.

definition classes: IterableLike ⇐ TraversableLike
def span(p: (A) ⇒ Boolean): (SortedSet[A], SortedSet[A])

Spits this set into a prefix/suffix pair according to a predicate

Spits this set into a prefix/suffix pair according to a predicate.
Note: c span p is equivalent to (but possibly more efficient than) (c takeWhile p, c dropWhile p), provided the evaluation of the predicate p does not cause any side-effects.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the test predicate
returns
a pair consisting of the longest prefix of this set whose elements all satisfy p, and the rest of this set.

definition classes: TraversableLike
def splitAt(n: Int): (SortedSet[A], SortedSet[A])

Splits this set into two at a given position

Splits this set into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the position at which to split.
returns
a pair of sets consisting of the first n elements of this set, and the other elements.

definition classes: TraversableLike
def stringPrefix: String

Defines the prefix of this object's toString representation

Defines the prefix of this object's toString representation.

definition classes: SetLike ⇐ TraversableLike
def subsetOf(that: Set[A]): Boolean

Tests whether this set is a subset of another set

Tests whether this set is a subset of another set.

that
the set to test.
returns
true if this set is a subset of that, i.e. if every element of this set is also an element of that.

definition classes: SortedSetLike ⇐ SetLike
def sum[B >: A](num: Numeric[B]): B

Sums up the elements of this collection

Sums up the elements of this collection.

B
the result type of the + operator.
num
an implicit parameter defining a set of numeric operations which includes the + operator to be used in forming the sum.
returns
the sum of all elements of this set with respect to the + operator in num.

definition classes: TraversableLike
def tail: SortedSet[A]

Selects all elements except the first

Selects all elements except the first.
Note: might return different results for different runs, unless the underlying collection type is ordered.

definition classes: TraversableLike
def take(n: Int): SortedSet[A]

Selects first n elements

Selects first n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
Tt number of elements to take from this set.
returns
a set consisting only of the first n elements of this set, or else the whole set, if it has less than n elements.

definition classes: IterableLike ⇐ TraversableLike
def takeRight(n: Int): SortedSet[A]

Selects last n elements

Selects last n elements.
Note: might return different results for different runs, unless the underlying collection type is ordered.

n
the number of elements to take
returns
a set consisting only of the last n elements of this set, or else the whole set, if it has less than n elements.

definition classes: IterableLike
def takeWhile(p: (A) ⇒ Boolean): SortedSet[A]

Takes longest prefix of elements that satisfy a predicate

Takes longest prefix of elements that satisfy a predicate.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
The predicate used to test elements.
returns
the longest prefix of this set whose elements all satisfy the predicate p.

definition classes: IterableLike ⇐ TraversableLike
def to(to: A): SortedSet[A]

Create a range projection of this collection with no lower-bound

Create a range projection of this collection with no lower-bound.

to
The upper-bound (inclusive) of the ranged projection.

definition classes: Sorted
def toArray[B >: A](arg0: ClassManifest[B]): Array[B]

Converts this set to an array

Converts this set to an array.

B
the type of the elements of the array. A ClassManifest for this type must be available.
returns
an array containing all elements of this set.

definition classes: TraversableLike
def toIndexedSeq[B >: A]: IndexedSeq[B]

Converts this set to an indexed sequence

Converts this set to an indexed sequence.

definition classes: TraversableLike
def toIterable: Iterable[A]

Converts this set to an iterable collection

Converts this set to an iterable collection.
Note: Will not terminate for infinite-sized collections.

definition classes: IterableLike ⇐ TraversableLike
def toList: List[A]

Converts this set to a list

Converts this set to a list.

definition classes: TraversableLike
def toSeq: Seq[A]

Converts this set to a sequence

Converts this set to a sequence.

definition classes: TraversableLike
def toSet[B >: A]: Set[B]

Converts this set to a set

Converts this set to a set.

definition classes: TraversableLike
def toStream: Stream[A]

Converts this set to a stream

Converts this set to a stream.

definition classes: IterableLike ⇐ TraversableLike
def toString(): String

Converts this set to a string

Converts this set to a string

definition classes: SetLike ⇐ TraversableLike ⇐ AnyRef ⇐ Any
def transpose[B](asTraversable: (A) ⇒ Traversable[B]): Set[Set[B]]

Transposes this set of traversable collections into

Transposes this set of traversable collections into

definition classes: GenericTraversableTemplate
def union(that: Set[A]): SortedSet[A]

Computes the union between of set and another set

Computes the union between of set and another set.

that
the set to form the union with.
returns
a new set consisting of all elements that are in this set or in the given set that.

definition classes: SetLike
def until(until: A): SortedSet[A]

Creates a ranged projection of this collection with no lower-bound

Creates a ranged projection of this collection with no lower-bound.

until
The upper-bound (exclusive) of the ranged projection.

definition classes: SortedSetLike ⇐ Sorted
def unzip[A1, A2](asPair: (A) ⇒ (A1, A2)): (Set[A1], Set[A2])

Converts this set of pairs into two collections of the first and second halfs of each pair

Converts this set of pairs into two collections of the first and second halfs of each pair.

asPair
an implicit conversion which asserts that the element type of this set is a pair.
returns
a pair sets, containing the first, respectively second half of each element pair of this set.

definition classes: GenericTraversableTemplate
def view(from: Int, until: Int): IterableView[A, SortedSet[A]]

Creates a non-strict view of a slice of this set

Creates a non-strict view of a slice of this set.
Note: the difference between view and slice is that view produces a view of the current set, whereas slice produces a new set.
Note: view(from, to) is equivalent to view.slice(from, to)
Note: might return different results for different runs, unless the underlying collection type is ordered.

from
the index of the first element of the view
until
the index of the element following the view
returns
a non-strict view of a slice of this set, starting at index from and extending up to (but not including) index until.

definition classes: IterableLike ⇐ TraversableLike
def view: IterableView[A, SortedSet[A]]

Creates a non-strict view of this set

Creates a non-strict view of this set.

definition classes: IterableLike ⇐ TraversableLike
def withFilter(p: (A) ⇒ Boolean): WithFilter

Creates a non-strict filter of this set

Creates a non-strict filter of this set.
Note: the difference between c filter p and c withFilter p is that the former creates a new collection, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
Note: might return different results for different runs, unless the underlying collection type is ordered.

p
the predicate used to test elements.
returns
an object of class WithFilter, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this set which satify the predicate p.

definition classes: TraversableLike
def zip[A1 >: A, B, That](that: Iterable[B])(bf: CanBuildFrom[SortedSet[A], (A1, B), That]): That

Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs

Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is longer than the other, its remaining elements are ignored.
Note: might return different results for different runs, unless the underlying collection type is ordered.

A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
B
the type of the second half of the returned pairs
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, B) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, B), That]. is found.
that
The iterable providing the second half of each result pair
bf
an implicit value of class CanBuildFrom which determines the result class That from the current representation type Repr and the new element type (A1, B).
returns
a new collection of type That containing pairs consisting of corresponding elements of this set and that. The length of the returned collection is the minimum of the lengths of this set$ and that.

definition classes: IterableLike
def zipAll[B, A1 >: A, That](that: Iterable[B], thisElem: A1, thatElem: B)(bf: CanBuildFrom[SortedSet[A], (A1, B), That]): That

Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs

Returns a set formed from this set and another iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements are used to extend the shorter collection to the length of the longer.
Note: might return different results for different runs, unless the underlying collection type is ordered.

that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this set is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this set.
returns
a new collection of type That containing pairs consisting of corresponding elements of this set and that. The length of the returned collection is the maximum of the lengths of this set$ and that. If this set is shorter than that, thisElem values are used to pad the result. If that is shorter than this set, thatElem values are used to pad the result.

definition classes: IterableLike
def zipWithIndex[A1 >: A, That](bf: CanBuildFrom[SortedSet[A], (A1, Int), That]): That

Zips this set with its indices

Zips this set with its indices.
Note: might return different results for different runs, unless the underlying collection type is ordered.

A1
the type of the first half of the returned pairs (this is always a supertype of the collection's element type A).
That
the class of the returned collection. Where possible, That is the same class as the current collection class Repr, but this depends on the element type (A1, Int) being admissible for that class, which means that an implicit instance of type CanBuildFrom[Repr, (A1, Int), That]. is found.
returns
A new collection of type That containing pairs consisting of all elements of this set paired with their index. Indices start at 0.

definition classes: IterableLike
def |(that: Set[A]): SortedSet[A]

Computes the union between this set and another set

Computes the union between this set and another set.

that
the set to form the union with.
returns
a new set consisting of all elements that are in this set or in the given set that.

definition classes: SetLike

SortedSet

trait SortedSet[A] extends Set[A] with SortedSetLike[A, SortedSet[A]]

Inherits

Type Members

class WithFilter extends AnyRef

Value Members

def &(that: Set[A]): SortedSet[A]

def &~(that: Set[A]): SortedSet[A]

def **(that: Set[A]): SortedSet[A]

def +(elem1: A, elem2: A, elems: A*): SortedSet[A]

def +(elem: A): SortedSet[A]

def ++(iter: Iterator[A]): SortedSet[A]

def ++(elems: Traversable[A]): SortedSet[A]

def ++[B >: A, That](that: Iterator[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

def ++[B >: A, That](that: Traversable[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

def -(elem1: A, elem2: A, elems: A*): SortedSet[A]

def -(elem: A): SortedSet[A]

def --(iter: Iterator[A]): SortedSet[A]

def --(elems: Traversable[A]): SortedSet[A]

def /:[B](z: B)(op: (B, A) ⇒ B): B

def :\[B](z: B)(op: (A, B) ⇒ B): B

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def andThen[A](g: (Boolean) ⇒ A): (A) ⇒ A

def apply(elem: A): Boolean

def canEqual(that: Any): Boolean

def companion: GenericCompanion[Set[A][A]]

def compare(k0: A, k1: A): Int

def compose[A](g: (A) ⇒ A): (A) ⇒ Boolean

def contains(elem: A): Boolean

def copyToArray[B >: A](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: A](xs: Array[B]): Unit

def copyToArray[B >: A](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: A](dest: Buffer[B]): Unit

def count(p: (A) ⇒ Boolean): Int

def diff(that: Set[A]): SortedSet[A]

def drop(n: Int): SortedSet[A]

def dropRight(n: Int): SortedSet[A]

def dropWhile(p: (A) ⇒ Boolean): SortedSet[A]

def elements: Iterator[A]

def empty: SortedSet[A]

def equals(that: Any): Boolean

def exists(p: (A) ⇒ Boolean): Boolean

def filter(p: (A) ⇒ Boolean): SortedSet[A]

def filterNot(p: (A) ⇒ Boolean): SortedSet[A]

def find(p: (A) ⇒ Boolean): Option[A]

def first: A

def firstKey: A

def firstOption: Option[A]

def flatMap[B, That](f: (A) ⇒ Traversable[B])(bf: CanBuildFrom[SortedSet[A], B, That]): That

def flatten[B](asTraversable: (A) ⇒ Traversable[B]): Set[B]

def foldLeft[B](z: B)(op: (B, A) ⇒ B): B

def foldRight[B](z: B)(op: (A, B) ⇒ B): B

def forall(p: (A) ⇒ Boolean): Boolean

def foreach[U](f: (A) ⇒ U): Unit

def from(from: A): SortedSet[A]

def genericBuilder[B]: Builder[B, Set[B]]

def groupBy[K](f: (A) ⇒ K): Map[K, SortedSet[A]]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: A

def headOption: Option[A]

def init: SortedSet[A]

def intersect(that: Set[A]): SortedSet[A]

def isEmpty: Boolean

def iterator: Iterator[A]

def keySet: SortedSet[A]

def last: A

def lastKey: A

def lastOption: Option[A]

def map[B, That](f: (A) ⇒ B)(bf: CanBuildFrom[SortedSet[A], B, That]): That

def max[B >: A](cmp: Ordering[B]): A

def min[B >: A](cmp: Ordering[B]): A

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

def nonEmpty: Boolean

def ordering: Ordering[A]

def partialMap[B, That](pf: PartialFunction[A, B])(bf: CanBuildFrom[SortedSet[A], B, That]): That