cats.laws

TraverseLaws

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
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Traverse[F]

    Definition Classes
    TraverseLawsFoldableLawsFunctorLawsInvariantLaws

Concrete Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  7. def clone(): AnyRef

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

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

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

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

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

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

    Definition Classes
    FoldableLaws
  14. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

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

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

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

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

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

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

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

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

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

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

    Definition Classes
    FoldableLaws
  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. def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

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

    Definition Classes
    AnyRef
  29. def toString(): String

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

  31. 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]])]

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

  33. final def wait(): Unit

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

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from FoldableLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped