Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
apply[F[_], K, V](implicit K: Kvs[F, K, V]): Kvs[F, K, V]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
implicit
def
eitherTKvs[K, V, E, F[_]](implicit arg0: Monad[F], arg1: Kvs[F, K, V]): Kvs[[γ$7$]EitherT[F, E, γ$7$], K, V]
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
forTrans[F[_], K, V, T[_[_], _]](implicit arg0: Monad[F], arg1: MonadTrans[T], K: Kvs[F, K, V]): Kvs[[β$0$]T[F, β$0$], K, V]
-
implicit
def
freeKvs[K, V, F[_], S[_]](implicit F: Kvs[F, K, V], I: :<:[F, S]): Kvs[[β$4$]Free[S, β$4$], K, V]
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
implicit
def
keyValueStoreKvs[K, V]: Kvs[[γ$2$]KeyValueStore[K, V, γ$2$], K, V]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
implicit
def
readerTKvs[K, V, R, F[_]](implicit arg0: Monad[F], arg1: Kvs[F, K, V]): Kvs[[γ$11$]Kleisli[F, R, γ$11$], K, V]
-
implicit
def
stateTKvs[K, V, S, F[_]](implicit arg0: Monad[F], arg1: Kvs[F, K, V]): Kvs[[γ$15$]IndexedStateT[F, S, S, γ$15$], K, V]
-
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
-
implicit
def
writerTKvs[K, V, W, F[_]](implicit arg0: Monoid[W], arg1: Monad[F], arg2: Kvs[F, K, V]): Kvs[[γ$19$]WriterT[F, W, γ$19$], K, V]
Inherited from AnyRef
Inherited from Any
