scalaz/scalaz.syntax.std/VectorOps

VectorOps

final
class VectorOps[A](val self: Vector[A]) extends AnyVal
class AnyVal
trait Matchable
class Any

Value members

Concrete methods

final
def <^>[B : Monoid](f: NonEmptyList[A] => B): B
final
def adjacentPairs: Vector[(A, A)]
final
def allPairs: Vector[(A, A)]
final
def breakM[M[_] : Monad](p: A => M[Boolean]): M[(Vector[A], Vector[A])]
final
def filterM[M[_] : Applicative](p: A => M[Boolean]): M[Vector[A]]
final
def findM[M[_] : Monad](p: A => M[Boolean]): M[Option[A]]
final
def groupWhen(p: (A, A) => Boolean): Vector[Vector[A]]
final
def groupWhenM[M[_] : Monad](p: (A, A) => M[Boolean]): M[Vector[Vector[A]]]
final
def initz: Vector[Vector[A]]
final
def intersperse(a: A): Vector[A]
final
def mapAccumLeft[B, C](c: C, f: (C, A) => (C, B)): (C, Vector[B])
final
def mapAccumRight[B, C](c: C, f: (C, A) => (C, B)): (C, Vector[B])
final
def partitionM[M[_] : Applicative](p: A => M[Boolean]): M[(Vector[A], Vector[A])]
final
def powerset: Vector[Vector[A]]
final
def spanM[M[_] : Monad](p: A => M[Boolean]): M[(Vector[A], Vector[A])]
final
def tailz: Vector[Vector[A]]
final
def takeUntilM[M[_] : Monad](p: A => M[Boolean]): M[Vector[A]]
final
def takeWhileM[M[_] : Monad](p: A => M[Boolean]): M[Vector[A]]
final
def toNel: Option[NonEmptyList[A]]
final
def toZipper: Option[Zipper[A]]
final
def zipperEnd: Option[Zipper[A]]

Concrete fields

val self: Vector[A]