IndexedStoreT

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

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

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def bimap[X, Y](f: (I) ⇒ X)(g: (B) ⇒ Y)(implicit F: Functor[F]): IndexedStoreT[F, X, A, Y]

def bmap[X, Z >: I <: A](b: Bijection[Z, X])(implicit F: Functor[F]): StoreT[F, X, B]

def canEqual(arg0: Any): Boolean

def clone(): AnyRef

def cobind[K, C](f: (IndexedStoreT[F, K, A, B]) ⇒ C)(implicit F: Cobind[F]): IndexedStoreT[F, I, K, C]

def contramap[X](g: (X) ⇒ A)(implicit F: Functor[F]): IndexedStoreT[F, I, X, B]

def copoint(implicit F: Comonad[F], ev: <:<[I, A]): B

def duplicate[J](implicit F: Comonad[F]): IndexedStoreT[F, I, J, IndexedStoreT[F, J, A, B]]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def experiment[G[_]](f: (I) ⇒ G[A])(implicit F: Comonad[F], G: Functor[G]): G[B]

def finalize(): Unit

final def getClass(): java.lang.Class[_]

def hashCode(): Int

def imap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]

final def isInstanceOf[T0]: Boolean

def leftMap[X](f: (I) ⇒ X): IndexedStoreT[F, X, A, B]

def map[C](f: (B) ⇒ C)(implicit ftr: Functor[F]): IndexedStoreT[F, I, A, C]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def peek(a: A)(implicit F: Comonad[F]): B

def peeks(f: (I) ⇒ A)(implicit F: Comonad[F]): B

def pos: I

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

def productArity: Int

def productElement(arg0: Int): Any

def productIterator: Iterator[Any]

def productPrefix: String

def put(a: A)(implicit F: Functor[F]): F[B]

def puts(f: (I) ⇒ A)(implicit F: Functor[F]): F[B]

val run: (F[(A) ⇒ B], I)

def seek[J](j: J): IndexedStoreT[F, J, A, B]

def seeks[J](f: (I) ⇒ J): IndexedStoreT[F, J, A, B]

def set: F[(A) ⇒ B]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def xmap[X1, X2](f: (I) ⇒ X1)(g: (X2) ⇒ A)(implicit F: Functor[F]): IndexedStoreT[F, X1, X2, B]

def productElements: Iterator[Any]