trait ReducibleLaws[F[_]] extends FoldableLaws[F]

Linear Supertypes
FoldableLaws[F], UnorderedFoldableLaws[F], AnyRef, Any
Known Subclasses
NonEmptyTraverseLaws
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ReducibleLaws
  2. FoldableLaws
  3. UnorderedFoldableLaws
  4. AnyRef
  5. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. implicit abstract def F: Reducible[F]
    Definition Classes
    ReducibleLaws → FoldableLaws → UnorderedFoldableLaws

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 dropWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  9. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  11. def existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
    Definition Classes
    FoldableLaws
  12. def existsLazy[A](fa: F[A]): Boolean
    Definition Classes
    UnorderedFoldableLaws
  13. def filter_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  14. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  15. 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
  16. def foldRef[A](fa: F[A])(implicit A: Monoid[A]): IsEq[A]
    Definition Classes
    FoldableLaws
  17. def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
    Definition Classes
    UnorderedFoldableLaws
  18. 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
  19. def forallLazy[A](fa: F[A]): Boolean
    Definition Classes
    UnorderedFoldableLaws
  20. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  21. def getRef[A](fa: F[A], idx: Long): IsEq[Option[A]]
    Definition Classes
    FoldableLaws
  22. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
    Definition Classes
    FoldableLaws
  25. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  26. def nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
    Definition Classes
    UnorderedFoldableLaws
  27. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  28. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  29. def orderedConsistency[A](x: F[A], y: F[A])(implicit arg0: Eq[A], ev: Eq[F[A]]): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  30. def reduceLeftOptionConsistentWithReduceLeftToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

    reduceLeftOption consistent with reduceLeftToOption

    reduceLeftOption consistent with reduceLeftToOption

    Definition Classes
    FoldableLaws
  31. def reduceLeftToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
  32. def reduceReduceLeftConsistent[B](fa: F[B])(implicit B: Semigroup[B]): IsEq[B]
  33. def reduceRightConsistentWithReduceRightOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]
  34. def reduceRightOptionConsistentWithReduceRightToOption[A](fa: F[A], f: (A, A) ⇒ A): IsEq[Option[A]]

    reduceRightOption consistent with reduceRightToOption

    reduceRightOption consistent with reduceRightToOption

    Definition Classes
    FoldableLaws
  35. def reduceRightToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
  36. def reduceRightToConsistentWithReduceRightToOption[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[Option[B]]
  37. def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
    Definition Classes
    FoldableLaws
  38. def sequenceConsistent[G[_], A](fa: F[G[A]])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
  39. def sizeConsistent[A](fa: F[A]): IsEq[Long]
  40. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  41. def takeWhile_Ref[A](fa: F[A], p: (A) ⇒ Boolean): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  42. def toListRef[A](fa: F[A]): IsEq[List[A]]
    Definition Classes
    FoldableLaws
  43. def toString(): String
    Definition Classes
    AnyRef → Any
  44. def traverseConsistent[G[_], A, B](fa: F[A], f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
  45. def unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
    Definition Classes
    UnorderedFoldableLaws
  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
    @native() @throws( ... )

Inherited from FoldableLaws[F]

Inherited from UnorderedFoldableLaws[F]

Inherited from AnyRef

Inherited from Any

Ungrouped