sealed abstract class Every[+T] extends PartialFunction[Int, T] with Product with Serializable
An ordered, immutable, non-empty collection of elements.
Class Every
has two and only two subtypes: One
and Many
.
A One
contains exactly one element. A Many
contains two or more elements. Thus no way exists for an
Every
to contain zero elements.
Constructing Every
s
You can construct an Every
by passing one or more elements to the Every.apply
factory method:
Every(1) Every(1, 2) Every(1, 2, 3)
Alternatively you can pass one element to the One.apply
factory method, or two or more elements to
Many.apply
:
One(1) Many(1, 3) Many(1, 2, 3)
Working with Every
s
Every
does not extend Scala's Seq
or Traversable
traits because these require that
implementations may be empty. For example, if you invoke tail
on a Seq
that contains just one element,
you'll get an empty Seq
:
scala> List(1).tail res6: List[Int] = List()
On the other hand, many useful methods exist on Seq
that when invoked on a non-empty Seq
are guaranteed
to not result in an empty Seq
. For convenience, Every
defines a method corresponding to every such Seq
method. Here are some examples:
Many(1, 2, 3).map(_ + 1) // Result: Many(2, 3, 4) One(1).map(_ + 1) // Result: One(2) Every(1, 2, 3).containsSlice(Every(2, 3)) // Result: true Every(1, 2, 3).containsSlice(Every(3, 4)) // Result: false Every(-1, -2, 3, 4, 5).minBy(_.abs) // Result: -1
Every
does not currently define any methods corresponding to Seq
methods that could result in
an empty Seq
. However, an implicit converison from Every
to collection.immutable.IndexedSeq
is defined in the Every
companion object that will be applied if you attempt to call one of the missing methods. As a
result, you can invoke filter
on an Every
, even though filter
could result
in an empty sequence—but the result type will be collection.immutable.IndexedSeq
instead of Every
:
Every(1, 2, 3).filter(_ < 10) // Result: Vector(1, 2, 3) Every(1, 2, 3).filter(_ > 10) // Result: Vector()
You can use Every
s in for
expressions. The result will be an Every
unless
you use a filter (an if
clause). Because filters are desugared to invocations of filter
, the
result type will switch to a collection.immutable.IndexedSeq
at that point. Here are some examples:
scala> import org.scalactic._ import org.scalactic._ scala> for (i <- Every(1, 2, 3)) yield i + 1 res0: org.scalactic.Every[Int] = Many(2, 3, 4) scala> for (i <- Every(1, 2, 3) if i < 10) yield i + 1 res1: scala.collection.immutable.IndexedSeq[Int] = Vector(2, 3, 4) scala> for { | i <- Every(1, 2, 3) | j <- Every('a', 'b', 'c') | } yield (i, j) res3: org.scalactic.Every[(Int, Char)] = Many((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c)) scala> for { | i <- Every(1, 2, 3) if i < 10 | j <- Every('a', 'b', 'c') | } yield (i, j) res6: scala.collection.immutable.IndexedSeq[(Int, Char)] = Vector((1,a), (1,b), (1,c), (2,a), (2,b), (2,c), (3,a), (3,b), (3,c))
Motivation for Every
s
Although Every
is a general-purpose, non-empty ordered collection, it was motivated by the desire to enable easy
accumulation of errors in Or
s. For examples of Every
used in that use case, see the
Accumulating errors with Or
section in the main documentation for Or
.
- T
the type of elements contained in this
Every
- Source
- Every.scala
- Alphabetic
- By Inheritance
- Every
- Serializable
- Product
- Equals
- PartialFunction
- Function1
- AnyRef
- Any
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def ++[U >: T](other: GenTraversableOnce[U]): Every[U]
Returns a new
Many
containing the elements of thisEvery
followed by the elements of the passedGenTraversableOnce
.Returns a new
Many
containing the elements of thisEvery
followed by the elements of the passedGenTraversableOnce
. The element type of the resultingMany
is the most specific superclass encompassing the element types of thisEvery
and the passedGenTraversableOnce
.- U
the element type of the returned
Many
- other
the
Every
to append- returns
a new
Many
that contains all the elements of thisEvery
followed by all elements ofother
.
- abstract def ++[U >: T](other: Every[U]): Many[U]
Returns a new
Many
containing the elements of thisEvery
followed by the elements of the passedEvery
.Returns a new
Many
containing the elements of thisEvery
followed by the elements of the passedEvery
. The element type of the resultingMany
is the most specific superclass encompassing the element types of this and the passedEvery
.- U
the element type of the returned
Many
- other
the
Every
to append- returns
a new
Many
that contains all the elements of thisEvery
followed by all elements ofother
.
- abstract def :+[U >: T](element: U): Many[U]
Returns a new
Every
with the given element appended.Returns a new
Every
with the given element appended.Note a mnemonic for
+:
vs.:+
is: the COLon goes on the COLlection side.- element
the element to append to this
Every
- returns
a new
Every
consisting of all elements of thisEvery
followed byelement
.
- abstract def canEqual(that: Any): Boolean
- Definition Classes
- Equals
- abstract def productArity: Int
- Definition Classes
- Product
- abstract def productElement(n: Int): Any
- Definition Classes
- Product
- abstract def stringPrefix: String
The prefix of this object's
toString
representation.The prefix of this object's
toString
representation.- returns
a string representation which starts the result of
toString
applied to thisEvery
, which will be"One"
if thisEvery
is aOne
, or"Many"
if it is aMany
.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def +:[U >: T](element: U): Many[U]
Returns a new
Every
with the given element prepended.Returns a new
Every
with the given element prepended.Note that :-ending operators are right associative. A mnemonic for
+:
vs.:+
is: the COLon goes on the COLlection side.- element
the element to prepend to this
Every
- returns
a new
Every
consisting ofelement
followed by all elements of thisEvery
.
- 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
Every
to a string builder using start, end, and separator strings.Appends all elements of this
Every
to a string builder using start, end, and separator strings. The written text will consist of a concatenation of the stringstart
; the result of invokingtoString
on all elements of 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.
- final def addString(sb: StringBuilder, sep: String): StringBuilder
Appends all elements of this
Every
to a string builder using a separator string.Appends all elements of this
Every
to a string builder using a separator string. The written text will consist of a concatenation of the result of invokingtoString
on of every element of 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.
- final def addString(sb: StringBuilder): StringBuilder
Appends all elements of this
Every
to a string builder.Appends all elements of this
Every
to a string builder. The written text will consist of a concatenation of the result of invokingtoString
on 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.
- def andThen[C](k: PartialFunction[T, C]): PartialFunction[Int, C]
- Definition Classes
- PartialFunction
- 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
Every
at 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
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def collectFirst[U](pf: PartialFunction[T, U]): Option[U]
Finds the first element of the
Every
for which the given partial function is defined, if any, and applies the partial function to it.Finds the first element of the
Every
for which the given partial function is defined, if any, and applies the partial function to it.- pf
the partial function
- returns
an
Option
containingpf
applied to the first element for which it is defined, orNone
if the partial function was not defined for any element.
- def compose[R](k: PartialFunction[R, Int]): PartialFunction[R, T]
- Definition Classes
- PartialFunction
- def compose[A](g: (A) => Int): (A) => T
- Definition Classes
- Function1
- Annotations
- @unspecialized()
- final def contains(elem: Any): Boolean
Indicates whether this
Every
contains a given value as an element.Indicates whether this
Every
contains a given value as an element.- elem
the element to look for
- returns
true if this
Every
has an element that is equal (as determined by==)
toelem
, false otherwise.
- final def containsSlice[B](that: Every[B]): Boolean
Indicates whether this
Every
contains a givenEvery
as a slice.Indicates whether this
Every
contains a givenEvery
as a slice.- that
the
Every
slice to look for- returns
true if this
Every
contains a slice with the same elements asthat
, otherwisefalse
.
- final def containsSlice[B](that: GenSeq[B]): Boolean
Indicates whether this
Every
contains a givenGenSeq
as a slice.Indicates whether this
Every
contains a givenGenSeq
as a slice.- that
the
GenSeq
slice to look for- returns
true if this
Every
contains a slice with the same elements asthat
, otherwisefalse
.
- final def copyToArray[U >: T](arr: Array[U], start: Int, len: Int): Unit
Copies values of this
Every
to an array.Copies values of this
Every
to an array. Fills the given arrayarr
with at mostlen
elements of thisEvery
, beginning at indexstart
. Copying will stop once either the end of the currentEvery
is reached, the end of the array is reached, orlen
elements have been copied.- arr
the array to fill
- start
the starting index
- len
the maximum number of elements to copy
- final def copyToArray[U >: T](arr: Array[U], start: Int): Unit
Copies values of this
Every
to an array.Copies values of this
Every
to an array. Fills the given arrayarr
with values of thisEvery
, beginning at indexstart
. Copying will stop once either the end of the currentEvery
is reached, or the end of the array is reached.- arr
the array to fill
- start
the starting index
- final def copyToArray[U >: T](arr: Array[U]): Unit
Copies values of this
Every
to an array.Copies values of this
Every
to an array. Fills the given arrayarr
with values of thisEvery
. Copying will stop once either the end of the currentEvery
is reached, or the end of the array is reached.- arr
the array to fill
- final def copyToBuffer[U >: T](buf: Buffer[U]): Unit
Copies all elements of this
Every
to a buffer.Copies all elements of this
Every
to a buffer.- buf
the buffer to which elements are copied
- final def corresponds[B](that: Every[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this
Every
relates to the corresponding element of a givenEvery
by satisfying a given predicate.Indicates whether every element of this
Every
relates to the corresponding element of a givenEvery
by satisfying a given predicate.- B
the type of the elements of
that
- that
the
Every
to compare for correspondence- p
the predicate, which relates elements from this and the passed
Every
- returns
true if this and the passed
Every
have the same length andp(x, y)
istrue
for all corresponding elementsx
of thisEvery
andy
of that, otherwisefalse
.
- final def corresponds[B](that: GenSeq[B])(p: (T, B) => Boolean): Boolean
Indicates whether every element of this
Every
relates to the corresponding element of a givenGenSeq
by satisfying a given predicate.Indicates whether every element of this
Every
relates to the corresponding element of a givenGenSeq
by satisfying a given predicate.- B
the type of the elements of
that
- that
the
GenSeq
to compare for correspondence- p
the predicate, which relates elements from this
Every
and the passedGenSeq
- returns
true if this
Every
and the passedGenSeq
have the same length andp(x, y)
istrue
for all corresponding elementsx
of thisEvery
andy
of that, otherwisefalse
.
- final def count(p: (T) => Boolean): Int
Counts the number of elements in the
Every
that satisfy a predicate.Counts the number of elements in the
Every
that satisfy a predicate.- p
the predicate used to test elements.
- returns
the number of elements satisfying the predicate
p
.
- final def distinct: Every[T]
Builds a new
Every
from thisEvery
without any duplicate elements.Builds a new
Every
from thisEvery
without any duplicate elements.- returns
A new
Every
that contains the first occurrence of every element of thisEvery
.
- def elementWise: ElementWiseExtractor[Int, T]
- Definition Classes
- PartialFunction
- final def endsWith[B](that: Every[B]): Boolean
Indicates whether this
Every
ends with the givenEvery
.Indicates whether this
Every
ends with the givenEvery
.- returns
true
if thisEvery
hasthat
as a suffix,false
otherwise.
- final def endsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Every
ends with the givenGenSeq
.Indicates whether this
Every
ends with the givenGenSeq
.- returns
true
if thisEvery
hasthat
as a suffix,false
otherwise.
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- 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
true
if the given predicatep
holds for some of the elements of thisEvery
, otherwisefalse
.
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def find(p: (T) => Boolean): Option[T]
Finds the first element of this
Every
that satisfies the given predicate, if any.Finds the first element of this
Every
that satisfies the given predicate, if any.- p
the predicate used to test elements
- returns
an
Some
containing the first element in thisEvery
that satisfiesp
, orNone
if none exists.
- final def flatMap[U](f: (T) => Every[U]): Every[U]
Builds a new
Every
by applying a function to all elements of thisEvery
and using the elements of the resultingEvery
s.Builds a new
Every
by applying a function to all elements of thisEvery
and using the elements of the resultingEvery
s.- U
the element type of the returned
Every
- f
the function to apply to each element.
- returns
a new
Every
containing elements obtained by applying the given functionf
to each element of thisEvery
and concatenating the elements of resultingEvery
s.
- final def flatten[B](implicit ev: <:<[T, Every[B]]): Every[B]
Converts this
Every
ofEvery
s into anEvery
formed by the elements of the nestedEvery
s.Converts this
Every
ofEvery
s into anEvery
formed by the elements of the nestedEvery
s.Note: You cannot use this
flatten
method on anEvery
that contains aGenTraversableOnce
s, because if all the nestedGenTraversableOnce
s were empty, you'd end up with an emptyEvery
.- returns
a new
Every
resulting from concatenating all nestedEvery
s.
- final def fold[U >: T](z: U)(op: (U, U) => U): U
Folds the elements of this
Every
using the specified associative binary operator.Folds the elements of this
Every
using the specified associative binary operator.The order in which operations are performed on elements is unspecified and may be nondeterministic.
- U
a type parameter for the binary operator, a supertype of T.
- z
a neutral element for the fold operation; may be added to the result an arbitrary number of times, and must not change the result (e.g.,
Nil
for list concatenation, 0 for addition, or 1 for multiplication.)- op
a binary operator that must be associative
- returns
the result of applying fold operator
op
between all the elements andz
- final def foldLeft[B](z: B)(op: (B, T) => B): B
Applies a binary operator to a start value and all elements of this
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
op
between 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 x_{1}, ..., x_{n} are the elements of thisEvery
.
- final def foldRight[B](z: B)(op: (T, B) => B): B
Applies a binary operator to all elements of this
Every
and a start value, going right to left.Applies a binary operator to all elements of this
Every
and a start value, going right to left.- B
the result of the binary operator
- z
the start value
- op
the binary operator
- returns
the result of inserting
op
between consecutive elements of thisEvery
, going right to left, with the start value,z
, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n} are the elements of thisEvery
.
- 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
true
if the given predicatep
holds for all elements of thisEvery
, otherwisefalse
.
- final def foreach(f: (T) => Unit): Unit
Applies a function
f
to all elements of thisEvery
.Applies a function
f
to all elements of thisEvery
.- f
the function that is applied for its side-effect to every element. The result of function
f
is discarded.
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def groupBy[K](f: (T) => K): Map[K, Every[T]]
Partitions this
Every
into a map ofEvery
s according to some discriminator function.Partitions this
Every
into a map ofEvery
s according to some discriminator function.- K
the type of keys returned by the discriminator function.
- f
the discriminator function.
- returns
A map from keys to
Every
s such that the following invariant holds:(every.toVector partition f)(k) = xs filter (x => f(x) == k)
That is, every keyk
is bound to anEvery
of those elementsx
for whichf(x)
equalsk
.
- final def grouped(size: Int): Iterator[Every[T]]
Partitions elements into fixed size
Every
s.Partitions elements into fixed size
Every
s.- size
the number of elements per group
- returns
An iterator producing
Every
s of sizesize
, except the last will be truncated if the elements don't divide evenly.
- final def hasDefiniteSize: Boolean
Returns
true
to indicate thisEvery
has a definite size, since allEvery
s are strict collections. - def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- 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
.
- final def headOption: Option[T]
Selects the first element of this
Every
and returns it wrapped in aSome
.Selects the first element of this
Every
and returns it wrapped in aSome
.- returns
the first element of this
Every
, wrapped in aSome
.
- final def indexOf[U >: T](elem: U, from: Int): Int
Finds index of first occurrence of some value in this
Every
after or at some start index.Finds index of first occurrence of some value in this
Every
after or at some start index.- elem
the element value to search for.
- from
the start index
- returns
the index
>=
from
of the first element of thisEvery
that is equal (as determined by==
) toelem
, or-1
, if none exists.
- 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
Every
that is equal (as determined by==
) toelem
, or-1
, if none exists.
- final def indexOfSlice[U >: T](that: Every[U], from: Int): Int
Finds first index after or at a start index where this
Every
contains a givenEvery
as a slice.Finds first index after or at a start index where this
Every
contains a givenEvery
as a slice.- that
the
Every
defining the slice to look for- from
the start index
- returns
the first index
>=
from
such that the elements of thisEvery
starting at this index match the elements ofEvery
that
, or-1
of no such subsequence exists.
- final def indexOfSlice[U >: T](that: Every[U]): Int
Finds first index where this
Every
contains a givenEvery
as a slice.Finds first index where this
Every
contains a givenEvery
as a slice.- that
the
Every
defining the slice to look for- returns
the first index such that the elements of this
Every
starting at this index match the elements ofEvery
that
, or-1
of no such subsequence exists.
- final def indexOfSlice[U >: T](that: GenSeq[U], from: Int): Int
Finds first index after or at a start index where this
Every
contains a givenGenSeq
as a slice.Finds first index after or at a start index where this
Every
contains a givenGenSeq
as a slice.- that
the
GenSeq
defining the slice to look for- from
the start index
- returns
the first index
>=
from
at which the elements of thisEvery
starting at that index match the elements ofGenSeq
that
, or-1
of no such subsequence exists.
- final def indexOfSlice[U >: T](that: GenSeq[U]): Int
Finds first index where this
Every
contains a givenGenSeq
as a slice.Finds first index where this
Every
contains a givenGenSeq
as a slice.- that
the
GenSeq
defining the slice to look for- returns
the first index at which the elements of this
Every
starting at that index match the elements ofGenSeq
that
, or-1
of no such subsequence exists.
- final def indexWhere(p: (T) => Boolean, from: Int): Int
Finds index of the first element satisfying some predicate after or at some start index.
Finds index of the first element satisfying some predicate after or at some start index.
- p
the predicate used to test elements.
- from
the start index
- returns
the index
>=
from
of the first element of thisEvery
that satisfies the predicatep
, or-1
, if none exists.
- final def indexWhere(p: (T) => Boolean): Int
Finds index of the first element satisfying some predicate.
Finds index of the first element satisfying some predicate.
- p
the predicate used to test elements.
- returns
the index of the first element of this
Every
that satisfies the predicatep
, or-1
, if none exists.
- final def indices: Range
Produces the range of all indices of this
Every
.Produces the range of all indices of this
Every
.- returns
a
Range
value from0
to one less than the length of thisEvery
.
- final def isDefinedAt(idx: Int): Boolean
Tests whether this
Every
contains given index.Tests whether this
Every
contains given index.- idx
the index to test
- returns
true if this
Every
contains an element at positionidx
,false
otherwise.
- Definition Classes
- Every → PartialFunction
- final def isEmpty: Boolean
Returns
false
to indicate thisEvery
, like allEvery
s, is non-empty.Returns
false
to indicate thisEvery
, like allEvery
s, is non-empty.- returns
false
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def isTraversableAgain: Boolean
Returns
true
to indicate thisEvery
, like allEvery
s, can be traversed repeatedly.Returns
true
to indicate thisEvery
, like allEvery
s, can be traversed repeatedly.- returns
true
- 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
- 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
.
- final def lastIndexOf[U >: T](elem: U, end: Int): Int
Finds the index of the last occurrence of some value in this
Every
before or at a givenend
index.Finds the index of the last occurrence of some value in this
Every
before or at a givenend
index.- elem
the element value to search for.
- end
the end index.
- returns
the index
>=
end
of the last element of thisEvery
that is equal (as determined by==
) toelem
, or-1
, if none exists.
- 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
Every
that is equal (as determined by==
) toelem
, or-1
, if none exists.
- final def lastIndexOfSlice[U >: T](that: Every[U], end: Int): Int
Finds the last index before or at a given end index where this
Every
contains a givenEvery
as a slice.Finds the last index before or at a given end index where this
Every
contains a givenEvery
as a slice.- that
the
Every
defining the slice to look for- end
the end index
- returns
the last index
>=
end
at which the elements of thisEvery
starting at that index match the elements ofEvery
that
, or-1
of no such subsequence exists.
- final def lastIndexOfSlice[U >: T](that: Every[U]): Int
Finds the last index where this
Every
contains a givenEvery
as a slice.Finds the last index where this
Every
contains a givenEvery
as a slice.- that
the
Every
defining the slice to look for- returns
the last index at which the elements of this
Every
starting at that index match the elements ofEvery
that
, or-1
of no such subsequence exists.
- final def lastIndexOfSlice[U >: T](that: GenSeq[U], end: Int): Int
Finds the last index before or at a given end index where this
Every
contains a givenGenSeq
as a slice.Finds the last index before or at a given end index where this
Every
contains a givenGenSeq
as a slice.- that
the
GenSeq
defining the slice to look for- end
the end index
- returns
the last index
>=
end
at which the elements of thisEvery
starting at that index match the elements ofGenSeq
that
, or-1
of no such subsequence exists.
- final def lastIndexOfSlice[U >: T](that: GenSeq[U]): Int
Finds the last index where this
Every
contains a givenGenSeq
as a slice.Finds the last index where this
Every
contains a givenGenSeq
as a slice.- that
the
GenSeq
defining the slice to look for- returns
the last index at which the elements of this
Every
starting at that index match the elements ofGenSeq
that
, or-1
of no such subsequence exists.
- final def lastIndexWhere(p: (T) => Boolean, end: Int): Int
Finds index of last element satisfying some predicate before or at given end index.
Finds index of last element satisfying some predicate before or at given end index.
- p
the predicate used to test elements.
- end
the end index
- returns
the index
>=
end
of the last element of thisEvery
that satisfies the predicatep
, or-1
, if none exists.
- final def lastIndexWhere(p: (T) => Boolean): Int
Finds index of last element satisfying some predicate.
Finds index of last element satisfying some predicate.
- p
the predicate used to test elements.
- returns
the index of the last element of this
Every
that satisfies the predicatep
, or-1
, if none exists.
- 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
.
- final def length: Int
The length of this
Every
.The length of this
Every
.Note:
length
andsize
yield the same result, which will be>
= 1.- returns
the number of elements in this
Every
.
- final def lengthCompare(len: Int): Int
Compares the length of this
Every
to a test value.Compares the length of this
Every
to a test value.- len
the test value that gets compared with the length.
- returns
a value
x
wherex < 0 if this.length < len x == 0 if this.length == len x > 0 if this.length > len
- def lift: (Int) => Option[T]
- Definition Classes
- PartialFunction
- final def map[U](f: (T) => U): Every[U]
Builds a new
Every
by applying a function to all elements of thisEvery
.Builds a new
Every
by 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
Every
resulting from applying the given functionf
to each element of thisEvery
and collecting the results.
- final def max[U >: T](implicit cmp: Ordering[U]): T
Finds the largest element.
Finds the largest element.
- returns
the largest element of this
Every
.
- 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
.
- final def min[U >: T](implicit cmp: Ordering[U]): T
Finds the smallest element.
Finds the smallest element.
- returns
the smallest element of this
Every
.
- 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
.
- final def mkString(start: String, sep: String, end: String): String
Displays all elements of this
Every
in a string using start, end, and separator strings.Displays all elements of this
Every
in a string using start, end, and separator strings.- start
the starting string.
- sep
the separator string.
- end
the ending string.
- returns
a string representation of this
Every
. The resulting string begins with the stringstart
and ends with the stringend
. Inside, In the resulting string, the result of invokingtoString
on all elements of thisEvery
are separated by the stringsep
.
- final def mkString(sep: String): String
Displays all elements of this
Every
in a string using a separator string.Displays all elements of this
Every
in a string using a separator string.- sep
the separator string
- returns
a string representation of this
Every
. In the resulting string, the result of invokingtoString
on all elements of thisEvery
are separated by the stringsep
.
- final def mkString: String
Displays all elements of this
Every
in a string.Displays all elements of this
Every
in a string.- returns
a string representation of this
Every
. In the resulting string, the result of invokingtoString
on all elements of thisEvery
follow each other without any separator string.
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def nonEmpty: Boolean
Returns
true
to indicate thisEvery
, like allEvery
s, is non-empty.Returns
true
to indicate thisEvery
, like allEvery
s, is non-empty.- returns
true
- 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
- final def padTo[U >: T](len: Int, elem: U): Every[U]
A copy of this
Every
with an element value appended until a given target length is reached.A copy of this
Every
with an element value appended until a given target length is reached.- len
the target length
- elem
he padding value
- returns
a new
Every
consisting of all elements of thisEvery
followed by the minimal number of occurrences ofelem
so that the resultingEvery
has a length of at leastlen
.
- final def patch[U >: T](from: Int, that: Every[U], replaced: Int): Every[U]
Produces a new
Every
where a slice of elements in thisEvery
is replaced by anotherEvery
Produces a new
Every
where a slice of elements in thisEvery
is replaced by anotherEvery
- from
the index of the first replaced element
- that
the
Every
whose elements should replace a slice in thisEvery
- replaced
the number of elements to drop in the original
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
.
- 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
Every
such that every element of the segment satisfies the predicatep
.
- final def product[U >: T](implicit num: Numeric[U]): U
The result of multiplying all the elements of this
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
- def productElementName(n: Int): String
- Definition Classes
- Product
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- def productIterator: Iterator[Any]
- Definition Classes
- Product
- def productPrefix: String
- Definition Classes
- Product
- final def reduce[U >: T](op: (U, U) => U): U
Reduces the elements of this
Every
using the specified associative binary operator.Reduces the elements of this
Every
using the specified associative binary operator.The order in which operations are performed on elements is unspecified and may be nondeterministic.
- U
a type parameter for the binary operator, a supertype of T.
- op
a binary operator that must be associative.
- returns
the result of applying reduce operator
op
between all the elements of thisEvery
.
- 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
op
between consecutive elements of thisEvery
, going left to right:op(...op(op(x_1, x_2), x_3), ..., x_n)
where x_{1}, ..., x_{n} are the elements of thisEvery
.
- 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
Some
containing the result ofreduceLeft(op)
- final def reduceOption[U >: T](op: (U, U) => U): Option[U]
- final def reduceRight[U >: T](op: (T, U) => U): U
Applies a binary operator to all elements of this
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
op
between consecutive elements of thisEvery
, going right to left:op(x_1, op(x_2, ... op(x_{n-1}, x_n)...))
where x_{1}, ..., x_{n} are the elements of thisEvery
.
- 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
Some
containing the result ofreduceRight(op)
- final def reverse: Every[T]
Returns new
Every
wih elements in reverse order.Returns new
Every
wih elements in reverse order.- returns
a new
Every
with all elements of thisEvery
in reversed order.
- final def reverseIterator: Iterator[T]
An iterator yielding elements in reverse order.
An iterator yielding elements in reverse order.
Note:
every.reverseIterator
is the same asevery.reverse.iterator
, but might be more efficient.- returns
an iterator yielding the elements of this
Every
in reversed order
- final def reverseMap[U](f: (T) => U): Every[U]
Builds a new
Every
by applying a function to all elements of thisEvery
and collecting the results in reverse order.Builds a new
Every
by applying a function to all elements of thisEvery
and 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
Every
resulting from applying the given functionf
to each element of thisEvery
and collecting the results in reverse order.
- def runWith[U](action: (T) => U): (Int) => Boolean
- Definition Classes
- PartialFunction
- final def sameElements[U >: T](that: Every[U]): Boolean
Checks if the given
Every
contains the same elements in the same order as thisEvery
.Checks if the given
Every
contains the same elements in the same order as thisEvery
.- that
the
Every
with which to compare- returns
true
, if both this and the givenEvery
contain the same elements in the same order,false
otherwise.
- final def sameElements[U >: T](that: GenIterable[U]): Boolean
Checks if the given
GenIterable
contains the same elements in the same order as thisEvery
.Checks if the given
GenIterable
contains the same elements in the same order as thisEvery
.- that
the
GenIterable
with which to compare- returns
true
, if both thisEvery
and the givenGenIterable
contain the same elements in the same order,false
otherwise.
- 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.,
Nil
for list concatenation, 0 for addition, or 1 for multiplication.)- op
a binary operator that must be associative
- returns
a new
Every
containing the prefix scan of the elements in thisEvery
- final def scanLeft[B](z: B)(op: (B, T) => B): Every[B]
Produces an
Every
containing cumulative results of applying the operator going left to right.Produces an
Every
containing 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
Every
containing the intermediate results of insertingop
between consecutive elements of thisEvery
, going left to right, with the start value,z
, on the left.
- final def scanRight[B](z: B)(op: (T, B) => B): Every[B]
Produces an
Every
containing cumulative results of applying the operator going right to left.Produces an
Every
containing 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
Every
containing the intermediate results of insertingop
between consecutive elements of thisEvery
, going right to left, with the start value,z
, on the right.
- final def segmentLength(p: (T) => Boolean, from: Int): Int
Computes length of longest segment whose elements all satisfy some predicate.
Computes length of longest segment whose elements all satisfy some predicate.
- p
the predicate used to test elements.
- from
the index where the search starts.
- final def size: Int
The size of this
Every
.The size of this
Every
.Note:
length
andsize
yield the same result, which will be>
= 1.- returns
the number of elements in this
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
step
each time.Groups elements in fixed size blocks by passing a “sliding window” over them (as opposed to partitioning them, as is done in grouped.), moving the sliding window by a given
step
each time.- size
the number of elements per group
- step
the distance between the first elements of successive groups
- returns
an iterator producing
Every
s of sizesize
, except the last and the only element will be truncated if there are fewer elements thansize
.
- final def sliding(size: Int): Iterator[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
Every
s of sizesize
, except the last and the only element will be truncated if there are fewer elements thansize
.
- final def sortBy[U](f: (T) => U)(implicit ord: Ordering[U]): Every[T]
Sorts this
Every
according to theOrdering
of the result of applying the given function to every element.Sorts this
Every
according to theOrdering
of the result of applying the given function to every element.- U
the target type of the transformation
f
, and the type where theOrdering
ord
is defined.- f
the transformation function mapping elements to some other domain
U
.- ord
the ordering assumed on domain
U
.- returns
a
Every
consisting of the elements of thisEvery
sorted according to theOrdering
wherex < y if ord.lt(f(x), f(y))
.
- final def sortWith(lt: (T, T) => Boolean): Every[T]
Sorts this
Every
according to a comparison function.Sorts this
Every
according to a comparison function.The sort is stable. That is, elements that are equal (as determined by
lt
) appear in the same order in the sortedEvery
as in the original.- returns
an
Every
consisting of the elements of thisEvery
sorted according to the comparison functionlt
.
- final def sorted[U >: T](implicit ord: Ordering[U]): Every[U]
Sorts this
Every
according to anOrdering
.Sorts this
Every
according to anOrdering
.The sort is stable. That is, elements that are equal (as determined by
lt
) appear in the same order in the sortedEvery
as in the original.- ord
the
Ordering
to be used to compare elements.- returns
an
Every
consisting of the elements of thisEvery
sorted according to the comparison functionlt
.
- final def startsWith[B](that: Every[B], offset: Int): Boolean
Indicates whether this
Every
starts with the givenEvery
at the given index.Indicates whether this
Every
starts with the givenEvery
at the given index.- that
the
Every
slice to look for in thisEvery
- offset
the index at which this
Every
is searched.- returns
true
if thisEvery
hasthat
as a slice at the indexoffset
,false
otherwise.
- final def startsWith[B](that: Every[B]): Boolean
Indicates whether this
Every
starts with the givenEvery
.Indicates whether this
Every
starts with the givenEvery
.- that
the
Every
to test- returns
true
if this collection hasthat
as a prefix,false
otherwise.
- final def startsWith[B](that: GenSeq[B], offset: Int): Boolean
Indicates whether this
Every
starts with the givenGenSeq
at the given index.Indicates whether this
Every
starts with the givenGenSeq
at the given index.- that
the
GenSeq
slice to look for in thisEvery
- offset
the index at which this
Every
is searched.- returns
true
if thisEvery
hasthat
as a slice at the indexoffset
,false
otherwise.
- final def startsWith[B](that: GenSeq[B]): Boolean
Indicates whether this
Every
starts with the givenGenSeq
.Indicates whether this
Every
starts with the givenGenSeq
.- that
the
GenSeq
slice to look for in thisEvery
- returns
true
if thisEvery
hasthat
as a prefix,false
otherwise.
- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- final def to[C1](factory: Factory[T, C1]): C1
Converts this
Every
into a collection of typeCol
by copying all elements.Converts this
Every
into a collection of typeCol
by copying all elements.- returns
a new collection containing all elements of this
Every
.
- final def toArray[U >: T](implicit classTag: ClassTag[U]): Array[U]
Converts this
Every
to an array.Converts this
Every
to an array.- returns
an array containing all elements of this
Every
. AClassTag
must be available for the element type of thisEvery
.
- final def toBuffer[U >: T]: Buffer[U]
Converts this
Every
to a mutable buffer.Converts this
Every
to a mutable buffer.- returns
a buffer containing all elements of this
Every
.
- final def toIndexedSeq: IndexedSeq[T]
Converts this
Every
to an immutableIndexedSeq
.Converts this
Every
to an immutableIndexedSeq
.- returns
an immutable
IndexedSeq
containing all elements of thisEvery
.
- final def toIterable: Iterable[T]
Converts this
Every
to an iterable collection.Converts this
Every
to an iterable collection.- returns
an
Iterable
containing all elements of thisEvery
.
- final def toIterator: Iterator[T]
Returns an
Iterator
over the elements in thisEvery
.Returns an
Iterator
over the elements in thisEvery
.- returns
an
Iterator
containing all elements of thisEvery
.
- final def toList: List[T]
Converts this
Every
to a list.Converts this
Every
to a list.- returns
a list containing all elements of this
Every
.
- final def toMap[K, V](implicit ev: <:<[T, (K, V)]): Map[K, V]
Converts this
Every
to a map.Converts this
Every
to a map.This method is unavailable unless the elements are members of
Tuple2
, each((K, V))
becoming a key-value pair in the map. Duplicate keys will be overwritten by later keys.- returns
a map of type
immutable.Map[K, V]
containing all key/value pairs of type(K, V)
of thisEvery
.
- final def toSeq: Seq[T]
Converts this
Every
to an immutableIndexedSeq
.Converts this
Every
to an immutableIndexedSeq
.- returns
an immutable
IndexedSeq
containing all elements of thisEvery
.
- final def toSet[U >: T]: Set[U]
Converts this
Every
to a set.Converts this
Every
to a set.- returns
a set containing all elements of this
Every
.
- final def toStream: Stream[T]
Converts this
Every
to a stream.Converts this
Every
to a stream.- returns
a stream containing all elements of this
Every
.
- def toString(): String
- Definition Classes
- Function1 → AnyRef → Any
- final def toVector: Vector[T]
Converts this
Every
to aVector
.Converts this
Every
to aVector
.- returns
a
Vector
containing all elements of thisEvery
.
- final def transpose[U](implicit ev: <:<[T, Every[U]]): Every[Every[U]]
Converts this
Every
to an unspecified Traversable.Converts this
Every
to an unspecified Traversable.- returns
a
Traversable
containing all elements of thisEvery
.
- def unapply(a: Int): Option[T]
- Definition Classes
- PartialFunction
- final def union[U >: T](that: Seq[U]): Every[U]
Produces a new
Every
that contains all elements of thisEvery
and also all elements of a givenGenSeq
.Produces a new
Every
that contains all elements of thisEvery
and also all elements of a givenGenSeq
.everyX
union
ys
is equivalent toeveryX
++
ys
.Another way to express this is that
everyX
union
ys
computes the order-presevring multi-set union ofeveryX
andys
. Thisunion
method is hence a counter-part ofdiff
andintersect
that also work on multi-sets.- that
the
GenSeq
to add.- returns
a new
Every
that contains all elements of thisEvery
followed by all elements ofthat
GenSeq
.
- final def union[U >: T](that: Every[U]): Every[U]
Produces a new
Every
that contains all elements of thisEvery
and also all elements of a givenEvery
.Produces a new
Every
that contains all elements of thisEvery
and also all elements of a givenEvery
.everyX
union
everyY
is equivalent toeveryX
++
everyY
.Another way to express this is that
everyX
union
everyY
computes the order-presevring multi-set union ofeveryX
andeveryY
. Thisunion
method is hence a counter-part ofdiff
andintersect
that also work on multi-sets.- that
the
Every
to add.- returns
a new
Every
that contains all elements of thisEvery
followed by all elements ofthat
.
- final def unzip[L, R](implicit asPair: (T) => (L, R)): (Every[L], Every[R])
Converts this
Every
of pairs into twoEvery
s of the first and second half of each pair.Converts this
Every
of pairs into twoEvery
s of the first and second half of each pair.- L
the type of the first half of the element pairs
- R
the type of the second half of the element pairs
- asPair
an implicit conversion that asserts that the element type of this
Every
is a pair.- returns
a pair of
Every
s, containing the first and second half, respectively, of each element pair of thisEvery
.
- final def unzip3[L, M, R](implicit asTriple: (T) => (L, M, R)): (Every[L], Every[M], Every[R])
Converts this
Every
of triples into threeEvery
s of the first, second, and and third element of each triple.Converts this
Every
of triples into threeEvery
s of the first, second, and and third element of each triple.- L
the type of the first member of the element triples
- R
the type of the third member of the element triples
- asTriple
an implicit conversion that asserts that the element type of this
Every
is a triple.- returns
a triple of
Every
s, containing the first, second, and third member, respectively, of each element triple of thisEvery
.
- final def updated[U >: T](idx: Int, elem: U): Every[U]
A copy of this
Every
with one single replaced element.A copy of this
Every
with one single replaced element.- idx
the position of the replacement
- elem
the replacing element
- returns
a copy of this
Every
with the element at positionidx
replaced byelem
.
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def zipAll[O, U >: T](other: Iterable[O], thisElem: U, otherElem: O): Every[(U, O)]
Returns an
Every
formed from thisEvery
and an iterable collection by combining corresponding elements in pairs.Returns an
Every
formed from thisEvery
and an iterable collection by combining corresponding elements in pairs. If one of the two collections is shorter than the other, placeholder elements will be used to extend the shorter collection to the length of the longer.- other
the
Iterable
providing the second half of each result pair- thisElem
the element to be used to fill up the result if this
Every
is shorter thanthat
Iterable
.- returns
a new
Every
containing pairs consisting of corresponding elements of thisEvery
andthat
. The length of the returned collection is the maximum of the lengths of thisEvery
andthat
. If thisEvery
is shorter thanthat
,thisElem
values are used to pad the result. Ifthat
is shorter than thisEvery
,thatElem
values are used to pad the result.
- final def zipWithIndex: Every[(T, Int)]
Zips this
Every
with its indices.Zips this
Every
with its indices.- returns
A new
Every
containing pairs consisting of all elements of thisEvery
paired with their index. Indices start at 0.
Deprecated Value Members
- final def /:[B](z: B)(op: (B, T) => B): B
The
/:
method has been deprecated and will be removed in a future version of Scalactic. Please usefoldLeft
instead.The
/:
method has been deprecated and will be removed in a future version of Scalactic. Please usefoldLeft
instead.This method has been deprecated for consistency with Scala 2.13's collections API.
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 thefoldLeft
method;z
/:
every
is the same asevery
foldLeft
z
.- B
the result of the binary operator
- z
the start value
- op
the binary operator
- returns
the result of inserting
op
between consecutive elements of thisEvery
, going left to right, with the start value,z
, on the left:op(...op(op(z, x_1), x_2), ..., x_n)
where x_{1}, ..., x_{n} are the elements of thisEvery
.
- Annotations
- @deprecated
- Deprecated
(Since version 3.1.x) The /: method has been deprecated and will be removed in a future version of Scalactic. Please use foldLeft instead.
- final def :\[B](z: B)(op: (T, B) => B): B
The
:\\
method has been deprecated and will be removed in a future version of Scalactic. Please usefoldRight
instead.The
:\\
method has been deprecated and will be removed in a future version of Scalactic. Please usefoldRight
instead.This method has been deprecated for consistency with Scala 2.13's collections API.
Fold right: applies a binary operator to all elements of this
Every
and a start value, going right to left.Note:
:\
is alternate syntax for thefoldRight
method;every
:\
z
is the same asevery
foldRight
z
.- B
the result of the binary operator
- z
the start value
- op
the binary operator
- returns
the result of inserting
op
between consecutive elements of thisEvery
, going right to left, with the start value,z
, on the right:op(x_1, op(x_2, ... op(x_n, z)...))
where x_{1}, ..., x_{n} are the elements of thisEvery
.
- Annotations
- @deprecated
- Deprecated
(Since version 3.1.x) The :\ method has been deprecated and will be removed in a future version of Scalactic. Please use foldRight instead.