final
class
STM[F[+_], +A] extends AnyRef
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
*>[B](that: ⇒ STM[F, B]): STM[F, B]
-
final
def
<*[B](that: ⇒ STM[F, B]): STM[F, A]
-
final
def
<*>[B](that: ⇒ STM[F, B]): STM[F, (A, B)]
-
final
def
==(arg0: Any): Boolean
-
final
def
>>=[B](f: (A) ⇒ STM[F, B]): STM[F, B]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
collect[B](pf: PartialFunction[A, B]): STM[F, B]
-
final
def
commit(implicit R: Runtime[Any], A: Async[F]): F[A]
-
final
def
const[B](b: ⇒ B): STM[F, B]
-
final
def
either: STM[F, Either[Throwable, A]]
-
-
-
final
def
filter(f: (A) ⇒ Boolean): STM[F, A]
-
def
finalize(): Unit
-
final
def
flatMap[B](f: (A) ⇒ STM[F, B]): STM[F, B]
-
final
def
flatten[B](implicit ev: <:<[A, STM[F, B]]): STM[F, B]
-
final
def
fold[B](f: (Throwable) ⇒ B, g: (A) ⇒ B): STM[F, B]
-
final
def
foldM[B](f: (Throwable) ⇒ STM[F, B], g: (A) ⇒ STM[F, B]): STM[F, B]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
map[B](f: (A) ⇒ B): STM[F, B]
-
final
def
mapError[E1 <: Throwable](f: (Throwable) ⇒ E1): STM[F, A]
-
final
def
mapK[G[+_]]: STM[G, A]
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
final
def
option: STM[F, Option[A]]
-
final
def
orElse[A1 >: A](that: ⇒ STM[F, A1]): STM[F, A1]
-
final
def
orElseEither[B](that: ⇒ STM[F, B]): STM[F, Either[A, B]]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
unit: STM[F, Unit]
-
final
def
void: STM[F, Unit]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
final
def
withFilter(f: (A) ⇒ Boolean): STM[F, A]
-
final
def
zip[B](that: ⇒ STM[F, B]): STM[F, (A, B)]
-
final
def
zipLeft[B](that: ⇒ STM[F, B]): STM[F, A]
-
final
def
zipRight[B](that: ⇒ STM[F, B]): STM[F, B]
-
final
def
zipWith[B, C](that: ⇒ STM[F, B])(f: (A, B) ⇒ C): STM[F, C]
See zio.stm.STM