scalaz.std

IndexedSeqSubFunctions

trait IndexedSeqSubFunctions extends IndexedSeqSub

Source
IndexedSeq.scala
Linear Supertypes
IndexedSeqSub, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. IndexedSeqSubFunctions
  2. IndexedSeqSub
  3. AnyRef
  4. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. abstract type IxSq[+A] <: IndexedSeq[A] with GenericTraversableTemplate[A, IxSq] with IndexedSeqLike[A, IxSq[A]]

    Definition Classes
    IndexedSeqSub

Abstract Value Members

  1. implicit abstract def buildIxSq[A, B]: CanBuildFrom[IxSq[A], B, IxSq[B]]

    Attributes
    protected
    Definition Classes
    IndexedSeqSub
  2. abstract def covariant: Traverse[IxSq] with Monad[IxSq]

    Attributes
    protected
    Definition Classes
    IndexedSeqSub
  3. abstract def empty[A]: IxSq[A]

    Attributes
    protected
    Definition Classes
    IndexedSeqSub

Concrete Value Members

  1. final def !=(arg0: Any): Boolean

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

    Definition Classes
    AnyRef → Any
  3. final def <^>[A, B](as: IxSq[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): Boolean

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

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

  6. final def allPairs[A](as: IxSq[A]): IxSq[(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: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[(IxSq[A], IxSq[A])]

    spanM with p's complement.

  9. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  10. final def eq(arg0: AnyRef): Boolean

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

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

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  14. final def findM[A, M[_]](as: IxSq[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.

  15. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  16. final def groupByM[A, M[_]](as: IxSq[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[IxSq[A]]]

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

  17. final def groupWhen[A](as: IxSq[A])(p: (A, A) ⇒ Boolean): IxSq[IxSq[A]]

    groupByM specialized to scalaz.Id.Id.

  18. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  19. final def initz[A](as: IxSq[A]): IxSq[IxSq[A]]

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

  20. final def intersperse[A](as: IxSq[A], a: A): IxSq[A]

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

  21. final def isInstanceOf[T0]: Boolean

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

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

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

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

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

    Definition Classes
    AnyRef
  25. final def notify(): Unit

    Definition Classes
    AnyRef
  26. final def notifyAll(): Unit

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

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

  28. final def powerset[A](as: IxSq[A]): IxSq[IxSq[A]]

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

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

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

    Definition Classes
    AnyRef
  31. final def tailz[A](as: IxSq[A]): IxSq[IxSq[A]]

    [as, as.tail, as.tail.tail, ..., empty IxSq]

  32. final def takeUntilM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[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 ps after the first true.

  33. final def takeWhileM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[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 ps after the first false.

  34. final def toNel[A](as: IxSq[A]): Option[NonEmptyList[A]]

  35. def toString(): String

    Definition Classes
    AnyRef → Any
  36. final def toZipper[A](as: IxSq[A]): Option[Zipper[A]]

  37. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. final def zipperEnd[A](as: IxSq[A]): Option[Zipper[A]]

Inherited from IndexedSeqSub

Inherited from AnyRef

Inherited from Any

Ungrouped