A class supporting filtered operations.
Computes the intersection between this SortedEquaSet and another EquaSet.
Computes the intersection between this SortedEquaSet and another EquaSet.
Note: Same as intersect.
the EquaSet to intersect with.
a new SortedEquaSet consisting of all elements that are both in this
SortedEquaSet and in the given EquaSet that.
The difference of this SortedEquaSet and another EquaSet.
The difference of this SortedEquaSet and another EquaSet.
Note: Same as diff.
the EquaSet of elements to exclude.
a SortedEquaSet containing those elements of this
SortedEquaSet that are not also contained in the given EquaSet that.
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.
the first element to add.
the second element to add.
the remaining elements to add.
a new SortedEquaSet with the given elements added.
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.
the element to be added
a new SortedEquaSet that contains all elements of this SortedEquaSet and that also
contains elem.
Creates a new SortedEquaSet by adding elements contained in another EquaSet.
Creates a new SortedEquaSet by adding elements contained in another EquaSet.
the other EquaSet containing the added elements.
a new SortedEquaSet with the given elements added.
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.
the collection containing the added elements.
a new SortedEquaSet with the given elements added.
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.
the first element to remove.
the second element to remove.
the remaining elements to remove.
a new SortedEquaSet that contains all elements of the current SortedEquaSet
except one less occurrence of each of the given elements.
Creates a new SortedEquaSet with a given element removed from this SortedEquaSet.
Creates a new SortedEquaSet with a given element removed from this SortedEquaSet.
the element to be removed
a new SortedEquaSet that contains all elements of this SortedEquaSet but that does not
contain elem.
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
the other EquaSet containing the removed elements.
a new SortedEquaSet that contains all elements of the current EquaSet minus elements contained in the passed in EquaSet.
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.
the collection containing the removed elements.
a new SortedEquaSet that contains all elements of the current SortedEquaSet
except one less occurrence of each of the elements of elems.
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
the result type of the binary operator.
the start value.
the binary operator.
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 x1, ..., xn are the elements of this SortedEquaSet.
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
the result type of the binary operator.
the start value
the binary operator
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 x1, ..., xn are the elements of this SortedEquaSet.
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)
the string builder to which elements are appended.
the starting string.
the separator string.
the ending string.
the string builder b to which elements were appended.
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
the string builder to which elements are appended.
the separator string.
the string builder b to which elements were appended.
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
the string builder to which elements are appended.
the string builder b to which elements were appended.
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).
the type of accumulated results
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
an operator used to accumulate results within a partition
an associative operator used to combine results from different partitions
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.
the element to test for membership.
true if elem is contained in this set, false otherwise.
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.
the partial function which filters and maps the SortedEquaSet.
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.
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.
the array to fill.
the starting index.
the length of elements to copy
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.
the array to fill.
the starting index.
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.
the array to fill.
Copies all elements of this EquaSet to a buffer.
Copies all elements of this EquaSet to a buffer.
The buffer to which elements are copied.
Counts the number of elements in the EquaSet which satisfy a predicate.
Counts the number of elements in the EquaSet which satisfy a predicate.
the predicate used to test elements.
the number of elements satisfying the predicate p.
Computes the difference of this SortedEquaSet and another SortedEquaSet.
Computes the difference of this SortedEquaSet and another SortedEquaSet.
the EquaSet of elements to exclude.
a SortedEquaSet containing those elements of this
SortedEquaSet that are not also contained in the given EquaSet that.
Selects all elements except first n ones.
Selects all elements except first n ones.
the number of elements to drop from this SortedEquaSet.
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.
Selects all elements except last n ones.
Selects all elements except last n ones.
The number of elements to take
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.
Drops longest prefix of elements that satisfy a predicate.
Drops longest prefix of elements that satisfy a predicate.
The predicate used to test elements.
the longest suffix of this SortedEquaSet whose first element
does not satisfy the predicate p.
Check if this EquaSet contains element which satisfy a predicate.
Check if this EquaSet contains element which satisfy a predicate.
predicate predicate used to test elements
true if there's at least one element satisfy the given predicate pred
Selects all elements of this SortedEquaSet which satisfy a predicate.
Selects all elements of this SortedEquaSet which satisfy a predicate.
the predicate used to test elements.
a new SortedEquaSet consisting of all elements of this SortedEquaSet that satisfy the given
predicate pred.
Selects all elements of this SortedEquaSets which do not satisfy a predicate.
Selects all elements of this SortedEquaSets which do not satisfy a predicate.
the predicate used to test elements.
a new SortedEquaSets consisting of all elements of this SortedEquaSets that do not satisfy the given
predicate pred.
Finds the first element of the EquaSet satisfying a predicate, if any.
Finds the first element of the EquaSet satisfying a predicate, if any.
the predicate used to test elements.
an option value containing the first element in the EquaSet
that satisfies pred, or None if none exists.
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.
the function to apply to each element.
a new SortedEquaSet resulting from applying the given EquaSet-valued function
f to each element of this SortedEquaSet and concatenating the results.
Folds the elements of this EquaSet using the specified associative
binary operator.
Folds the elements of this EquaSet using the specified associative
binary operator.
a type parameter for the binary operator, a supertype of A.
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.)
a binary operator that must be associative
the result of applying fold operator op between all the elements and z
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.
the result type of the binary operator.
the start value.
the binary operator.
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 x1, ..., xn are the elements of this EquaSet.
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.
the result type of the binary operator.
the start value.
the binary operator.
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 x1, ..., xn are the elements of this EquaSet.
Check if all elements in this EquaSet satisfy the predicate.
Check if all elements in this EquaSet satisfy the predicate.
the predicate to check for
true if all elements satisfy the predicate, false otherwise.
Applies a function f to all elements of this EquaSet.
Applies a function f to all elements of this EquaSet.
the type parameter describing the result of function f.
This result will always be ignored. Typically U is Unit,
but this is not necessary.
the function that is applied for its side-effect to every element.
The result of function f is discarded.
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.
the type of keys returned by the discriminator function.
the discriminator function.
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.
Partitions elements in fixed size SortedEquaSets.
Partitions elements in fixed size SortedEquaSets.
the number of elements per group
An iterator producing SortedEquaSets of size size, except the
last will be less than size size if the elements don't divide evenly.
scala.collection.Iterator, method grouped
Selects the first element of this EquaSet.
Selects the first element of this EquaSet.
the first element of this EquaSet.
if the EquaSet is empty.
Optionally selects the first element.
Optionally selects the first element.
the first element of this EquaSet if it is nonempty,
None if it is empty.
Selects all elements except the last.
Selects all elements except the last.
a SortedEquaSet consisting of all elements of this SortedEquaSet
except the last one.
if the SortedEquaSet is empty.
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.
an iterator over all the inits of this SortedEquaSet
SortedEquaSet(1,2,3).inits = Iterator(SortedEquaSet(1,2,3), SortedEquaSet(1,2), SortedEquaSet(1), SortedEquaSet())
Computes the intersection between this SortedEquaSet and another EquaSet.
Computes the intersection between this SortedEquaSet and another EquaSet.
the EquaSet to intersect with.
a new SortedEquaSet consisting of all elements that are both in this
SortedEquaSet and in the given EquaSet that.
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.
the type of thatEquaSets
that SortedEquaSets to bridge to
an instance of thatEquaSets.SortedEquaBridge
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.
the type of thatEquaSets
that EquaSets to bridge to
an instance of thatEquaSets.EquaBridge
Tests if this SortedEquaSet is empty.
Tests if this SortedEquaSet is empty.
true if there is no element in the set, false otherwise.
Tests whether this EquaSet can be repeatedly traversed.
Tests whether this EquaSet can be repeatedly traversed. Always
true for EquaSet unless overridden.
true unless overriden.
Get an instance of Iterator for elements of this SortedEquaSet.
Get an instance of Iterator for elements of this SortedEquaSet.
an instance of Iterator for elements of this SortedEquaSet
Selects the last element.
Selects the last element.
The last element of this EquaSet.
If the EquaSet is empty.
Optionally selects the last element.
Optionally selects the last element.
the last element of this EquaSet if it is nonempty,
None if it is empty.
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.
the function to apply to each element.
a new SortedEquaSet resulting from applying the given function
f to each element of this SortedEquaSet and collecting the results.
Finds the largest element.
Finds the largest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the largest element of this EquaSet.
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.
The result type of the function f.
The measuring function.
An ordering to be used for comparing elements.
the first element of this EquaSet with the largest value measured by function f.
Finds the smallest element.
Finds the smallest element.
The type over which the ordering is defined.
An ordering to be used for comparing elements.
the smallest element of this EquaSet
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.
The result type of the function f.
The measuring function.
An ordering to be used for comparing elements.
the first element of this EquaSet with the smallest value measured by function f.
Displays all elements of this EquaSet in a string.
Displays all elements of this EquaSet in a string.
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.
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.
the separator string.
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.
EquaSet(1, 2, 3).mkString("|") = "1|2|3"
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.
the starting string.
the separator string.
the ending string.
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.
EquaSet(1, 2, 3).mkString("(", "; ", ")") = "(1; 2; 3)"
Tests whether the EquaSet is not empty.
Tests whether the EquaSet is not empty.
true if the EquaSet contains at least one element, false otherwise.
Partitions this SortedEquaSet in two SortedEquaSets according to a predicate.
Partitions this SortedEquaSet in two SortedEquaSets according to a predicate.
the predicate on which to partition.
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.
Multiplies up the elements of this collection.
Multiplies up the elements of this collection.
the result type of the * operator.
an implicit parameter defining a set of numeric operations
which includes the * operator to be used in forming the product.
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.
Reduces the elements of this EquaSet using the specified associative binary operator.
Reduces the elements of this EquaSet using the specified associative binary operator.
A type parameter for the binary operator, a supertype of T.
A binary operator that must be associative.
The result of applying reduce operator op between all the elements if the EquaSet is nonempty.
if this EquaSet is empty.
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.
the result type of the binary operator.
the binary operator.
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 x1, ..., xn are the elements of this EquaSet.
if this EquaSet is empty.
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.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceLeft(op) is this EquaSet is nonempty,
None otherwise.
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.
A type parameter for the binary operator, a supertype of T.
A binary operator that must be associative.
An option value containing result of applying reduce operator op between all
the elements if the collection is nonempty, and None otherwise.
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.
the result type of the binary operator.
the binary operator.
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 x1, ..., xn are the elements of this EquaSet.
if this EquaSet is empty.
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.
the result type of the binary operator.
the binary operator.
an option value containing the result of reduceRight(op) is this EquaSet is nonempty,
None otherwise.
The SortedSet[EquaBox] underlying this SortedEquaSet object.
The SortedSet[EquaBox] underlying this SortedEquaSet object.
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.
the type of the elements of collection that.
the collection to compare with.
true, if both collections contain the same elements in the same order, false otherwise.
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.
the initial value
the binary operator applied to the intermediate result and the element
SortedEquaSet with intermediate results
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)
the initial value
the binary operator applied to the intermediate result and the element
SortedEquaSet with intermediate results
The size of this SortedEquaSet.
The size of this SortedEquaSet.
the number of elements in this SortedEquaSet.
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
the lowest index to include from this EquaSet.
the lowest index to EXCLUDE from this EquaSet.
an EquaSet containing the elements greater than or equal to
index from extending up to (but not including) index until
of this 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.)
the number of elements per group
the distance between the first elements of successive groups (defaults to 1)
An iterator producing SortedEquaSets of size size, except the
last and the only element will be truncated if there are
fewer elements than size.
scala.collection.Iterator, method sliding
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.)
the number of elements per group
An iterator producing SortedEquaSets of size size, except the
last and the only element will be truncated if there are
fewer elements than size.
scala.collection.Iterator, method sliding
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.
the test predicate
a pair consisting of the longest prefix of this SortedEquaSet whose
elements all satisfy p, and the rest of this SortedEquaSet.
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).
the position at which to split.
a pair of SortedEquaSets consisting of the first n
elements of this SortedEquaSet, and the other elements.
Defines the prefix of this object's toString representation.
Defines the prefix of this object's toString representation.
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.
Tests whether this set is a subset of another set.
Tests whether this set is a subset of another set.
the set to test.
true if this set is a subset of that, i.e. if
every element of this set is also an element of that.
An iterator over all subsets of this set.
An iterator over all subsets of this set.
the iterator.
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.
the size of the subsets.
the iterator.
Sums up the elements of this collection.
Sums up the elements of this collection.
the result type of the + operator.
an implicit parameter defining a set of numeric operations
which includes the + operator to be used in forming the sum.
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.
Selects all elements except the first.
Selects all elements except the first.
a SortedEquaSet consisting of all elements of this SortedEquaSet
except the first one.
if the SortedEquaSet is empty.
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.
an iterator over all the tails of this SortedEquaSet
SortedEquaSet(1,2,3).tails = Iterator(SortedEquaSet(1,2,3), SortedEquaSet(2,3), SortedEquaSet(3), SortedEquaSet())
Selects first n elements.
Selects first n elements.
the number of elements to take from this SortedEquaSet.
a SortedEquaSet consisting only of the first n elements of this SortedEquaSet,
or else the whole SortedEquaSet, if it has less than n elements.
Selects last n elements.
Selects last n elements.
the number of elements to take
a SortedEquaSet consisting only of the last n elements of this SortedEquaSet, or else the
whole SortedEquaSet, if it has less than n elements.
Converts this EquaSet into another by copying all elements.
Converts this EquaSet into another by copying all elements.
The collection type to build.
a new collection containing all elements of this EquaSet.
Converts this EquaSet to an array.
Converts this EquaSet to an array.
an array containing all elements of this EquaSet.
Uses the contents of this EquaSet to create a new mutable buffer.
Uses the contents of this EquaSet to create a new mutable buffer.
a buffer containing all elements of this EquaSet.
Converts this EquaSet to an array of EquaBoxes containing the elements.
Converts this EquaSet to an array of EquaBoxes containing the elements.
an array containing all elements of this EquaSet, boxed in 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.
a buffer containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to an indexed sequence containing EquaBoxes of elements.
Converts this EquaSet to an indexed sequence containing EquaBoxes of elements.
an indexed sequence containing all elements of this EquaSet, boxed in 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).
an Iterable containing all elements of this EquaSet, boxed in 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.
an Iterator containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to a list of EquaBox.
Converts this EquaSet to a list of EquaBox.
a list containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to a ParArray containing EquaBoxes of elements.
Converts this EquaSet to a ParArray containing EquaBoxes of elements.
a ParArray containing all elements of this EquaSet, boxed in 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.
a sequence containing all elements of this EquaSet, boxed in EquaBox.
Converts this SortedEquaSet to a set of EquaBox.
Converts this SortedEquaSet to a set of EquaBox.
a set containing all elements of this SortedEquaSet, boxed in EquaBox.
Converts this EquaSet to a stream of EquaBoxes containing the elements.
Converts this EquaSet to a stream of EquaBoxes containing the elements.
a stream containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to a Traversable of EquaBoxes containing the elements.
Converts this EquaSet to a Traversable of EquaBoxes containing the elements.
a Traversable containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to a Vector of EquaBoxes containing the elements.
Converts this EquaSet to a Vector of EquaBoxes containing the elements.
a vector containing all elements of this EquaSet, boxed in EquaBox.
Converts this EquaSet to an indexed sequence.
Converts this EquaSet to an indexed sequence.
an indexed sequence containing all elements of this EquaSet.
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).
an Iterable containing all elements of this EquaSet.
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.
an Iterator containing all elements of this EquaSet.
Converts this EquaSet to a list.
Converts this EquaSet to a list.
a list containing all elements of this EquaSet.
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.
a map of type immutable.Map[K, V]
containing all key/value pairs of type (K, V) of this EquaSet.
Converts this EquaSet to a ParArray.
Converts this EquaSet to a ParArray.
a ParArray containing all elements of this EquaSet.
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.
a sequence containing all elements of this EquaSet.
Converts this SortedEquaSet to a set.
Converts this SortedEquaSet to a set.
a set containing all elements of this SortedEquaSet.
Converts this EquaSet to a stream.
Converts this EquaSet to a stream.
a stream containing all elements of this EquaSet.
Converts this EquaSet to a Traversable.
Converts this EquaSet to a Traversable.
a Traversable containing all elements of this EquaSet.
Converts this EquaSet to a Vector.
Converts this EquaSet to a Vector.
a vector containing all elements of this EquaSet.
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))
the type of the elements of each traversable collection.
an implicit conversion which asserts that the
element type of this SortedEquaSet is a Traversable.
a two-dimensional SortedEquaSet of ${coll}s which has as nth row
the nth column of this SortedEquaSet.
if all collections in this SortedEquaSet
are not of the same size.
Computes the union between of set and another set.
Computes the union between of set and another set.
the set to form the union with.
a new set consisting of all elements that are in this
set or in the given set that.
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))
the type of the first half of the element pairs
the type of the second half of the element pairs
an implicit conversion which asserts that the element type
of this EquaSet is a pair.
a pair of EquaSets, containing the first, respectively second
half of each element pair of this 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))
the type of the first member of the element triples
the type of the second member of the element triples
the type of the third member of the element triples
an implicit conversion which asserts that the element type
of this EquaSet is a triple.
a triple of EquaSets, containing the first, second, respectively
third member of each element triple of this EquaSet.
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
the index of the first element of the view
the index of the element following the view
a non-strict view of a slice of this EquaSet, starting at index from
and extending up to (but not including) index until.
Creates a non-strict view of this EquaSet.
Creates a non-strict view of this EquaSet.
a non-strict view of this EquaSet.
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.
the predicate used to test elements.
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.
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.
the type of the second half of the returned pairs
The iterable providing the second half of each result pair
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 this EquaSet and that.
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.
the iterable providing the second half of each result pair
the element to be used to fill up the result if this EquaSet is shorter than that.
the element to be used to fill up the result if that is shorter than this EquaSet.
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.
Zips this EquaSet with its indices.
Zips this EquaSet with its indices.
A new EquaSet containing pairs consisting of all elements of this
EquaSet paired with their index. Indices start at 0.
List("a", "b", "c").zipWithIndex = List(("a", 0), ("b", 1), ("c", 2))
Computes the union between this SortedEquaSet and another EquaSet.
Computes the union between this SortedEquaSet and another EquaSet.
Note: Same as union.
the EquaSet to form the union with.
a new SortedEquaSet consisting of all elements that are in this
SortedEquaSet or in the given EquaSet that.