sealed
trait
UnwriterT[F[+_], +U, +A] extends AnyRef
Abstract Value Members
-
abstract
val
run: F[(U, A)]
Concrete Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
ap[B, UU >: U](f: ⇒ UnwriterT[F, UU, (A) ⇒ B])(implicit F: Apply[F]): UnwriterT[F, UU, B]
-
final
def
asInstanceOf[T0]: T0
-
def
bimap[C, D](f: (U) ⇒ C, g: (A) ⇒ D)(implicit F: Functor[F]): UnwriterT[F, C, D]
-
def
bitraverse[G[_], C, D](f: (U) ⇒ G[C], g: (A) ⇒ G[D])(implicit G: Applicative[G], F: Traverse[F]): G[UnwriterT[F, C, D]]
-
def
clone(): AnyRef
-
def
colocal[X](f: (U) ⇒ X)(implicit F: Functor[F]): UnwriterT[F, X, A]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
flatMap[B, UU >: U](f: (A) ⇒ UnwriterT[F, UU, B])(implicit F: Bind[F]): UnwriterT[F, UU, B]
-
def
foldRight[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B)(implicit F: Foldable[F]): B
-
def
foreach[B](f: (A) ⇒ Unit)(implicit E: Each[F]): Unit
-
final
def
getClass(): java.lang.Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
leftMap[C](f: (U) ⇒ C)(implicit F: Functor[F]): UnwriterT[F, C, A]
-
def
map[B](f: (A) ⇒ B)(implicit F: Functor[F]): UnwriterT[F, U, B]
-
def
mapUnwritten[X](f: (U) ⇒ X)(implicit F: Functor[F]): UnwriterT[F, X, A]
-
def
mapValue[X, B](f: ((U, A)) ⇒ (X, B))(implicit F: Functor[F]): UnwriterT[F, X, B]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
on: WriterT[F, U, A]
-
def
swap(implicit F: Functor[F]): UnwriterT[F, A, U]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
traverse[G[+_], B](f: (A) ⇒ G[B])(implicit G: Applicative[G], F: Traverse[F]): G[UnwriterT[F, U, B]]
-
def
unary_+: WriterT[F, U, A]
-
def
unwritten(implicit F: Functor[F]): F[U]
-
def
value(implicit F: Functor[F]): F[A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
wpoint[G[+_]](implicit F: Functor[F], P: Applicative[G]): UnwriterT[F, G[U], A]
Inherited from AnyRef
Inherited from Any
This data type is isomorphic to
WriterT
, however, it is NOT a monad.It implements flatMap+map and drops the write value. There is no
Monoid
orSemigroup
required. There is nopoint
operation. You can switch betweenWriterT
andUnwriterT
withunary_+
andunary_-
.