Packages

o

scalaz.std

indexedSeq

object indexedSeq extends IndexedSeqInstances with IndexedSeqSubFunctions with IndexedSeqSubIndexedSeq

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. indexedSeq
  2. IndexedSeqSubIndexedSeq
  3. IndexedSeqSubFunctions
  4. IndexedSeqSub
  5. IndexedSeqInstances
  6. IndexedSeqInstances0
  7. AnyRef
  8. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type IxSq[+A] = IndexedSeq[A]
    Definition Classes
    IndexedSeqSubIndexedSeq → IndexedSeqSub

Value Members

  1. object generic extends IndexedSeqSubIndexedSeq with IndexedSeqSubInstances
    Definition Classes
    IndexedSeqInstances
  2. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  3. final def ##(): Int
    Definition Classes
    AnyRef → Any
  4. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def adjacentPairs[A](as: IxSq[A]): IxSq[(A, A)]

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

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

    Definition Classes
    IndexedSeqSubFunctions
  7. final def allPairs[A](as: IxSq[A]): IxSq[(A, A)]

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

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

    Definition Classes
    IndexedSeqSubFunctions
  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. 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.

    spanM with p's complement.

    Definition Classes
    IndexedSeqSubFunctions
  10. final def buildIxSq[A, B]: CanBuildFrom[IxSq[A], B, IxSq[B]]
    Attributes
    protected
    Definition Classes
    IndexedSeqSubIndexedSeq → IndexedSeqSub
  11. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  12. final def covariant: Traverse[IndexedSeqInstances.generic.IxSq] with MonadPlus[IndexedSeqInstances.generic.IxSq] with Each[IndexedSeqInstances.generic.IxSq] with Index[IndexedSeqInstances.generic.IxSq] with Length[IndexedSeqInstances.generic.IxSq] with Zip[IndexedSeqInstances.generic.IxSq] with Unzip[IndexedSeqInstances.generic.IxSq] with IsEmpty[IndexedSeqInstances.generic.IxSq] with Align[IndexedSeqInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.std.indexedSeq.generic.IxSq[A]): scalaz.std.indexedSeq.generic.IxSq[A] }
    Attributes
    protected
    Definition Classes
    IndexedSeqSubIndexedSeq → IndexedSeqSub
  13. final def empty[A]: IndexedSeq[Nothing]
    Attributes
    protected
    Definition Classes
    IndexedSeqSubIndexedSeq → IndexedSeqSub
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. final def filterM[A, M[_]](as: IxSq[A])(p: (A) ⇒ M[Boolean])(implicit F: Applicative[M]): M[IxSq[A]]
    Definition Classes
    IndexedSeqSubFunctions
  17. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  18. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  19. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  20. final def groupWhen[A](as: IxSq[A])(p: (A, A) ⇒ Boolean): IxSq[IxSq[A]]

    groupWhenM specialized to scalaz.Id.Id.

    groupWhenM specialized to scalaz.Id.Id.

    Definition Classes
    IndexedSeqSubFunctions
  21. final def groupWhenM[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.

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

    Definition Classes
    IndexedSeqSubFunctions
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  23. implicit def indexedSeqEqual[A](implicit A0: Equal[A]): Equal[IndexedSeq[A]]
    Definition Classes
    IndexedSeqInstances0
  24. implicit val indexedSeqInstance: Traverse[IndexedSeqInstances.generic.IxSq] with MonadPlus[IndexedSeqInstances.generic.IxSq] with Each[IndexedSeqInstances.generic.IxSq] with Index[IndexedSeqInstances.generic.IxSq] with Length[IndexedSeqInstances.generic.IxSq] with Zip[IndexedSeqInstances.generic.IxSq] with Unzip[IndexedSeqInstances.generic.IxSq] with IsEmpty[IndexedSeqInstances.generic.IxSq] with Align[IndexedSeqInstances.generic.IxSq] { def toIndexedSeq[A](fa: scalaz.std.indexedSeq.generic.IxSq[A]): scalaz.std.indexedSeq.generic.IxSq[A] }
    Definition Classes
    IndexedSeqInstances
  25. implicit def indexedSeqMonoid[A]: Monoid[IndexedSeq[A]]
    Definition Classes
    IndexedSeqInstances
  26. implicit def indexedSeqOrder[A](implicit A0: Order[A]): Order[IndexedSeq[A]]
    Definition Classes
    IndexedSeqInstances
  27. implicit def indexedSeqShow[A](implicit arg0: Show[A]): Show[IndexedSeq[A]]
    Definition Classes
    IndexedSeqInstances
  28. final def initz[A](as: IxSq[A]): IxSq[IxSq[A]]

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

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

    Definition Classes
    IndexedSeqSubFunctions
  29. final def intersperse[A](as: IxSq[A], a: A): IxSq[A]

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

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

    Definition Classes
    IndexedSeqSubFunctions
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  32. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  33. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  34. final def notify(): Unit
    Definition Classes
    AnyRef
  35. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  36. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  37. final def powerset[A](as: IxSq[A]): IxSq[IxSq[A]]
    Definition Classes
    IndexedSeqSubFunctions
  38. 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.

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

    Definition Classes
    IndexedSeqSubFunctions
  39. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  40. final def tailz[A](as: IxSq[A]): IxSq[IxSq[A]]

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

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

    Definition Classes
    IndexedSeqSubFunctions
  41. 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.

    Definition Classes
    IndexedSeqSubFunctions
  42. 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.

    Definition Classes
    IndexedSeqSubFunctions
  43. final def toNel[A](as: IxSq[A]): Option[NonEmptyList[A]]
    Definition Classes
    IndexedSeqSubFunctions
  44. def toString(): String
    Definition Classes
    AnyRef → Any
  45. final def toZipper[A](as: IxSq[A]): Option[Zipper[A]]
    Definition Classes
    IndexedSeqSubFunctions
  46. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  47. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  48. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def zipperEnd[A](as: IxSq[A]): Option[Zipper[A]]
    Definition Classes
    IndexedSeqSubFunctions
  50. object indexedSeqSyntax extends ToIndexedSeqOps

Deprecated Value Members

  1. final def groupByM[A, M[_]](as: IxSq[A])(p: (A, A) ⇒ M[Boolean])(implicit arg0: Monad[M]): M[IxSq[IxSq[A]]]
    Definition Classes
    IndexedSeqSubFunctions
    Annotations
    @deprecated
    Deprecated

    (Since version 7.1) use groupWhenM

Inherited from IndexedSeqSubIndexedSeq

Inherited from IndexedSeqSubFunctions

Inherited from IndexedSeqSub

Inherited from IndexedSeqInstances

Inherited from IndexedSeqInstances0

Inherited from AnyRef

Inherited from Any

Ungrouped