Packages

final case class IndexedStoreT[F[_], +I, A, B](run: (F[(A) ⇒ B], I)) extends Product with Serializable

Source
StoreT.scala
See also

scalaz.Lens

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedStoreT
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new IndexedStoreT(run: (F[(A) ⇒ B], I))

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def ***[J, C, D](that: IndexedStoreT[F, J, C, D])(implicit M: Bind[F]): IndexedStoreT[F, (I, J), (A, C), (B, D)]

    alias for product

  4. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  6. def bimap[X, Y](f: (I) ⇒ X)(g: (B) ⇒ Y)(implicit F: Functor[F]): IndexedStoreT[F, X, A, Y]
  7. def bmap[X, Z >: I <: A](b: Bijection[Z, X])(implicit F: Functor[F]): StoreT[F, X, B]
  8. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  9. def cobind[K, C](f: (IndexedStoreT[F, K, A, B]) ⇒ C)(implicit F: Cobind[F]): IndexedStoreT[F, I, K, C]
  10. def contramap[X](g: (X) ⇒ A)(implicit F: Functor[F]): IndexedStoreT[F, I, X, B]
  11. def copoint(implicit F: Comonad[F], ev: <:<[I, A]): B
  12. def duplicate[J](implicit F: Comonad[F]): IndexedStoreT[F, I, J, IndexedStoreT[F, J, A, B]]
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def experiment[G[_]](f: (I) ⇒ G[A])(implicit F: Comonad[F], G: Functor[G]): G[B]
  15. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  16. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  17. def imap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. def leftMap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]
  20. def map[C](f: (B) ⇒ C)(implicit ftr: Functor[F]): IndexedStoreT[F, I, A, C]
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  24. def peek(a: A)(implicit F: Comonad[F]): B
  25. def peeks(f: (I) ⇒ A)(implicit F: Comonad[F]): B
  26. def pos: I
  27. def product[J, C, D](that: IndexedStoreT[F, J, C, D])(implicit M: Bind[F]): IndexedStoreT[F, (I, J), (A, C), (B, D)]

    Two disjoint lenses can be paired

  28. def put(a: A)(implicit F: Functor[F]): F[B]
  29. def putf[G[_]](a: G[A])(implicit F: Functor[F], G: Functor[G]): G[F[B]]
  30. def puts(f: (I) ⇒ A)(implicit F: Functor[F]): F[B]
  31. def putsf[G[_]](f: (I) ⇒ G[A])(implicit F: Functor[F], G: Functor[G]): G[F[B]]
  32. val run: (F[(A) ⇒ B], I)
  33. def seek[J](j: J): IndexedStoreT[F, J, A, B]
  34. def seeks[J](f: (I) ⇒ J): IndexedStoreT[F, J, A, B]
  35. def set: F[(A) ⇒ B]
  36. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. def xmap[X1, X2](f: (I) ⇒ X1)(g: (X2) ⇒ A)(implicit F: Functor[F]): IndexedStoreT[F, X1, X2, B]

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped