Trait

scalaz.std

VectorFunctions

Related Doc: package std

Permalink

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): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

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

    Permalink

    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): Boolean

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

    Permalink

    [(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)]

    Permalink

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

  7. final def asInstanceOf[T0]: T0

    Permalink
    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])]

    Permalink

    spanM with p's complement.

  9. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. def empty[A]: Vector[A]

    Permalink
    Attributes
    protected
  11. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  13. final def filterM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[Vector[A]]

    Permalink
  14. def finalize(): Unit

    Permalink
    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]]

    Permalink

    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[_]

    Permalink
    Definition Classes
    AnyRef → Any
  17. final def groupWhen[A](as: Vector[A])(p: (A, A) ⇒ Boolean): Vector[Vector[A]]

    Permalink

    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]]]

    Permalink

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

  19. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  20. final def initz[A](as: Vector[A]): Vector[Vector[A]]

    Permalink

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

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

    Permalink

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

  22. final def isInstanceOf[T0]: Boolean

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

    Permalink

    All of the Bs, 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])

    Permalink

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

  25. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  26. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  27. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  28. final def partitionM[A, M[_]](as: Vector[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[(Vector[A], Vector[A])]

    Permalink

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

  29. final def powerset[A](as: Vector[A]): Vector[Vector[A]]

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

    Permalink

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

  31. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  32. final def tailz[A](as: Vector[A]): Vector[Vector[A]]

    Permalink

    [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]]

    Permalink

    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 ps after the first true.

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

    Permalink

    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 ps after the first false.

  35. final def toNel[A](as: Vector[A]): Option[NonEmptyList[A]]

    Permalink
  36. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  37. final def toZipper[A](as: Vector[A]): Option[Zipper[A]]

    Permalink
  38. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  41. final def zipperEnd[A](as: Vector[A]): Option[Zipper[A]]

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped