EquaSet

Type Members

class WithFilter extends AnyRef

A class supporting filtered operations.

Abstract Value Members

abstract def &(that: EquaSet): EquaSet

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

The difference of this EquaSet and another EquaSet.
The difference of this EquaSet and another EquaSet.
Note: Same as diff.
that
the EquaSet of elements to exclude.
returns
an EquaSet containing those elements of this EquaSet that are not also contained in the given EquaSet that.
abstract def +(elem1: T, elem2: T, elems: T*): EquaSet

Creates a new EquaSet with additional elements.
Creates a new EquaSet 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 EquaSet with the given elements added.
abstract def +(elem: T): EquaSet

Creates a new EquaSet with an additional element, unless the element is already present.
Creates a new EquaSet with an additional element, unless the element is already present.
elem
the element to be added
returns
a new EquaSet that contains all elements of this EquaSet and that also contains elem.
abstract def ++(that: EquaSet): EquaSet

Creates a new EquaSet by adding elements contained in another EquaSet.
Creates a new EquaSet by adding elements contained in another EquaSet.
that
the other EquaSet containing the added elements.
returns
a new EquaSet with the given elements added.
abstract def ++(elems: GenTraversableOnce[T]): EquaSet

Creates a new EquaSet by adding all elements contained in another collection to this EquaSet.
Creates a new EquaSet by adding all elements contained in another collection to this EquaSet.
elems
the collection containing the added elements.
returns
a new EquaSet with the given elements added.
abstract def -(elem1: T, elem2: T, elems: T*): EquaSet

Creates a new EquaSet from this EquaSet with some elements removed.
Creates a new EquaSet from this EquaSet 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 EquaSet that contains all elements of the current EquaSet except one less occurrence of each of the given elements.
abstract def -(elem: T): EquaSet

Creates a new EquaSet with a given element removed from this EquaSet.
Creates a new EquaSet with a given element removed from this EquaSet.
elem
the element to be removed
returns
a new EquaSet that contains all elements of this EquaSet but that does not contain elem.
abstract def --(that: EquaSet): EquaSet

Creates a new EquaSet from this EquaSet by removing all elements of another EquaSet
Creates a new EquaSet from this EquaSet by removing all elements of another EquaSet
that
the other EquaSet containing the removed elements.
returns
a new EquaSet that contains all elements of the current EquaSet minus elements contained in the passed in EquaSet.
abstract def --(elems: GenTraversableOnce[T]): EquaSet

Creates a new EquaSet from this EquaSet by removing all elements of another collection.
Creates a new EquaSet from this EquaSet by removing all elements of another collection.
elems
the collection containing the removed elements.
returns
a new EquaSet that contains all elements of the current EquaSet except one less occurrence of each of the elements of elems.
abstract def /:[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.
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 EquaSet, 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 EquaSet.
abstract def :\[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.
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 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.
abstract 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.
abstract 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.
abstract 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.
abstract 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
abstract 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
EquaSet → Function1
abstract def canEqual(that: Any): Boolean

Definition Classes
Equals
abstract def collect(pf: PartialFunction[T, T]): EquaSet

Builds a new collection by applying a partial function to all elements of this EquaSet on which the function is defined.
Builds a new collection by applying a partial function to all elements of this EquaSet on which the function is defined.
pf
the partial function which filters and maps the EquaSet.
returns
a new EquaSet 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.
abstract def contains[U](elem: U)(implicit ev: <:<[U, T]): Boolean
abstract def copyInto(thatEquaPath: EquaPath[T]): EquaSet
abstract def copyToArray(xs: Array[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
abstract def copyToArray(xs: Array[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.
abstract def copyToArray(xs: Array[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.
abstract def copyToBuffer(dest: Buffer[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.
abstract 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.
abstract def diff(that: EquaSet): EquaSet

Computes the difference of this EquaSet and another EquaSet.
Computes the difference of this EquaSet and another EquaSet.
that
the EquaSet of elements to exclude.
returns
an EquaSet containing those elements of this EquaSet that are not also contained in the given EquaSet that.
abstract def drop(n: Int): EquaSet

Selects all elements except first n ones.
Selects all elements except first n ones.
n
the number of elements to drop from this EquaSet.
returns
an EquaSet consisting of all elements of this EquaSet except the first n ones, or else the empty EquaSet, if this EquaSet has less than n elements.
abstract def dropRight(n: Int): EquaSet

Selects all elements except last n ones.
Selects all elements except last n ones.
n
The number of elements to take
returns
an EquaSet consisting of all elements of this EquaSet except the last n ones, or else the empty EquaSet, if this EquaSet has less than n elements.
abstract def dropWhile(pred: (T) ⇒ Boolean): EquaSet

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 EquaSet whose first element does not satisfy the predicate p.
abstract 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
abstract def filter(pred: (T) ⇒ Boolean): EquaSet

Selects all elements of this EquaSet which satisfy a predicate.
Selects all elements of this EquaSet which satisfy a predicate.
pred
the predicate used to test elements.
returns
a new EquaSet consisting of all elements of this EquaSet that satisfy the given predicate pred. Their order may not be preserved.
abstract def filterNot(pred: (T) ⇒ Boolean): EquaSet

Selects all elements of this EquaPath which do not satisfy a predicate.
Selects all elements of this EquaPath which do not satisfy a predicate.
pred
the predicate used to test elements.
returns
a new EquaPath consisting of all elements of this EquaPath that do not satisfy the given predicate pred. Their order may not be preserved.
abstract 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.
abstract def flatMap(f: (T) ⇒ EquaSet): EquaSet

Builds a new EquaSet by applying a function to all elements of this EquaSet and using the elements of the resulting EquaSet.
Builds a new EquaSet by applying a function to all elements of this EquaSet and using the elements of the resulting EquaSet.
f
the function to apply to each element.
returns
a new EquaSet resulting from applying the given EquaSet-valued function f to each element of this EquaSet and concatenating the results.
abstract 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
abstract 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.
abstract 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.
abstract 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.
abstract 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.
abstract def groupBy[K](f: (T) ⇒ K): GenMap[K, EquaSet]

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

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

See also
scala.collection.Iterator, method grouped
abstract def hasDefiniteSize: Boolean
abstract def head: T

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

Exceptions thrown
`NoSuchElementException`
if the EquaSet is empty.
abstract 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.
abstract def init: EquaSet

Selects all elements except the last.
Selects all elements except the last.
returns
an EquaSet consisting of all elements of this EquaSet except the last one.

Exceptions thrown
`UnsupportedOperationException`
if the EquaSet is empty.
abstract def inits: Iterator[EquaSet]

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

Computes the intersection between this EquaSet and another EquaSet.
Computes the intersection between this EquaSet and another EquaSet.
that
the EquaSet to intersect with.
returns
a new EquaSet consisting of all elements that are both in this EquaSet and in the given EquaSet that.
abstract def into[U](thatEquaPath: EquaPath[U]): EquaBridge[T]

Make an EquaBridge between this EquaSet and the given thatEquaPath.
Make an EquaBridge between this EquaSet and the given thatEquaPath. EquaBridge enables this EquaSet to transform into thatEquaPath.EquaSet through collect, map, flatMap, flatten, scanLeft, scanRight.
U
the type of thatEquaPath
thatEquaPath
that EquaPath to bridge to
returns
an instance of thatEquaPath.EquaBridge
abstract def isEmpty: Boolean

Tests if this EquaSet is empty.
Tests if this EquaSet is empty.
returns
true if there is no element in the set, false otherwise.
abstract def iterator: Iterator[T]

Get an instance of Iterator for elements of this EquaSet.
Get an instance of Iterator for elements of this EquaSet.
returns
an instance of Iterator for elements of this EquaSet
abstract def last: T

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

Exceptions thrown
NoSuchElementException
If the EquaSet is empty.
abstract 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.
abstract def map(f: (T) ⇒ T): EquaSet

Builds a new EquaSet by applying a function to all elements of this EquaSet.
Builds a new EquaSet by applying a function to all elements of this EquaSet.
f
the function to apply to each element.
returns
a new EquaSet resulting from applying the given function f to each element of this EquaSet and collecting the results.
abstract 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.
abstract 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.
abstract 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
abstract 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.
abstract 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.
abstract 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.
Example:
1. EquaSet(1, 2, 3).mkString("|") = "1|2|3"
abstract 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.
Example:
1. EquaSet(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
abstract 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.
abstract def partition(pred: (T) ⇒ Boolean): (EquaSet, EquaSet)

Partitions this EquaSet in two EquaSets according to a predicate.
Partitions this EquaSet in two EquaSets according to a predicate.
pred
the predicate on which to partition.
returns
a pair of EquaSets: the first EquaSet consists of all elements that satisfy the predicate p and the second EquaSet consists of all elements that don't. The relative order of the elements in the resulting EquaSets may not be preserved.
abstract val path: EquaPath.this.type
abstract 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.
abstract 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.

Exceptions thrown
UnsupportedOperationException
if this EquaSet is empty.
abstract 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.
Exceptions thrown
`UnsupportedOperationException`
if this EquaSet is empty.
abstract 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.
abstract 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.
abstract 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.
Exceptions thrown
`UnsupportedOperationException`
if this EquaSet is empty.
abstract 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.
abstract def repr: Set[EquaBox]

The Set[EquaBox] underlying this EquaSet object.
abstract 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.
abstract def scanLeft(z: T)(op: (T, T) ⇒ T): EquaSet

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
EquaSet with intermediate results
abstract def scanRight(z: T)(op: (T, T) ⇒ T): EquaSet

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:
```
`EquaSet`(1, 2, 3, 4).scanRight(0)(_ + _) == `EquaSet`(10, 9, 7, 4, 0)
```
z
the initial value
op
the binary operator applied to the intermediate result and the element
returns
EquaSet with intermediate results
abstract def size: Int

The size of this EquaSet.
The size of this EquaSet.
returns
the number of elements in this EquaSet.
abstract def slice(unc_from: Int, unc_until: Int): EquaSet

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.
abstract def sliding(size: Int, step: Int): Iterator[EquaSet]

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 EquaSets of size size, except the last and the only element will be truncated if there are fewer elements than size.

See also
scala.collection.Iterator, method sliding
abstract def sliding(size: Int): Iterator[EquaSet]

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.

See also
scala.collection.Iterator, method sliding
abstract def span(pred: (T) ⇒ Boolean): (EquaSet, EquaSet)

Splits this EquaSet into a prefix/suffix pair according to a predicate.
Splits this EquaSet 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 EquaSet whose elements all satisfy p, and the rest of this EquaSet.
abstract def splitAt(n: Int): (EquaSet, EquaSet)

Splits this EquaSet into two at a given position.
Splits this EquaSet 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 EquaSets consisting of the first n elements of this EquaSet, and the other elements.
abstract 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.
abstract def subsetOf(that: 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.
abstract def subsets: Iterator[EquaSet]

An iterator over all subsets of this set.
An iterator over all subsets of this set.
returns
the iterator.
abstract def subsets(len: Int): Iterator[EquaSet]

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.
abstract 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.
abstract def tail: EquaSet

Selects all elements except the first.
Selects all elements except the first.
returns
an EquaSet consisting of all elements of this EquaSet except the first one.

Exceptions thrown
`UnsupportedOperationException`
if the EquaSet is empty.
abstract def tails: Iterator[EquaSet]

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

Selects first n elements.
Selects first n elements.
n
the number of elements to take from this EquaSet.
returns
an EquaSet consisting only of the first n elements of this EquaSet, or else the whole EquaSet, if it has less than n elements.
abstract def takeRight(n: Int): EquaSet

Selects last n elements.
Selects last n elements.
n
the number of elements to take
returns
an EquaSet consisting only of the last n elements of this EquaSet, or else the whole EquaSet, if it has less than n elements.
abstract def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, EquaBox, Col[EquaBox]]): Col[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.
abstract 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.
abstract 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.
abstract def toEquaBoxArray: Array[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.
abstract def toEquaBoxBuffer: Buffer[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.
abstract def toEquaBoxIndexedSeq: IndexedSeq[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.
abstract def toEquaBoxIterable: GenIterable[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.
abstract def toEquaBoxIterator: Iterator[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.
abstract def toEquaBoxList: List[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.
abstract def toEquaBoxParArray: ParArray[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.
abstract def toEquaBoxSeq: GenSeq[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.
abstract def toEquaBoxSet: Set[EquaBox]

Converts this EquaSet to a set of EquaBox.
Converts this EquaSet to a set of EquaBox.
returns
a set containing all elements of this EquaSet, boxed in EquaBox.
abstract def toEquaBoxStream: Stream[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.
abstract def toEquaBoxTraversable: GenTraversable[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.
abstract def toEquaBoxVector: Vector[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.
abstract 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.
abstract 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.
abstract 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.
abstract 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.
abstract 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.
abstract 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.
abstract 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.
abstract def toSet: Set[T]

Converts this EquaSet to a set.
Converts this EquaSet to a set.
returns
a set containing all elements of this EquaSet.
abstract 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.
abstract 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.
abstract 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.
abstract def transpose[B](implicit asTraversable: (T) ⇒ GenTraversableOnce[B]): EquaSet

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

val ys = Vector(
List(1, 2, 3),
List(4, 5, 6)).transpose
// ys == Vector(
// 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 EquaSet is a Traversable.
returns
a two-dimensional EquaSet of ${coll}s which has as nth row the nth column of this EquaSet.

Exceptions thrown
`IllegalArgumentException`
if all collections in this EquaSet are not of the same size.
abstract def union(that: EquaSet): EquaSet

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.
abstract def unzip[T1, T2](t1EquaPath: EquaPath[T1], t2EquaPath: EquaPath[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.
abstract def unzip3[T1, T2, T3](t1EquaPath: EquaPath[T1], t2EquaPath: EquaPath[T2], t3EquaPath: EquaPath[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.
abstract def view(from: Int, until: Int): TraversableView[EquaBox, Set[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.
abstract def view: TraversableView[EquaBox, Set[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.
abstract 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.
abstract 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.
abstract 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.
Example:
1. List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
abstract def |(that: EquaSet): EquaSet

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

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

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

Definition Classes
Function1
Annotations
@unspecialized()
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[A](g: (A) ⇒ T): (A) ⇒ Boolean

Definition Classes
Function1
Annotations
@unspecialized()
final def eq(arg0: AnyRef): Boolean

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

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
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.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
Function1 → AnyRef → Any
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.

trait EquaSet extends (T) ⇒ Boolean with Equals

Type Members

class WithFilter extends AnyRef

Abstract Value Members

abstract def &(that: EquaSet): EquaSet

abstract def &~(that: EquaSet): EquaSet

abstract def +(elem1: T, elem2: T, elems: T*): EquaSet

abstract def +(elem: T): EquaSet

abstract def ++(that: EquaSet): EquaSet

abstract def ++(elems: GenTraversableOnce[T]): EquaSet

abstract def -(elem1: T, elem2: T, elems: T*): EquaSet

abstract def -(elem: T): EquaSet

abstract def --(that: EquaSet): EquaSet

abstract def --(elems: GenTraversableOnce[T]): EquaSet

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

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

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

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

abstract def addString(b: StringBuilder): StringBuilder

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

abstract def apply(elem: T): Boolean

abstract def canEqual(that: Any): Boolean

abstract def collect(pf: PartialFunction[T, T]): EquaSet

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

abstract def copyInto(thatEquaPath: EquaPath[T]): EquaSet

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

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

abstract def copyToArray(xs: Array[EquaBox]): Unit

abstract def copyToBuffer(dest: Buffer[EquaBox]): Unit

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

abstract def diff(that: EquaSet): EquaSet

abstract def drop(n: Int): EquaSet

abstract def dropRight(n: Int): EquaSet

abstract def dropWhile(pred: (T) ⇒ Boolean): EquaSet

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

abstract def filter(pred: (T) ⇒ Boolean): EquaSet

abstract def filterNot(pred: (T) ⇒ Boolean): EquaSet

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

abstract def flatMap(f: (T) ⇒ EquaSet): EquaSet

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

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

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

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

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

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

abstract def grouped(size: Int): Iterator[EquaSet]

abstract def hasDefiniteSize: Boolean

abstract def head: T

abstract def headOption: Option[T]

abstract def init: EquaSet

abstract def inits: Iterator[EquaSet]

abstract def intersect(that: EquaSet): EquaSet

abstract def into[U](thatEquaPath: EquaPath[U]): EquaBridge[T]

abstract def isEmpty: Boolean

abstract def iterator: Iterator[T]

abstract def last: T

abstract def lastOption: Option[T]

abstract def map(f: (T) ⇒ T): EquaSet

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

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

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

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

abstract def mkString: String

abstract def mkString(sep: String): String

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

abstract def nonEmpty: Boolean

abstract def partition(pred: (T) ⇒ Boolean): (EquaSet, EquaSet)

abstract val path: EquaPath.this.type

abstract def product[T1 >: T](implicit num: Numeric[T1]): T1

abstract def reduce[T1 >: T](op: (T1, T1) ⇒ T1): T1

abstract def reduceLeft[T1 >: T](op: (T1, T) ⇒ T1): T1

abstract def reduceLeftOption[T1 >: T](op: (T1, T) ⇒ T1): Option[T1]

abstract def reduceOption[T1 >: T](op: (T1, T1) ⇒ T1): Option[T1]

abstract def reduceRight[T1 >: T](op: (T, T1) ⇒ T1): T1

abstract def reduceRightOption[T1 >: T](op: (T, T1) ⇒ T1): Option[T1]

abstract def repr: Set[EquaBox]

abstract def sameElements[T1 >: T](that: GenIterable[T1]): Boolean

abstract def scanLeft(z: T)(op: (T, T) ⇒ T): EquaSet

abstract def scanRight(z: T)(op: (T, T) ⇒ T): EquaSet