Object

quasar.effect.KeyValueStore

impl

Related Doc: package KeyValueStore

Permalink

object impl

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

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  6. def default[K, V]: Task[~>[[γ$4$]KeyValueStore[K, V, γ$4$], Task]]

    Permalink

    The default implementation of an in-memory KeyValueStore.

    The default implementation of an in-memory KeyValueStore. Uses a scala.collection.concurrent.TrieMap as the underlying implementation

  7. def defaultWith[K, V](initialState: slamdata.Predef.Map[K, V]): Task[~>[[γ$5$]KeyValueStore[K, V, γ$5$], Task]]

    Permalink

    The default implementation of an in-memory KeyValueStore.

    The default implementation of an in-memory KeyValueStore. Uses a scala.collection.concurrent.TrieMap as the underlying implementation

    initialState

    The initial state of the key value store to begin with

  8. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  9. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any
  10. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  11. def fromTaskRef[K, V](ref: TaskRef[slamdata.Predef.Map[K, V]]): ~>[[γ$7$]KeyValueStore[K, V, γ$7$], Task]

    Permalink

    Returns an interpreter of KeyValueStore[K, V, ?] into Task, given a TaskRef[Map[K, V]].

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any
  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  15. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef
  16. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  17. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
  18. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef
  19. object toAtomicRef

    Permalink

    Interpret KeyValueStore[K, V, ?] into AtomicRef[Map[K, V], ?], plus Free.

    Interpret KeyValueStore[K, V, ?] into AtomicRef[Map[K, V], ?], plus Free. Usage: toAtomicRef[K, V]().

  20. object toState

    Permalink

    Returns an interpreter of KeyValueStore[K, V, ?] into F[S, ?], given a Lens[S, Map[K, V]] and MonadState[F, S].

    Returns an interpreter of KeyValueStore[K, V, ?] into F[S, ?], given a Lens[S, Map[K, V]] and MonadState[F, S].

    NB: Uses partial application of F[_, _] for better type inference, usage: toState[F](lens)

  21. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any
  22. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  23. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  24. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped