trait
TraverseFilterLaws[F[_]] extends FunctorFilterLaws[F]
Abstract Value Members
-
implicit abstract
def
F: TraverseFilter[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
collectConsistentWithMapFilter[A, B](fa: F[A], f: PartialFunction[A, B]): IsEq[F[B]]
-
-
-
def
filterAConsistentWithTraverseFilter[G[_], A](fa: F[A], f: (A) ⇒ G[Boolean])(implicit arg0: Applicative[G]): IsEq[G[F[A]]]
-
def
filterConsistentWithMapFilter[A](fa: F[A], f: (A) ⇒ Boolean): IsEq[F[A]]
-
def
finalize(): Unit
-
def
flattenOptionConsistentWithMapFilter[A](fa: F[Option[A]]): IsEq[F[A]]
-
implicit
def
functor: Functor[F]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
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]]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
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
traverseFilterConsistentWithTraverse[G[_], A](fa: F[A], f: (A) ⇒ G[A])(implicit arg0: Applicative[G]): IsEq[G[F[A]]]
-
def
traverseFilterIdentity[G[_], A](fa: F[A])(implicit arg0: Applicative[G]): IsEq[G[F[A]]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
