< Back

Packages

package root
Definition Classes
root
package cats
The cats root package contains all the trait signatures of most Scala type classes.
The cats root package contains all the trait signatures of most Scala type classes.
Cats type classes are implemented using the approach from the Type classes as objects and implicits article.
For each type class, cats provides three pieces: - Its signature: a trait that is polymorphic on a type parameter. Type class traits inherit from other type classes to indicate that any implementation of the lower type class (e.g. Applicative) can also serve as an instance for the higuer type class (e.g. Functor). - Type class 'instances, which are classes and objects that implement one or more type class signatures for some specific types. Type class instances for several data types from the Java or Scala standard libraries are declared in the subpackage cats.instances. - Syntax extensions, each of which provides the methods of the type class defines as extension methods (which in Scala 2 are encoded as implicit classes) for values of any type F; given that an instance of the type class for the receiver type (this) is in the implicit scope. Symtax extensions are declared in the cats.syntax package. - A set of laws, that are also generic on the type of the class, and are only defined on the operations of the type class. The purpose of these laws is to declare some algebraic relations (equations) between Scala expressions involving the operations of the type class, and test (but not verify) that implemented instances satisfy those equations. Laws are defined in the cats-laws package.
Although most of cats type classes are declared in this package, some are declared in other packages: - type classes that operate on base types (kind *), and their implementations for standard library types, are contained in cats.kernel, which is a different SBT project. However, they are re-exported from this package. - type classes of kind F[_, _], such as cats.arrow.Profunctor" or cats.arrow.Arrow, which are relevant for Functional Reactive Programming or optics, are declared in the cats.arrow package. - Also, those type classes that abstract over (pure or impure) functional runtime effects are declared in the cats-effect library. - Some type classes for which no laws can be provided are left out of the main road, in a small and dirty alley. These are the alleycats.
Definition Classes
root
package data
Definition Classes
cats
AndThen
AppFunc
Binested
BinestedBifoldable
BinestedBitraverse
BinestedInstances
Chain
Cokleisli
Const
Cont
ContT
EitherK
EitherT
Func
IdT
IndexedReaderWriterStateT
IndexedState
IndexedStateT
Ior
IorT
Kleisli
KleisliFromFunctionPartiallyApplied
Nested
NonEmptyChainImpl
NonEmptyChainOps
NonEmptyLazyList
NonEmptyLazyListOps
NonEmptyList
NonEmptyMapImpl
NonEmptyMapOps
NonEmptySeq
NonEmptySetImpl
NonEmptySetOps
NonEmptyVector
OneAnd
Op
OptionT
Reader
ReaderWriterState
ReaderWriterStateT
RepresentableStore
RepresentableStoreT
RepresentableStoreTInstances1
RepresentableStoreTInstances2
State
StateT
Store
StoreT
Tuple2K
Validated
Writer
WriterT
ZipLazyList
ZipList
ZipSeq
ZipStream
ZipVector

IdT

Companion object IdT

final case class IdT[F[_], A](value: F[A]) extends Product with Serializable

IdT[F[_], A] is the identity monad transformer.

Source: IdT.scala

Linear Supertypes

Serializable, Product, Equals, AnyRef, Any

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

IdT
Serializable
Product
Equals
AnyRef
Any

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new IdT(value: F[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: IdT[F, (A) => B])(implicit F: Apply[F]): IdT[F, B]
final def asInstanceOf[T0]: T0
Definition Classes
Any
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native()
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable])
def flatMap[B](f: (A) => IdT[F, B])(implicit F: FlatMap[F]): IdT[F, B]
def flatMapF[B](f: (A) => F[B])(implicit F: FlatMap[F]): IdT[F, B]
def foldLeft[B](b: B)(f: (B, A) => B)(implicit F: Foldable[F]): B
def foldRight[B](lb: Eval[B])(f: (A, Eval[B]) => Eval[B])(implicit F: Foldable[F]): Eval[B]
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native()
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def map[B](f: (A) => B)(implicit F: Functor[F]): IdT[F, B]
def mapK[G[_]](f: ~>[F, G]): IdT[G, A]
Modify the context F using transformation f.
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def nonEmptyTraverse[G[_], B](f: (A) => G[B])(implicit F: NonEmptyTraverse[F], G: Apply[G]): G[IdT[F, B]]
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native()
def productElementNames: Iterator[String]
Definition Classes
Product
def reduceLeftTo[B](f: (A) => B)(g: (B, A) => B)(implicit F: Reducible[F]): B
def reduceRightTo[B](f: (A) => B)(g: (A, Eval[B]) => Eval[B])(implicit F: Reducible[F]): Eval[B]
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
def traverse[G[_], B](f: (A) => G[B])(implicit F: Traverse[F], G: Applicative[G]): G[IdT[F, B]]
val value: F[A]
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped