TreeEquaSet

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations.
A class supporting filtered operations. Instances of this class are returned by method withFilter.

Definition Classes
EquaSet

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
def &(that: SortedEquaSets.EquaSet): TreeEquaSet

Computes the intersection between this SortedEquaSet and another EquaSet.
Computes the intersection between this SortedEquaSet and another EquaSet.
Note: Same as intersect.
that
the EquaSet to intersect with.
returns
a new SortedEquaSet consisting of all elements that are both in this SortedEquaSet and in the given EquaSet that.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def &~(that: SortedEquaSets.EquaSet): TreeEquaSet

The difference of this SortedEquaSet and another EquaSet.
The difference of this SortedEquaSet and another EquaSet.
Note: Same as diff.
that
the EquaSet of elements to exclude.
returns
a SortedEquaSet containing those elements of this SortedEquaSet that are not also contained in the given EquaSet that.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def +(elem1: T, elem2: T, elems: T*): TreeEquaSet

Creates a new SortedEquaSet with additional elements.
Creates a new SortedEquaSet 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 SortedEquaSet with the given elements added.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def +(elem: T): TreeEquaSet

Creates a new SortedEquaSet with an additional element, unless the element is already present.
Creates a new SortedEquaSet with an additional element, unless the element is already present.
elem
the element to be added
returns
a new SortedEquaSet that contains all elements of this SortedEquaSet and that also contains elem.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def ++(that: SortedEquaSets.EquaSet): TreeEquaSet

Creates a new SortedEquaSet by adding elements contained in another EquaSet.
Creates a new SortedEquaSet by adding elements contained in another EquaSet.
that
the other EquaSet containing the added elements.
returns
a new SortedEquaSet with the given elements added.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def ++(elems: GenTraversableOnce[T]): TreeEquaSet

Creates a new SortedEquaSet by adding all elements contained in another collection to this SortedEquaSet.
Creates a new SortedEquaSet by adding all elements contained in another collection to this SortedEquaSet.
elems
the collection containing the added elements.
returns
a new SortedEquaSet with the given elements added.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def -(elem1: T, elem2: T, elems: T*): TreeEquaSet

Creates a new SortedEquaSet from this SortedEquaSet with some elements removed.
Creates a new SortedEquaSet from this SortedEquaSet 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 SortedEquaSet that contains all elements of the current SortedEquaSet except one less occurrence of each of the given elements.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def -(elem: T): TreeEquaSet

Creates a new SortedEquaSet with a given element removed from this SortedEquaSet.
Creates a new SortedEquaSet with a given element removed from this SortedEquaSet.
elem
the element to be removed
returns
a new SortedEquaSet that contains all elements of this SortedEquaSet but that does not contain elem.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def --(that: SortedEquaSets.EquaSet): TreeEquaSet

Creates a new SortedEquaSet from this SortedEquaSet by removing all elements of another EquaSet
Creates a new SortedEquaSet from this SortedEquaSet by removing all elements of another EquaSet
that
the other EquaSet containing the removed elements.
returns
a new SortedEquaSet that contains all elements of the current EquaSet minus elements contained in the passed in EquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def --(elems: GenTraversableOnce[T]): TreeEquaSet

Creates a new SortedEquaSet from this SortedEquaSet by removing all elements of another collection.
Creates a new SortedEquaSet from this SortedEquaSet by removing all elements of another collection.
elems
the collection containing the removed elements.
returns
a new SortedEquaSet that contains all elements of the current SortedEquaSet except one less occurrence of each of the elements of elems.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def /:[B](z: B)(op: (B, T) ⇒ B): B

Applies a binary operator to a start value and all elements of this SortedEquaSet, going left to right.
Applies a binary operator to a start value and all elements of this SortedEquaSet, going left to right.
Note: /: is alternate syntax for foldLeft; z /: xs is the same as xs foldLeft z.
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = (5 /: a)(_+_)
b: Int = 15

scala> val c = (5 /: a)((x,y) => x + y)
c: Int = 15
```
$willNotTerminateInf $orderDependentFold
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 SortedEquaSet, going left to right with the start value z on the left:
```
op(...op(op(z, x_1), x_2), ..., x_n)
```
where x₁, ..., x_n are the elements of this SortedEquaSet.
Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def :\[B](z: B)(op: (T, B) ⇒ B): B

Applies a binary operator to all elements of this SortedEquaSet and a start value, going right to left.
Applies a binary operator to all elements of this SortedEquaSet and a start value, going right to left.
Note: :\ is alternate syntax for foldRight; xs :\ z is the same as xs foldRight z. $willNotTerminateInf $orderDependentFold
Examples:
Note that the folding function used to compute b is equivalent to that used to compute c.
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = (a :\ 5)(_+_)
b: Int = 15

scala> val c = (a :\ 5)((x,y) => x + y)
c: Int = 15
```
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 SortedEquaSet, going right to left with the start value z on the right:
```
op(x_1, op(x_2, ... op(x_n, z)...))
```
where x₁, ..., x_n are the elements of this SortedEquaSet.
Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

Appends all elements of this EquaSet to a string builder using start, end, and separator strings.
Appends all elements of this EquaSet 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 EquaSet are separated by the string sep.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b , "List(" , ", " , ")")
res5: StringBuilder = List(1, 2, 3, 4)
```
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
TreeEquaSet → EquaSet
def addString(b: StringBuilder, sep: String): StringBuilder

Appends all elements of this EquaSet to a string builder using a separator string.
Appends all elements of this EquaSet 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 EquaSet, separated by the string sep.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> a.addString(b, ", ")
res0: StringBuilder = 1, 2, 3, 4
```
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
TreeEquaSet → EquaSet
def addString(b: StringBuilder): StringBuilder

Appends all elements of this EquaSet to a string builder.
Appends all elements of this EquaSet to a string builder. The written text consists of the string representations (w.r.t. the method toString) of all elements of this EquaSet without any separator string.
Example:
```
scala> val a = List(1,2,3,4)
a: List[Int] = List(1, 2, 3, 4)

scala> val b = new StringBuilder()
b: StringBuilder =

scala> val h = a.addString(b)
h: StringBuilder = 1234
```
b
the string builder to which elements are appended.
returns
the string builder b to which elements were appended.

Definition Classes
TreeEquaSet → EquaSet
def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

Aggregates the results of applying an operator to subsequent elements.
Aggregates the results of applying an operator to subsequent elements.
This is a more general form of fold and reduce. It has similar semantics, but does not require the result to be a supertype of the element type. It traverses the elements in different partitions sequentially, using seqop to update the result, and then applies combop to results from different partitions. The implementation of this operation may operate on an arbitrary number of collection partitions, so combop may be invoked an arbitrary number of times.
For example, one might want to process some elements and then produce a Set. In this case, seqop would process an element and append it to the list, while combop would concatenate two lists from different partitions together. The initial value z would be an empty set.
```
pc.aggregate(Set[Int]())(_ += process(_), _ ++ _)
```
Another example is calculating geometric mean from a collection of doubles (one would typically require big doubles for this).
B
the type of accumulated results
z
the initial value for the accumulated result of the partition - this will typically be the neutral element for the seqop operator (e.g. Nil for list concatenation or 0 for summation) and may be evaluated more than once
seqop
an operator used to accumulate results within a partition
combop
an associative operator used to combine results from different partitions

Definition Classes
TreeEquaSet → EquaSet
def andThen[A](g: (Boolean) ⇒ A): (T) ⇒ A

Definition Classes
Function1
Annotations
@unspecialized()
def apply(elem: T): 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
TreeEquaSet → EquaSet → Function1
final def asInstanceOf[T0]: T0

Definition Classes
Any
def canEqual(that: Any): Boolean

Definition Classes
TreeEquaSet → Equals
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def collect(pf: PartialFunction[T, T]): TreeEquaSet

Builds a new collection by applying a partial function to all elements of this SortedEquaSet on which the function is defined.
Builds a new collection by applying a partial function to all elements of this SortedEquaSet on which the function is defined.
pf
the partial function which filters and maps the SortedEquaSet.
returns
a new SortedEquaSet resulting from applying the given partial function pf to each element on which it is defined and collecting the results. The order of the elements is preserved.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

Definition Classes
Function1
Annotations
@unspecialized()
def contains[U](elem: U)(implicit ev: <:<[U, T]): Boolean

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def copyToArray(xs: Array[SortedEquaSets.EquaBox], start: Int, len: Int): Unit

Copies values of this EquaSet to an array.
Copies values of this EquaSet to an array. Fills the given array xs with values of this EquaSet, beginning at index start. Copying will stop once the count of element copied reach len.
xs
the array to fill.
start
the starting index.
len
the length of elements to copy

Definition Classes
TreeEquaSet → EquaSet
def copyToArray(xs: Array[SortedEquaSets.EquaBox], start: Int): Unit

Copies values of this EquaSet to an array.
Copies values of this EquaSet to an array. Fills the given array xs with values of this EquaSet, beginning at index start. Copying will stop once either the end of the current EquaSet is reached, or the end of the array is reached.
xs
the array to fill.
start
the starting index.

Definition Classes
TreeEquaSet → EquaSet
def copyToArray(xs: Array[SortedEquaSets.EquaBox]): Unit

Copies values of this EquaSet to an array.
Copies values of this EquaSet to an array. Fills the given array xs with values of this EquaSet. Copying will stop once either the end of the current EquaSet is reached, or the end of the array is reached.
xs
the array to fill.

Definition Classes
TreeEquaSet → EquaSet
def copyToBuffer(dest: Buffer[SortedEquaSets.EquaBox]): Unit

Copies all elements of this EquaSet to a buffer.
Copies all elements of this EquaSet to a buffer.
dest
The buffer to which elements are copied.

Definition Classes
TreeEquaSet → EquaSet
def count(p: (T) ⇒ Boolean): Int

Counts the number of elements in the EquaSet which satisfy a predicate.
Counts the number of elements in the EquaSet which satisfy a predicate.
p
the predicate used to test elements.
returns
the number of elements satisfying the predicate p.

Definition Classes
TreeEquaSet → EquaSet
def diff(that: SortedEquaSets.EquaSet): TreeEquaSet

Computes the difference of this SortedEquaSet and another SortedEquaSet.
Computes the difference of this SortedEquaSet and another SortedEquaSet.
that
the EquaSet of elements to exclude.
returns
a SortedEquaSet containing those elements of this SortedEquaSet that are not also contained in the given EquaSet that.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def drop(n: Int): TreeEquaSet

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

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def dropRight(n: Int): TreeEquaSet

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

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def dropWhile(pred: (T) ⇒ Boolean): TreeEquaSet

Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
pred
The predicate used to test elements.
returns
the longest suffix of this SortedEquaSet whose first element does not satisfy the predicate p.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def enclosingEquaSets: SortedEquaSets[T]

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(other: Any): Boolean

Definition Classes
TreeEquaSet → Equals → AnyRef → Any
def exists(pred: (T) ⇒ Boolean): Boolean

Check if this EquaSet contains element which satisfy a predicate.
Check if this EquaSet contains element which satisfy a predicate.
pred
predicate predicate used to test elements
returns
true if there's at least one element satisfy the given predicate pred

Definition Classes
TreeEquaSet → EquaSet
def filter(pred: (T) ⇒ Boolean): TreeEquaSet

Selects all elements of this SortedEquaSet which satisfy a predicate.
Selects all elements of this SortedEquaSet which satisfy a predicate.
pred
the predicate used to test elements.
returns
a new SortedEquaSet consisting of all elements of this SortedEquaSet that satisfy the given predicate pred.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def filterNot(pred: (T) ⇒ Boolean): SortedEquaSet

Selects all elements of this SortedEquaSets which do not satisfy a predicate.
Selects all elements of this SortedEquaSets which do not satisfy a predicate.
pred
the predicate used to test elements.
returns
a new SortedEquaSets consisting of all elements of this SortedEquaSets that do not satisfy the given predicate pred.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def find(pred: (T) ⇒ Boolean): Option[T]

Finds the first element of the EquaSet satisfying a predicate, if any.
Finds the first element of the EquaSet satisfying a predicate, if any.
pred
the predicate used to test elements.
returns
an option value containing the first element in the EquaSet that satisfies pred, or None if none exists.

Definition Classes
TreeEquaSet → EquaSet
def flatMap(f: (T) ⇒ SortedEquaSets.EquaSet): TreeEquaSet

Builds a new SortedEquaSet by applying a function to all elements of this SortedEquaSet and using the elements of the resulting EquaSet.
Builds a new SortedEquaSet by applying a function to all elements of this SortedEquaSet and using the elements of the resulting EquaSet.
f
the function to apply to each element.
returns
a new SortedEquaSet resulting from applying the given EquaSet-valued function f to each element of this SortedEquaSet and concatenating the results.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def fold[T1 >: T](z: T1)(op: (T1, T1) ⇒ T1): T1

Folds the elements of this EquaSet using the specified associative binary operator.
Folds the elements of this EquaSet using the specified associative binary operator.
T1
a type parameter for the binary operator, a supertype of A.
z
a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g., Nil for list concatenation, 0 for addition, or 1 for multiplication.)
op
a binary operator that must be associative
returns
the result of applying fold operator op between all the elements and z

Definition Classes
TreeEquaSet → EquaSet
def foldLeft[B](z: B)(op: (B, T) ⇒ B): B

Applies a binary operator to a start value and all elements of this EquaSet, going left to right.
Applies a binary operator to a start value and all elements of this EquaSet, going left to right.
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 EquaSet, going left to right with the start value z on the left:
```
op(...op(z, x_1), x_2, ..., x_n)
```
where x₁, ..., x_n are the elements of this EquaSet.
Definition Classes
TreeEquaSet → EquaSet
def foldRight[B](z: B)(op: (T, B) ⇒ B): B

Applies a binary operator to all elements of this EquaSet and a start value, going right to left.
Applies a binary operator to all elements of this EquaSet and a start value, going right to left.
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 EquaSet, going right to left with the start value z on the right:
```
op(x_1, op(x_2, ... op(x_n, z)...))
```
where x₁, ..., x_n are the elements of this EquaSet.
Definition Classes
TreeEquaSet → EquaSet
def forall(pred: (T) ⇒ Boolean): Boolean

Check if all elements in this EquaSet satisfy the predicate.
Check if all elements in this EquaSet satisfy the predicate.
pred
the predicate to check for
returns
true if all elements satisfy the predicate, false otherwise.

Definition Classes
TreeEquaSet → EquaSet
def foreach[U](f: (T) ⇒ U): Unit

Applies a function f to all elements of this EquaSet.
Applies a function f to all elements of this EquaSet.
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
TreeEquaSet → EquaSet
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def groupBy[K](f: (T) ⇒ K): GenMap[K, TreeEquaSet]

Partitions this SortedEquaSet into a map of SortedEquaSets according to some discriminator function.
Partitions this SortedEquaSet into a map of SortedEquaSets 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 SortedEquaSet.
K
the type of keys returned by the discriminator function.
f
the discriminator function.
returns
A map from keys to SortedEquaSets such that the following invariant holds:
```
(xs groupBy f)(k) = xs filter (x => f(x) == k)
```
That is, every key k is bound to a SortedEquaSet of those elements x for which f(x) equals k.
Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def grouped(size: Int): Iterator[TreeEquaSet]

Partitions elements in fixed size SortedEquaSets.
Partitions elements in fixed size SortedEquaSets.
size
the number of elements per group
returns
An iterator producing SortedEquaSets of size size, except the last will be less than size size if the elements don't divide evenly.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
See also
scala.collection.Iterator, method grouped
def hasDefiniteSize: Boolean

Definition Classes
TreeEquaSet → EquaSet
def hashCode(): Int

Definition Classes
TreeEquaSet → AnyRef → Any
def head: T

Selects the first element of this EquaSet.
Selects the first element of this EquaSet.
returns
the first element of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
Exceptions thrown
`NoSuchElementException`
if the EquaSet is empty.
def headOption: Option[T]

Optionally selects the first element.
Optionally selects the first element.
returns
the first element of this EquaSet if it is nonempty, None if it is empty.

Definition Classes
TreeEquaSet → EquaSet
def init: TreeEquaSet

Selects all elements except the last.
Selects all elements except the last.
returns
a SortedEquaSet consisting of all elements of this SortedEquaSet except the last one.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
Exceptions thrown
`UnsupportedOperationException`
if the SortedEquaSet is empty.
def inits: Iterator[TreeEquaSet]

Iterates over the inits of this SortedEquaSet.
Iterates over the inits of this SortedEquaSet. The first value will be this SortedEquaSet and the final one will be an empty SortedEquaSet, with the intervening values the results of successive applications of init.
returns
an iterator over all the inits of this SortedEquaSet
Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
Example:
1. SortedEquaSet(1,2,3).inits = Iterator(SortedEquaSet(1,2,3), SortedEquaSet(1,2), SortedEquaSet(1), SortedEquaSet())
def intersect(that: SortedEquaSets.EquaSet): TreeEquaSet

Computes the intersection between this SortedEquaSet and another EquaSet.
Computes the intersection between this SortedEquaSet and another EquaSet.
that
the EquaSet to intersect with.
returns
a new SortedEquaSet consisting of all elements that are both in this SortedEquaSet and in the given EquaSet that.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def into[U](thatEquaSets: SortedEquaSets[U]): TreeEquaBridge[T]

Make a SortedEquaBridge between this SortedEquaSet and the given thatEquaSets.
Make a SortedEquaBridge between this SortedEquaSet and the given thatEquaSets. SortedEquaBridge enables this SortedEquaSet to transform into thatEquaSets.SortedEquaSet through collect, map, flatMap, flatten, scanLeft, scanRight.
U
the type of thatEquaSets
thatEquaSets
that SortedEquaSets to bridge to
returns
an instance of thatEquaSets.SortedEquaBridge

Definition Classes
TreeEquaSet → SortedEquaSet
def into[U](thatEquaSets: EquaSets[U]): EquaBridge[T]

Make an EquaBridge between this SortedEquaSet and the given thatEquaSets.
Make an EquaBridge between this SortedEquaSet and the given thatEquaSets. EquaBridge enables this SortedEquaSet to transform into thatEquaSets.EquaSet through collect, map, flatMap, flatten, scanLeft, scanRight.
U
the type of thatEquaSets
thatEquaSets
that EquaSets to bridge to
returns
an instance of thatEquaSets.EquaBridge

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def isEmpty: Boolean

Tests if this SortedEquaSet is empty.
Tests if this SortedEquaSet is empty.
returns
true if there is no element in the set, false otherwise.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isTraversableAgain: Boolean

Tests whether this EquaSet can be repeatedly traversed.
Tests whether this EquaSet can be repeatedly traversed. Always true for EquaSet unless overridden.
returns
true unless overriden.

Definition Classes
EquaSet
def iterator: Iterator[T]

Get an instance of Iterator for elements of this SortedEquaSet.
Get an instance of Iterator for elements of this SortedEquaSet.
returns
an instance of Iterator for elements of this SortedEquaSet

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def last: T

Selects the last element.
Selects the last element.
returns
The last element of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
Exceptions thrown
NoSuchElementException
If the EquaSet is empty.
def lastOption: Option[T]

Optionally selects the last element.
Optionally selects the last element.
returns
the last element of this EquaSet if it is nonempty, None if it is empty.

Definition Classes
TreeEquaSet → EquaSet
def map(f: (T) ⇒ T): TreeEquaSet

Builds a new SortedEquaSet by applying a function to all elements of this SortedEquaSet.
Builds a new SortedEquaSet by applying a function to all elements of this SortedEquaSet.
f
the function to apply to each element.
returns
a new SortedEquaSet resulting from applying the given function f to each element of this SortedEquaSet and collecting the results.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def max[T1 >: T](implicit ord: Ordering[T1]): T

Finds the largest element.
Finds the largest element.
T1
The type over which the ordering is defined.
ord
An ordering to be used for comparing elements.
returns
the largest element of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Finds the first element which yields the largest value measured by function f.
Finds the first element which yields the largest value measured by function f.
B
The result type of the function f.
f
The measuring function.
cmp
An ordering to be used for comparing elements.
returns
the first element of this EquaSet with the largest value measured by function f.

Definition Classes
TreeEquaSet → EquaSet
def min[T1 >: T](implicit ord: Ordering[T1]): T

Finds the smallest element.
Finds the smallest element.
T1
The type over which the ordering is defined.
ord
An ordering to be used for comparing elements.
returns
the smallest element of this EquaSet

Definition Classes
TreeEquaSet → EquaSet
def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

Finds the first element which yields the smallest value measured by function f.
Finds the first element which yields the smallest value measured by function f.
B
The result type of the function f.
f
The measuring function.
cmp
An ordering to be used for comparing elements.
returns
the first element of this EquaSet with the smallest value measured by function f.

Definition Classes
TreeEquaSet → EquaSet
def mkString: String

Displays all elements of this EquaSet in a string.
Displays all elements of this EquaSet in a string.
returns
a string representation of this EquaSet. In the resulting string the string representations (w.r.t. the method toString) of all elements of this EquaSet follow each other without any separator string.

Definition Classes
TreeEquaSet → EquaSet
def mkString(sep: String): String

Displays all elements of this EquaSet in a string using a separator string.
Displays all elements of this EquaSet in a string using a separator string.
sep
the separator string.
returns
a string representation of this EquaSet. In the resulting string the string representations (w.r.t. the method toString) of all elements of this EquaSet are separated by the string sep.
Definition Classes
TreeEquaSet → EquaSet
Example:
1. EquaSet(1, 2, 3).mkString("|") = "1|2|3"
def mkString(start: String, sep: String, end: String): String

Displays all elements of this EquaSet in a string using start, end, and separator strings.
Displays all elements of this EquaSet 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 EquaSet. 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 EquaSet are separated by the string sep.
Definition Classes
TreeEquaSet → EquaSet
Example:
1. EquaSet(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def nonEmpty: Boolean

Tests whether the EquaSet is not empty.
Tests whether the EquaSet is not empty.
returns
true if the EquaSet contains at least one element, false otherwise.

Definition Classes
TreeEquaSet → EquaSet
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def partition(pred: (T) ⇒ Boolean): (TreeEquaSet, TreeEquaSet)

Partitions this SortedEquaSet in two SortedEquaSets according to a predicate.
Partitions this SortedEquaSet in two SortedEquaSets according to a predicate.
pred
the predicate on which to partition.
returns
a pair of SortedEquaSets: the first SortedEquaSet consists of all elements that satisfy the predicate p and the second SortedEquaSet consists of all elements that don't. The relative order of the elements in the resulting SortedEquaSets may not be preserved.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def product[T1 >: T](implicit num: Numeric[T1]): T1

Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
T1
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 in this EquaSet of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the EquaSet and as result type of product. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes
TreeEquaSet → EquaSet
def reduce[T1 >: T](op: (T1, T1) ⇒ T1): T1

Reduces the elements of this EquaSet using the specified associative binary operator.
Reduces the elements of this EquaSet using the specified associative binary operator.
T1
A type parameter for the binary operator, a supertype of T.
op
A binary operator that must be associative.
returns
The result of applying reduce operator op between all the elements if the EquaSet is nonempty.

Definition Classes
TreeEquaSet → EquaSet
Exceptions thrown
UnsupportedOperationException
if this EquaSet is empty.
def reduceLeft[T1 >: T](op: (T1, T) ⇒ T1): T1

Applies a binary operator to all elements of this EquaSet, going left to right.
Applies a binary operator to all elements of this EquaSet, going left to right.
T1
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this EquaSet, going left to right:
```
op( op( ... op(x_1, x_2) ..., x_{n-1}), x_n)
```
where x₁, ..., x_n are the elements of this EquaSet.
Definition Classes
TreeEquaSet → EquaSet
Exceptions thrown
`UnsupportedOperationException`
if this EquaSet is empty.
def reduceLeftOption[T1 >: T](op: (T1, T) ⇒ T1): Option[T1]

Optionally applies a binary operator to all elements of this EquaSet, going left to right.
Optionally applies a binary operator to all elements of this EquaSet, going left to right.
T1
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceLeft(op) is this EquaSet is nonempty, None otherwise.

Definition Classes
TreeEquaSet → EquaSet
def reduceOption[T1 >: T](op: (T1, T1) ⇒ T1): Option[T1]

Reduces the elements of this EquaSet, if any, using the specified associative binary operator.
Reduces the elements of this EquaSet, if any, using the specified associative binary operator.
T1
A type parameter for the binary operator, a supertype of T.
op
A binary operator that must be associative.
returns
An option value containing result of applying reduce operator op between all the elements if the collection is nonempty, and None otherwise.

Definition Classes
TreeEquaSet → EquaSet
def reduceRight[T1 >: T](op: (T, T1) ⇒ T1): T1

Applies a binary operator to all elements of this EquaSet, going right to left.
Applies a binary operator to all elements of this EquaSet, going right to left.
T1
the result type of the binary operator.
op
the binary operator.
returns
the result of inserting op between consecutive elements of this EquaSet, going right to left:
```
op(x_1, op(x_2, ..., op(x_{n-1}, x_n)...))
```
where x₁, ..., x_n are the elements of this EquaSet.
Definition Classes
TreeEquaSet → EquaSet
Exceptions thrown
`UnsupportedOperationException`
if this EquaSet is empty.
def reduceRightOption[T1 >: T](op: (T, T1) ⇒ T1): Option[T1]

Optionally applies a binary operator to all elements of this EquaSet, going right to left.
Optionally applies a binary operator to all elements of this EquaSet, going right to left.
T1
the result type of the binary operator.
op
the binary operator.
returns
an option value containing the result of reduceRight(op) is this EquaSet is nonempty, None otherwise.

Definition Classes
TreeEquaSet → EquaSet
def repr: SortedSet[SortedEquaSets.EquaBox]

The SortedSet[EquaBox] underlying this SortedEquaSet object.
The SortedSet[EquaBox] underlying this SortedEquaSet object.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def sameElements[T1 >: T](that: GenIterable[T1]): Boolean

Checks if the other iterable collection contains the same elements in the same order as this EquaSet.
Checks if the other iterable collection contains the same elements in the same order as this EquaSet.
T1
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
TreeEquaSet → EquaSet
def scanLeft(z: T)(op: (T, T) ⇒ T): TreeEquaSet

Produces a collection containing cumulative results of applying the operator going left to right.
Produces a collection containing cumulative results of applying the operator going left to right.
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
SortedEquaSet with intermediate results

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def scanRight(z: T)(op: (T, T) ⇒ T): TreeEquaSet

Produces a collection containing cumulative results of applying the operator going right to left.
Produces a collection containing cumulative results of applying the operator going right to left. The head of the collection is the last cumulative result.
Example:
```
`SortedEquaSet`(1, 2, 3, 4).scanRight(0)(_ + _) == `SortedEquaSet`(10, 9, 7, 4, 0)
```
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
SortedEquaSet with intermediate results

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def size: Int

The size of this SortedEquaSet.
The size of this SortedEquaSet.
returns
the number of elements in this SortedEquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def slice(unc_from: Int, unc_until: Int): TreeEquaSet

Selects an interval of elements.
Selects an interval of elements. The returned collection is made up of all elements x which satisfy the invariant:
```
from <= indexOf(x) < until
```
unc_from
the lowest index to include from this EquaSet.
unc_until
the lowest index to EXCLUDE from this EquaSet.
returns
an EquaSet containing the elements greater than or equal to index from extending up to (but not including) index until of this EquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def sliding(size: Int, step: Int): Iterator[TreeEquaSet]

Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
size
the number of elements per group
step
the distance between the first elements of successive groups (defaults to 1)
returns
An iterator producing SortedEquaSets of size size, except the last and the only element will be truncated if there are fewer elements than size.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
See also
scala.collection.Iterator, method sliding
def sliding(size: Int): Iterator[TreeEquaSet]

Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.)
size
the number of elements per group
returns
An iterator producing SortedEquaSets of size size, except the last and the only element will be truncated if there are fewer elements than size.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
See also
scala.collection.Iterator, method sliding
def span(pred: (T) ⇒ Boolean): (TreeEquaSet, TreeEquaSet)

Splits this SortedEquaSet into a prefix/suffix pair according to a predicate.
Splits this SortedEquaSet 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.
pred
the test predicate
returns
a pair consisting of the longest prefix of this SortedEquaSet whose elements all satisfy p, and the rest of this SortedEquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def splitAt(n: Int): (TreeEquaSet, TreeEquaSet)

Splits this SortedEquaSet into two at a given position.
Splits this SortedEquaSet into two at a given position. Note: c splitAt n is equivalent to (but possibly more efficient than) (c take n, c drop n).
n
the position at which to split.
returns
a pair of SortedEquaSets consisting of the first n elements of this SortedEquaSet, and the other elements.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def stringPrefix: String

Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
returns
a string representation which starts the result of toString applied to this EquaSet. By default the string prefix is the simple name of the collection class EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def subsetOf(that: SortedEquaSets.EquaSet): 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
TreeEquaSet → EquaSet
def subsets: Iterator[TreeEquaSet]

An iterator over all subsets of this set.
An iterator over all subsets of this set.
returns
the iterator.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def subsets(len: Int): Iterator[TreeEquaSet]

An iterator over all subsets of this set of the given size.
An iterator over all subsets of this set of the given size. If the requested size is impossible, an empty iterator is returned.
len
the size of the subsets.
returns
the iterator.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def sum[T1 >: T](implicit num: Numeric[T1]): T1

Sums up the elements of this collection.
Sums up the elements of this collection.
T1
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 in this EquaSet of numbers of type Int. Instead of Int, any other type T with an implicit Numeric[T] implementation can be used as element type of the EquaSet and as result type of sum. Examples of such types are: Long, Float, Double, BigInt.

Definition Classes
TreeEquaSet → EquaSet
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def tail: TreeEquaSet

Selects all elements except the first.
Selects all elements except the first.
returns
a SortedEquaSet consisting of all elements of this SortedEquaSet except the first one.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
Exceptions thrown
`UnsupportedOperationException`
if the SortedEquaSet is empty.
def tails: Iterator[TreeEquaSet]

Iterates over the tails of this SortedEquaSet.
Iterates over the tails of this SortedEquaSet. The first value will be this SortedEquaSet and the final one will be an empty SortedEquaSet, with the intervening values the results of successive applications of tail.
returns
an iterator over all the tails of this SortedEquaSet
Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
Example:
1. SortedEquaSet(1,2,3).tails = Iterator(SortedEquaSet(1,2,3), SortedEquaSet(2,3), SortedEquaSet(3), SortedEquaSet())
def take(n: Int): TreeEquaSet

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

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def takeRight(n: Int): TreeEquaSet

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

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, SortedEquaSets.EquaBox, Col[SortedEquaSets.EquaBox]]): Col[SortedEquaSets.EquaBox]

Converts this EquaSet into another by copying all elements.
Converts this EquaSet into another by copying all elements.
Col
The collection type to build.
returns
a new collection containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toArray: Array[T]

Converts this EquaSet to an array.
Converts this EquaSet to an array.
returns
an array containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toBuffer: Buffer[T]

Uses the contents of this EquaSet to create a new mutable buffer.
Uses the contents of this EquaSet to create a new mutable buffer.
returns
a buffer containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxArray: Array[SortedEquaSets.EquaBox]

Converts this EquaSet to an array of EquaBoxes containing the elements.
Converts this EquaSet to an array of EquaBoxes containing the elements.
returns
an array containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxBuffer: Buffer[SortedEquaSets.EquaBox]

Uses the contents of this EquaSet to create a new mutable buffer containing EquaBoxes of elements.
Uses the contents of this EquaSet to create a new mutable buffer containing EquaBoxes of elements.
returns
a buffer containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxIndexedSeq: IndexedSeq[SortedEquaSets.EquaBox]

Converts this EquaSet to an indexed sequence containing EquaBoxes of elements.
Converts this EquaSet to an indexed sequence containing EquaBoxes of elements.
returns
an indexed sequence containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxIterable: GenIterable[SortedEquaSets.EquaBox]

Converts this EquaSet to an iterable collection of EquaBoxes containing the elements.
Converts this EquaSet to an iterable collection of EquaBoxes containing the elements. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).
returns
an Iterable containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxIterator: Iterator[SortedEquaSets.EquaBox]

Returns an Iterator over the EquaBoxes in this EquaSet.
Returns an Iterator over the EquaBoxes in this EquaSet. Will return the same Iterator if this instance is already an Iterator.
returns
an Iterator containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxList: List[SortedEquaSets.EquaBox]

Converts this EquaSet to a list of EquaBox.
Converts this EquaSet to a list of EquaBox.
returns
a list containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxParArray: ParArray[SortedEquaSets.EquaBox]

Converts this EquaSet to a ParArray containing EquaBoxes of elements.
Converts this EquaSet to a ParArray containing EquaBoxes of elements.
returns
a ParArray containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxSeq: GenSeq[SortedEquaSets.EquaBox]

Converts this EquaSet to a sequence containing EquaBoxes of elements.
Converts this EquaSet to a sequence containing EquaBoxes of elements. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.
returns
a sequence containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxSet: TreeSet[SortedEquaSets.EquaBox]

Converts this SortedEquaSet to a set of EquaBox.
Converts this SortedEquaSet to a set of EquaBox.
returns
a set containing all elements of this SortedEquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def toEquaBoxStream: Stream[SortedEquaSets.EquaBox]

Converts this EquaSet to a stream of EquaBoxes containing the elements.
Converts this EquaSet to a stream of EquaBoxes containing the elements.
returns
a stream containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxTraversable: GenTraversable[SortedEquaSets.EquaBox]

Converts this EquaSet to a Traversable of EquaBoxes containing the elements.
Converts this EquaSet to a Traversable of EquaBoxes containing the elements.
returns
a Traversable containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toEquaBoxVector: Vector[SortedEquaSets.EquaBox]

Converts this EquaSet to a Vector of EquaBoxes containing the elements.
Converts this EquaSet to a Vector of EquaBoxes containing the elements.
returns
a vector containing all elements of this EquaSet, boxed in EquaBox.

Definition Classes
TreeEquaSet → EquaSet
def toIndexedSeq: IndexedSeq[T]

Converts this EquaSet to an indexed sequence.
Converts this EquaSet to an indexed sequence.
returns
an indexed sequence containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toIterable: GenIterable[T]

Converts this EquaSet to an iterable collection.
Converts this EquaSet to an iterable collection. Note that the choice of target Iterable is lazy in this default implementation as this TraversableOnce may be lazy and unevaluated (i.e. it may be an iterator which is only traversable once).
returns
an Iterable containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toIterator: Iterator[T]

Returns an Iterator over the elements in this EquaSet.
Returns an Iterator over the elements in this EquaSet. Will return the same Iterator if this instance is already an Iterator.
returns
an Iterator containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toList: List[T]

Converts this EquaSet to a list.
Converts this EquaSet to a list.
returns
a list containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]

Converts this EquaSet to a map.
Converts this EquaSet to a map. This method is unavailable unless the elements are members of Tuple2, each ((K, V)) becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys: if this is an unordered EquaSet, which key is in the resulting map is undefined.
returns
a map of type immutable.Map[K, V] containing all key/value pairs of type (K, V) of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toParArray: ParArray[T]

Converts this EquaSet to a ParArray.
Converts this EquaSet to a ParArray.
returns
a ParArray containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toSeq: GenSeq[T]

Converts this EquaSet to a sequence.
Converts this EquaSet to a sequence. As with toIterable, it's lazy in this default implementation, as this TraversableOnce may be lazy and unevaluated.
returns
a sequence containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toSet: TreeSet[T]

Converts this SortedEquaSet to a set.
Converts this SortedEquaSet to a set.
returns
a set containing all elements of this SortedEquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
def toStream: Stream[T]

Converts this EquaSet to a stream.
Converts this EquaSet to a stream.
returns
a stream containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toString(): String

Definition Classes
TreeEquaSet → Function1 → AnyRef → Any
def toTraversable: GenTraversable[T]

Converts this EquaSet to a Traversable.
Converts this EquaSet to a Traversable.
returns
a Traversable containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def toVector: Vector[T]

Converts this EquaSet to a Vector.
Converts this EquaSet to a Vector.
returns
a vector containing all elements of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): TreeEquaSet

Transposes this SortedEquaSet of traversable collections into a SortedEquaSet of GenTraversableOnces.
Transposes this SortedEquaSet of traversable collections into a SortedEquaSet of GenTraversableOnces.
The resulting collection's type will be guided by the static type of EquaSet. For example:
```
val xs = SortedEquaSet(
List(1, 2, 3),
List(4, 5, 6)).transpose
// xs == SortedEquaSet(
// List(1, 4),
// List(2, 5),
// List(3, 6))

val ys = SortedEquaSet(
List(1, 2, 3),
List(4, 5, 6)).transpose
// ys == SortedEquaSet(
// Vector(1, 4),
// Vector(2, 5),
// Vector(3, 6))
```
B
the type of the elements of each traversable collection.
asTraversable
an implicit conversion which asserts that the element type of this SortedEquaSet is a Traversable.
returns
a two-dimensional SortedEquaSet of ${coll}s which has as nth row the nth column of this SortedEquaSet.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet
Exceptions thrown
`IllegalArgumentException`
if all collections in this SortedEquaSet are not of the same size.
def union(that: SortedEquaSets.EquaSet): TreeEquaSet

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
TreeEquaSet → SortedEquaSet → EquaSet
def unzip[T1, T2](t1EquaSets: EquaSets[T1], t2EquaSets: EquaSets[T2])(implicit asPair: (T) ⇒ (T1, T2)): (EquaSet, EquaSet)

Converts this EquaSet of pairs into two collections of the first and second half of each pair.
Converts this EquaSet of pairs into two collections of the first and second half of each pair.
```
val xs = `EquaSet`(
(1, "one"),
(2, "two"),
(3, "three")).unzip
// xs == (`EquaSet`(1, 2, 3),
// `EquaSet`(one, two, three))
```
T1
the type of the first half of the element pairs
T2
the type of the second half of the element pairs
asPair
an implicit conversion which asserts that the element type of this EquaSet is a pair.
returns
a pair of EquaSets, containing the first, respectively second half of each element pair of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def unzip3[T1, T2, T3](t1EquaSets: EquaSets[T1], t2EquaSets: EquaSets[T2], t3EquaSets: EquaSets[T3])(implicit asTriple: (T) ⇒ (T1, T2, T3)): (EquaSet, EquaSet, EquaSet)

Converts this EquaSet of triples into three collections of the first, second, and third element of each triple.
Converts this EquaSet of triples into three collections of the first, second, and third element of each triple.
```
val xs = `EquaSet`(
(1, "one", '1'),
(2, "two", '2'),
(3, "three", '3')).unzip3
// xs == (`EquaSet`(1, 2, 3),
// `EquaSet`(one, two, three),
// `EquaSet`(1, 2, 3))
```
T1
the type of the first member of the element triples
T2
the type of the second member of the element triples
T3
the type of the third member of the element triples
asTriple
an implicit conversion which asserts that the element type of this EquaSet is a triple.
returns
a triple of EquaSets, containing the first, second, respectively third member of each element triple of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
def view(from: Int, until: Int): IterableView[SortedEquaSets.EquaBox, Set[SortedEquaSets.EquaBox]]

Creates a non-strict view of a slice of this EquaSet.
Creates a non-strict view of a slice of this EquaSet.
Note: the difference between view and slice is that view produces a view of the current EquaSet, whereas slice produces a new EquaSet.
Note: view(from, to) is equivalent to view.slice(from, to) $orderDependent
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 EquaSet, starting at index from and extending up to (but not including) index until.

Definition Classes
TreeEquaSet → EquaSet
def view: IterableView[SortedEquaSets.EquaBox, Set[SortedEquaSets.EquaBox]]

Creates a non-strict view of this EquaSet.
Creates a non-strict view of this EquaSet.
returns
a non-strict view of this EquaSet.

Definition Classes
TreeEquaSet → EquaSet
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def withFilter(p: (T) ⇒ Boolean): WithFilter

Creates a non-strict filter of this EquaSet.
Creates a non-strict filter of this EquaSet.
Note: the difference between c filter p and c withFilter p is that the former creates a new EquaSet, whereas the latter only restricts the domain of subsequent map, flatMap, foreach, and withFilter operations.
p
the predicate used to test elements.
returns
an object of class FilterMonadic, which supports map, flatMap, foreach, and withFilter operations. All these operations apply to those elements of this EquaSet which satisfy the predicate p.

Definition Classes
EquaSet
def zip[U](that: GenIterable[U]): Set[(T, U)]

Returns an EquaSet formed from this EquaSet and another iterable collection by combining corresponding elements in pairs.
Returns an EquaSet formed from this EquaSet 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.
U
the type of the second half of the returned pairs
that
The iterable providing the second half of each result pair
returns
a Set containing pairs consisting of corresponding elements of this EquaSet and that. The length of the returned collection is the minimum of the lengths of thisEquaSet and that.

Definition Classes
TreeEquaSet → EquaSet
def zipAll[U, T1 >: T](that: GenIterable[U], thisElem: T1, thatElem: U): Set[(T1, U)]

Returns an EquaSet formed from this EquaSet and another iterable collection by combining corresponding elements in pairs.
Returns an EquaSet formed from this EquaSet 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.
that
the iterable providing the second half of each result pair
thisElem
the element to be used to fill up the result if this EquaSet is shorter than that.
thatElem
the element to be used to fill up the result if that is shorter than this EquaSet.
returns
a new collection of type That containing pairs consisting of corresponding elements of this EquaSet and that. The length of the returned collection is the maximum of the lengths of this EquaSet and that. If this EquaSet is shorter than that, thisElem values are used to pad the result. If that is shorter than this EquaSet, thatElem values are used to pad the result.

Definition Classes
TreeEquaSet → EquaSet
def zipWithIndex: Set[(T, Int)]

Zips this EquaSet with its indices.
Zips this EquaSet with its indices.
returns
A new EquaSet containing pairs consisting of all elements of this EquaSet paired with their index. Indices start at 0.
Definition Classes
TreeEquaSet → EquaSet
Example:
1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
def |(that: SortedEquaSets.EquaSet): TreeEquaSet

Computes the union between this SortedEquaSet and another EquaSet.
Computes the union between this SortedEquaSet and another EquaSet.
Note: Same as union.
that
the EquaSet to form the union with.
returns
a new SortedEquaSet consisting of all elements that are in this SortedEquaSet or in the given EquaSet that.

Definition Classes
TreeEquaSet → SortedEquaSet → EquaSet

class TreeEquaSet extends SortedEquaSet

Type Members

class WithFilter extends AnyRef

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def &(that: SortedEquaSets.EquaSet): TreeEquaSet

def &~(that: SortedEquaSets.EquaSet): TreeEquaSet

def +(elem1: T, elem2: T, elems: T*): TreeEquaSet

def +(elem: T): TreeEquaSet

def ++(that: SortedEquaSets.EquaSet): TreeEquaSet

def ++(elems: GenTraversableOnce[T]): TreeEquaSet

def -(elem1: T, elem2: T, elems: T*): TreeEquaSet

def -(elem: T): TreeEquaSet

def --(that: SortedEquaSets.EquaSet): TreeEquaSet

def --(elems: GenTraversableOnce[T]): TreeEquaSet

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

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

final def ==(arg0: Any): Boolean

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

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

def addString(b: StringBuilder): StringBuilder

def aggregate[B](z: ⇒ B)(seqop: (B, T) ⇒ B, combop: (B, B) ⇒ B): B

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

def apply(elem: T): Boolean

final def asInstanceOf[T0]: T0

def canEqual(that: Any): Boolean

def clone(): AnyRef

def collect(pf: PartialFunction[T, T]): TreeEquaSet

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

def contains[U](elem: U)(implicit ev: <:<[U, T]): Boolean

def copyToArray(xs: Array[SortedEquaSets.EquaBox], start: Int, len: Int): Unit

def copyToArray(xs: Array[SortedEquaSets.EquaBox], start: Int): Unit

def copyToArray(xs: Array[SortedEquaSets.EquaBox]): Unit

def copyToBuffer(dest: Buffer[SortedEquaSets.EquaBox]): Unit

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

def diff(that: SortedEquaSets.EquaSet): TreeEquaSet

def drop(n: Int): TreeEquaSet

def dropRight(n: Int): TreeEquaSet

def dropWhile(pred: (T) ⇒ Boolean): TreeEquaSet

def enclosingEquaSets: SortedEquaSets[T]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def exists(pred: (T) ⇒ Boolean): Boolean

def filter(pred: (T) ⇒ Boolean): TreeEquaSet

def filterNot(pred: (T) ⇒ Boolean): SortedEquaSet

def finalize(): Unit

def find(pred: (T) ⇒ Boolean): Option[T]

def flatMap(f: (T) ⇒ SortedEquaSets.EquaSet): TreeEquaSet

def fold[T1 >: T](z: T1)(op: (T1, T1) ⇒ T1): T1

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

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

def forall(pred: (T) ⇒ Boolean): Boolean

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

final def getClass(): Class[_]

def groupBy[K](f: (T) ⇒ K): GenMap[K, TreeEquaSet]

def grouped(size: Int): Iterator[TreeEquaSet]

def hasDefiniteSize: Boolean

def hashCode(): Int

def head: T

def headOption: Option[T]

def init: TreeEquaSet

def inits: Iterator[TreeEquaSet]

def intersect(that: SortedEquaSets.EquaSet): TreeEquaSet

def into[U](thatEquaSets: SortedEquaSets[U]): TreeEquaBridge[T]

def into[U](thatEquaSets: EquaSets[U]): EquaBridge[T]

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isTraversableAgain: Boolean

def iterator: Iterator[T]

def last: T

def lastOption: Option[T]

def map(f: (T) ⇒ T): TreeEquaSet

def max[T1 >: T](implicit ord: Ordering[T1]): T

def maxBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def min[T1 >: T](implicit ord: Ordering[T1]): T

def minBy[B](f: (T) ⇒ B)(implicit cmp: Ordering[B]): T

def mkString: String

def mkString(sep: String): String