TraverseFilterLaws

implicit abstract def F: TraverseFilter[F]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def covariantComposition[A, B, C](fa: F[A], f: (A) ⇒ B, g: (B) ⇒ C): IsEq[F[C]]

def covariantIdentity[A](fa: F[A]): IsEq[F[A]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def existsConsistentWithFind[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

def existsLazy[A](fa: F[A]): Boolean

def finalize(): Unit

def foldMapDerived[A, B](fa: F[A], f: (A) ⇒ B)(implicit B: Monoid[B]): IsEq[B]

def forallConsistentWithExists[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

def forallEmpty[A](fa: F[A], p: (A) ⇒ Boolean): Boolean

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

def forallLazy[A](fa: F[A]): Boolean

final def getClass(): Class[_]

def hashCode(): Int

def invariantComposition[A, B, C](fa: F[A], f1: (A) ⇒ B, f2: (B) ⇒ A, g1: (B) ⇒ C, g2: (C) ⇒ B): IsEq[F[C]]

def invariantIdentity[A](fa: F[A]): IsEq[F[A]]

final def isInstanceOf[T0]: Boolean

def leftFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

def mapFilterComposition[A, B, C](fa: F[A], f: (A) ⇒ Option[B], g: (B) ⇒ Option[C]): IsEq[F[C]]

def mapFilterMapConsistency[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

Combined with the functor identity law, this implies a mapFilter identity law (when f is the identity function).

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def rightFoldConsistentWithFoldMap[A, B](fa: F[A], f: (A) ⇒ B)(implicit M: Monoid[B]): IsEq[B]

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

def toString(): String

def traverseFilterComposition[A, B, C, M[_], N[_]](fa: F[A], f: (A) ⇒ M[Option[B]], g: (B) ⇒ N[Option[C]])(implicit M: Applicative[M], N: Applicative[N]): IsEq[Nested[M, N, F[C]]]

def traverseFilterIdentity[G[_], A](fa: F[A])(implicit arg0: Applicative[G]): IsEq[G[F[A]]]

def traverseIdentity[A, B](fa: F[A], f: (A) ⇒ B): IsEq[F[B]]

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

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

final def wait(): Unit

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

final def wait(arg0: Long): Unit