abstract
class
MonadAsyncLaw[F[_]] extends MonadSuspendLaw[F]
Instance Constructors
-
new
MonadAsyncLaw(ma: MonadAsync[F])(implicit arg0: Monad[F], arg1: Catchable[F])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
asyncIsDelay[A](a: () ⇒ A)(implicit FEA: Equal[F[A]]): Boolean
-
def
clone(): AnyRef
-
def
delayIsMap[A](a: () ⇒ A)(implicit FEA: Equal[F[A]]): Boolean
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
implicit
val
impMA: MonadAsync[F]
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
nowIsPoint[A](a: A)(implicit FEA: Equal[F[A]]): Boolean
-
implicit
val
pool: SameThreadExecutor.type
-
def
suspendIsDelayJoin[A](fa: F[A])(implicit FEA: Equal[F[A]]): Boolean
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Some laws any MonadAsync implementation should obey. TODO include nondeterminism