trait
ReducibleLaws[F[_]] extends FoldableLaws[F]
Abstract Value Members
-
implicit abstract
def
F: Reducible[F]
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
-
def
existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
existsLazy[A](fa: F[A]): Boolean
-
def
finalize(): Unit
-
def
forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean
-
def
forallLazy[A](fa: F[A]): Boolean
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reduceLeftToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
-
def
reduceRightToConsistentWithReduceMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Semigroup[B]): IsEq[B]
-
def
rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]
-
def
sequenceConsistent[G[_], A](fa: F[G[A]])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverseConsistent[G[_], A, B](fa: F[A], f: (A) ⇒ G[B])(implicit arg0: Applicative[G]): IsEq[G[Unit]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit