Packages

sealed trait IndexedStoreT[F[+_], +I, -A, +B] extends AnyRef

Source
StoreT.scala
See also

scalaz.Lens

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IndexedStoreT
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def run: (F[(A) ⇒ B], I)

Concrete 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: BijectionT.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 equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  15. def experiment[G[+_]](f: (I) ⇒ G[A])(implicit F: Comonad[F], G: Functor[G]): G[B]
  16. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  17. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  18. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  19. def imap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]
  20. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  21. def leftMap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]
  22. def map[C](f: (B) ⇒ C)(implicit ftr: Functor[F]): IndexedStoreT[F, I, A, C]
  23. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  24. final def notify(): Unit
    Definition Classes
    AnyRef
  25. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  26. def peek(a: A)(implicit F: Comonad[F]): B
  27. def peeks(f: (I) ⇒ A)(implicit F: Comonad[F]): B
  28. def pos: I
  29. 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

  30. def put(a: A)(implicit F: Functor[F]): F[B]
  31. def puts(f: (I) ⇒ A)(implicit F: Functor[F]): F[B]
  32. def seek[J](j: J): IndexedStoreT[F, J, A, B]
  33. def seeks[J](f: (I) ⇒ J): IndexedStoreT[F, J, A, B]
  34. def set: F[(A) ⇒ B]
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    AnyRef → Any
  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 AnyRef

Inherited from Any

Ungrouped