final
class
VectorOps[A] extends AnyVal
Instance Constructors
-
new
VectorOps(self: Vector[A])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
<^>[B](f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B
-
final
def
==(arg0: Any): Boolean
-
final
def
adjacentPairs: Vector[(A, A)]
-
final
def
allPairs: Vector[(A, A)]
-
final
def
asInstanceOf[T0]: T0
-
final
def
breakM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(Vector[A], Vector[A])]
-
final
def
filterM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[Vector[A]]
-
final
def
findM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]
-
def
getClass(): Class[_ <: AnyVal]
-
final
def
groupWhen(p: (A, A) ⇒ Boolean): Vector[Vector[A]]
-
final
def
groupWhenM[M[_]](p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[Vector[A]]]
-
final
def
initz: Vector[Vector[A]]
-
final
def
intersperse(a: A): Vector[A]
-
final
def
isInstanceOf[T0]: Boolean
-
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[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Applicative[M]): M[(Vector[A], Vector[A])]
-
final
def
powerset: Vector[Vector[A]]
-
val
self: Vector[A]
-
final
def
spanM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(Vector[A], Vector[A])]
-
final
def
tailz: Vector[Vector[A]]
-
final
def
takeUntilM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[A]]
-
final
def
takeWhileM[M[_]](p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[A]]
-
-
def
toString(): String
-
final
def
toZipper: Option[Zipper[A]]
-
final
def
zipperEnd: Option[Zipper[A]]