final case class Many[+T](firstElement: T, secondElement: T, otherElements: T*) extends Every[T] with Product with Serializable
An Every that contains two or more elements.
For more information and examples, see the main documentation for superclass Every.
- T
the type of the element contained in this
Many- firstElement
the first element (with index 0) contained in this
Many- secondElement
the second element (with index 1) contained in this
Many- otherElements
a varargs of zero or more other elements (with index 2, 3, ...) contained in this
Many
- Source
- Every.scala
- Alphabetic
- By Inheritance
- Many
- Every
- Serializable
- Serializable
- Product
- Equals
- PartialFunction
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
Many(firstElement: T, secondElement: T, otherElements: T*)
- firstElement
the first element (with index 0) contained in this
Many- secondElement
the second element (with index 1) contained in this
Many- otherElements
a varargs of zero or more other elements (with index 2, 3, ...) contained in this
Many
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[U >: T](other: GenTraversableOnce[U]): Every[U]
Returns a new
Manycontaining the elements of thisEveryfollowed by the elements of the passedGenTraversableOnce.Returns a new
Manycontaining the elements of thisEveryfollowed by the elements of the passedGenTraversableOnce. The element type of the resultingManyis the most specific superclass encompassing the element types of thisEveryand the passedGenTraversableOnce.- U
the element type of the returned
Many- other
the
Everyto append- returns
a new
Manythat contains all the elements of thisEveryfollowed by all elements ofother.
-
def
++[U >: T](other: Every[U]): Many[U]
Returns a new
Manycontaining the elements of thisEveryfollowed by the elements of the passedEvery.Returns a new
Manycontaining the elements of thisEveryfollowed by the elements of the passedEvery. The element type of the resultingManyis the most specific superclass encompassing the element types of this and the passedEvery.- U
the element type of the returned
Many- other
the
Everyto append- returns
a new
Manythat contains all the elements of thisEveryfollowed by all elements ofother.
-
final
def
+:[U >: T](element: U): Many[U]
Returns a new
Everywith the given element prepended.Returns a new
Everywith 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
Every- returns
a new
Everyconsisting ofelementfollowed by all elements of thisEvery.
- Definition Classes
- Every
-
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 thisEvery, going left to right.Fold left: applies a binary operator to a start value,
z, and all elements of thisEvery, going left to right.Note:
/:is alternate syntax for thefoldLeftmethod;z/:everyis the same aseveryfoldLeftz.- B
the result of the binary operator
- z
the start value
- op
the binary operator
- returns
the result of inserting
opbetween consecutive elements of thisEvery, going left to right, with the start value,z, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
def
:+[U >: T](element: U): Many[U]
Returns a new
Everywith the given element appended. -
final
def
:\[B](z: B)(op: (T, B) ⇒ B): B
Fold right: applies a binary operator to all elements of this
Everyand a start value, going right to left.Fold right: applies a binary operator to all elements of this
Everyand a start value, going right to left.Note:
:\is alternate syntax for thefoldRightmethod;every:\zis the same aseveryfoldRightz.- B
the result of the binary operator
- z
the start value
- op
the binary operator
- returns
the result of inserting
opbetween consecutive elements of thisEvery, going right to left, with the start value,z, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
addString(sb: StringBuilder, start: String, sep: String, end: String): StringBuilder
Appends all elements of this
Everyto a string builder using start, end, and separator strings.Appends all elements of this
Everyto a string builder using start, end, and separator strings. The written text will consist of a concatenation of the stringstart; the result of invokingtoStringon all elements of thisEvery, 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.
- Definition Classes
- Every
-
final
def
addString(sb: StringBuilder, sep: String): StringBuilder
Appends all elements of this
Everyto a string builder using a separator string.Appends all elements of this
Everyto a string builder using a separator string. The written text will consist of a concatenation of the result of invokingtoStringon of every element of thisEvery, 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.
- Definition Classes
- Every
-
final
def
addString(sb: StringBuilder): StringBuilder
Appends all elements of this
Everyto a string builder.Appends all elements of this
Everyto a string builder. The written text will consist of a concatenation of the result of invokingtoStringon of every element of thisEvery, without any separator string.- sb
the string builder to which elements will be appended
- returns
the string builder,
sb, to which elements were appended.
- Definition Classes
- Every
-
def
andThen[C](k: (T) ⇒ C): PartialFunction[Int, C]
- Definition Classes
- PartialFunction → Function1
-
final
def
apply(idx: Int): T
Selects an element by its index in the
Every.Selects an element by its index in the
Every.- returns
the element of this
Everyat indexidx, where 0 indicates the first element.
- Definition Classes
- Every → Function1
-
def
applyOrElse[A1 <: Int, B1 >: T](x: A1, default: (A1) ⇒ B1): B1
- Definition Classes
- PartialFunction
-
def
asEvery: Every[T]
Returns this
Manywith the type widened toEvery.Returns this
Manywith the type widened toEvery.- returns
this
Manyas anEvery
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
collectFirst[U](pf: PartialFunction[T, U]): Option[U]
Finds the first element of the
Everyfor which the given partial function is defined, if any, and applies the partial function to it.Finds the first element of the
Everyfor which the given partial function is defined, if any, and applies the partial function to it.- pf
the partial function
- returns
an
Optioncontainingpfapplied to the first element for which it is defined, orNoneif the partial function was not defined for any element.
- Definition Classes
- Every
-
def
compose[A](g: (A) ⇒ Int): (A) ⇒ T
- Definition Classes
- Function1
- Annotations
- @unspecialized()
-
final
def
contains(elem: Any): Boolean
Indicates whether this
Everycontains a given value as an element.Indicates whether this
Everycontains a given value as an element.- elem
the element to look for
- returns
true if this
Everyhas an element that is equal (as determined by==)toelem, false otherwise.
- Definition Classes
- Every
-
final
def
containsSlice[B](that: Every[B]): Boolean
Indicates whether this
Everycontains a givenEveryas a slice.Indicates whether this
Everycontains a givenEveryas a slice.- that
the
Everyslice to look for- returns
true if this
Everycontains a slice with the same elements asthat, otherwisefalse.
- Definition Classes
- Every
-
final
def
containsSlice[B](that: GenSeq[B]): Boolean
Indicates whether this
Everycontains a givenGenSeqas a slice.Indicates whether this
Everycontains a givenGenSeqas a slice.- that
the
GenSeqslice to look for- returns
true if this
Everycontains a slice with the same elements asthat, otherwisefalse.
- Definition Classes
- Every
-
final
def
copyToArray[U >: T](arr: Array[U], start: Int, len: Int): Unit
Copies values of this
Everyto an array.Copies values of this
Everyto an array. Fills the given arrayarrwith at mostlenelements of thisEvery, beginning at indexstart. Copying will stop once either the end of the currentEveryis reached, the end of the array is reached, orlenelements have been copied.- arr
the array to fill
- start
the starting index
- len
the maximum number of elements to copy
- Definition Classes
- Every
-
final
def
copyToArray[U >: T](arr: Array[U], start: Int): Unit
Copies values of this
Everyto an array.Copies values of this
Everyto an array. Fills the given arrayarrwith values of thisEvery, beginning at indexstart. Copying will stop once either the end of the currentEveryis reached, or the end of the array is reached.- arr
the array to fill
- start
the starting index
- Definition Classes
- Every
-
final
def
copyToArray[U >: T](arr: Array[U]): Unit
Copies values of this
Everyto an array.Copies values of this
Everyto an array. Fills the given arrayarrwith values of thisEvery. Copying will stop once either the end of the currentEveryis reached, or the end of the array is reached.- arr
the array to fill
- Definition Classes
- Every
-
final
def
copyToBuffer[U >: T](buf: Buffer[U]): Unit
Copies all elements of this
Everyto a buffer.Copies all elements of this
Everyto a buffer.- buf
the buffer to which elements are copied
- Definition Classes
- Every
-
final
def
corresponds[B](that: Every[B])(p: (T, B) ⇒ Boolean): Boolean
Indicates whether every element of this
Everyrelates to the corresponding element of a givenEveryby satisfying a given predicate.Indicates whether every element of this
Everyrelates to the corresponding element of a givenEveryby satisfying a given predicate.- B
the type of the elements of
that- that
the
Everyto compare for correspondence- p
the predicate, which relates elements from this and the passed
Every- returns
true if this and the passed
Everyhave the same length andp(x, y)istruefor all corresponding elementsxof thisEveryandyof that, otherwisefalse.
- Definition Classes
- Every
-
final
def
corresponds[B](that: GenSeq[B])(p: (T, B) ⇒ Boolean): Boolean
Indicates whether every element of this
Everyrelates to the corresponding element of a givenGenSeqby satisfying a given predicate.Indicates whether every element of this
Everyrelates to the corresponding element of a givenGenSeqby satisfying a given predicate.- B
the type of the elements of
that- that
the
GenSeqto compare for correspondence- p
the predicate, which relates elements from this
Everyand the passedGenSeq- returns
true if this
Everyand the passedGenSeqhave the same length andp(x, y)istruefor all corresponding elementsxof thisEveryandyof that, otherwisefalse.
- Definition Classes
- Every
-
final
def
count(p: (T) ⇒ Boolean): Int
Counts the number of elements in the
Everythat satisfy a predicate.Counts the number of elements in the
Everythat satisfy a predicate.- p
the predicate used to test elements.
- returns
the number of elements satisfying the predicate
p.
- Definition Classes
- Every
-
final
def
distinct: Every[T]
Builds a new
Everyfrom thisEverywithout any duplicate elements.Builds a new
Everyfrom thisEverywithout any duplicate elements.- returns
A new
Everythat contains the first occurrence of every element of thisEvery.
- Definition Classes
- Every
-
final
def
endsWith[B](that: Every[B]): Boolean
Indicates whether this
Everyends with the givenEvery.Indicates whether this
Everyends with the givenEvery.- returns
trueif thisEveryhasthatas a suffix,falseotherwise.
- Definition Classes
- Every
-
final
def
endsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Everyends with the givenGenSeq.Indicates whether this
Everyends with the givenGenSeq.- returns
trueif thisEveryhasthatas a suffix,falseotherwise.
- Definition Classes
- Every
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
exists(p: (T) ⇒ Boolean): Boolean
Indicates whether a predicate holds for at least one of the elements of this
Every.Indicates whether a predicate holds for at least one of the elements of this
Every.- returns
trueif the given predicatepholds for some of the elements of thisEvery, otherwisefalse.
- Definition Classes
- Every
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
find(p: (T) ⇒ Boolean): Option[T]
Finds the first element of this
Everythat satisfies the given predicate, if any.Finds the first element of this
Everythat satisfies the given predicate, if any.- p
the predicate used to test elements
- returns
an
Somecontaining the first element in thisEverythat satisfiesp, orNoneif none exists.
- Definition Classes
- Every
- val firstElement: T
-
final
def
flatMap[U](f: (T) ⇒ Every[U]): Every[U]
Builds a new
Everyby applying a function to all elements of thisEveryand using the elements of the resultingEverys.Builds a new
Everyby applying a function to all elements of thisEveryand using the elements of the resultingEverys.- U
the element type of the returned
Every- f
the function to apply to each element.
- returns
a new
Everycontaining elements obtained by applying the given functionfto each element of thisEveryand concatenating the elements of resultingEverys.
- Definition Classes
- Every
-
final
def
flatten[B](implicit ev: <:<[T, Every[B]]): Every[B]
Converts this
EveryofEverys into anEveryformed by the elements of the nestedEverys.Converts this
EveryofEverys into anEveryformed by the elements of the nestedEverys.Note: You cannot use this
flattenmethod on anEverythat contains aGenTraversableOnces, because if all the nestedGenTraversableOnces were empty, you'd end up with an emptyEvery.- returns
a new
Everyresulting from concatenating all nestedEverys.
- Definition Classes
- Every
-
final
def
fold[U >: T](z: U)(op: (U, U) ⇒ U): U
Folds the elements of this
Everyusing the specified associative binary operator.Folds the elements of this
Everyusing 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.,
Nilfor list concatenation, 0 for addition, or 1 for multiplication.)- op
a binary operator that must be associative
- returns
the result of applying fold operator
opbetween all the elements andz
- Definition Classes
- Every
-
final
def
foldLeft[B](z: B)(op: (B, T) ⇒ B): B
Applies a binary operator to a start value and all elements of this
Every, going left to right.Applies a binary operator to a start value and all elements of this
Every, 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
opbetween consecutive elements of thisEvery, going left to right, with the start value,z, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
final
def
foldRight[B](z: B)(op: (T, B) ⇒ B): B
Applies a binary operator to all elements of this
Everyand a start value, going right to left.Applies a binary operator to all elements of this
Everyand 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
opbetween consecutive elements of thisEvery, going right to left, with the start value,z, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
final
def
forall(p: (T) ⇒ Boolean): Boolean
Indicates whether a predicate holds for all elements of this
Every.Indicates whether a predicate holds for all elements of this
Every.- p
the predicate used to test elements.
- returns
trueif the given predicatepholds for all elements of thisEvery, otherwisefalse.
- Definition Classes
- Every
-
final
def
foreach(f: (T) ⇒ Unit): Unit
Applies a function
fto all elements of thisEvery.Applies a function
fto all elements of thisEvery.- f
the function that is applied for its side-effect to every element. The result of function
fis discarded.
- Definition Classes
- Every
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
groupBy[K](f: (T) ⇒ K): Map[K, Every[T]]
Partitions this
Everyinto a map ofEverys according to some discriminator function.Partitions this
Everyinto a map ofEverys 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
Everys such that the following invariant holds:(every.toVector partition f)(k) = xs filter (x => f(x) == k)
That is, every keykis bound to anEveryof those elementsxfor whichf(x)equalsk.
- Definition Classes
- Every
-
final
def
grouped(size: Int): Iterator[Every[T]]
Partitions elements into fixed size
Everys.Partitions elements into fixed size
Everys.- size
the number of elements per group
- returns
An iterator producing
Everys of sizesize, except the last will be truncated if the elements don't divide evenly.
- Definition Classes
- Every
-
final
def
hasDefiniteSize: Boolean
Returns
trueto indicate thisEveryhas a definite size, since allEverys are strict collections.Returns
trueto indicate thisEveryhas a definite size, since allEverys are strict collections.- Definition Classes
- Every
-
final
def
head: T
Selects the first element of this
Every.Selects the first element of this
Every.- returns
the first element of this
Every.
- Definition Classes
- Every
-
final
def
headOption: Option[T]
Selects the first element of this
Everyand returns it wrapped in aSome.Selects the first element of this
Everyand returns it wrapped in aSome.- returns
the first element of this
Every, wrapped in aSome.
- Definition Classes
- Every
-
final
def
indexOf[U >: T](elem: U, from: Int): Int
Finds index of first occurrence of some value in this
Everyafter or at some start index.Finds index of first occurrence of some value in this
Everyafter or at some start index.- elem
the element value to search for.
- from
the start index
- returns
the index
>=fromof the first element of thisEverythat is equal (as determined by==) toelem, or-1, if none exists.
- Definition Classes
- Every
-
final
def
indexOf[U >: T](elem: U): Int
Finds index of first occurrence of some value in this
Every.Finds index of first occurrence of some value in this
Every.- elem
the element value to search for.
- returns
the index of the first element of this
Everythat is equal (as determined by==) toelem, or-1, if none exists.
- Definition Classes
- Every
-
final
def
indexOfSlice[U >: T](that: Every[U], from: Int): Int
Finds first index after or at a start index where this
Everycontains a givenEveryas a slice.Finds first index after or at a start index where this
Everycontains a givenEveryas a slice.- that
the
Everydefining the slice to look for- from
the start index
- returns
the first index
>=fromsuch that the elements of thisEverystarting at this index match the elements ofEverythat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
indexOfSlice[U >: T](that: Every[U]): Int
Finds first index where this
Everycontains a givenEveryas a slice.Finds first index where this
Everycontains a givenEveryas a slice.- that
the
Everydefining the slice to look for- returns
the first index such that the elements of this
Everystarting at this index match the elements ofEverythat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
indexOfSlice[U >: T](that: GenSeq[U], from: Int): Int
Finds first index after or at a start index where this
Everycontains a givenGenSeqas a slice.Finds first index after or at a start index where this
Everycontains a givenGenSeqas a slice.- that
the
GenSeqdefining the slice to look for- from
the start index
- returns
the first index
>=fromat which the elements of thisEverystarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
indexOfSlice[U >: T](that: GenSeq[U]): Int
Finds first index where this
Everycontains a givenGenSeqas a slice.Finds first index where this
Everycontains a givenGenSeqas a slice.- that
the
GenSeqdefining the slice to look for- returns
the first index at which the elements of this
Everystarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
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
>=fromof the first element of thisEverythat satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Every
-
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
Everythat satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Every
-
final
def
indices: Range
Produces the range of all indices of this
Every.Produces the range of all indices of this
Every.- returns
a
Rangevalue from0to one less than the length of thisEvery.
- Definition Classes
- Every
-
final
def
isDefinedAt(idx: Int): Boolean
Tests whether this
Everycontains given index.Tests whether this
Everycontains given index.- idx
the index to test
- returns
true if this
Everycontains an element at positionidx,falseotherwise.
- Definition Classes
- Every → PartialFunction
-
final
def
isEmpty: Boolean
Returns
falseto indicate thisEvery, like allEverys, is non-empty.Returns
falseto indicate thisEvery, like allEverys, is non-empty.- returns
false
- Definition Classes
- Every
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
isTraversableAgain: Boolean
Returns
trueto indicate thisEvery, like allEverys, can be traversed repeatedly.Returns
trueto indicate thisEvery, like allEverys, can be traversed repeatedly.- returns
true
- Definition Classes
- Every
-
final
def
iterator: Iterator[T]
Creates and returns a new iterator over all elements contained in this
Every.Creates and returns a new iterator over all elements contained in this
Every.- returns
the new iterator
- Definition Classes
- Every
-
final
def
last: T
Selects the last element of this
Every.Selects the last element of this
Every.- returns
the last element of this
Every.
- Definition Classes
- Every
-
final
def
lastIndexOf[U >: T](elem: U, end: Int): Int
Finds the index of the last occurrence of some value in this
Everybefore or at a givenendindex.Finds the index of the last occurrence of some value in this
Everybefore or at a givenendindex.- elem
the element value to search for.
- end
the end index.
- returns
the index
>=endof the last element of thisEverythat is equal (as determined by==) toelem, or-1, if none exists.
- Definition Classes
- Every
-
final
def
lastIndexOf[U >: T](elem: U): Int
Finds the index of the last occurrence of some value in this
Every.Finds the index of the last occurrence of some value in this
Every.- elem
the element value to search for.
- returns
the index of the last element of this
Everythat is equal (as determined by==) toelem, or-1, if none exists.
- Definition Classes
- Every
-
final
def
lastIndexOfSlice[U >: T](that: Every[U], end: Int): Int
Finds the last index before or at a given end index where this
Everycontains a givenEveryas a slice.Finds the last index before or at a given end index where this
Everycontains a givenEveryas a slice.- that
the
Everydefining the slice to look for- end
the end index
- returns
the last index
>=endat which the elements of thisEverystarting at that index match the elements ofEverythat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
lastIndexOfSlice[U >: T](that: Every[U]): Int
Finds the last index where this
Everycontains a givenEveryas a slice.Finds the last index where this
Everycontains a givenEveryas a slice.- that
the
Everydefining the slice to look for- returns
the last index at which the elements of this
Everystarting at that index match the elements ofEverythat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
lastIndexOfSlice[U >: T](that: GenSeq[U], end: Int): Int
Finds the last index before or at a given end index where this
Everycontains a givenGenSeqas a slice.Finds the last index before or at a given end index where this
Everycontains a givenGenSeqas a slice.- that
the
GenSeqdefining the slice to look for- end
the end index
- returns
the last index
>=endat which the elements of thisEverystarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
final
def
lastIndexOfSlice[U >: T](that: GenSeq[U]): Int
Finds the last index where this
Everycontains a givenGenSeqas a slice.Finds the last index where this
Everycontains a givenGenSeqas a slice.- that
the
GenSeqdefining the slice to look for- returns
the last index at which the elements of this
Everystarting at that index match the elements ofGenSeqthat, or-1of no such subsequence exists.
- Definition Classes
- Every
-
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
>=endof the last element of thisEverythat satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Every
-
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
Everythat satisfies the predicatep, or-1, if none exists.
- Definition Classes
- Every
-
final
def
lastOption: Option[T]
Returns the last element of this
Every, wrapped in aSome.Returns the last element of this
Every, wrapped in aSome.- returns
the last element, wrapped in a
Some.
- Definition Classes
- Every
-
final
def
length: Int
The length of this
Every.The length of this
Every.Note:
lengthandsizeyield the same result, which will be>= 1.- returns
the number of elements in this
Every.
- Definition Classes
- Every
-
final
def
lengthCompare(len: Int): Int
Compares the length of this
Everyto a test value.Compares the length of this
Everyto a test value.- len
the test value that gets compared with the length.
- returns
a value
xwherex < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len
- Definition Classes
- Every
-
def
lift: (Int) ⇒ Option[T]
- Definition Classes
- PartialFunction
-
final
def
map[U](f: (T) ⇒ U): Every[U]
Builds a new
Everyby applying a function to all elements of thisEvery.Builds a new
Everyby applying a function to all elements of thisEvery.- U
the element type of the returned
Every.- f
the function to apply to each element.
- returns
a new
Everyresulting from applying the given functionfto each element of thisEveryand collecting the results.
- Definition Classes
- Every
-
final
def
max[U >: T](implicit cmp: Ordering[U]): T
Finds the largest element.
-
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
Every.
- Definition Classes
- Every
-
final
def
min[U >: T](implicit cmp: Ordering[U]): T
Finds the smallest element.
-
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
Every.
- Definition Classes
- Every
-
final
def
mkString(start: String, sep: String, end: String): String
Displays all elements of this
Everyin a string using start, end, and separator strings.Displays all elements of this
Everyin 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
Every. The resulting string begins with the stringstartand ends with the stringend. Inside, In the resulting string, the result of invokingtoStringon all elements of thisEveryare separated by the stringsep.
- Definition Classes
- Every
-
final
def
mkString(sep: String): String
Displays all elements of this
Everyin a string using a separator string.Displays all elements of this
Everyin a string using a separator string.- sep
the separator string
- returns
a string representation of this
Every. In the resulting string, the result of invokingtoStringon all elements of thisEveryare separated by the stringsep.
- Definition Classes
- Every
-
final
def
mkString: String
Displays all elements of this
Everyin a string.Displays all elements of this
Everyin a string.- returns
a string representation of this
Every. In the resulting string, the result of invokingtoStringon all elements of thisEveryfollow each other without any separator string.
- Definition Classes
- Every
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
nonEmpty: Boolean
Returns
trueto indicate thisEvery, like allEverys, is non-empty.Returns
trueto indicate thisEvery, like allEverys, is non-empty.- returns
true
- Definition Classes
- Every
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
orElse[A1 <: Int, B1 >: T](that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
- Definition Classes
- PartialFunction
- val otherElements: T*
-
final
def
padTo[U >: T](len: Int, elem: U): Every[U]
A copy of this
Everywith an element value appended until a given target length is reached.A copy of this
Everywith an element value appended until a given target length is reached.- len
the target length
- elem
he padding value
- returns
a new
Everyconsisting of all elements of thisEveryfollowed by the minimal number of occurrences ofelemso that the resultingEveryhas a length of at leastlen.
- Definition Classes
- Every
-
final
def
patch[U >: T](from: Int, that: Every[U], replaced: Int): Every[U]
Produces a new
Everywhere a slice of elements in thisEveryis replaced by anotherEveryProduces a new
Everywhere a slice of elements in thisEveryis replaced by anotherEvery- from
the index of the first replaced element
- that
the
Everywhose elements should replace a slice in thisEvery- replaced
the number of elements to drop in the original
Every
- Definition Classes
- Every
-
final
def
permutations: Iterator[Every[T]]
Iterates over distinct permutations.
Iterates over distinct permutations.
Here's an example:
Every('a', 'b', 'b').permutations.toList = Iterator(Many(a, b, b), Many(b, a, b), Many(b, b, a))- returns
an iterator which traverses the distinct permutations of this
Every.
- Definition Classes
- Every
-
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
Everysuch that every element of the segment satisfies the predicatep.
- Definition Classes
- Every
-
final
def
product[U >: T](implicit num: Numeric[U]): U
The result of multiplying all the elements of this
Every.The result of multiplying all the elements of this
Every.This method can be invoked for any
Every[T]for which an implicitNumeric[T]exists.- returns
the product of all elements
- Definition Classes
- Every
-
final
def
reduce[U >: T](op: (U, U) ⇒ U): U
Reduces the elements of this
Everyusing the specified associative binary operator.Reduces the elements of this
Everyusing 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
opbetween all the elements of thisEvery.
- Definition Classes
- Every
-
final
def
reduceLeft[U >: T](op: (U, T) ⇒ U): U
Applies a binary operator to all elements of this
Every, going left to right.Applies a binary operator to all elements of this
Every, going left to right.- U
the result type of the binary operator.
- op
the binary operator.
- returns
the result of inserting
opbetween consecutive elements of thisEvery, going left to right:op(...op(op(x_1, x_2), x_3), ..., x_n)
where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
final
def
reduceLeftOption[U >: T](op: (U, T) ⇒ U): Option[U]
Applies a binary operator to all elements of this
Every, going left to right, returning the result in aSome.Applies a binary operator to all elements of this
Every, going left to right, returning the result in aSome.- U
the result type of the binary operator.
- op
the binary operator.
- returns
a
Somecontaining the result ofreduceLeft(op)
- Definition Classes
- Every
-
final
def
reduceOption[U >: T](op: (U, U) ⇒ U): Option[U]
- Definition Classes
- Every
-
final
def
reduceRight[U >: T](op: (T, U) ⇒ U): U
Applies a binary operator to all elements of this
Every, going right to left.Applies a binary operator to all elements of this
Every, going right to left.- U
the result of the binary operator
- op
the binary operator
- returns
the result of inserting
opbetween consecutive elements of thisEvery, going right to left:op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))where x1, ..., xn are the elements of thisEvery.
- Definition Classes
- Every
-
final
def
reduceRightOption[U >: T](op: (T, U) ⇒ U): Option[U]
Applies a binary operator to all elements of this
Every, going right to left, returning the result in aSome.Applies a binary operator to all elements of this
Every, going right to left, returning the result in aSome.- U
the result of the binary operator
- op
the binary operator
- returns
a
Somecontaining the result ofreduceRight(op)
- Definition Classes
- Every
-
final
def
reverse: Every[T]
Returns new
Everywih elements in reverse order.Returns new
Everywih elements in reverse order.- returns
a new
Everywith all elements of thisEveryin reversed order.
- Definition Classes
- Every
-
final
def
reverseIterator: Iterator[T]
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
Note:
every.reverseIteratoris the same asevery.reverse.iterator, but might be more efficient.- returns
an iterator yielding the elements of this
Everyin reversed order
- Definition Classes
- Every
-
final
def
reverseMap[U](f: (T) ⇒ U): Every[U]
Builds a new
Everyby applying a function to all elements of thisEveryand collecting the results in reverse order.Builds a new
Everyby applying a function to all elements of thisEveryand collecting the results in reverse order.Note:
every.reverseMap(f)is the same asevery.reverse.map(f), but might be more efficient.- U
the element type of the returned
Every.- f
the function to apply to each element.
- returns
a new
Everyresulting from applying the given functionfto each element of thisEveryand collecting the results in reverse order.
- Definition Classes
- Every
-
def
runWith[U](action: (T) ⇒ U): (Int) ⇒ Boolean
- Definition Classes
- PartialFunction
-
final
def
sameElements[U >: T](that: Every[U]): Boolean
Checks if the given
Everycontains the same elements in the same order as thisEvery.Checks if the given
Everycontains the same elements in the same order as thisEvery.- that
the
Everywith which to compare- returns
true, if both this and the givenEverycontain the same elements in the same order,falseotherwise.
- Definition Classes
- Every
-
final
def
sameElements[U >: T](that: GenIterable[U]): Boolean
Checks if the given
GenIterablecontains the same elements in the same order as thisEvery.Checks if the given
GenIterablecontains the same elements in the same order as thisEvery.- that
the
GenIterablewith which to compare- returns
true, if both thisEveryand the givenGenIterablecontain the same elements in the same order,falseotherwise.
- Definition Classes
- Every
-
final
def
scan[U >: T](z: U)(op: (U, U) ⇒ U): Every[U]
Computes a prefix scan of the elements of this
Every.Computes a prefix scan of the elements of this
Every.Note: The neutral element z may be applied more than once.
Here are some examples:
Every(1, 2, 3).scan(0)(_ + _) == Every(0, 1, 3, 6) Every(1, 2, 3).scan("z")(_ + _.toString) == Every("z", "z1", "z12", "z123")- U
a type parameter for the binary operator, a supertype of T, and the type of the resulting
Every.- 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.,
Nilfor list concatenation, 0 for addition, or 1 for multiplication.)- op
a binary operator that must be associative
- returns
a new
Everycontaining the prefix scan of the elements in thisEvery
- Definition Classes
- Every
-
final
def
scanLeft[B](z: B)(op: (B, T) ⇒ B): Every[B]
Produces an
Everycontaining cumulative results of applying the operator going left to right.Produces an
Everycontaining cumulative results of applying the operator going left to right.Here are some examples:
Every(1, 2, 3).scanLeft(0)(_ + _) == Every(0, 1, 3, 6) Every(1, 2, 3).scanLeft("z")(_ + _) == Every("z", "z1", "z12", "z123")- B
the result type of the binary operator and type of the resulting
Every- z
the start value.
- op
the binary operator.
- returns
a new
Everycontaining the intermediate results of insertingopbetween consecutive elements of thisEvery, going left to right, with the start value,z, on the left.
- Definition Classes
- Every
-
final
def
scanRight[B](z: B)(op: (T, B) ⇒ B): Every[B]
Produces an
Everycontaining cumulative results of applying the operator going right to left.Produces an
Everycontaining cumulative results of applying the operator going right to left.Here are some examples:
Every(1, 2, 3).scanRight(0)(_ + _) == Every(6, 5, 3, 0) Every(1, 2, 3).scanRight("z")(_ + _) == Every("123z", "23z", "3z", "z")- B
the result of the binary operator and type of the resulting
Every- z
the start value
- op
the binary operator
- returns
a new
Everycontaining the intermediate results of insertingopbetween consecutive elements of thisEvery, going right to left, with the start value,z, on the right.
- Definition Classes
- Every
- val secondElement: T
-
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.
- Definition Classes
- Every
-
final
def
size: Int
The size of this
Every.The size of this
Every.Note:
lengthandsizeyield the same result, which will be>= 1.- returns
the number of elements in this
Every.
- Definition Classes
- Every
-
final
def
sliding(size: Int, step: Int): Iterator[Every[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
stepeach 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
stepeach time.- size
the number of elements per group
- step
the distance between the first elements of successive groups
- returns
an iterator producing
Everys of sizesize, except the last and the only element will be truncated if there are fewer elements thansize.
- Definition Classes
- Every
-
final
def
sliding(size: Int): Iterator[Every[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
Everys of sizesize, except the last and the only element will be truncated if there are fewer elements thansize.
- Definition Classes
- Every
-
final
def
sortBy[U](f: (T) ⇒ U)(implicit ord: Ordering[U]): Every[T]
Sorts this
Everyaccording to theOrderingof the result of applying the given function to every element.Sorts this
Everyaccording to theOrderingof the result of applying the given function to every element.- U
the target type of the transformation
f, and the type where theOrderingordis defined.- f
the transformation function mapping elements to some other domain
U.- ord
the ordering assumed on domain
U.- returns
a
Everyconsisting of the elements of thisEverysorted according to theOrderingwherex < y if ord.lt(f(x), f(y)).
- Definition Classes
- Every
-
final
def
sortWith(lt: (T, T) ⇒ Boolean): Every[T]
Sorts this
Everyaccording to a comparison function.Sorts this
Everyaccording 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 sortedEveryas in the original.- returns
an
Everyconsisting of the elements of thisEverysorted according to the comparison functionlt.
- Definition Classes
- Every
-
final
def
sorted[U >: T](implicit ord: Ordering[U]): Every[U]
Sorts this
Everyaccording to anOrdering.Sorts this
Everyaccording to anOrdering.The sort is stable. That is, elements that are equal (as determined by
lt) appear in the same order in the sortedEveryas in the original.- ord
the
Orderingto be used to compare elements.- returns
an
Everyconsisting of the elements of thisEverysorted according to the comparison functionlt.
- Definition Classes
- Every
-
final
def
startsWith[B](that: Every[B], offset: Int): Boolean
Indicates whether this
Everystarts with the givenEveryat the given index.Indicates whether this
Everystarts with the givenEveryat the given index.- that
the
Everyslice to look for in thisEvery- offset
the index at which this
Everyis searched.- returns
trueif thisEveryhasthatas a slice at the indexoffset,falseotherwise.
- Definition Classes
- Every
-
final
def
startsWith[B](that: Every[B]): Boolean
Indicates whether this
Everystarts with the givenEvery.Indicates whether this
Everystarts with the givenEvery.- that
the
Everyto test- returns
trueif this collection hasthatas a prefix,falseotherwise.
- Definition Classes
- Every
-
final
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
Indicates whether this
Everystarts with the givenGenSeqat the given index.Indicates whether this
Everystarts with the givenGenSeqat the given index.- that
the
GenSeqslice to look for in thisEvery- offset
the index at which this
Everyis searched.- returns
trueif thisEveryhasthatas a slice at the indexoffset,falseotherwise.
- Definition Classes
- Every
-
final
def
startsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Everystarts with the givenGenSeq.Indicates whether this
Everystarts with the givenGenSeq.- that
the
GenSeqslice to look for in thisEvery- returns
trueif thisEveryhasthatas a prefix,falseotherwise.
- Definition Classes
- Every
-
def
stringPrefix: String
Returns
"Many", the prefix of this object'stoStringrepresentation. -
final
def
sum[U >: T](implicit num: Numeric[U]): U
The result of summing all the elements of this
Every.The result of summing all the elements of this
Every.This method can be invoked for any
Every[T]for which an implicitNumeric[T]exists.- returns
the sum of all elements
- Definition Classes
- Every
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, T, Col[T]]): Col[T]
Converts this
Everyinto a collection of typeColby copying all elements.Converts this
Everyinto a collection of typeColby copying all elements.- Col
the collection type to build.
- returns
a new collection containing all elements of this
Every.
- Definition Classes
- Every
-
final
def
toArray[U >: T](implicit classTag: ClassTag[U]): Array[U]
Converts this
Everyto an array.Converts this
Everyto an array.- returns
an array containing all elements of this
Every. AClassTagmust be available for the element type of thisEvery.
- Definition Classes
- Every
-
final
def
toBuffer[U >: T]: Buffer[U]
Converts this
Everyto a mutable buffer.Converts this
Everyto a mutable buffer.- returns
a buffer containing all elements of this
Every.
- Definition Classes
- Every
-
final
def
toIndexedSeq: IndexedSeq[T]
Converts this
Everyto an immutableIndexedSeq.Converts this
Everyto an immutableIndexedSeq.- returns
an immutable
IndexedSeqcontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
toIterable: Iterable[T]
Converts this
Everyto an iterable collection.Converts this
Everyto an iterable collection.- returns
an
Iterablecontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
toIterator: Iterator[T]
Returns an
Iteratorover the elements in thisEvery.Returns an
Iteratorover the elements in thisEvery.- returns
an
Iteratorcontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
toList: List[T]
Converts this
Everyto a list.Converts this
Everyto a list.- returns
a list containing all elements of this
Every.
- Definition Classes
- Every
-
final
def
toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
Converts this
Everyto a map.Converts this
Everyto a map.This method is unavailable unless the elements are members of
Tuple2, each((K, V))becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys.- returns
a map of type
immutable.Map[K, V]containing all key/value pairs of type(K, V)of thisEvery.
- Definition Classes
- Every
-
final
def
toSeq: Seq[T]
Converts this
Everyto an immutableIndexedSeq.Converts this
Everyto an immutableIndexedSeq.- returns
an immutable
IndexedSeqcontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
toSet[U >: T]: Set[U]
Converts this
Everyto a set.Converts this
Everyto a set.- returns
a set containing all elements of this
Every.
- Definition Classes
- Every
-
final
def
toStream: Stream[T]
Converts this
Everyto a stream.Converts this
Everyto a stream.- returns
a stream containing all elements of this
Every.
- Definition Classes
- Every
-
def
toString(): String
Returns a string representation of this
Many.Returns a string representation of this
Many.- returns
the string
"Many"followed by the result of invokingtoStringon thisMany's elements, surrounded by parentheses.
- Definition Classes
- Many → Function1 → AnyRef → Any
-
final
def
toTraversable: Traversable[T]
Converts this
Everyto an unspecified Traversable.Converts this
Everyto an unspecified Traversable.- returns
a
Traversablecontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
toVector: Vector[T]
Converts this
Everyto aVector.Converts this
Everyto aVector.- returns
a
Vectorcontaining all elements of thisEvery.
- Definition Classes
- Every
-
final
def
transpose[U](implicit ev: <:<[T, Every[U]]): Every[Every[U]]
- Definition Classes
- Every
-
final
def
union[U >: T](that: GenSeq[U])(implicit cbf: CanBuildFrom[Vector[T], U, Vector[U]]): Every[U]
Produces a new
Everythat contains all elements of thisEveryand also all elements of a givenGenSeq.Produces a new
Everythat contains all elements of thisEveryand also all elements of a givenGenSeq.everyXunionysis equivalent toeveryX++ys.Another way to express this is that
everyXunionyscomputes the order-presevring multi-set union ofeveryXandys. Thisunionmethod is hence a counter-part ofdiffandintersectthat also work on multi-sets.- that
the
GenSeqto add.- returns
a new
Everythat contains all elements of thisEveryfollowed by all elements ofthatGenSeq.
- Definition Classes
- Every
-
final
def
union[U >: T](that: Every[U]): Every[U]
Produces a new
Everythat contains all elements of thisEveryand also all elements of a givenEvery.Produces a new
Everythat contains all elements of thisEveryand also all elements of a givenEvery.everyXunioneveryYis equivalent toeveryX++everyY.Another way to express this is that
everyXunioneveryYcomputes the order-presevring multi-set union ofeveryXandeveryY. Thisunionmethod is hence a counter-part ofdiffandintersectthat also work on multi-sets.- that
the
Everyto add.- returns
a new
Everythat contains all elements of thisEveryfollowed by all elements ofthat.
- Definition Classes
- Every
-
final
def
unzip[L, R](implicit asPair: (T) ⇒ (L, R)): (Every[L], Every[R])
Converts this
Everyof pairs into twoEverys of the first and second half of each pair.Converts this
Everyof pairs into twoEverys 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
Everyis a pair.- returns
a pair of
Everys, containing the first and second half, respectively, of each element pair of thisEvery.
- Definition Classes
- Every
-
final
def
unzip3[L, M, R](implicit asTriple: (T) ⇒ (L, M, R)): (Every[L], Every[M], Every[R])
Converts this
Everyof triples into threeEverys of the first, second, and and third element of each triple.Converts this
Everyof triples into threeEverys 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
Everyis a triple.- returns
a triple of
Everys, containing the first, second, and third member, respectively, of each element triple of thisEvery.
- Definition Classes
- Every
-
final
def
updated[U >: T](idx: Int, elem: U): Every[U]
A copy of this
Everywith one single replaced element.A copy of this
Everywith one single replaced element.- idx
the position of the replacement
- elem
the replacing element
- returns
a copy of this
Everywith the element at positionidxreplaced byelem.
- Definition Classes
- Every
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
zipAll[O, U >: T](other: Iterable[O], thisElem: U, otherElem: O): Every[(U, O)]
Returns an
Everyformed from thisEveryand an iterable collection by combining corresponding elements in pairs.Returns an
Everyformed from thisEveryand 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
Iterableproviding the second half of each result pair- thisElem
the element to be used to fill up the result if this
Everyis shorter thanthatIterable.- returns
a new
Everycontaining pairs consisting of corresponding elements of thisEveryandthat. The length of the returned collection is the maximum of the lengths of thisEveryandthat. If thisEveryis shorter thanthat,thisElemvalues are used to pad the result. Ifthatis shorter than thisEvery,thatElemvalues are used to pad the result.
- Definition Classes
- Every
-
final
def
zipWithIndex: Every[(T, Int)]
Zips this
Everywith its indices.Zips this
Everywith its indices.- returns
A new
Everycontaining pairs consisting of all elements of thisEverypaired with their index. Indices start at 0.
- Definition Classes
- Every