final case class UnwriterT[F[_], U, A](run: F[(U, A)]) extends Product with Serializable
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
or Semigroup
required. There is no point
operation.
You can switch between WriterT
and UnwriterT
with unary_+
and unary_-
.
- Self Type
- UnwriterT[F, U, A]
- Source
- UnwriterT.scala
- Alphabetic
- By Inheritance
- UnwriterT
- Serializable
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new UnwriterT(run: F[(U, A)])
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def ap[B](f: ⇒ UnwriterT[F, U, (A) ⇒ B])(implicit F: Apply[F]): UnwriterT[F, U, B]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
- 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
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def colocal[X](f: (U) ⇒ X)(implicit F: Functor[F]): UnwriterT[F, X, A]
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
- def flatMap[B](f: (A) ⇒ UnwriterT[F, U, B])(implicit F: Bind[F]): UnwriterT[F, U, B]
- def foldRight[B](z: ⇒ B)(f: (A, ⇒ B) ⇒ B)(implicit F: Foldable[F]): B
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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 mapT[G[_], V, B](f: (F[(U, A)]) ⇒ G[(V, B)]): UnwriterT[G, V, 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
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- def on: WriterT[F, U, A]
- val run: F[(U, A)]
- def swap(implicit F: Functor[F]): UnwriterT[F, A, U]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- 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]
alias for
on
- def unwritten(implicit F: Functor[F]): F[U]
- def value(implicit F: Functor[F]): F[A]
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
- def wpoint[G[_]](implicit F: Functor[F], P: Applicative[G]): UnwriterT[F, G[U], A]