0.6004295*List*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
a function that takes an argument

`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.List.liftDoc ·

0.5920944*LinearSeq*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
a function that takes an argument

`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.LinearSeq.liftDoc ·

0.5893959*LinearSeq*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
a function that takes an argument

`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.LinearSeq.liftDoc ·

0.5856794*Seq*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.Seq.liftDoc ·

0.57923704*AbstractSeq*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.AbstractSeq.liftDoc ·

0.5592747*Seq*[*A*].**lift**: (*Int*) =>*Option*[*A*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.Seq.liftDoc ·

0.4209922*ofRef*[*A*].**lift**: (*Int*) =>*Option*[*A*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofRef.liftDoc ·

0.41529927*Range*.**lift**: (*Int*) =>*Option*[*Int*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.Range.liftDoc ·

0.41529927*Inclusive*.**lift**: (*Int*) =>*Option*[*Int*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.Range.Inclusive.liftDoc ·

0.41529927*ofInt*.**lift**: (*Int*) =>*Option*[*Int*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.mutable.WrappedArray.ofInt.liftDoc ·

0.41529927*ofInt*.**lift**: (*Int*) =>*Option*[*Int*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofInt.liftDoc ·

0.41414917*ofShort*.**lift**: (*Int*) =>*Option*[*Short*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.mutable.WrappedArray.ofShort.liftDoc ·

0.41414917*ofShort*.**lift**: (*Int*) =>*Option*[*Short*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofShort.liftDoc ·

0.4141411*WrappedString*.**lift**: (*Int*) =>*Option*[*Char*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.immutable.WrappedString.liftDoc ·

0.4141411*StringBuilder*.**lift**: (*Int*) =>*Option*[*Char*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.mutable.StringBuilder.liftDoc ·

0.4141411*ofChar*.**lift**: (*Int*) =>*Option*[*Char*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.mutable.WrappedArray.ofChar.liftDoc ·

0.4141411*ofStringArray*.**lift**: (*Int*) =>*Option*[*Char*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofStringArray.liftDoc ·

0.4141411*ofChar*.**lift**: (*Int*) =>*Option*[*Char*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofChar.liftDoc ·

0.4140417*ofByte*.**lift**: (*Int*) =>*Option*[*Byte*]Turns this partial function into a plain function returning an

`Option`

result.- returns
`x`

to`Some(this(x))`

if`this`

is defined for`x`

, and to`None`

otherwise.- see
Function.unlift

scala-library scala.collection.mutable.WrappedArray.ofByte.liftDoc ·

0.4140417*ofByte*.**lift**: (*Int*) =>*Option*[*Byte*]- scalaz-core_2.11 scalaz.ImmutableArray.WrappedImmutableArray.ofByte.liftDoc ·

0.4512721*List*[*A*].**apply**(*Int*):*A*Selects an element by its index in the list. Note: the execution of

`apply`

may take time proportional to the index value.- returns
the element of this list at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.immutable.List.applyDoc ·

0.44293705*LinearSeq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the immutable sequence.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this immutable sequence at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.immutable.LinearSeq.applyDoc ·

0.4402385*LinearSeq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the sequence.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this sequence at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.LinearSeq.applyDoc ·

0.43652204*Seq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the immutable sequence.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this immutable sequence at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.immutable.Seq.applyDoc ·

0.43007967*AbstractSeq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the sequence.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this sequence at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.AbstractSeq.applyDoc ·

0.4101173*Seq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the sequence.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this sequence at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.Seq.applyDoc ·

0.40683025*GenSeq*[*A*].**apply**(*Int*):*A*Selects an element by its index in the collection.

Example:

`scala> val x = List(1, 2, 3, 4, 5) x: List[Int] = List(1, 2, 3, 4, 5) scala> x(3) res1: Int = 4`

- params
- idx
The index to select.

- returns
the element of this collection at index

`idx`

, where`0`

indicates the first element.- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`idx`

does not satisfy`0 <= idx < length`

.

scala-library scala.collection.GenSeq.applyDoc ·

0.4458359*GenSeqFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]Produces a collection containing values of a given function over a range of integer values starting from 0.

- params
- n
The number of elements in the collection

- f
The function computing element values

- returns
A collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.GenSeqFactory.tabulateDoc ·

0.4458359*GenTraversableFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]Produces a collection containing values of a given function over a range of integer values starting from 0.

- params
- n
The number of elements in the collection

- f
The function computing element values

- returns
A collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.GenTraversableFactory.tabulateDoc ·

0.4458359*IndexedSeqFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]Produces a collection containing values of a given function over a range of integer values starting from 0.

- params
- n
The number of elements in the collection

- f
The function computing element values

- returns
A collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.IndexedSeqFactory.tabulateDoc ·

0.4458359*ParFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]Produces a parallel collection containing values of a given function over a range of integer values starting from 0.

- params
- n
The number of elements in the parallel collection

- f
The function computing element values

- returns
A parallel collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.ParFactory.tabulateDoc ·

0.4458359*SeqFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]- params
- n
The number of elements in the collection

- f
The function computing element values

- returns
A collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.SeqFactory.tabulateDoc ·

0.4458359*TraversableFactory*[*CC*].**tabulate**[*A*](*Int*)((*Int*) =>*A*):*CC*[*A*]- params
- n
The number of elements in the collection

- f
The function computing element values

- returns
A collection consisting of elements

`f(0), ..., f(n -1)`

scala-library scala.collection.generic.TraversableFactory.tabulateDoc ·

0.4347422*Foldable*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Foldable.indexDoc ·

0.4347422*FromFoldMap*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Foldable.FromFoldMap.indexDoc ·

0.4347422*FromFoldr*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Foldable.FromFoldr.indexDoc ·

0.4347422*Foldable1*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Foldable1.indexDoc ·

0.4347422*Index*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Index.indexDoc ·

0.4347422*Traverse*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Traverse.indexDoc ·

0.4347422*Traverse1*[*F*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.Traverse1.indexDoc ·

0.4187721*IsomorphismIndex*[*F*,*G*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.IsomorphismIndex.indexDoc ·

0.4187721*IsomorphismFoldable*[*F*,*G*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.IsomorphismFoldable.indexDoc ·

0.4187721*IsomorphismTraverse*[*F*,*G*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.IsomorphismTraverse.indexDoc ·

0.4187721*IsomorphismFoldable1*[*F*,*G*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.IsomorphismFoldable1.indexDoc ·

0.4187721*IsomorphismTraverse1*[*F*,*G*].**index**[*A*](*F*[*A*],*Int*):*Option*[*A*]- returns
the element at index

`i`

in a`Some`

, or`None`

if the given index falls outside of the range

scalaz-core_2.11 scalaz.IsomorphismTraverse1.indexDoc ·

0.43183935*List*[*A*].**take**(*Int*):*List*[*A*]Selects first

n elements.- params
- n
the number of elements to take from this list.

- returns
a list consisting only of the first

`n`

elements of this list, or else the whole list, if it has less than`n`

elements.

scala-library scala.collection.immutable.List.takeDoc ·

0.42386323*LinearSeq*[*A*].**take**(*Int*):*LinearSeq*[*A*]Selects first

n elements.- params
- n
the number of elements to take from this immutable sequence.

- returns
a immutable sequence consisting only of the first

`n`

elements of this immutable sequence, or else the whole immutable sequence, if it has less than`n`

elements.

scala-library scala.collection.immutable.LinearSeq.takeDoc ·

0.4212809*LinearSeq*[*A*].**take**(*Int*):*LinearSeq*[*A*]Selects first

n elements.- params
- n
the number of elements to take from this sequence.

- returns
a sequence consisting only of the first

`n`

elements of this sequence, or else the whole sequence, if it has less than`n`

elements.

scala-library scala.collection.LinearSeq.takeDoc ·

0.41772446*Seq*[*A*].**take**(*Int*):*Seq*[*A*]Selects first

n elements.- params
- n
the number of elements to take from this immutable sequence.

- returns
a immutable sequence consisting only of the first

`n`

elements of this immutable sequence, or else the whole immutable sequence, if it has less than`n`

elements.

scala-library scala.collection.immutable.Seq.takeDoc ·

0.41155952*AbstractSeq*[*A*].**take**(*Int*):*Seq*[*A*]Selects first

n elements.- params
- n
the number of elements to take from this sequence.

- returns
a sequence consisting only of the first

`n`

elements of this sequence, or else the whole sequence, if it has less than`n`

elements.

scala-library scala.collection.AbstractSeq.takeDoc ·

0.40833446*Iterable*[*A*].**take**(*Int*):*Iterable*[*A*]Selects first

n elements.Note: might return different results for different runs, unless the underlying collection type is ordered.

- params
- n
the number of elements to take from this immutable iterable collection.

- returns
a immutable iterable collection consisting only of the first

`n`

elements of this immutable iterable collection, or else the whole immutable iterable collection, if it has less than`n`

elements.

scala-library scala.collection.immutable.Iterable.takeDoc ·

0.40820083*Traversable*[*A*].**take**(*Int*):*Traversable*[*A*]Selects first

n elements.Note: might return different results for different runs, unless the underlying collection type is ordered.

- params
- n
the number of elements to take from this collection.

- returns
a collection consisting only of the first

`n`

elements of this collection, or else the whole collection, if it has less than`n`

elements.

scala-library scala.collection.immutable.Traversable.takeDoc ·

0.43183935*List*[*A*].**drop**(*Int*):*List*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this list.

- returns
a list consisting of all elements of this list except the first

`n`

ones, or else the empty list, if this list has less than`n`

elements.

scala-library scala.collection.immutable.List.dropDoc ·

0.42386323*LinearSeq*[*A*].**drop**(*Int*):*LinearSeq*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this immutable sequence.

- returns
a immutable sequence consisting of all elements of this immutable sequence except the first

`n`

ones, or else the empty immutable sequence, if this immutable sequence has less than`n`

elements.

scala-library scala.collection.immutable.LinearSeq.dropDoc ·

0.4212809*LinearSeq*[*A*].**drop**(*Int*):*LinearSeq*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this sequence.

- returns
a sequence consisting of all elements of this sequence except the first

`n`

ones, or else the empty sequence, if this sequence has less than`n`

elements.

scala-library scala.collection.LinearSeq.dropDoc ·

0.41772446*Seq*[*A*].**drop**(*Int*):*Seq*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this immutable sequence.

- returns
a immutable sequence consisting of all elements of this immutable sequence except the first

`n`

ones, or else the empty immutable sequence, if this immutable sequence has less than`n`

elements.

scala-library scala.collection.immutable.Seq.dropDoc ·

0.41155952*AbstractSeq*[*A*].**drop**(*Int*):*Seq*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this sequence.

- returns
a sequence consisting of all elements of this sequence except the first

`n`

ones, or else the empty sequence, if this sequence has less than`n`

elements.

scala-library scala.collection.AbstractSeq.dropDoc ·

0.40833446*Iterable*[*A*].**drop**(*Int*):*Iterable*[*A*]Selects all elements except first

n ones.Note: might return different results for different runs, unless the underlying collection type is ordered.

- params
- n
the number of elements to drop from this immutable iterable collection.

- returns
a immutable iterable collection consisting of all elements of this immutable iterable collection except the first

`n`

ones, or else the empty immutable iterable collection, if this immutable iterable collection has less than`n`

elements.

scala-library scala.collection.immutable.Iterable.dropDoc ·

0.40820083*Traversable*[*A*].**drop**(*Int*):*Traversable*[*A*]Selects all elements except first

n ones.- params
- n
the number of elements to drop from this collection.

- returns
a collection consisting of all elements of this collection except the first

`n`

ones, or else the empty collection, if this collection has less than`n`

elements.

scala-library scala.collection.immutable.Traversable.dropDoc ·

0.43183935*List*[*A*].**dropRight**(*Int*):*List*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a list consisting of all elements of this list except the last

`n`

ones, or else the empty list, if this list has less than`n`

elements.

scala-library scala.collection.immutable.List.dropRightDoc ·

0.42386323*LinearSeq*[*A*].**dropRight**(*Int*):*LinearSeq*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a immutable sequence consisting of all elements of this immutable sequence except the last

`n`

ones, or else the empty immutable sequence, if this immutable sequence has less than`n`

elements.

scala-library scala.collection.immutable.LinearSeq.dropRightDoc ·

0.4212809*LinearSeq*[*A*].**dropRight**(*Int*):*LinearSeq*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a sequence consisting of all elements of this sequence except the last

`n`

ones, or else the empty sequence, if this sequence has less than`n`

elements.

scala-library scala.collection.LinearSeq.dropRightDoc ·

0.41772446*Seq*[*A*].**dropRight**(*Int*):*Seq*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a immutable sequence consisting of all elements of this immutable sequence except the last

`n`

ones, or else the empty immutable sequence, if this immutable sequence has less than`n`

elements.

scala-library scala.collection.immutable.Seq.dropRightDoc ·

0.41155952*AbstractSeq*[*A*].**dropRight**(*Int*):*Seq*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a sequence consisting of all elements of this sequence except the last

`n`

ones, or else the empty sequence, if this sequence has less than`n`

elements.

scala-library scala.collection.AbstractSeq.dropRightDoc ·

0.40833446*Iterable*[*A*].**dropRight**(*Int*):*Iterable*[*A*]Selects all elements except last

n ones.- params
- n
The number of elements to take

- returns
a immutable iterable collection consisting of all elements of this immutable iterable collection except the last

`n`

ones, or else the empty immutable iterable collection, if this immutable iterable collection has less than`n`

elements.

scala-library scala.collection.immutable.Iterable.dropRightDoc ·

0.43183935*List*[*A*].**takeRight**(*Int*):*List*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a list consisting only of the last

`n`

elements of this list, or else the whole list, if it has less than`n`

elements.

scala-library scala.collection.immutable.List.takeRightDoc ·

0.42386323*LinearSeq*[*A*].**takeRight**(*Int*):*LinearSeq*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a immutable sequence consisting only of the last

`n`

elements of this immutable sequence, or else the whole immutable sequence, if it has less than`n`

elements.

scala-library scala.collection.immutable.LinearSeq.takeRightDoc ·

0.4212809*LinearSeq*[*A*].**takeRight**(*Int*):*LinearSeq*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a sequence consisting only of the last

`n`

elements of this sequence, or else the whole sequence, if it has less than`n`

elements.

scala-library scala.collection.LinearSeq.takeRightDoc ·

0.41772446*Seq*[*A*].**takeRight**(*Int*):*Seq*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a immutable sequence consisting only of the last

`n`

elements of this immutable sequence, or else the whole immutable sequence, if it has less than`n`

elements.

scala-library scala.collection.immutable.Seq.takeRightDoc ·

0.41155952*AbstractSeq*[*A*].**takeRight**(*Int*):*Seq*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a sequence consisting only of the last

`n`

elements of this sequence, or else the whole sequence, if it has less than`n`

elements.

scala-library scala.collection.AbstractSeq.takeRightDoc ·

0.40833446*Iterable*[*A*].**takeRight**(*Int*):*Iterable*[*A*]Selects last

n elements.- params
- n
the number of elements to take

- returns
a immutable iterable collection consisting only of the last

`n`

elements of this immutable iterable collection, or else the whole immutable iterable collection, if it has less than`n`

elements.

scala-library scala.collection.immutable.Iterable.takeRightDoc ·

0.42075574*ApplicativeOps*[*F*,*A*].**replicateM**(*Int*):*F*[*List*[*A*]]- scalaz-core_2.11 scalaz.syntax.ApplicativeOps.replicateMDoc ·

0.4140111*List*[*A*].**slice**(*Int*,*Int*):*List*[*A*]- returns
a list containing the elements greater than or equal to index

`from`

extending up to (but not including) index`until`

of this list.- example
`// Given a list val letters = List('a','b','c','d','e') // `slice` returns all elements beginning at index `from` and afterwards, // up until index `until` (excluding index `until`.) letters.slice(1,3) // Returns List('b','c')`

scala-library scala.collection.immutable.List.sliceDoc ·

0.40636426*LinearSeq*[*A*].**slice**(*Int*,*Int*):*LinearSeq*[*A*]Selects an interval of elements. The returned collection is made up of all elements

`x`

which satisfy the invariant:`from <= indexOf(x) < until`

- params
- unc_from
the lowest index to include from this immutable sequence.

- unc_until
the lowest index to EXCLUDE from this immutable sequence.

- returns
a immutable sequence containing the elements greater than or equal to index

`from`

extending up to (but not including) index`until`

of this immutable sequence.

scala-library scala.collection.immutable.LinearSeq.sliceDoc ·

0.4140111*List*[*A*].**sliding**(*Int*):*Iterator*[*List*[*A*]]Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) "Sliding window" step is 1 by default.

- params
- size
the number of elements per group

- returns
An iterator producing lists of size

`size`

, except the last and the only element will be truncated if there are fewer elements than size.- see
scala.collection.Iterator, method

`sliding`

scala-library scala.collection.immutable.List.slidingDoc ·

0.40636426*LinearSeq*[*A*].**sliding**(*Int*):*Iterator*[*LinearSeq*[*A*]]Groups elements in fixed size blocks by passing a "sliding window" over them (as opposed to partitioning them, as is done in grouped.) "Sliding window" step is 1 by default.

- params
- size
the number of elements per group

- returns
An iterator producing immutable sequences of size

`size`

, except the last and the only element will be truncated if there are fewer elements than size.- see
scala.collection.Iterator, method

`sliding`

scala-library scala.collection.immutable.LinearSeq.slidingDoc ·

0.4140111*List*[*A*].**combinations**(*Int*):*Iterator*[*List*[*A*]]Iterates over combinations. A _combination_ of length

`n`

is a subsequence of the original sequence, with the elements taken in order. Thus,`"xy"`

and`"yy"`

are both length-2 combinations of`"xyy"`

, but`"yx"`

is not. If there is more than one way to generate the same subsequence, only one will be returned.For example,

`"xyyy"`

has three different ways to generate`"xy"`

depending on whether the first, second, or third`"y"`

is selected. However, since all are identical, only one will be chosen. Which of the three will be taken is an implementation detail that is not defined.- returns
An Iterator which traverses the possible n-element combinations of this list.

- example
`"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

scala-library scala.collection.immutable.List.combinationsDoc ·

0.40636426*LinearSeq*[*A*].**combinations**(*Int*):*Iterator*[*LinearSeq*[*A*]]Iterates over combinations. A _combination_ of length

`n`

is a subsequence of the original sequence, with the elements taken in order. Thus,`"xy"`

and`"yy"`

are both length-2 combinations of`"xyy"`

, but`"yx"`

is not. If there is more than one way to generate the same subsequence, only one will be returned.For example,

`"xyyy"`

has three different ways to generate`"xy"`

depending on whether the first, second, or third`"y"`

is selected. However, since all are identical, only one will be chosen. Which of the three will be taken is an implementation detail that is not defined.- returns
An Iterator which traverses the possible n-element combinations of this immutable sequence.

- example
`"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

scala-library scala.collection.immutable.LinearSeq.combinationsDoc ·

0.40388852*LinearSeq*[*A*].**combinations**(*Int*):*Iterator*[*LinearSeq*[*A*]]Iterates over combinations. A _combination_ of length

`n`

is a subsequence of the original sequence, with the elements taken in order. Thus,`"xy"`

and`"yy"`

are both length-2 combinations of`"xyy"`

, but`"yx"`

is not. If there is more than one way to generate the same subsequence, only one will be returned.For example,

`"xyyy"`

has three different ways to generate`"xy"`

depending on whether the first, second, or third`"y"`

is selected. However, since all are identical, only one will be chosen. Which of the three will be taken is an implementation detail that is not defined.- returns
An Iterator which traverses the possible n-element combinations of this sequence.

- example
`"abbbc".combinations(2) = Iterator(ab, ac, bb, bc)`

scala-library scala.collection.LinearSeq.combinationsDoc ·

0.4140111*List*[*A*].**padTo**(*Int*,*A*):*List*[*A*]A copy of this list with an element value appended until a given target length is reached.

- typeParams
- That
the class of the returned collection. In the standard library configuration,

`That`

is always`List[B]`

because an implicit of type`CanBuildFrom[List, B, That]`

is defined in object`List`

.- B
the element type of the returned list.

- params
- elem
the padding value

- len
the target length

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

. This is usually the`canBuildFrom`

value defined in object`List`

.

- returns
a new collection of type

`That`

consisting of all elements of this list followed by the minimal number of occurrences of`elem`

so that the resulting collection has a length of at least`len`

.

scala-library scala.collection.immutable.List.padToDoc ·

0.40636426*LinearSeq*[*A*].**padTo**(*Int*,*A*):*Seq*[*A*]A copy of this immutable sequence with an element value appended until a given target length is reached.

- typeParams
- That
the class of the returned collection. Where possible,

`That`

is the same class as the current collection class`Repr`

, but this depends on the element type`B`

being admissible for that class, which means that an implicit instance of type`CanBuildFrom[Repr, B, That]`

is found.- B
the element type of the returned immutable sequence.

- params
- elem
the padding value

- len
the target length

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

.

- returns
a new collection of type

`That`

consisting of all elements of this immutable sequence followed by the minimal number of occurrences of`elem`

so that the resulting collection has a length of at least`len`

.

scala-library scala.collection.immutable.LinearSeq.padToDoc ·

0.40388852*LinearSeq*[*A*].**padTo**(*Int*,*A*):*Seq*[*A*]A copy of this sequence with an element value appended until a given target length is reached.

- typeParams
- That
the class of the returned collection. Where possible,

`That`

is the same class as the current collection class`Repr`

, but this depends on the element type`B`

being admissible for that class, which means that an implicit instance of type`CanBuildFrom[Repr, B, That]`

is found.- B
the element type of the returned sequence.

- params
- elem
the padding value

- len
the target length

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

.

- returns
a new collection of type

`That`

consisting of all elements of this sequence followed by the minimal number of occurrences of`elem`

so that the resulting collection has a length of at least`len`

.

scala-library scala.collection.LinearSeq.padToDoc ·

0.4140111*List*[*A*].**grouped**(*Int*):*Iterator*[*List*[*A*]]Partitions elements in fixed size lists.

- params
- size
the number of elements per group

- returns
An iterator producing lists of size

`size`

, except the last will be less than size`size`

if the elements don't divide evenly.- see
scala.collection.Iterator, method

`grouped`

scala-library scala.collection.immutable.List.groupedDoc ·

0.40636426*LinearSeq*[*A*].**grouped**(*Int*):*Iterator*[*LinearSeq*[*A*]]Partitions elements in fixed size immutable sequences.

- params
- size
the number of elements per group

- returns
An iterator producing immutable sequences of size

`size`

, except the last will be less than size`size`

if the elements don't divide evenly.- see
scala.collection.Iterator, method

`grouped`

scala-library scala.collection.immutable.LinearSeq.groupedDoc ·

0.4140111*List*[*A*].**updated**(*Int*,*A*):*List*[*A*]A copy of this list with one single replaced element.

- typeParams
- That
the class of the returned collection. In the standard library configuration,

`That`

is always`List[B]`

because an implicit of type`CanBuildFrom[List, B, That]`

is defined in object`List`

.- B
the element type of the returned list.

- params
- elem
the replacing element

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

. This is usually the`canBuildFrom`

value defined in object`List`

.- index
the position of the replacement

- returns
a new list

`which is a copy of this list with the element at position`

index`replaced by`

elem`.`

- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`index`

does not satisfy`0 <= index < length`

.

scala-library scala.collection.immutable.List.updatedDoc ·

0.40636426*LinearSeq*[*A*].**updated**(*Int*,*A*):*Seq*[*A*]A copy of this immutable sequence with one single replaced element.

- typeParams
- That
the class of the returned collection. Where possible,

`That`

is the same class as the current collection class`Repr`

, but this depends on the element type`B`

being admissible for that class, which means that an implicit instance of type`CanBuildFrom[Repr, B, That]`

is found.- B
the element type of the returned immutable sequence.

- params
- elem
the replacing element

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

.- index
the position of the replacement

- returns
a new immutable sequence

`which is a copy of this immutable sequence with the element at position`

index`replaced by`

elem`.`

- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`index`

does not satisfy`0 <= index < length`

.

scala-library scala.collection.immutable.LinearSeq.updatedDoc ·

0.40388852*LinearSeq*[*A*].**updated**(*Int*,*A*):*Seq*[*A*]A copy of this sequence with one single replaced element.

- typeParams
- That
`That`

is the same class as the current collection class`Repr`

, but this depends on the element type`B`

being admissible for that class, which means that an implicit instance of type`CanBuildFrom[Repr, B, That]`

is found.- B
the element type of the returned sequence.

- params
- elem
the replacing element

- bf
`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

.- index
the position of the replacement

- returns
a new sequence

`which is a copy of this sequence with the element at position`

index`replaced by`

elem`.`

- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`index`

does not satisfy`0 <= index < length`

.

scala-library scala.collection.LinearSeq.updatedDoc ·

0.41105884**scala.math.Numeric.IntIsIntegral.tryCompare**(*Int*,*Int*):*Some*[*Int*]Returns whether a comparison between

`x`

and`y`

is defined, and if so the result of`compare(x, y)`

.scala-library scala.math.Numeric.IntIsIntegral.tryCompareDoc ·

0.40728527*List*[*A*].**padTo**[*B >: A*,*That*](*Int*,*B*)(implicit*CanBuildFrom*[*List*[*A*],*B*,*That*]):*That*A copy of this list with an element value appended until a given target length is reached.

- typeParams
- That
the class of the returned collection. In the standard library configuration,

`That`

is always`List[B]`

because an implicit of type`CanBuildFrom[List, B, That]`

is defined in object`List`

.- B
the element type of the returned list.

- params
- elem
the padding value

- len
the target length

- bf
an implicit value of class

`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

. This is usually the`canBuildFrom`

value defined in object`List`

.

- returns
a new collection of type

`That`

consisting of all elements of this list followed by the minimal number of occurrences of`elem`

so that the resulting collection has a length of at least`len`

.

scala-library scala.collection.immutable.List.padToDoc ·

0.40728527*List*[*A*].**updated**[*B >: A*,*That*](*Int*,*B*)(implicit*CanBuildFrom*[*List*[*A*],*B*,*That*]):*That*A copy of this list with one single replaced element.

- typeParams
- That
`That`

is always`List[B]`

because an implicit of type`CanBuildFrom[List, B, That]`

is defined in object`List`

.- B
the element type of the returned list.

- params
- elem
the replacing element

- bf
`CanBuildFrom`

which determines the result class`That`

from the current representation type`Repr`

and the new element type`B`

. This is usually the`canBuildFrom`

value defined in object`List`

.- index
the position of the replacement

- returns
a new list

`which is a copy of this list with the element at position`

index`replaced by`

elem`.`

- throws
- IndexOutOfBoundsException
`IndexOutOfBoundsException`

if`index`

does not satisfy`0 <= index < length`

.

scala-library scala.collection.immutable.List.updatedDoc ·

0.40640125*List*[*A*].**isDefinedAt**(*Int*):*Boolean*Tests whether this list contains given index.

The implementations of methods

`apply`

and`isDefinedAt`

turn a`Seq[A]`

into a`PartialFunction[Int, A]`

.- params
- idx
the index to test

- returns
`true`

if this list contains an element at position`idx`

,`false`

otherwise.

scala-library scala.collection.immutable.List.isDefinedAtDoc ·

0.40640125*List*[*A*].**productElement**(*Int*):*Any*The n

^{th}element of this product, 0-based. In other words, for a product`A(x`

, returns_{1}, ..., x_{k})`x`

where_{(n+1)}`0 < n < k`

.- params
- n
the index of the element to return

- returns
the element

`n`

elements after the first element- throws
- IndexOutOfBoundsException

scala-library scala.collection.immutable.List.productElementDoc ·

0.40640125*List*[*A*].**lengthCompare**(*Int*):*Int*Compares the length of this list to a test value.

- params
- len
the test value that gets compared with the length.

- returns
A value

`x`

where`x < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len`

The method as implemented here does not call

`length`

directly; its running time is`O(length min len)`

instead of`O(length)`

. The method should be overwritten if computing`length`

is cheap.

scala-library scala.collection.immutable.List.lengthCompareDoc ·

0.40635726*ApplicativePlus*[*F*].**replicateM**[*A*](*Int*,*F*[*A*]):*F*[*List*[*A*]]Performs the action

`n`

times, returning the list of results.scalaz-core_2.11 scalaz.ApplicativePlus.replicateMDoc ·

0.40635726*Applicative*[*F*].**replicateM**[*A*](*Int*,*F*[*A*]):*F*[*List*[*A*]]Performs the action

`n`

times, returning the list of results.scalaz-core_2.11 scalaz.Applicative.replicateMDoc ·

0.40635726*Monad*[*F*].**replicateM**[*A*](*Int*,*F*[*A*]):*F*[*List*[*A*]]Performs the action

`n`

times, returning the list of results.scalaz-core_2.11 scalaz.Monad.replicateMDoc ·

0.40635726*MonadPlus*[*F*].**replicateM**[*A*](*Int*,*F*[*A*]):*F*[*List*[*A*]]Performs the action

`n`

times, returning the list of results.scalaz-core_2.11 scalaz.MonadPlus.replicateMDoc ·

0.40635726*Nondeterminism*[*F*].**replicateM**[*A*](*Int*,*F*[*A*]):*F*[*List*[*A*]]Performs the action

`n`

times, returning the list of results.scalaz-core_2.11 scalaz.Nondeterminism.replicateMDoc ·