final class Chain[+T] extends AnyVal
A nonempty list: an ordered, immutable, nonempty collection of elements with LinearSeq
performance characteristics.
The purpose of Chain
is to allow you to express in a type that a List
is nonempty, thereby eliminating the
need for (and potential exception from) a runtime check for nonemptiness. For a nonempty sequence with IndexedSeq
performance, see Every
.
Constructing Chain
s
You can construct a Chain
by passing one or more elements to the Chain.apply
factory method:
scala> Chain(1, 2, 3) res0: org.scalactic.Chain[Int] = Chain(1, 2, 3)
Alternatively you can cons elements onto the End
singleton object, similar to making a List
starting with Nil
:
scala> 1 :: 2 :: 3 :: Nil res0: List[Int] = List(1, 2, 3)
scala> 1 :: 2 :: 3 :: End res1: org.scalactic.Chain[Int] = Chain(1, 2, 3)
Note that although Nil
is a List[Nothing]
, End
is
not a Chain[Nothing]
, because no empty Chain
exists. (A chain is a series
of connected links; if you have no links, you have no chain.)
scala> val nil: List[Nothing] = Nil nil: List[Nothing] = List()
scala> val nada: Chain[Nothing] = End <console>:16: error: type mismatch; found : org.scalactic.End.type required: org.scalactic.Chain[Nothing] val nada: Chain[Nothing] = End ^
Working with Chain
s
Chain
does not extend Scala's Seq
or Traversable
traits because these require that
implementations may be empty. For example, if you invoke tail
on a Seq
that contains just one element,
you'll get an empty Seq
:
scala> List(1).tail res6: List[Int] = List()
On the other hand, many useful methods exist on Seq
that when invoked on a nonempty Seq
are guaranteed
to not result in an empty Seq
. For convenience, Chain
defines a method corresponding to every such Seq
method. Here are some examples:
Chain(1, 2, 3).map(_ + 1) // Result: Chain(2, 3, 4) Chain(1).map(_ + 1) // Result: Chain(2) Chain(1, 2, 3).containsSlice(Chain(2, 3)) // Result: true Chain(1, 2, 3).containsSlice(Chain(3, 4)) // Result: false Chain(1, 2, 3, 4, 5).minBy(_.abs) // Result: 1
Chain
does not currently define any methods corresponding to Seq
methods that could result in
an empty Seq
. However, an implicit converison from Chain
to List
is defined in the Chain
companion object that will be applied if you attempt to call one of the missing methods. As a
result, you can invoke filter
on an Chain
, even though filter
could result
in an empty sequence—but the result type will be List
instead of Chain
:
Chain(1, 2, 3).filter(_ < 10) // Result: List(1, 2, 3) Chain(1, 2, 3).filter(_ > 10) // Result: List()
You can use Chain
s in for
expressions. The result will be an Chain
unless
you use a filter (an if
clause). Because filters are desugared to invocations of filter
, the
result type will switch to a List
at that point. Here are some examples:
scala> import org.scalactic._ import org.scalactic._ scala> for (i < Chain(1, 2, 3)) yield i + 1 res0: org.scalactic.Chain[Int] = Chain(2, 3, 4) scala> for (i < Chain(1, 2, 3) if i < 10) yield i + 1 res1: List[Int] = List(2, 3, 4) scala> for {  i < Chain(1, 2, 3)  j < Chain('a', 'b', 'c')  } yield (i, j) res3: org.scalactic.Chain[(Int, Char)] = Chain((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c)) scala> for {  i < Chain(1, 2, 3) if i < 10  j < Chain('a', 'b', 'c')  } yield (i, j) res6: List[(Int, Char)] = List((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c))
 T
the type of elements contained in this
Chain
 Source
 Chain.scala
 Alphabetic
 By Inheritance
 Chain
 AnyVal
 Any
 Hide All
 Show All
 Public
 All
Value Members

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

final
def
##(): Int
 Definition Classes
 Any

def
++[U >: T](other: GenTraversableOnce[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedGenTraversableOnce
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedGenTraversableOnce
. The element type of the resultingChain
is the most specific superclass encompassing the element types of thisChain
and the passedGenTraversableOnce
. U
the element type of the returned
Chain
 other
the
GenTraversableOnce
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

def
++[U >: T](other: Every[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedEvery
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedEvery
. The element type of the resultingChain
is the most specific superclass encompassing the element types of thisChain
and the passedEvery
. U
the element type of the returned
Chain
 other
the
Every
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

def
++[U >: T](other: Chain[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedChain
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedChain
. The element type of the resultingChain
is the most specific superclass encompassing the element types of this and the passedChain
. U
the element type of the returned
Chain
 other
the
Chain
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

final
def
+:[U >: T](element: U): Chain[U]
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. element
the element to prepend to this
Chain
 returns
a new
Chain
consisting ofelement
followed by all elements of thisChain
.

final
def
/:[B](z: B)(op: (B, T) ⇒ B): B
Fold left: applies a binary operator to a start value,
z
, and all elements of thisChain
, going left to right.Fold left: applies a binary operator to a start value,
z
, and all elements of thisChain
, going left to right.Note:
/:
is alternate syntax for thefoldLeft
method;z
/:
chain
is the same aschain
foldLeft
z
. B
the result of the binary operator
 z
the start value
 op
the binary operator
 returns
the result of inserting
op
between consecutive elements of thisChain
, going left to right, with the start value,z
, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x_{1}, ..., x_{n} are the elements of thisChain
.

def
:+[U >: T](element: U): Chain[U]
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. element
the element to append to this
Chain
 returns
a new
Chain
consisting of all elements of thisChain
followed byelement
.

final
def
::[U >: T](element: U): Chain[U]
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. element
the element to prepend to this
Chain
 returns
a
Chain
that containselement
as first element and that continues with thisChain
.

def
:::[U >: T](other: GenTraversableOnce[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedGenTraversableOnce
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedGenTraversableOnce
. The element type of the resultingChain
is the most specific superclass encompassing the element types of thisChain
and the passedGenTraversableOnce
. U
the element type of the returned
Chain
 other
the
GenTraversableOnce
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

def
:::[U >: T](other: Every[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedEvery
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedEvery
. The element type of the resultingChain
is the most specific superclass encompassing the element types of this and the passedEvery
. U
the element type of the returned
Chain
 other
the
Every
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

def
:::[U >: T](other: Chain[U]): Chain[U]
Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedChain
.Returns a new
Chain
containing the elements of thisChain
followed by the elements of the passedChain
. The element type of the resultingChain
is the most specific superclass encompassing the element types of this and the passedChain
. U
the element type of the returned
Chain
 other
the
Chain
to append returns
a new
Chain
that contains all the elements of thisChain
followed by all elements ofother
.

final
def
:\[B](z: B)(op: (T, B) ⇒ B): B
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 thefoldRight
method;chain
:\
z
is the same aschain
foldRight
z
. B
the result of the binary operator
 z
the start value
 op
the binary operator
 returns
the result of inserting
op
between consecutive elements of thisChain
, going right to left, with the start value,z
, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n} are the elements of thisChain
.

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

final
def
addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
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 stringstart
; the result of invokingtoString
on all elements of thisChain
, separated by the stringsep
; and the stringend
 sb
the string builder to which elements will be appended
 start
the ending string
 sep
the separator string
 returns
the string builder,
sb
, to which elements were appended.

final
def
addString(sb: StringBuilder, sep: String): StringBuilder
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 invokingtoString
on of every element of thisChain
, separated by the stringsep
. sb
the string builder to which elements will be appended
 sep
the separator string
 returns
the string builder,
sb
, to which elements were appended.

final
def
addString(sb: StringBuilder): StringBuilder
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 invokingtoString
on of every element of thisChain
, without any separator string. sb
the string builder to which elements will be appended
 returns
the string builder,
sb
, to which elements were appended.

final
def
apply(idx: Int): T
Selects an element by its index in the
Chain
.Selects an element by its index in the
Chain
. returns
the element of this
Chain
at indexidx
, where 0 indicates the first element.

final
def
asInstanceOf[T0]: T0
 Definition Classes
 Any

final
def
collectFirst[U](pf: PartialFunction[T, U]): Option[U]
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. pf
the partial function
 returns
an
Option
containingpf
applied to the first element for which it is defined, orNone
if the partial function was not defined for any element.

final
def
contains(elem: Any): Boolean
Indicates whether this
Chain
contains a given value as an element.Indicates whether this
Chain
contains a given value as an element. elem
the element to look for
 returns
true if this
Chain
has an element that is equal (as determined by==)
toelem
, false otherwise.

final
def
containsSlice[B](that: Chain[B]): Boolean
Indicates whether this
Chain
contains a givenChain
as a slice.Indicates whether this
Chain
contains a givenChain
as a slice. that
the
Chain
slice to look for returns
true if this
Chain
contains a slice with the same elements asthat
, otherwisefalse
.

final
def
containsSlice[B](that: Every[B]): Boolean
Indicates whether this
Chain
contains a givenEvery
as a slice.Indicates whether this
Chain
contains a givenEvery
as a slice. that
the
Every
slice to look for returns
true if this
Chain
contains a slice with the same elements asthat
, otherwisefalse
.

final
def
containsSlice[B](that: GenSeq[B]): Boolean
Indicates whether this
Chain
contains a givenGenSeq
as a slice.Indicates whether this
Chain
contains a givenGenSeq
as a slice. that
the
GenSeq
slice to look for returns
true if this
Chain
contains a slice with the same elements asthat
, otherwisefalse
.

final
def
copyToArray[U >: T](arr: Array[U], start: Int, len: Int): Unit
Copies values of this
Chain
to an array.Copies values of this
Chain
to an array. Fills the given arrayarr
with at mostlen
elements of thisChain
, beginning at indexstart
. Copying will stop once either the end of the currentChain
is reached, the end of the array is reached, orlen
elements have been copied. arr
the array to fill
 start
the starting index
 len
the maximum number of elements to copy

final
def
copyToArray[U >: T](arr: Array[U], start: Int): Unit
Copies values of this
Chain
to an array.Copies values of this
Chain
to an array. Fills the given arrayarr
with values of thisChain
, beginning at indexstart
. Copying will stop once either the end of the currentChain
is reached, or the end of the array is reached. arr
the array to fill
 start
the starting index

final
def
copyToArray[U >: T](arr: Array[U]): Unit
Copies values of this
Chain
to an array.Copies values of this
Chain
to an array. Fills the given arrayarr
with values of thisChain
. Copying will stop once either the end of the currentChain
is reached, or the end of the array is reached. arr
the array to fill

final
def
copyToBuffer[U >: T](buf: Buffer[U]): Unit
Copies all elements of this
Chain
to a buffer.Copies all elements of this
Chain
to a buffer. buf
the buffer to which elements are copied

final
def
corresponds[B](that: Chain[B])(p: (T, B) ⇒ Boolean): Boolean
Indicates whether every element of this
Chain
relates to the corresponding element of a givenChain
by satisfying a given predicate.Indicates whether every element of this
Chain
relates to the corresponding element of a givenChain
by satisfying a given predicate. B
the type of the elements of
that
 that
the
Chain
to compare for correspondence p
the predicate, which relates elements from this and the passed
Chain
 returns
true if this and the passed
Chain
have the same length andp(x, y)
istrue
for all corresponding elementsx
of thisChain
andy
of that, otherwisefalse
.

final
def
corresponds[B](that: Every[B])(p: (T, B) ⇒ Boolean): Boolean
Indicates whether every element of this
Chain
relates to the corresponding element of a givenEvery
by satisfying a given predicate.Indicates whether every element of this
Chain
relates to the corresponding element of a givenEvery
by satisfying a given predicate. B
the type of the elements of
that
 that
the
Every
to compare for correspondence p
the predicate, which relates elements from this
Chain
and the passedEvery
 returns
true if this
Chain
and the passedEvery
have the same length andp(x, y)
istrue
for all corresponding elementsx
of thisChain
andy
of that, otherwisefalse
.

final
def
corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
Indicates whether every element of this
Chain
relates to the corresponding element of a givenGenSeq
by satisfying a given predicate.Indicates whether every element of this
Chain
relates to the corresponding element of a givenGenSeq
by satisfying a given predicate. B
the type of the elements of
that
 that
the
GenSeq
to compare for correspondence p
the predicate, which relates elements from this
Chain
and the passedGenSeq
 returns
true if this
Chain
and the passedGenSeq
have the same length andp(x, y)
istrue
for all corresponding elementsx
of thisChain
andy
of that, otherwisefalse
.

final
def
count(p: (T) ⇒ Boolean): Int
Counts the number of elements in this
Chain
that satisfy a predicate.Counts the number of elements in this
Chain
that satisfy a predicate. p
the predicate used to test elements.
 returns
the number of elements satisfying the predicate
p
.

final
def
distinct: Chain[T]
Builds a new
Chain
from thisChain
without any duplicate elements.Builds a new
Chain
from thisChain
without any duplicate elements. returns
A new
Chain
that contains the first occurrence of every element of thisChain
.

final
def
endsWith[B](that: Chain[B]): Boolean
Indicates whether this
Chain
ends with the givenChain
.Indicates whether this
Chain
ends with the givenChain
. that
the
Chain
to test returns
true
if thisChain
hasthat
as a suffix,false
otherwise.

final
def
endsWith[B](that: Every[B]): Boolean
Indicates whether this
Chain
ends with the givenEvery
.Indicates whether this
Chain
ends with the givenEvery
. that
the
Every
to test returns
true
if thisChain
hasthat
as a suffix,false
otherwise.

final
def
endsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Chain
ends with the givenGenSeq
.Indicates whether this
Chain
ends with the givenGenSeq
. that
the sequence to test
 returns
true
if thisChain
hasthat
as a suffix,false
otherwise.

final
def
exists(p: (T) ⇒ Boolean): Boolean
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
. returns
true
if the given predicatep
holds for some of the elements of thisChain
, otherwisefalse
.

final
def
find(p: (T) ⇒ Boolean): Option[T]
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. p
the predicate used to test elements
 returns
an
Some
containing the first element in thisChain
that satisfiesp
, orNone
if none exists.

final
def
flatMap[U](f: (T) ⇒ Chain[U]): Chain[U]
Builds a new
Chain
by applying a function to all elements of thisChain
and using the elements of the resultingChain
s.Builds a new
Chain
by applying a function to all elements of thisChain
and using the elements of the resultingChain
s. U
the element type of the returned
Chain
 f
the function to apply to each element.
 returns
a new
Chain
containing elements obtained by applying the given functionf
to each element of thisChain
and concatenating the elements of resultingChain
s.

final
def
flatten[B](implicit ev: <:<[T, Chain[B]]): Chain[B]
Converts this
Chain
ofChain
s into aChain
formed by the elements of the nestedChain
s.Converts this
Chain
ofChain
s into aChain
formed by the elements of the nestedChain
s.Note: You cannot use this
flatten
method on aChain
that contains aGenTraversableOnce
s, because if all the nestedGenTraversableOnce
s were empty, you'd end up with an emptyChain
. returns
a new
Chain
resulting from concatenating all nestedChain
s.

final
def
fold[U >: T](z: U)(op: (U, U) ⇒ U): U
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.
 U
a type parameter for the binary operator, a supertype of T.
 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 andz

final
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
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. 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 thisChain
, going left to right, with the start value,z
, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x_{1}, ..., x_{n} are the elements of thisChain
.

final
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
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. B
the result of the binary operator
 z
the start value
 op
the binary operator
 returns
the result of inserting
op
between consecutive elements of thisChain
, going right to left, with the start value,z
, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n} are the elements of thisChain
.

final
def
forall(p: (T) ⇒ Boolean): Boolean
Indicates whether a predicate holds for all elements of this
Chain
.Indicates whether a predicate holds for all elements of this
Chain
. p
the predicate used to test elements.
 returns
true
if the given predicatep
holds for all elements of thisChain
, otherwisefalse
.

final
def
foreach(f: (T) ⇒ Unit): Unit
Applies a function
f
to all elements of thisChain
.Applies a function
f
to all elements of thisChain
. f
the function that is applied for its sideeffect to every element. The result of function
f
is discarded.

def
getClass(): Class[_ <: AnyVal]
 Definition Classes
 AnyVal → Any

final
def
groupBy[K](f: (T) ⇒ K): Map[K, Chain[T]]
Partitions this
Chain
into a map ofChain
s according to some discriminator function.Partitions this
Chain
into a map ofChain
s according to some discriminator function. K
the type of keys returned by the discriminator function.
 f
the discriminator function.
 returns
A map from keys to
Chain
s such that the following invariant holds:(chain.toList partition f)(k) = xs filter (x => f(x) == k)
That is, every keyk
is bound to aChain
of those elementsx
for whichf(x)
equalsk
.

final
def
grouped(size: Int): Iterator[Chain[T]]
Partitions elements into fixed size
Chain
s.Partitions elements into fixed size
Chain
s. size
the number of elements per group
 returns
An iterator producing
Chain
s of sizesize
, except the last will be truncated if the elements don't divide evenly.

final
def
hasDefiniteSize: Boolean
Returns
true
to indicate thisChain
has a definite size, since allChain
s are strict collections. 
final
def
head: T
Selects the first element of this
Chain
.Selects the first element of this
Chain
. returns
the first element of this
Chain
.

final
def
headOption: Option[T]
Selects the first element of this
Chain
and returns it wrapped in aSome
.Selects the first element of this
Chain
and returns it wrapped in aSome
. returns
the first element of this
Chain
, wrapped in aSome
.

final
def
indexOf[U >: T](elem: U, from: Int): Int
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. elem
the element value to search for.
 from
the start index
 returns
the index
>=
from
of the first element of thisChain
that is equal (as determined by==
) toelem
, or1
, if none exists.

final
def
indexOf[U >: T](elem: U): Int
Finds index of first occurrence of some value in this
Chain
.Finds index of first occurrence of some value in this
Chain
. elem
the element value to search for.
 returns
the index of the first element of this
Chain
that is equal (as determined by==
) toelem
, or1
, if none exists.

final
def
indexOfSlice[U >: T](that: Chain[U], from: Int): Int
Finds first index after or at a start index where this
Chain
contains a givenChain
as a slice.Finds first index after or at a start index where this
Chain
contains a givenChain
as a slice. that
the
Chain
defining the slice to look for from
the start index
 returns
the first index
>=
from
such that the elements of thisChain
starting at this index match the elements ofChain
that
, or1
of no such subsequence exists.

final
def
indexOfSlice[U >: T](that: Every[U], from: Int): Int
Finds first index after or at a start index where this
Chain
contains a givenEvery
as a slice.Finds first index after or at a start index where this
Chain
contains a givenEvery
as a slice. that
the
Every
defining the slice to look for from
the start index
 returns
the first index
>=
from
such that the elements of thisChain
starting at this index match the elements ofEvery
that
, or1
of no such subsequence exists.

final
def
indexOfSlice[U >: T](that: Chain[U]): Int
Finds first index where this
Chain
contains a givenChain
as a slice.Finds first index where this
Chain
contains a givenChain
as a slice. that
the
Chain
defining the slice to look for returns
the first index such that the elements of this
Chain
starting at this index match the elements ofChain
that
, or1
of no such subsequence exists.

final
def
indexOfSlice[U >: T](that: Every[U]): Int
Finds first index where this
Chain
contains a givenEvery
as a slice.Finds first index where this
Chain
contains a givenEvery
as a slice. that
the
Every
defining the slice to look for returns
the first index such that the elements of this
Chain
starting at this index match the elements ofEvery
that
, or1
of no such subsequence exists.

final
def
indexOfSlice[U >: T](that: GenSeq[U], from: Int): Int
Finds first index after or at a start index where this
Chain
contains a givenGenSeq
as a slice.Finds first index after or at a start index where this
Chain
contains a givenGenSeq
as a slice. that
the
GenSeq
defining the slice to look for from
the start index
 returns
the first index
>=
from
at which the elements of thisChain
starting at that index match the elements ofGenSeq
that
, or1
of no such subsequence exists.

final
def
indexOfSlice[U >: T](that: GenSeq[U]): Int
Finds first index where this
Chain
contains a givenGenSeq
as a slice.Finds first index where this
Chain
contains a givenGenSeq
as a slice. that
the
GenSeq
defining the slice to look for returns
the first index at which the elements of this
Chain
starting at that index match the elements ofGenSeq
that
, or1
of no such subsequence exists.

final
def
indexWhere(p: (T) ⇒ Boolean, from: Int): Int
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.
 p
the predicate used to test elements.
 from
the start index
 returns
the index
>=
from
of the first element of thisChain
that satisfies the predicatep
, or1
, if none exists.

final
def
indexWhere(p: (T) ⇒ Boolean): Int
Finds index of the first element satisfying some predicate.
Finds index of the first element satisfying some predicate.
 p
the predicate used to test elements.
 returns
the index of the first element of this
Chain
that satisfies the predicatep
, or1
, if none exists.

final
def
indices: Range
Produces the range of all indices of this
Chain
.Produces the range of all indices of this
Chain
. returns
a
Range
value from0
to one less than the length of thisChain
.

final
def
isDefinedAt(idx: Int): Boolean
Tests whether this
Chain
contains given index.Tests whether this
Chain
contains given index. idx
the index to test
 returns
true if this
Chain
contains an element at positionidx
,false
otherwise.

final
def
isEmpty: Boolean
Returns
false
to indicate thisChain
, like allChain
s, is nonempty.
Returns
false
to indicate thisChain
, like allChain
s, is nonempty.
returns
false
final def isInstanceOf[T0]: Boolean
 Definition Classes
 Any
final def isTraversableAgain: Boolean
Returns
true
to indicate thisChain
, like allChain
s, can be traversed repeatedly.Returns
true
to indicate thisChain
, like allChain
s, can be traversed repeatedly. returns
true
final def iterator: Iterator[T]
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
. returns
the new iterator
final def last: T
Selects the last element of this
Chain
.Selects the last element of this
Chain
. returns
the last element of this
Chain
.
final def lastIndexOf[U >: T](elem: U, end: Int): Int
Finds the index of the last occurrence of some value in this
Chain
before or at a givenend
index.Finds the index of the last occurrence of some value in this
Chain
before or at a givenend
index. elem
the element value to search for.
 end
the end index.
 returns
the index
>=
end
of the last element of thisChain
that is equal (as determined by==
) toelem
, or1
, if none exists.
final def lastIndexOf[U >: T](elem: U): Int
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
. elem
the element value to search for.
 returns
the index of the last element of this
Chain
that is equal (as determined by==
) toelem
, or1
, if none exists.
final def lastIndexOfSlice[U >: T](that: Chain[U], end: Int): Int
Finds the last index before or at a given end index where this
Chain
contains a givenChain
as a slice.Finds the last index before or at a given end index where this
Chain
contains a givenChain
as a slice. that
the
Chain
defining the slice to look for end
the end index
 returns
the last index
>=
end
at which the elements of thisChain
starting at that index match the elements ofChain
that
, or1
of no such subsequence exists.
final def lastIndexOfSlice[U >: T](that: Every[U], end: Int): Int
Finds the last index before or at a given end index where this
Chain
contains a givenEvery
as a slice.Finds the last index before or at a given end index where this
Chain
contains a givenEvery
as a slice. that
the
Every
defining the slice to look for end
the end index
 returns
the last index
>=
end
at which the elements of thisChain
starting at that index match the elements ofEvery
that
, or1
of no such subsequence exists.
final def lastIndexOfSlice[U >: T](that: Chain[U]): Int
Finds the last index where this
Chain
contains a givenChain
as a slice.Finds the last index where this
Chain
contains a givenChain
as a slice. that
the
Chain
defining the slice to look for returns
the last index at which the elements of this
Chain
starting at that index match the elements ofChain
that
, or1
of no such subsequence exists.
final def lastIndexOfSlice[U >: T](that: Every[U]): Int
Finds the last index where this
Chain
contains a givenEvery
as a slice.Finds the last index where this
Chain
contains a givenEvery
as a slice. that
the
Every
defining the slice to look for returns
the last index at which the elements of this
Chain
starting at that index match the elements ofEvery
that
, or1
of no such subsequence exists.
final def lastIndexOfSlice[U >: T](that: GenSeq[U], end: Int): Int
Finds the last index before or at a given end index where this
Chain
contains a givenGenSeq
as a slice.Finds the last index before or at a given end index where this
Chain
contains a givenGenSeq
as a slice. that
the
GenSeq
defining the slice to look for end
the end index
 returns
the last index
>=
end
at which the elements of thisChain
starting at that index match the elements ofGenSeq
that
, or1
of no such subsequence exists.
final def lastIndexOfSlice[U >: T](that: GenSeq[U]): Int
Finds the last index where this
Chain
contains a givenGenSeq
as a slice.Finds the last index where this
Chain
contains a givenGenSeq
as a slice. that
the
GenSeq
defining the slice to look for returns
the last index at which the elements of this
Chain
starting at that index match the elements ofGenSeq
that
, or1
of no such subsequence exists.
final def lastIndexWhere(p: (T) ⇒ Boolean, end: Int): Int
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.
 p
the predicate used to test elements.
 end
the end index
 returns
the index
>=
end
of the last element of thisChain
that satisfies the predicatep
, or1
, if none exists.
final def lastIndexWhere(p: (T) ⇒ Boolean): Int
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
 p
the predicate used to test elements.
 returns
the index of the last element of this
Chain
that satisfies the predicatep
, or1
, if none exists.
final def lastOption: Option[T]
Returns the last element of this
Chain
, wrapped in aSome
.Returns the last element of this
Chain
, wrapped in aSome
. returns
the last element, wrapped in a
Some
.
final def length: Int
The length of this
Chain
.The length of this
Chain
.Note:
length
andsize
yield the same result, which will be>
= 1. returns
the number of elements in this
Chain
.
final def lengthCompare(len: Int): Int
Compares the length of this
Chain
to a test value.Compares the length of this
Chain
to a test value. len
the test value that gets compared with the length.
 returns
a value
x
wherex < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len
final def map[U](f: (T) ⇒ U): Chain[U]
Builds a new
Chain
by applying a function to all elements of thisChain
.Builds a new
Chain
by applying a function to all elements of thisChain
. U
the element type of the returned
Chain
. f
the function to apply to each element.
 returns
a new
Chain
resulting from applying the given functionf
to each element of thisChain
and collecting the results.
final def max[U >: T](implicit cmp: Ordering[U]): T
Finds the largest element.
Finds the largest element.
 returns
the largest element of this
Chain
.
final def maxBy[U](f: (T) ⇒ U)(implicit cmp: Ordering[U]): T
Finds the largest result after applying the given function to every element.
Finds the largest result after applying the given function to every element.
 returns
the largest result of applying the given function to every element of this
Chain
.
final def min[U >: T](implicit cmp: Ordering[U]): T
Finds the smallest element.
Finds the smallest element.
 returns
the smallest element of this
Chain
.
final def minBy[U](f: (T) ⇒ U)(implicit cmp: Ordering[U]): T
Finds the smallest result after applying the given function to every element.
Finds the smallest result after applying the given function to every element.
 returns
the smallest result of applying the given function to every element of this
Chain
.
final def mkString(start: String, sep: String, end: String): String
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. start
the starting string.
 sep
the separator string.
 end
the ending string.
 returns
a string representation of this
Chain
. The resulting string begins with the stringstart
and ends with the stringend
. Inside, In the resulting string, the result of invokingtoString
on all elements of thisChain
are separated by the stringsep
.
final def mkString(sep: String): String
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. sep
the separator string
 returns
a string representation of this
Chain
. In the resulting string, the result of invokingtoString
on all elements of thisChain
are separated by the stringsep
.
final def mkString: String
Displays all elements of this
Chain
in a string.Displays all elements of this
Chain
in a string. returns
a string representation of this
Chain
. In the resulting string, the result of invokingtoString
on all elements of thisChain
follow each other without any separator string.
final def nonEmpty: Boolean
Returns
true
to indicate thisChain
, like allChain
s, is nonempty.Returns
true
to indicate thisChain
, like allChain
s, is nonempty. returns
true
final def padTo[U >: T](len: Int, elem: U): Chain[U]
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. len
the target length
 elem
he padding value
 returns
a new
Chain
consisting of all elements of thisChain
followed by the minimal number of occurrences ofelem
so that the resultingChain
has a length of at leastlen
.
final def patch[U >: T](from: Int, that: Chain[U], replaced: Int): Chain[U]
Produces a new
Chain
where a slice of elements in thisChain
is replaced by anotherChain
Produces a new
Chain
where a slice of elements in thisChain
is replaced by anotherChain
 from
the index of the first replaced element
 that
the
Chain
whose elements should replace a slice in thisChain
 replaced
the number of elements to drop in the original
Chain
final def permutations: Iterator[Chain[T]]
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))
 returns
an iterator that traverses the distinct permutations of this
Chain
.
final def prefixLength(p: (T) ⇒ Boolean): Int
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.
 p
the predicate used to test elements.
 returns
the length of the longest prefix of this
Chain
such that every element of the segment satisfies the predicatep
.
final def product[U >: T](implicit num: Numeric[U]): U
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 implicitNumeric[T]
exists. returns
the product of all elements
final def reduce[U >: T](op: (U, U) ⇒ U): U
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.
 U
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 of thisChain
.
final def reduceLeft[U >: T](op: (U, T) ⇒ U): U
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. U
the result type of the binary operator.
 op
the binary operator.
 returns
the result of inserting
op
between consecutive elements of thisChain
, going left to right:op(...op(op(x_1, x_2), x_3), ..., x_n)
where x_{1}, ..., x_{n} are the elements of thisChain
.
final def reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]
Applies a binary operator to all elements of this
Chain
, going left to right, returning the result in aSome
.Applies a binary operator to all elements of this
Chain
, going left to right, returning the result in aSome
. U
the result type of the binary operator.
 op
the binary operator.
 returns
a
Some
containing the result ofreduceLeft(op)
final def reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]
final def reduceRight[U >: T](op: (T, U) ⇒ U): U
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. U
the result of the binary operator
 op
the binary operator
 returns
the result of inserting
op
between consecutive elements of thisChain
, going right to left:op(x_1, op(x_2, ... op(x_{n1}, x_n)...))
where x_{1}, ..., x_{n} are the elements of thisChain
.
final def reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]
Applies a binary operator to all elements of this
Chain
, going right to left, returning the result in aSome
.Applies a binary operator to all elements of this
Chain
, going right to left, returning the result in aSome
. U
the result of the binary operator
 op
the binary operator
 returns
a
Some
containing the result ofreduceRight(op)
final def reverse: Chain[T]
Returns new
Chain
with elements in reverse order.Returns new
Chain
with elements in reverse order. returns
a new
Chain
with all elements of thisChain
in reversed order.
final def reverseIterator: Iterator[T]
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
Note:
chain.reverseIterator
is the same aschain.reverse.iterator
, but might be more efficient. returns
an iterator yielding the elements of this
Chain
in reversed order
final def reverseMap[U](f: (T) ⇒ U): Chain[U]
Builds a new
Chain
by applying a function to all elements of thisChain
and collecting the results in reverse order.Builds a new
Chain
by applying a function to all elements of thisChain
and collecting the results in reverse order.Note:
chain.reverseMap(f)
is the same aschain.reverse.map(f)
, but might be more efficient. U
the element type of the returned
Chain
. f
the function to apply to each element.
 returns
a new
Chain
resulting from applying the given functionf
to each element of thisChain
and collecting the results in reverse order.
final def sameElements[U >: T](that: Chain[U]): Boolean
Checks if the given
Chain
contains the same elements in the same order as thisChain
.Checks if the given
Chain
contains the same elements in the same order as thisChain
. that
the
Chain
with which to compare returns
true
, if both this and the givenChain
contain the same elements in the same order,false
otherwise.
final def sameElements[U >: T](that: Every[U]): Boolean
Checks if the given
Every
contains the same elements in the same order as thisChain
.Checks if the given
Every
contains the same elements in the same order as thisChain
. that
the
Every
with which to compare returns
true
, if both this and the givenEvery
contain the same elements in the same order,false
otherwise.
final def sameElements[U >: T](that: GenIterable[U]): Boolean
Checks if the given
GenIterable
contains the same elements in the same order as thisChain
.Checks if the given
GenIterable
contains the same elements in the same order as thisChain
. that
the
GenIterable
with which to compare returns
true
, if both thisChain
and the givenGenIterable
contain the same elements in the same order,false
otherwise.
final def scan[U >: T](z: U)(op: (U, U) ⇒ U): Chain[U]
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")
 U
a type parameter for the binary operator, a supertype of T, and the type of the resulting
Chain
. z
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.) op
a binary operator that must be associative
 returns
a new
Chain
containing the prefix scan of the elements in thisChain
final def scanLeft[B](z: B)(op: (B, T) ⇒ B): Chain[B]
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")
 B
the result type of the binary operator and type of the resulting
Chain
 z
the start value.
 op
the binary operator.
 returns
a new
Chain
containing the intermediate results of insertingop
between consecutive elements of thisChain
, going left to right, with the start value,z
, on the left.
final def scanRight[B](z: B)(op: (T, B) ⇒ B): Chain[B]
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")
 B
the result of the binary operator and type of the resulting
Chain
 z
the start value
 op
the binary operator
 returns
a new
Chain
containing the intermediate results of insertingop
between consecutive elements of thisChain
, going right to left, with the start value,z
, on the right.
final def segmentLength(p: (T) ⇒ Boolean, from: Int): Int
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
 p
the predicate used to test elements.
 from
the index where the search starts.
final def size: Int
The size of this
Chain
.The size of this
Chain
.Note:
length
andsize
yield the same result, which will be>
= 1. returns
the number of elements in this
Chain
.
final def sliding(size: Int, step: Int): Iterator[Chain[T]]
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.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. size
the number of elements per group
 step
the distance between the first elements of successive groups
 returns
an iterator producing
Chain
s of sizesize
, except the last and the only element will be truncated if there are fewer elements thansize
.
final def sliding(size: Int): Iterator[Chain[T]]
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
Chain
s of sizesize
, except the last and the only element will be truncated if there are fewer elements thansize
.
final def sortBy[U](f: (T) ⇒ U)(implicit ord: Ordering[U]): Chain[T]
Sorts this
Chain
according to theOrdering
of the result of applying the given function to every element.Sorts this
Chain
according to theOrdering
of the result of applying the given function to every element. U
the target type of the transformation
f
, and the type where theOrdering
ord
is defined. f
the transformation function mapping elements to some other domain
U
. ord
the ordering assumed on domain
U
. returns
a
Chain
consisting of the elements of thisChain
sorted according to theOrdering
wherex < y if ord.lt(f(x), f(y))
.
final def sortWith(lt: (T, T) ⇒ Boolean): Chain[T]
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 sortedChain
as in the original. returns
a
Chain
consisting of the elements of thisChain
sorted according to the comparison functionlt
.
final def sorted[U >: T](implicit ord: Ordering[U]): Chain[U]
Sorts this
Chain
according to anOrdering
.Sorts this
Chain
according to anOrdering
.The sort is stable. That is, elements that are equal (as determined by
lt
) appear in the same order in the sortedChain
as in the original. ord
the
Ordering
to be used to compare elements. returns
a
Chain
consisting of the elements of thisChain
sorted according to the comparison functionlt
.
final def startsWith[B](that: Chain[B], offset: Int): Boolean
Indicates whether this
Chain
starts with the givenChain
at the given index.Indicates whether this
Chain
starts with the givenChain
at the given index. that
the
Chain
slice to look for in thisChain
 offset
the index at which this
Chain
is searched. returns
true
if thisChain
hasthat
as a slice at the indexoffset
,false
otherwise.
final def startsWith[B](that: Every[B], offset: Int): Boolean
Indicates whether this
Chain
starts with the givenEvery
at the given index.Indicates whether this
Chain
starts with the givenEvery
at the given index. that
the
Every
slice to look for in thisChain
 offset
the index at which this
Chain
is searched. returns
true
if thisChain
hasthat
as a slice at the indexoffset
,false
otherwise.
final def startsWith[B](that: Chain[B]): Boolean
Indicates whether this
Chain
starts with the givenChain
.Indicates whether this
Chain
starts with the givenChain
. that
the
Chain
to test returns
true
if this collection hasthat
as a prefix,false
otherwise.
final def startsWith[B](that: Every[B]): Boolean
Indicates whether this
Chain
starts with the givenEvery
.Indicates whether this
Chain
starts with the givenEvery
. that
the
Every
to test returns
true
if this collection hasthat
as a prefix,false
otherwise.
final def startsWith[B](that: GenSeq[B], offset: Int): Boolean
Indicates whether this
Chain
starts with the givenGenSeq
at the given index.Indicates whether this
Chain
starts with the givenGenSeq
at the given index. that
the
GenSeq
slice to look for in thisChain
 offset
the index at which this
Chain
is searched. returns
true
if thisChain
hasthat
as a slice at the indexoffset
,false
otherwise.
final def startsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Chain
starts with the givenGenSeq
.Indicates whether this
Chain
starts with the givenGenSeq
. that
the
GenSeq
slice to look for in thisChain
 returns
true
if thisChain
hasthat
as a prefix,false
otherwise.
def stringPrefix: String
Returns
"Chain"
, the prefix of this object'stoString
representation.Returns
"Chain"
, the prefix of this object'stoString
representation. returns
the string
"Chain"
final def sum[U >: T](implicit num: Numeric[U]): U
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 implicitNumeric[T]
exists. returns
the sum of all elements
final def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
Converts this
Chain
into a collection of typeCol
by copying all elements.Converts this
Chain
into a collection of typeCol
by copying all elements. Col
the collection type to build.
 returns
a new collection containing all elements of this
Chain
.
final def toArray[U >: T](implicit classTag: ClassTag[U]): Array[U]
Converts this
Chain
to an array.Converts this
Chain
to an array. returns
an array containing all elements of this
Chain
. AClassTag
must be available for the element type of thisChain
.
final def toBuffer[U >: T]: Buffer[U]
Converts this
Chain
to a mutable buffer.Converts this
Chain
to a mutable buffer. returns
a buffer containing all elements of this
Chain
.
final def toIndexedSeq: IndexedSeq[T]
Converts this
Chain
to an immutableIndexedSeq
.Converts this
Chain
to an immutableIndexedSeq
. returns
an immutable
IndexedSeq
containing all elements of thisChain
.
final def toIterable: Iterable[T]
Converts this
Chain
to an iterable collection.Converts this
Chain
to an iterable collection. returns
an
Iterable
containing all elements of thisChain
.
final def toIterator: Iterator[T]
Returns an
Iterator
over the elements in thisChain
.Returns an
Iterator
over the elements in thisChain
. returns
an
Iterator
containing all elements of thisChain
.
val toList: List[T]
final def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
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 keyvalue pair in the map. Duplicate keys will be overwritten by later keys. returns
a map of type
immutable.Map[K, V]
containing all key/value pairs of type(K, V)
of thisChain
.
final def toSeq: Seq[T]
Converts this
Chain
to an immutableIndexedSeq
.Converts this
Chain
to an immutableIndexedSeq
. returns
an immutable
IndexedSeq
containing all elements of thisChain
.
final def toSet[U >: T]: Set[U]
Converts this
Chain
to a set.Converts this
Chain
to a set. returns
a set containing all elements of this
Chain
.
final def toStream: Stream[T]
Converts this
Chain
to a stream.Converts this
Chain
to a stream. returns
a stream containing all elements of this
Chain
.
def toString(): String
Returns a string representation of this
Chain
.Returns a string representation of this
Chain
. returns
the string
"Chain"
followed by the result of invokingtoString
on thisChain
's elements, surrounded by parentheses.
 Definition Classes
 Chain → Any
final def toTraversable: Traversable[T]
Converts this
Chain
to an unspecified Traversable.Converts this
Chain
to an unspecified Traversable. returns
a
Traversable
containing all elements of thisChain
.
final def toVector: Vector[T]
Converts this
Chain
to aVector
.Converts this
Chain
to aVector
. returns
a
Vector
containing all elements of thisChain
.
final def transpose[U](implicit ev: <:<[T, Chain[U]]): Chain[Chain[U]]
final def union[U >: T](that: GenSeq[U])(implicit cbf: CanBuildFrom[List[T], U, List[U]]): Chain[U]
Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenGenSeq
.Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenGenSeq
.chainX
union
ys
is equivalent tochainX
++
ys
.Another way to express this is that
chainX
union
ys
computes the orderpresevring multiset union ofchainX
andys
. Thisunion
method is hence a counterpart ofdiff
andintersect
that also work on multisets. that
the
GenSeq
to add. returns
a new
Chain
that contains all elements of thisChain
followed by all elements ofthat
GenSeq
.
final def union[U >: T](that: Chain[U]): Chain[U]
Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenChain
.Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenChain
.chainX
union
chainY
is equivalent tochainX
++
chainY
.Another way to express this is that
chainX
union
chainY
computes the orderpresevring multiset union ofchainX
andchainY
. Thisunion
method is hence a counterpart ofdiff
andintersect
that also work on multisets. that
the
Chain
to add. returns
a new
Chain
that contains all elements of thisChain
followed by all elements ofthat
.
final def union[U >: T](that: Every[U]): Chain[U]
Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenEvery
.Produces a new
Chain
that contains all elements of thisChain
and also all elements of a givenEvery
.chainX
union
everyY
is equivalent tochainX
++
everyY
.Another way to express this is that
chainX
union
everyY
computes the orderpresevring multiset union ofchainX
andeveryY
. Thisunion
method is hence a counterpart ofdiff
andintersect
that also work on multisets. that
the
Every
to add. returns
a new
Chain
that contains all elements of thisChain
followed by all elements ofthat
Every
.
final def unzip[L, R](implicit asPair: (T) ⇒ (L, R)): (Chain[L], Chain[R])
Converts this
Chain
of pairs into twoChain
s of the first and second half of each pair.Converts this
Chain
of pairs into twoChain
s of the first and second half of each pair. L
the type of the first half of the element pairs
 R
the type of the second half of the element pairs
 asPair
an implicit conversion that asserts that the element type of this
Chain
is a pair. returns
a pair of
Chain
s, containing the first and second half, respectively, of each element pair of thisChain
.
final def unzip3[L, M, R](implicit asTriple: (T) ⇒ (L, M, R)): (Chain[L], Chain[M], Chain[R])
Converts this
Chain
of triples into threeChain
s of the first, second, and and third element of each triple.Converts this
Chain
of triples into threeChain
s of the first, second, and and third element of each triple. L
the type of the first member of the element triples
 R
the type of the third member of the element triples
 asTriple
an implicit conversion that asserts that the element type of this
Chain
is a triple. returns
a triple of
Chain
s, containing the first, second, and third member, respectively, of each element triple of thisChain
.
final def updated[U >: T](idx: Int, elem: U): Chain[U]
A copy of this
Chain
with one single replaced element.A copy of this
Chain
with one single replaced element. idx
the position of the replacement
 elem
the replacing element
 returns
a copy of this
Chain
with the element at positionidx
replaced byelem
.
 Exceptions thrown
IndexOutOfBoundsException
if the passed index is greater than or equal to the length of thisChain
final def zipAll[O, U >: T](other: Iterable[O], thisElem: U, otherElem: O): Chain[(U, O)]
Returns a
Chain
formed from thisChain
and an iterable collection by combining corresponding elements in pairs.Returns a
Chain
formed from thisChain
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. other
the
Iterable
providing the second half of each result pair thisElem
the element to be used to fill up the result if this
Chain
is shorter thanthat
Iterable
. returns
a new
Chain
containing pairs consisting of corresponding elements of thisChain
andthat
. The length of the returned collection is the maximum of the lengths of thisChain
andthat
. If thisChain
is shorter thanthat
,thisElem
values are used to pad the result. Ifthat
is shorter than thisChain
,thatElem
values are used to pad the result.
final def zipWithIndex: Chain[(T, Int)]
Zips this
Chain
with its indices.Zips this
Chain
with its indices. returns
A new
Chain
containing pairs consisting of all elements of thisChain
paired with their index. Indices start at 0.
Inherited from AnyVal
Inherited from Any
Ungrouped