trait NonEmptyTraverseLaws[F[_]] extends TraverseLaws[F] with ReducibleLaws[F]

Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NonEmptyTraverseLaws
  2. ReducibleLaws
  3. TraverseLaws
  4. UnorderedTraverseLaws
  5. FoldableLaws
  6. UnorderedFoldableLaws
  7. FunctorLaws
  8. InvariantLaws
  9. AnyRef
  10. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: NonEmptyTraverse[F]
    Definition Classes
    NonEmptyTraverseLaws → ReducibleLaws → TraverseLaws → UnorderedTraverseLaws → FoldableLaws → UnorderedFoldableLaws → FunctorLaws → InvariantLaws

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  5. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  6. def collectFirstSome_Ref[A, B](fa: F[A], f: (A) ⇒ Option[B]): IsEq[Option[B]]
    Definition Classes
    FoldableLaws
  7. def collectFirst_Ref[A, B](fa: F[A], pf: PartialFunction[A, B]): IsEq[Option[B]]
    Definition Classes
    FoldableLaws
  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. def dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  11. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  12. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  13. def existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
    Definition Classes
    FoldableLaws
  14. def existsLazy[A](fa: F[A]): Boolean
    Definition Classes
    UnorderedFoldableLaws
  15. def filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  16. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. def foldMIdentity[A, B](fa: F[A], b: B, f: (B, A) ⇒ B): IsEq[B]

    Monadic folding with identity monad is analogous to foldLeft.

    Monadic folding with identity monad is analogous to foldLeft.

    Definition Classes
    FoldableLaws
  18. def foldMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Monoid[B]): IsEq[B]
    Definition Classes
    TraverseLaws
  19. def foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]
    Definition Classes
    FoldableLaws
  20. def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
    Definition Classes
    UnorderedFoldableLaws
  21. 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
    UnorderedFoldableLaws
  22. def forallLazy[A](fa: F[A]): Boolean
    Definition Classes
    UnorderedFoldableLaws
  23. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  24. def getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]
    Definition Classes
    FoldableLaws
  25. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  26. 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
  27. def invariantIdentity[A](fa: F[A]): IsEq[F[A]]
    Definition Classes
    InvariantLaws
  28. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  29. def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
    Definition Classes
    FoldableLaws
  30. def mapWithIndexRef[A, B](fa: F[A], f: (A, Int) ⇒ B): IsEq[F[B]]
    Definition Classes
    TraverseLaws
  31. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  32. def nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
    Definition Classes
    UnorderedFoldableLaws
  33. def nonEmptyTraverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
  34. def nonEmptyTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: Apply[N], M: Apply[M]): IsEq[(M[F[B]], N[F[B]])]
  35. def nonEmptyTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: Apply[N], M: Apply[M]): IsEq[Nested[M, N, F[C]]]
  36. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  37. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  38. def orderedConsistency[A](x: F[A], y: F[A])(implicit arg0: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  39. def reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

    reduceLeftOption consistent with reduceLeftToOption

    reduceLeftOption consistent with reduceLeftToOption

    Definition Classes
    FoldableLaws
  40. def reduceLeftToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
    Definition Classes
    ReducibleLaws
  41. def reduceMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
  42. def reduceReduceLeftConsistent[B](fa: F[B])(implicit B: Semigroup[B]): IsEq[B]
    Definition Classes
    ReducibleLaws
  43. def reduceRightConsistentWithReduceRightOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
    Definition Classes
    ReducibleLaws
  44. def reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

    reduceRightOption consistent with reduceRightToOption

    reduceRightOption consistent with reduceRightToOption

    Definition Classes
    FoldableLaws
  45. def reduceRightToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
    Definition Classes
    ReducibleLaws
  46. def reduceRightToConsistentWithReduceRightToOption[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[Option[B]]
    Definition Classes
    ReducibleLaws
  47. def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
    Definition Classes
    FoldableLaws
  48. def sequenceConsistent[G[_], A](fa: F[G[A]])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
    Definition Classes
    ReducibleLaws
  49. def sizeConsistent[A](fa: F[A]): IsEq[Long]
    Definition Classes
    ReducibleLaws
  50. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  51. def takeWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  52. def toListRef[A](fa: F[A]): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  53. def toString(): String
    Definition Classes
    AnyRef → Any
  54. def traverseConsistent[G[_], A, B](fa: F[A], f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
    Definition Classes
    ReducibleLaws
  55. def traverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]
    Definition Classes
    TraverseLaws
  56. def traverseOrderConsistent[A](fa: F[A]): IsEq[Option[A]]
    Definition Classes
    TraverseLaws
  57. 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]])]
    Definition Classes
    TraverseLaws
  58. 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[Nested[M, N, F[C]]]
    Definition Classes
    TraverseLaws
  59. def traverseWithIndexMRef[G[_], A, B](fa: F[A], f: (A, Int) ⇒ G[B])(implicit G: Monad[G]): IsEq[G[F[B]]]
    Definition Classes
    TraverseLaws
  60. def unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
    Definition Classes
    UnorderedFoldableLaws
  61. def unorderedSequenceConsistent[A, G[_]](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): IsEq[G[F[A]]]
    Definition Classes
    UnorderedTraverseLaws
  62. def unorderedTraverseIdentity[A, B](fa: F[A])(f: (A) ⇒ B)(implicit ev: Functor[F]): IsEq[F[B]]
    Definition Classes
    UnorderedTraverseLaws
  63. def unorderedTraverseParallelComposition[A, B, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (A) ⇒ N[B])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[(M[F[B]], N[F[B]])]
    Definition Classes
    UnorderedTraverseLaws
  64. def unorderedTraverseSequentialComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[B], g: (B) ⇒ N[C])(implicit N: CommutativeApplicative[N], M: CommutativeApplicative[M]): IsEq[Nested[M, N, F[C]]]
    Definition Classes
    UnorderedTraverseLaws
  65. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  66. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  67. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  68. def zipWithIndexRef[A, B](fa: F[A], f: ((A, Int)) ⇒ B): IsEq[F[B]]
    Definition Classes
    TraverseLaws

Inherited from ReducibleLaws[F]

Inherited from TraverseLaws[F]

Inherited from UnorderedTraverseLaws[F]

Inherited from FoldableLaws[F]

Inherited from UnorderedFoldableLaws[F]

Inherited from FunctorLaws[F]

Inherited from InvariantLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped