trait
UnorderedTraverseLaws[F[_]] extends UnorderedFoldableLaws[F]
Abstract Value Members
-
implicit abstract
def
F: UnorderedTraverse[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
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
nonEmptyRef[A](fa: F[A]): IsEq[Boolean]
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
unorderedFoldConsistentWithUnorderedFoldMap[A](fa: F[A])(implicit arg0: CommutativeMonoid[A]): IsEq[A]
-
def
unorderedSequenceConsistent[A, G[_]](fga: F[G[A]])(implicit arg0: CommutativeApplicative[G]): IsEq[G[F[A]]]
-
def
unorderedTraverseIdentity[A, B](fa: F[A])(f: (A) ⇒ B)(implicit ev: Functor[F]): IsEq[F[B]]
-
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]])]
-
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]]]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit