Trait/Object

cats.laws.discipline

NonEmptyTraverseTests

Related Docs: object NonEmptyTraverseTests | package discipline

Permalink

trait NonEmptyTraverseTests[F[_]] extends TraverseTests[F] with ReducibleTests[F]

Linear Supertypes
ReducibleTests[F], TraverseTests[F], UnorderedTraverseTests[F], FoldableTests[F], UnorderedFoldableTests[F], FunctorTests[F], InvariantTests[F], Laws, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptyTraverseTests
  2. ReducibleTests
  3. TraverseTests
  4. UnorderedTraverseTests
  5. FoldableTests
  6. UnorderedFoldableTests
  7. FunctorTests
  8. InvariantTests
  9. Laws
  10. AnyRef
  11. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. class DefaultRuleSet extends RuleSet with HasOneParent

    Permalink
    Definition Classes
    Laws

  2. trait HasOneParent extends AnyRef

    Permalink
    Definition Classes
    Laws

  3. trait RuleSet extends AnyRef

    Permalink
    Definition Classes
    Laws

  4. class SimpleRuleSet extends DefaultRuleSet

    Permalink
    Definition Classes
    Laws

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 emptyRuleSet: RuleSet

    Permalink
    Definition Classes
    Laws

  7. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  8. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  9. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  10. def foldable[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], ArbFA: Arbitrary[F[A]], A: CommutativeMonoid[A], B: CommutativeMonoid[B], CogenA: Cogen[A], CogenB: Cogen[B], EqA: Eq[A], EqFA: Eq[F[A]], EqB: Eq[B], EqOptionB: Eq[Option[B]], EqOptionA: Eq[Option[A]]): RuleSet

    Permalink
    Definition Classes
    FoldableTests

  11. def functor[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    FunctorTests

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

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. def invariant[A, B, C](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], ArbFA: Arbitrary[F[A]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], EqFA: Eq[F[A]], EqFC: Eq[F[C]]): RuleSet

    Permalink
    Definition Classes
    InvariantTests

  15. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

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

    Permalink
    Definition Classes
    AnyRef

  17. def nonEmptyTraverse[G[_], A, B, C, M, X[_], Y[_]](implicit arg0: Applicative[G], arg1: Arbitrary[A], arg2: Arbitrary[B], arg3: Arbitrary[C], arg4: Arbitrary[M], ArbFA: Arbitrary[F[A]], ArbXB: Arbitrary[X[B]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], ArbFB: Arbitrary[F[B]], ArbFM: Arbitrary[F[M]], ArbXM: Arbitrary[X[M]], ArbYM: Arbitrary[Y[M]], ArbFGA: Arbitrary[F[G[A]]], ArbFXM: Arbitrary[F[X[M]]], ArbGB: Arbitrary[G[B]], ArbGM: Arbitrary[G[M]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenM: Cogen[M], M: CommutativeMonoid[M], MA: CommutativeMonoid[A], MB: CommutativeMonoid[B], CX: CommutativeApplicative[X], CY: CommutativeApplicative[Y], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqG: Eq[G[Unit]], EqM: Eq[M], EqA: Eq[A], EqB: Eq[B], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqXFM: Eq[X[F[M]]], EqYFB: Eq[Y[F[B]]], EqYFM: Eq[Y[F[M]]], EqOptionA: Eq[Option[A]]): RuleSet

    Permalink

  18. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  20. def reducible[G[_], A, B](implicit arg0: Applicative[G], arg1: Arbitrary[A], arg2: Arbitrary[B], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbFGA: Arbitrary[F[G[A]]], ArbGB: Arbitrary[G[B]], CogenA: Cogen[A], CogenB: Cogen[B], EqG: Eq[G[Unit]], EqA: Eq[A], EqB: Eq[B], EqFA: Eq[F[A]], EqOptionA: Eq[Option[A]], MonoidA: CommutativeMonoid[A], MonoidB: CommutativeMonoid[B]): RuleSet

    Permalink
    Definition Classes
    ReducibleTests

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

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. def traverse[A, B, C, M, X[_], Y[_]](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: Arbitrary[M], arg4: CommutativeApplicative[X], arg5: CommutativeApplicative[Y], ArbFA: Arbitrary[F[A]], ArbFB: Arbitrary[F[B]], ArbXB: Arbitrary[X[B]], ArbXM: Arbitrary[X[M]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], ArbYM: Arbitrary[Y[M]], ArbFXM: Arbitrary[F[X[M]]], CogenA: Cogen[A], CogenB: Cogen[B], CogenC: Cogen[C], CogenM: Cogen[M], M: CommutativeMonoid[M], MA: CommutativeMonoid[A], EqFA: Eq[F[A]], EqFC: Eq[F[C]], EqM: Eq[M], EqA: Eq[A], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]], EqXFM: Eq[X[F[M]]], EqYFM: Eq[Y[F[M]]], EqOptionA: Eq[Option[A]]): RuleSet

    Permalink
    Definition Classes
    TraverseTests

  24. def unorderedFoldable[A, B](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], ArbFA: Arbitrary[F[A]], ArbF: Arbitrary[(A) ⇒ B], CogenA: Cogen[A], A: CommutativeMonoid[A], B: CommutativeMonoid[B], EqFA: Eq[A], EqFB: Eq[B]): RuleSet

    Permalink
    Definition Classes
    UnorderedFoldableTests

  25. def unorderedTraverse[A, B, C, X[_], Y[_]](implicit arg0: Arbitrary[A], arg1: Arbitrary[B], arg2: Arbitrary[C], arg3: CommutativeApplicative[X], arg4: CommutativeApplicative[Y], ArbFA: Arbitrary[F[A]], ArbFXB: Arbitrary[F[X[B]]], ArbXB: Arbitrary[X[B]], ArbYB: Arbitrary[Y[B]], ArbYC: Arbitrary[Y[C]], CogenA: Cogen[A], CogenB: Cogen[B], Ca: CommutativeMonoid[A], Cb: CommutativeMonoid[B], EqA: Eq[A], EqB: Eq[B], EqXYFC: Eq[X[Y[F[C]]]], EqXFB: Eq[X[F[B]]], EqYFB: Eq[Y[F[B]]]): RuleSet

    Permalink
    Definition Classes
    UnorderedTraverseTests

  26. final def wait(): Unit

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

  27. final def wait(arg0: Long, arg1: Int): Unit

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

  28. final def wait(arg0: Long): Unit

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

Inherited from ReducibleTests[F]

Inherited from TraverseTests[F]

Inherited from UnorderedTraverseTests[F]

Inherited from FoldableTests[F]

Inherited from UnorderedFoldableTests[F]

Inherited from FunctorTests[F]

Inherited from InvariantTests[F]

Inherited from Laws

Inherited from AnyRef

Inherited from Any

Ungrouped