t

# VectorFunctions 

#### trait VectorFunctions extends AnyRef

Source
Vector.scala
Linear Supertypes
Known Subclasses
Ordering
1. Alphabetic
2. By Inheritance
Inherited
1. VectorFunctions
2. AnyRef
3. Any
1. Hide All
2. Show All
Visibility
1. Public
2. All

### Value Members

1. final def !=(arg0: Any)
Definition Classes
AnyRef → Any
2. final def ##(): Int
Definition Classes
AnyRef → Any
3. final def <^>[A, B](as: Vector[A])(f: (NonEmptyList[A]) ⇒ B)(implicit arg0: Monoid[B]): B

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

4. final def ==(arg0: Any)
Definition Classes
AnyRef → Any
5. final def adjacentPairs[A](as: Vector[A]): Vector[(A, A)]

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

6. final def allPairs[A](as: Vector[A]): Vector[(A, A)]

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

7. final def asInstanceOf[T0]: T0
Definition Classes
Any
8. final def breakM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(Vector[A], Vector[A])]

`spanM` with `p`'s complement.

9. def clone()
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
10. def empty[A]: Vector[A]
Attributes
protected
11. final def eq(arg0: AnyRef)
Definition Classes
AnyRef
12. def equals(arg0: Any)
Definition Classes
AnyRef → Any
13. final def filterM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[Vector[A]]
14. def finalize(): Unit
Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
15. final def findM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Option[A]]

Run `p(a)`s left-to-right until it yields a true value, answering `Some(that)`, or `None` if nothing matched `p`.

16. final def getClass(): Class[_]
Definition Classes
AnyRef → Any
Annotations
@native()
17. final def groupWhen[A](as: Vector[A])(p: (A, A) ⇒ Boolean): Vector[Vector[A]]

`groupWhenM` specialized to scalaz.Id.Id.

18. final def groupWhenM[A, M[_]](as: Vector[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[Vector[A]]]

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

19. def hashCode(): Int
Definition Classes
AnyRef → Any
Annotations
@native()
20. final def initz[A](as: Vector[A]): Vector[Vector[A]]

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

21. final def intersperse[A](as: Vector[A], a: A): Vector[A]

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

22. final def isInstanceOf[T0]
Definition Classes
Any
23. final def mapAccumLeft[A, B, C](as: Vector[A])(c: C, f: (C, A) ⇒ (C, B)): (C, Vector[B])

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

24. final def mapAccumRight[A, B, C](as: Vector[A])(c: C, f: (C, A) ⇒ (C, B)): (C, Vector[B])

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

25. final def ne(arg0: AnyRef)
Definition Classes
AnyRef
26. final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
27. final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
28. 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`.

29. final def powerset[A](as: Vector[A]): Vector[Vector[A]]
30. final def spanM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(Vector[A], Vector[A])]

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

31. final def synchronized[T0](arg0: ⇒ T0): T0
Definition Classes
AnyRef
32. final def tailz[A](as: Vector[A]): Vector[Vector[A]]

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

33. final def takeUntilM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[A]]

Run `p(a)`s and collect `as` while `p` yields false.

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

34. final def takeWhileM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[Vector[A]]

Run `p(a)`s and collect `as` while `p` yields true.

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

35. final def toNel[A](as: Vector[A]): Option[NonEmptyList[A]]
36. def toString()
Definition Classes
AnyRef → Any
37. final def toZipper[A](as: Vector[A]): Option[Zipper[A]]
38. final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
39. final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws( ... )
40. final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@native() @throws( ... )
41. final def zipperEnd[A](as: Vector[A]): Option[Zipper[A]]