Trait/Object

cats.laws

TraverseLaws

Related Docs: object TraverseLaws | package laws

Permalink

trait TraverseLaws[F[_]] extends FunctorLaws[F] with FoldableLaws[F]

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. TraverseLaws
  2. FoldableLaws
  3. FunctorLaws
  4. InvariantLaws
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Traverse[F]

    Permalink
    Definition Classes
    TraverseLawsFoldableLawsFunctorLawsInvariantLaws

Concrete 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 ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]

    Permalink
    Definition Classes
    FunctorLaws
  7. def covariantIdentity[A](fa: F[A]): IsEq[F[A]]

    Permalink
    Definition Classes
    FunctorLaws
  8. final def eq(arg0: AnyRef): Boolean

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

    Permalink
    Definition Classes
    AnyRef → Any
  10. def existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    FoldableLaws
  11. def existsLazy[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    FoldableLaws
  12. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  13. def foldMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Monoid[B]): IsEq[B]

    Permalink
  14. def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

    Permalink
    Definition Classes
    FoldableLaws
  15. def forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

    Permalink

    If F[A] is empty, forall must return true.

    If F[A] is empty, forall must return true.

    Definition Classes
    FoldableLaws
  16. def forallLazy[A](fa: F[A]): Boolean

    Permalink
    Definition Classes
    FoldableLaws
  17. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  19. def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]

    Permalink
    Definition Classes
    InvariantLaws
  20. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]

    Permalink
    Definition Classes
    InvariantLaws
  21. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  22. def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

    Permalink
    Definition Classes
    FoldableLaws
  23. final def ne(arg0: AnyRef): Boolean

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

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

    Permalink
    Definition Classes
    AnyRef
  26. def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

    Permalink
    Definition Classes
    FoldableLaws
  27. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  28. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  29. def traverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

    Permalink
  30. def traverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: Applicative[N], M: Applicative[M]): IsEq[(M[F[B]], N[F[B]])]

    Permalink
  31. def traverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: Applicative[N], M: Applicative[M]): IsEq[M[N[F[C]]]]

    Permalink
  32. final def wait(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from FoldableLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped