vector

class Object
trait Matchable
class Any

Type members

Classlikes

object vectorSyntax extends ToVectorOps

Value members

Inherited methods

final
def <^>[A, B : Monoid](as: Vector[A])(f: NonEmptyList[A] => B): B

Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

Returns f applied to the contents of as if non-empty, otherwise, the zero element of the Monoid for the type B.

Inherited from
VectorFunctions
final
def adjacentPairs[A](as: Vector[A]): Vector[(A, A)]

[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

[(as(0), as(1)), (as(1), as(2)), ... (as(size-2), as(size-1))]

Inherited from
VectorFunctions
final
def allPairs[A](as: Vector[A]): Vector[(A, A)]

Combinations of as and as, excluding same-element pairs.

Combinations of as and as, excluding same-element pairs.

Inherited from
VectorFunctions
final
def breakM[A, M[_] : Monad](as: Vector[A])(p: A => M[Boolean]): M[(Vector[A], Vector[A])]

spanM with p's complement.

spanM with p's complement.

Inherited from
VectorFunctions
protected
def empty[A]: Vector[A]
Inherited from
VectorFunctions
final
def filterM[A, M[_]](as: Vector[A])(p: A => M[Boolean])(implicit F: Applicative[M]): M[Vector[A]]
Inherited from
VectorFunctions
final
def findM[A, M[_] : Monad](as: Vector[A])(p: A => M[Boolean]): M[Maybe[A]]

Run p(a)s left-to-right until it yields a true value, answering Maybe.Just(that), or Maybe.empty if nothing matched p.

Run p(a)s left-to-right until it yields a true value, answering Maybe.Just(that), or Maybe.empty if nothing matched p.

Inherited from
VectorFunctions
final
def groupWhen[A](as: Vector[A])(p: (A, A) => Boolean): Vector[Vector[A]]

groupWhenM specialized to scalaz.Id.Id.

groupWhenM specialized to scalaz.Id.Id.

Inherited from
VectorFunctions
final
def groupWhenM[A, M[_] : Monad](as: Vector[A])(p: (A, A) => M[Boolean]): M[Vector[Vector[A]]]

Split at each point where p(as(n), as(n+1)) yields false.

Split at each point where p(as(n), as(n+1)) yields false.

Inherited from
VectorFunctions
final
def initz[A](as: Vector[A]): Vector[Vector[A]]

[empty Vector, as take 1, as take 2, ..., as]

[empty Vector, as take 1, as take 2, ..., as]

Inherited from
VectorFunctions
final
def intersperse[A](as: Vector[A], a: A): Vector[A]

Intersperse the element a between each adjacent pair of elements in as

Intersperse the element a between each adjacent pair of elements in as

Inherited from
VectorFunctions
final
def mapAccumLeft[A, B, C](as: Vector[A])(c: C, f: (C, A) => (C, B)): (C, Vector[B])

All of the Bs, in order, and the final C acquired by a stateful left fold over as.

All of the Bs, in order, and the final C acquired by a stateful left fold over as.

Inherited from
VectorFunctions
final
def mapAccumRight[A, B, C](as: Vector[A])(c: C, f: (C, A) => (C, B)): (C, Vector[B])

All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

All of the Bs, in order as-wise, and the final C acquired by a stateful right fold over as.

Inherited from
VectorFunctions
final
def partitionM[A, M[_]](as: Vector[A])(p: A => M[Boolean])(implicit F: Applicative[M]): M[(Vector[A], Vector[A])]

A pair of passing and failing values of as against p.

A pair of passing and failing values of as against p.

Inherited from
VectorFunctions
final
def powerset[A](as: Vector[A]): Vector[Vector[A]]
Inherited from
VectorFunctions
final
def spanM[A, M[_] : Monad](as: Vector[A])(p: A => M[Boolean]): M[(Vector[A], Vector[A])]

A pair of the longest prefix of passing as against p, and the remainder.

A pair of the longest prefix of passing as against p, and the remainder.

Inherited from
VectorFunctions
final
def tailz[A](as: Vector[A]): Vector[Vector[A]]

[as, as.tail, as.tail.tail, ...,empty Vector]

[as, as.tail, as.tail.tail, ...,empty Vector]

Inherited from
VectorFunctions
final
def takeUntilM[A, M[_] : Monad](as: Vector[A])(p: A => M[Boolean]): M[Vector[A]]

Run p(a)s and collect as while p yields false. Don't run any ps after the first true.

Run p(a)s and collect as while p yields false. Don't run any ps after the first true.

Inherited from
VectorFunctions
final
def takeWhileM[A, M[_] : Monad](as: Vector[A])(p: A => M[Boolean]): M[Vector[A]]

Run p(a)s and collect as while p yields true. Don't run any ps after the first false.

Run p(a)s and collect as while p yields true. Don't run any ps after the first false.

Inherited from
VectorFunctions
final
def toNel[A](as: Vector[A]): Maybe[NonEmptyList[A]]
Inherited from
VectorFunctions
final
def toZipper[A](as: Vector[A]): Maybe[Zipper[A]]
Inherited from
VectorFunctions
final
def zipperEnd[A](as: Vector[A]): Maybe[Zipper[A]]
Inherited from
VectorFunctions

Implicits

Inherited implicits

implicit
def vectorEqual[A](implicit A0: Equal[A]): Equal[Vector[A]]
Inherited from
VectorInstances0
implicit
val vectorInstance: Traverse[Vector] & MonadPlus[Vector] & Alt[Vector] & BindRec[Vector] & Zip[Vector] & Unzip[Vector] & IsEmpty[Vector] & Align[Vector]
Inherited from
VectorInstances
implicit
def vectorMonoid[A]: Monoid[Vector[A]]
Inherited from
VectorInstances
implicit
def vectorOrder[A](implicit A0: Order[A]): Order[Vector[A]]
Inherited from
VectorInstances
implicit
def vectorShow[A : Show]: Show[Vector[A]]
Inherited from
VectorInstances