Returns a new Chain containing the elements of this Chain followed by the elements of the passed GenTraversableOnce.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed GenTraversableOnce.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this Chain
and the passed GenTraversableOnce.
the element type of the returned Chain
the GenTraversableOnce to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Every.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Every.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this Chain and the passed Every.
the element type of the returned Chain
the Every to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Chain.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Chain.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this and the passed Chain.
the element type of the returned Chain
the Chain to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Returns a new Chain with the given element prepended.
Returns a new Chain with the given element prepended.
Note that :-ending operators are right associative. A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
the element to prepend to this Chain
a new Chain consisting of element followed by all elements of this Chain.
Fold left: applies a binary operator to a start value, z, and all elements of this Chain, going left to right.
Fold left: applies a binary operator to a start value, z, and all elements of this Chain, going left to right.
Note: /: is alternate syntax for the foldLeft method; z /: chain is the
same as chain foldLeft z.
the result of the binary operator
the start value
the binary operator
the result of inserting op between consecutive elements of this Chain, 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 Chain.
Returns a new Chain with the given element appended.
Returns a new Chain with the given element appended.
Note a mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
the element to append to this Chain
a new Chain consisting of all elements of this Chain followed by element.
Adds an element to the beginning of this Chain.
Adds an element to the beginning of this Chain.
Note that :-ending operators are right associative. A mnemonic for +: vs. :+ is: the COLon goes on the COLlection side.
the element to prepend to this Chain
a Chain that contains element as first element and that continues with this Chain.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed GenTraversableOnce.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed GenTraversableOnce.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this Chain
and the passed GenTraversableOnce.
the element type of the returned Chain
the GenTraversableOnce to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Every.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Every.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this and the passed Every.
the element type of the returned Chain
the Every to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Chain.
Returns a new Chain containing the elements of this Chain followed by the elements of the passed Chain.
The element type of the resulting Chain is the most specific superclass encompassing the element types of this and the passed Chain.
the element type of the returned Chain
the Chain to append
a new Chain that contains all the elements of this Chain followed by all elements of other.
Fold right: applies a binary operator to all elements of this Chain and a start value, going right to left.
Fold right: applies a binary operator to all elements of this Chain and a start value, going right to left.
Note: :\ is alternate syntax for the foldRight method; chain :\ z is the same
as chain foldRight z.
the result of the binary operator
the start value
the binary operator
the result of inserting op between consecutive elements of this Chain, 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 Chain.
Appends all elements of this Chain to a string builder using start, end, and separator strings.
Appends all elements of this Chain to a string builder using start, end, and separator strings. The written text will consist of a concatenation of
the string start; the result of invoking toString on all elements of this Chain,
separated by the string sep; and the string end
the string builder to which elements will be appended
the ending string
the separator string
the string builder, sb, to which elements were appended.
Appends all elements of this Chain to a string builder using a separator string.
Appends all elements of this Chain to a string builder using a separator string. The written text will consist of a concatenation of the
result of invoking toString
on of every element of this Chain, separated by the string sep.
the string builder to which elements will be appended
the separator string
the string builder, sb, to which elements were appended.
Appends all elements of this Chain to a string builder.
Appends all elements of this Chain to a string builder. The written text will consist of a concatenation of the result of invoking toString
on of every element of this Chain, without any separator string.
the string builder to which elements will be appended
the string builder, sb, to which elements were appended.
Selects an element by its index in the Chain.
Selects an element by its index in the Chain.
the element of this Chain at index idx, where 0 indicates the first element.
Finds the first element of this Chain for which the given partial function is defined, if any, and applies the partial function to it.
Finds the first element of this Chain for which the given partial function is defined, if any, and applies the partial function to it.
the partial function
an Option containing pf applied to the first element for which it is defined, or None if
the partial function was not defined for any element.
Indicates whether this Chain contains a given value as an element.
Indicates whether this Chain contains a given value as an element.
the element to look for
true if this Chain has an element that is equal (as determined by ==) to elem, false otherwise.
Indicates whether this Chain contains a given Chain as a slice.
Indicates whether this Chain contains a given Chain as a slice.
the Chain slice to look for
true if this Chain contains a slice with the same elements as that, otherwise false.
Indicates whether this Chain contains a given Every as a slice.
Indicates whether this Chain contains a given Every as a slice.
the Every slice to look for
true if this Chain contains a slice with the same elements as that, otherwise false.
Indicates whether this Chain contains a given GenSeq as a slice.
Indicates whether this Chain contains a given GenSeq as a slice.
the GenSeq slice to look for
true if this Chain contains a slice with the same elements as that, otherwise false.
Copies values of this Chain to an array.
Copies values of this Chain to an array. Fills the given array arr with at most len elements of this Chain, beginning at
index start. Copying will stop once either the end of the current Chain is reached, the end of the array is reached, or
len elements have been copied.
the array to fill
the starting index
the maximum number of elements to copy
Copies values of this Chain to an array.
Copies values of this Chain to an array. Fills the given array arr with values of this Chain, beginning at
index start. Copying will stop once either the end of the current Chain is reached, or the end of the array is reached.
the array to fill
the starting index
Copies values of this Chain to an array.
Copies values of this Chain to an array. Fills the given array arr with values of this Chain. Copying
will stop once either the end of the current Chain is reached, or the end of the array is reached.
the array to fill
Copies all elements of this Chain to a buffer.
Copies all elements of this Chain to a buffer.
the buffer to which elements are copied
Indicates whether every element of this Chain relates to the corresponding element of a given Chain by satisfying a given predicate.
Indicates whether every element of this Chain relates to the corresponding element of a given Chain by satisfying a given predicate.
the type of the elements of that
the Chain to compare for correspondence
the predicate, which relates elements from this and the passed Chain
true if this and the passed Chain have the same length and p(x, y) is true
for all corresponding elements x of this Chain and y of that, otherwise false.
Indicates whether every element of this Chain relates to the corresponding element of a given Every by satisfying a given predicate.
Indicates whether every element of this Chain relates to the corresponding element of a given Every by satisfying a given predicate.
the type of the elements of that
the Every to compare for correspondence
the predicate, which relates elements from this Chain and the passed Every
true if this Chain and the passed Every have the same length and p(x, y) is true
for all corresponding elements x of this Chain and y of that, otherwise false.
Indicates whether every element of this Chain relates to the corresponding element of a given GenSeq by satisfying a given predicate.
Indicates whether every element of this Chain relates to the corresponding element of a given GenSeq by satisfying a given predicate.
the type of the elements of that
the GenSeq to compare for correspondence
the predicate, which relates elements from this Chain and the passed GenSeq
true if this Chain and the passed GenSeq have the same length and p(x, y) is true
for all corresponding elements x of this Chain and y of that, otherwise false.
Counts the number of elements in this Chain that satisfy a predicate.
Counts the number of elements in this Chain that satisfy a predicate.
the predicate used to test elements.
the number of elements satisfying the predicate p.
Builds a new Chain from this Chain without any duplicate elements.
Builds a new Chain from this Chain without any duplicate elements.
A new Chain that contains the first occurrence of every element of this Chain.
Indicates whether this Chain ends with the given Chain.
Indicates whether this Chain ends with the given Chain.
the Chain to test
true if this Chain has that as a suffix, false otherwise.
Indicates whether this Chain ends with the given Every.
Indicates whether this Chain ends with the given Every.
the Every to test
true if this Chain has that as a suffix, false otherwise.
Indicates whether this Chain ends with the given GenSeq.
Indicates whether this Chain ends with the given GenSeq.
the sequence to test
true if this Chain has that as a suffix, false otherwise.
Indicates whether a predicate holds for at least one of the elements of this Chain.
Indicates whether a predicate holds for at least one of the elements of this Chain.
true if the given predicate p holds for some of the elements of this Chain, otherwise false.
Finds the first element of this Chain that satisfies the given predicate, if any.
Finds the first element of this Chain that satisfies the given predicate, if any.
the predicate used to test elements
an Some containing the first element in this Chain that satisfies p, or None if none exists.
Builds a new Chain by applying a function to all elements of this Chain and using the elements of the resulting Chains.
Builds a new Chain by applying a function to all elements of this Chain and using the elements of the resulting Chains.
the element type of the returned Chain
the function to apply to each element.
a new Chain containing elements obtained by applying the given function f to each element of this Chain and concatenating
the elements of resulting Chains.
Converts this Chain of Chains into a Chain
formed by the elements of the nested Chains.
Converts this Chain of Chains into a Chain
formed by the elements of the nested Chains.
Note: You cannot use this flatten method on a Chain that contains a GenTraversableOnces, because
if all the nested GenTraversableOnces were empty, you'd end up with an empty Chain.
a new Chain resulting from concatenating all nested Chains.
Folds the elements of this Chain using the specified associative binary operator.
Folds the elements of this Chain using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
a type parameter for the binary operator, a supertype of T.
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 Chain, going left to right.
Applies a binary operator to a start value and all elements of this Chain, 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 Chain, 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 Chain.
Applies a binary operator to all elements of this Chain and a start value, going right to left.
Applies a binary operator to all elements of this Chain and a start value, going right to left.
the result of the binary operator
the start value
the binary operator
the result of inserting op between consecutive elements of this Chain, 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 Chain.
Indicates whether a predicate holds for all elements of this Chain.
Indicates whether a predicate holds for all elements of this Chain.
the predicate used to test elements.
true if the given predicate p holds for all elements of this Chain, otherwise false.
Applies a function f to all elements of this Chain.
Applies a function f to all elements of this Chain.
the function that is applied for its side-effect to every element. The result of function f is discarded.
Partitions this Chain into a map of Chains according to some discriminator function.
Partitions this Chain into a map of Chains according to some discriminator function.
the type of keys returned by the discriminator function.
the discriminator function.
A map from keys to Chains such that the following invariant holds:
(chain.toList partition f)(k) = xs filter (x => f(x) == k)
That is, every key k is bound to a Chain of those elements x for which f(x) equals k.
Partitions elements into fixed size Chains.
Partitions elements into fixed size Chains.
the number of elements per group
An iterator producing Chains of size size, except the last will be truncated if the elements don't divide evenly.
Returns true to indicate this Chain has a definite size, since all Chains are strict collections.
Selects the first element of this Chain.
Selects the first element of this Chain.
the first element of this Chain.
Selects the first element of this Chain and returns it wrapped in a Some.
Selects the first element of this Chain and returns it wrapped in a Some.
the first element of this Chain, wrapped in a Some.
Finds index of first occurrence of some value in this Chain after or at some start index.
Finds index of first occurrence of some value in this Chain after or at some start index.
the element value to search for.
the start index
the index >= from of the first element of this Chain that is equal (as determined by ==) to elem,
or -1, if none exists.
Finds index of first occurrence of some value in this Chain.
Finds index of first occurrence of some value in this Chain.
the element value to search for.
the index of the first element of this Chain that is equal (as determined by ==) to elem,
or -1, if none exists.
Finds first index after or at a start index where this Chain contains a given Chain as a slice.
Finds first index after or at a start index where this Chain contains a given Chain as a slice.
the Chain defining the slice to look for
the start index
the first index >= from such that the elements of this Chain starting at this index match the elements of
Chain that, or -1 of no such subsequence exists.
Finds first index after or at a start index where this Chain contains a given Every as a slice.
Finds first index after or at a start index where this Chain contains a given Every as a slice.
the Every defining the slice to look for
the start index
the first index >= from such that the elements of this Chain starting at this index match the elements of
Every that, or -1 of no such subsequence exists.
Finds first index where this Chain contains a given Chain as a slice.
Finds first index where this Chain contains a given Chain as a slice.
the Chain defining the slice to look for
the first index such that the elements of this Chain starting at this index match the elements of
Chain that, or -1 of no such subsequence exists.
Finds first index where this Chain contains a given Every as a slice.
Finds first index where this Chain contains a given Every as a slice.
the Every defining the slice to look for
the first index such that the elements of this Chain starting at this index match the elements of
Every that, or -1 of no such subsequence exists.
Finds first index after or at a start index where this Chain contains a given GenSeq as a slice.
Finds first index after or at a start index where this Chain contains a given GenSeq as a slice.
the GenSeq defining the slice to look for
the start index
the first index >= from at which the elements of this Chain starting at that index match the elements of
GenSeq that, or -1 of no such subsequence exists.
Finds first index where this Chain contains a given GenSeq as a slice.
Finds first index where this Chain contains a given GenSeq as a slice.
the GenSeq defining the slice to look for
the first index at which the elements of this Chain starting at that index match the elements of
GenSeq that, or -1 of no such subsequence exists.
Finds index of the first element satisfying some predicate after or at some start index.
Finds index of the first element satisfying some predicate after or at some start index.
the predicate used to test elements.
the start index
the index >= from of the first element of this Chain that satisfies the predicate p,
or -1, if none exists.
Finds index of the first element satisfying some predicate.
Finds index of the first element satisfying some predicate.
the predicate used to test elements.
the index of the first element of this Chain that satisfies the predicate p,
or -1, if none exists.
Produces the range of all indices of this Chain.
Produces the range of all indices of this Chain.
a Range value from 0 to one less than the length of this Chain.
Tests whether this Chain contains given index.
Tests whether this Chain contains given index.
the index to test
true if this Chain contains an element at position idx, false otherwise.
Returns false to indicate this Chain, like all Chains, is non-empty.
Chains, is non-empty.
Returns false to indicate this Chain, like all Chains, is non-empty.
false
Returns true to indicate this Chain, like all Chains, can be traversed repeatedly.
Returns true to indicate this Chain, like all Chains, can be traversed repeatedly.
true
Creates and returns a new iterator over all elements contained in this Chain.
Creates and returns a new iterator over all elements contained in this Chain.
the new iterator
Selects the last element of this Chain.
Selects the last element of this Chain.
the last element of this Chain.
Finds the index of the last occurrence of some value in this Chain before or at a given end index.
Finds the index of the last occurrence of some value in this Chain before or at a given end index.
the element value to search for.
the end index.
the index >= end of the last element of this Chain that is equal (as determined by ==)
to elem, or -1, if none exists.
Finds the index of the last occurrence of some value in this Chain.
Finds the index of the last occurrence of some value in this Chain.
the element value to search for.
the index of the last element of this Chain that is equal (as determined by ==) to elem,
or -1, if none exists.
Finds the last index before or at a given end index where this Chain contains a given Chain as a slice.
Finds the last index before or at a given end index where this Chain contains a given Chain as a slice.
the Chain defining the slice to look for
the end index
the last index >= end at which the elements of this Chain starting at that index match the elements of
Chain that, or -1 of no such subsequence exists.
Finds the last index before or at a given end index where this Chain contains a given Every as a slice.
Finds the last index before or at a given end index where this Chain contains a given Every as a slice.
the Every defining the slice to look for
the end index
the last index >= end at which the elements of this Chain starting at that index match the elements of
Every that, or -1 of no such subsequence exists.
Finds the last index where this Chain contains a given Chain as a slice.
Finds the last index where this Chain contains a given Chain as a slice.
the Chain defining the slice to look for
the last index at which the elements of this Chain starting at that index match the elements of
Chain that, or -1 of no such subsequence exists.
Finds the last index where this Chain contains a given Every as a slice.
Finds the last index where this Chain contains a given Every as a slice.
the Every defining the slice to look for
the last index at which the elements of this Chain starting at that index match the elements of
Every that, or -1 of no such subsequence exists.
Finds the last index before or at a given end index where this Chain contains a given GenSeq as a slice.
Finds the last index before or at a given end index where this Chain contains a given GenSeq as a slice.
the GenSeq defining the slice to look for
the end index
the last index >= end at which the elements of this Chain starting at that index match the elements of
GenSeq that, or -1 of no such subsequence exists.
Finds the last index where this Chain contains a given GenSeq as a slice.
Finds the last index where this Chain contains a given GenSeq as a slice.
the GenSeq defining the slice to look for
the last index at which the elements of this Chain starting at that index match the elements of
GenSeq that, or -1 of no such subsequence exists.
Finds index of last element satisfying some predicate before or at given end index.
Finds index of last element satisfying some predicate before or at given end index.
the predicate used to test elements.
the end index
the index >= end of the last element of this Chain that satisfies the predicate p,
or -1, if none exists.
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
the predicate used to test elements.
the index of the last element of this Chain that satisfies the predicate p, or -1, if none exists.
Returns the last element of this Chain, wrapped in a Some.
Returns the last element of this Chain, wrapped in a Some.
the last element, wrapped in a Some.
The length of this Chain.
The length of this Chain.
Note: length and size yield the same result, which will be >= 1.
the number of elements in this Chain.
Compares the length of this Chain to a test value.
Compares the length of this Chain to a test value.
the test value that gets compared with the length.
a value x where
x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len
Builds a new Chain by applying a function to all elements of this Chain.
Builds a new Chain by applying a function to all elements of this Chain.
the element type of the returned Chain.
the function to apply to each element.
a new Chain resulting from applying the given function f to each element of this Chain and collecting the results.
Finds the largest element.
Finds the largest element.
the largest element of this Chain.
Finds the largest result after applying the given function to every element.
Finds the largest result after applying the given function to every element.
the largest result of applying the given function to every element of this Chain.
Finds the smallest element.
Finds the smallest element.
the smallest element of this Chain.
Finds the smallest result after applying the given function to every element.
Finds the smallest result after applying the given function to every element.
the smallest result of applying the given function to every element of this Chain.
Displays all elements of this Chain in a string using start, end, and separator strings.
Displays all elements of this Chain in a string using start, end, and separator strings.
the starting string.
the separator string.
the ending string.
a string representation of this Chain. The resulting string begins with the string start and ends with the string
end. Inside, In the resulting string, the result of invoking toString on all elements of this Chain are
separated by the string sep.
Displays all elements of this Chain in a string using a separator string.
Displays all elements of this Chain in a string using a separator string.
the separator string
a string representation of this Chain. In the resulting string, the result of invoking toString on all elements of this
Chain are separated by the string sep.
Displays all elements of this Chain in a string.
Displays all elements of this Chain in a string.
a string representation of this Chain. In the resulting string, the result of invoking toString on all elements of this
Chain follow each other without any separator string.
Returns true to indicate this Chain, like all Chains, is non-empty.
Returns true to indicate this Chain, like all Chains, is non-empty.
true
A copy of this Chain with an element value appended until a given target length is reached.
A copy of this Chain with an element value appended until a given target length is reached.
the target length
he padding value
a new Chain consisting of all elements of this Chain followed by the minimal number of occurrences
of elem so that the resulting Chain has a length of at least len.
Produces a new Chain where a slice of elements in this Chain is replaced by another Chain
Produces a new Chain where a slice of elements in this Chain is replaced by another Chain
the index of the first replaced element
the Chain whose elements should replace a slice in this Chain
the number of elements to drop in the original Chain
Iterates over distinct permutations.
Iterates over distinct permutations.
Here's an example:
Chain('a', 'b', 'b').permutations.toList = List(Chain(a, b, b), Chain(b, a, b), Chain(b, b, a))
an iterator that traverses the distinct permutations of this Chain.
Returns the length of the longest prefix whose elements all satisfy some predicate.
Returns the length of the longest prefix whose elements all satisfy some predicate.
the predicate used to test elements.
the length of the longest prefix of this Chain such that every element
of the segment satisfies the predicate p.
The result of multiplying all the elements of this Chain.
The result of multiplying all the elements of this Chain.
This method can be invoked for any Chain[T] for which an implicit Numeric[T] exists.
the product of all elements
Reduces the elements of this Chain using the specified associative binary operator.
Reduces the elements of this Chain using the specified associative binary operator.
The order in which operations are performed on elements is unspecified and may be nondeterministic.
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 of this Chain.
Applies a binary operator to all elements of this Chain, going left to right.
Applies a binary operator to all elements of this Chain, going left to right.
the result type of the binary operator.
the binary operator.
the result of inserting op between consecutive elements of this Chain, going left to right:
op(...op(op(x_1, x_2), x_3), ..., x_n)
where x1, ..., xn are the elements of this Chain.
Applies a binary operator to all elements of this Chain, going left to right, returning the result in a Some.
Applies a binary operator to all elements of this Chain, going left to right, returning the result in a Some.
the result type of the binary operator.
the binary operator.
a Some containing the result of reduceLeft(op)
Applies a binary operator to all elements of this Chain, going right to left.
Applies a binary operator to all elements of this Chain, going right to left.
the result of the binary operator
the binary operator
the result of inserting op between consecutive elements of this Chain, going right to left:
op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))
where x1, ..., xn are the elements of this Chain.
Applies a binary operator to all elements of this Chain, going right to left, returning the result in a Some.
Applies a binary operator to all elements of this Chain, going right to left, returning the result in a Some.
the result of the binary operator
the binary operator
a Some containing the result of reduceRight(op)
Returns new Chain with elements in reverse order.
Returns new Chain with elements in reverse order.
a new Chain with all elements of this Chain in reversed order.
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
Note: chain.reverseIterator is the same as chain.reverse.iterator, but might be more efficient.
an iterator yielding the elements of this Chain in reversed order
Builds a new Chain by applying a function to all elements of this Chain and collecting the results in reverse order.
Builds a new Chain by applying a function to all elements of this Chain and collecting the results in reverse order.
Note: chain.reverseMap(f) is the same as chain.reverse.map(f), but might be more efficient.
the element type of the returned Chain.
the function to apply to each element.
a new Chain resulting from applying the given function f to each element of this Chain
and collecting the results in reverse order.
Checks if the given Chain contains the same elements in the same order as this Chain.
Checks if the given Chain contains the same elements in the same order as this Chain.
the Chain with which to compare
true, if both this and the given Chain contain the same elements
in the same order, false otherwise.
Checks if the given Every contains the same elements in the same order as this Chain.
Checks if the given Every contains the same elements in the same order as this Chain.
the Every with which to compare
true, if both this and the given Every contain the same elements
in the same order, false otherwise.
Checks if the given GenIterable contains the same elements in the same order as this Chain.
Checks if the given GenIterable contains the same elements in the same order as this Chain.
the GenIterable with which to compare
true, if both this Chain and the given GenIterable contain the same elements
in the same order, false otherwise.
Computes a prefix scan of the elements of this Chain.
Computes a prefix scan of the elements of this Chain.
Note: The neutral element z may be applied more than once.
Here are some examples:
Chain(1, 2, 3).scan(0)(_ + _) == Chain(0, 1, 3, 6) Chain(1, 2, 3).scan("z")(_ + _.toString) == Chain("z", "z1", "z12", "z123")
a type parameter for the binary operator, a supertype of T, and the type of the resulting Chain.
a neutral element for the scan 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
a new Chain containing the prefix scan of the elements in this Chain
Produces a Chain containing cumulative results of applying the operator going left to right.
Produces a Chain containing cumulative results of applying the operator going left to right.
Here are some examples:
Chain(1, 2, 3).scanLeft(0)(_ + _) == Chain(0, 1, 3, 6) Chain(1, 2, 3).scanLeft("z")(_ + _) == Chain("z", "z1", "z12", "z123")
the result type of the binary operator and type of the resulting Chain
the start value.
the binary operator.
a new Chain containing the intermediate results of inserting op between consecutive elements of this Chain,
going left to right, with the start value, z, on the left.
Produces a Chain containing cumulative results of applying the operator going right to left.
Produces a Chain containing cumulative results of applying the operator going right to left.
Here are some examples:
Chain(1, 2, 3).scanRight(0)(_ + _) == Chain(6, 5, 3, 0) Chain(1, 2, 3).scanRight("z")(_ + _) == Chain("123z", "23z", "3z", "z")
the result of the binary operator and type of the resulting Chain
the start value
the binary operator
a new Chain containing the intermediate results of inserting op between consecutive elements of this Chain,
going right to left, with the start value, z, on the right.
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
the predicate used to test elements.
the index where the search starts.
The size of this Chain.
The size of this Chain.
Note: length and size yield the same result, which will be >= 1.
the number of elements in this Chain.
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.),
moving the sliding window by a given step each time.
the number of elements per group
the distance between the first elements of successive groups
an iterator producing Chains of size size, except the last and the only element will be truncated
if there are fewer elements than size.
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 Chains of size size, except the last and the only element will be truncated
if there are fewer elements than size.
Sorts this Chain according to the Ordering of the result of applying the given function to every element.
Sorts this Chain according to the Ordering of the result of applying the given function to every element.
the target type of the transformation f, and the type where the Ordering ord is defined.
the transformation function mapping elements to some other domain U.
the ordering assumed on domain U.
a Chain consisting of the elements of this Chain sorted according to the Ordering where
x < y if ord.lt(f(x), f(y)).
Sorts this Chain according to a comparison function.
Sorts this Chain according to a comparison function.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the
sorted Chain as in the original.
a Chain consisting of the elements of this Chain sorted according to the comparison function lt.
Sorts this Chain according to an Ordering.
Sorts this Chain according to an Ordering.
The sort is stable. That is, elements that are equal (as determined by lt) appear in the same order in the
sorted Chain as in the original.
the Ordering to be used to compare elements.
a Chain consisting of the elements of this Chain sorted according to the comparison function lt.
Indicates whether this Chain starts with the given Chain at the given index.
Indicates whether this Chain starts with the given Chain at the given index.
the Chain slice to look for in this Chain
the index at which this Chain is searched.
true if this Chain has that as a slice at the index offset, false otherwise.
Indicates whether this Chain starts with the given Every at the given index.
Indicates whether this Chain starts with the given Every at the given index.
the Every slice to look for in this Chain
the index at which this Chain is searched.
true if this Chain has that as a slice at the index offset, false otherwise.
Indicates whether this Chain starts with the given Chain.
Indicates whether this Chain starts with the given Chain.
the Chain to test
true if this collection has that as a prefix, false otherwise.
Indicates whether this Chain starts with the given Every.
Indicates whether this Chain starts with the given Every.
the Every to test
true if this collection has that as a prefix, false otherwise.
Indicates whether this Chain starts with the given GenSeq at the given index.
Indicates whether this Chain starts with the given GenSeq at the given index.
the GenSeq slice to look for in this Chain
the index at which this Chain is searched.
true if this Chain has that as a slice at the index offset, false otherwise.
Indicates whether this Chain starts with the given GenSeq.
Indicates whether this Chain starts with the given GenSeq.
the GenSeq slice to look for in this Chain
true if this Chain has that as a prefix, false otherwise.
Returns "Chain", the prefix of this object's toString representation.
Returns "Chain", the prefix of this object's toString representation.
the string "Chain"
The result of summing all the elements of this Chain.
The result of summing all the elements of this Chain.
This method can be invoked for any Chain[T] for which an implicit Numeric[T] exists.
the sum of all elements
Converts this Chain into a collection of type Col by copying all elements.
Converts this Chain into a collection of type Col by copying all elements.
the collection type to build.
a new collection containing all elements of this Chain.
Converts this Chain to an array.
Converts this Chain to an array.
an array containing all elements of this Chain. A ClassTag must be available for the element type of this Chain.
Converts this Chain to a mutable buffer.
Converts this Chain to a mutable buffer.
a buffer containing all elements of this Chain.
Converts this Chain to an immutable IndexedSeq.
Converts this Chain to an immutable IndexedSeq.
an immutable IndexedSeq containing all elements of this Chain.
Converts this Chain to an iterable collection.
Converts this Chain to an iterable collection.
an Iterable containing all elements of this Chain.
Returns an Iterator over the elements in this Chain.
Returns an Iterator over the elements in this Chain.
an Iterator containing all elements of this Chain.
Converts this Chain to a list.
Converts this Chain to a list.
a list containing all elements of this Chain.
Converts this Chain to a map.
Converts this Chain 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.
a map of type immutable.Map[K, V] containing all key/value pairs of type (K, V) of this Chain.
Converts this Chain to an immutable IndexedSeq.
Converts this Chain to an immutable IndexedSeq.
an immutable IndexedSeq containing all elements of this Chain.
Converts this Chain to a set.
Converts this Chain to a set.
a set containing all elements of this Chain.
Converts this Chain to a stream.
Converts this Chain to a stream.
a stream containing all elements of this Chain.
Returns a string representation of this Chain.
Returns a string representation of this Chain.
the string "Chain" followed by the result of invoking toString on
this Chain's elements, surrounded by parentheses.
Converts this Chain to an unspecified Traversable.
Converts this Chain to an unspecified Traversable.
a Traversable containing all elements of this Chain.
Converts this Chain to a Vector.
Converts this Chain to a Vector.
a Vector containing all elements of this Chain.
Produces a new Chain that contains all elements of this Chain and also all elements of a given GenSeq.
Produces a new Chain that contains all elements of this Chain and also all elements of a given GenSeq.
chainX union ys is equivalent to chainX ++ ys.
Another way to express this is that chainX union ys computes the order-presevring multi-set union
of chainX and ys. This union method is hence a counter-part of diff and intersect that
also work on multi-sets.
the GenSeq to add.
a new Chain that contains all elements of this Chain followed by all elements of that GenSeq.
Produces a new Chain that contains all elements of this Chain and also all elements of a given Chain.
Produces a new Chain that contains all elements of this Chain and also all elements of a given Chain.
chainX union chainY is equivalent to chainX ++ chainY.
Another way to express this is that chainX union chainY computes the order-presevring multi-set union
of chainX and chainY. This union method is hence a counter-part of diff and intersect that
also work on multi-sets.
the Chain to add.
a new Chain that contains all elements of this Chain followed by all elements of that.
Produces a new Chain that contains all elements of this Chain and also all elements of a given Every.
Produces a new Chain that contains all elements of this Chain and also all elements of a given Every.
chainX union everyY is equivalent to chainX ++ everyY.
Another way to express this is that chainX union everyY computes the order-presevring multi-set union
of chainX and everyY. This union method is hence a counter-part of diff and intersect that
also work on multi-sets.
the Every to add.
a new Chain that contains all elements of this Chain followed by all elements of that Every.
Converts this Chain of pairs into two Chains of the first and second half of each pair.
Converts this Chain of pairs into two Chains of the first and second half of each pair.
the type of the first half of the element pairs
the type of the second half of the element pairs
an implicit conversion that asserts that the element type of this Chain is a pair.
a pair of Chains, containing the first and second half, respectively, of each element pair of this Chain.
Converts this Chain of triples into three Chains of the first, second, and and third element of each triple.
Converts this Chain of triples into three Chains of the first, second, and and third element of each triple.
the type of the first member of the element triples
the type of the third member of the element triples
an implicit conversion that asserts that the element type of this Chain is a triple.
a triple of Chains, containing the first, second, and third member, respectively, of each element triple of this Chain.
A copy of this Chain with one single replaced element.
A copy of this Chain with one single replaced element.
the position of the replacement
the replacing element
a copy of this Chain with the element at position idx replaced by elem.
if the passed index is greater than or equal to the length of this Chain
Returns a Chain formed from this Chain and an iterable collection by combining corresponding
elements in pairs.
Returns a Chain formed from this Chain and an iterable collection by combining corresponding
elements in pairs. If one of the two collections is shorter than the other, placeholder elements will be 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 Chain is shorter than that Iterable.
a new Chain containing pairs consisting of corresponding elements of this Chain and that. The
length of the returned collection is the maximum of the lengths of this Chain and that. If this Chain
is shorter than that, thisElem values are used to pad the result. If that is shorter than this
Chain, thatElem values are used to pad the result.
Zips this Chain with its indices.
Zips this Chain with its indices.
A new Chain containing pairs consisting of all elements of this Chain paired with their index. Indices start at 0.
A non-empty list: an ordered, immutable, non-empty collection of elements with
LinearSeqperformance characteristics.The purpose of
Chainis to allow you to express in a type that aListis non-empty, thereby eliminating the need for (and potential exception from) a run-time check for non-emptiness. For a non-empty sequence withIndexedSeqperformance, seeEvery.Constructing
ChainsYou can construct a
Chainby passing one or more elements to theChain.applyfactory method:Alternatively you can cons elements onto the
Endsingleton object, similar to making aListstarting withNil:Note that although
Nilis aList[Nothing],Endis not aChain[Nothing], because no emptyChainexists. (A chain is a series of connected links; if you have no links, you have no chain.)Working with
ChainsChaindoes not extend Scala'sSeqorTraversabletraits because these require that implementations may be empty. For example, if you invoketailon aSeqthat contains just one element, you'll get an emptySeq:On the other hand, many useful methods exist on
Seqthat when invoked on a non-emptySeqare guaranteed to not result in an emptySeq. For convenience,Chaindefines a method corresponding to every suchSeqmethod. Here are some examples:Chaindoes not currently define any methods corresponding toSeqmethods that could result in an emptySeq. However, an implicit converison fromChaintoListis defined in theChaincompanion object that will be applied if you attempt to call one of the missing methods. As a result, you can invokefilteron anChain, even thoughfiltercould result in an empty sequence—but the result type will beListinstead ofChain:You can use
Chains inforexpressions. The result will be anChainunless you use a filter (anifclause). Because filters are desugared to invocations offilter, the result type will switch to aListat that point. Here are some examples:the type of elements contained in this
Chain