Closed anatoliykmetyuk closed 7 years ago
δ + x != x + δ. This is because:
δ + x != x + δ
F[A <: Tree]
Hence, it can be a better idea to move the Choice logic from resumption to run/runM. The resumption then will return a List[F[Tree]].
run
runM
List[F[Tree]]
This is not a problem outside of the test cases. The test cases make their suspension functors succeed immediately, so the decision can be made based on the order.
δ + x != x + δ
. This is because:F[A <: Tree]
, there is no way of knowing the result of that functor until running it with a Comonad.Hence, it can be a better idea to move the Choice logic from resumption to
run
/runM
. The resumption then will return aList[F[Tree]]
.