Value Members

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

   Definition Classes

   AnyRef → Any

2.  final def ##(): Int

   Definition Classes

   AnyRef → Any

3.  final def ==(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

4.  def abort(): Unit

   Clean up the resource.

   Clean up the resource.

   The method name is to respect backward compatibility on StateStore.

   Definition Classes

   WrappedReadStateStore → ReadStateStore

5.  final def asInstanceOf[T0]: T0

   Definition Classes

   Any

6.  def clone(): AnyRef

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... ) @native()

7.  final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

8.  def equals(arg0: Any): Boolean

   Definition Classes

   AnyRef → Any

9.  def finalize(): Unit

   Attributes

   protected[lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( classOf[java.lang.Throwable] )

10.  def get(key: UnsafeRow): UnsafeRow

    Get the current value of a non-null key.

    Get the current value of a non-null key.

    returns

    a non-null row if the key exists in the store, otherwise null.

    Definition Classes

    WrappedReadStateStore → ReadStateStore

11.  final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

12.  def getRange(start: Option[UnsafeRow], end: Option[UnsafeRow]): Iterator[UnsafeRowPair]

    Get key value pairs with optional approximate start and end extents.

    Get key value pairs with optional approximate start and end extents. If the State Store implementation maintains indices for the data based on the optional keyIndexOrdinal over fields keySchema (see StateStoreProvider.init()), then it can use start and end to make a best-effort scan over the data. Default implementation returns the full data scan iterator, which is correct but inefficient. Custom implementations must ensure that updates (puts, removes) can be made while iterating over this iterator.

    start

    UnsafeRow having the keyIndexOrdinal column set with appropriate starting value.

    end

    UnsafeRow having the keyIndexOrdinal column set with appropriate ending value.

    returns

    An iterator of key-value pairs that is guaranteed not miss any key between start and end, both inclusive.

    Definition Classes

    ReadStateStore

13.  def hashCode(): Int

    Definition Classes

    AnyRef → Any

    Annotations

    @native()

14.  def id: StateStoreId

    Unique identifier of the store

    Unique identifier of the store

    Definition Classes

    WrappedReadStateStore → ReadStateStore

15.  final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

16.  def iterator(): Iterator[UnsafeRowPair]

    Return an iterator containing all the key-value pairs in the StateStore.

    Return an iterator containing all the key-value pairs in the StateStore.

    Definition Classes

    WrappedReadStateStore → ReadStateStore

17.  final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

18.  final def notify(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

19.  final def notifyAll(): Unit

    Definition Classes

    AnyRef

    Annotations

    @native()

20.  final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes

    AnyRef

21.  def toString(): String

    Definition Classes

    AnyRef → Any

22.  def version: Long

    Version of the data in this store before committing updates.

    Version of the data in this store before committing updates.

    Definition Classes

    WrappedReadStateStore → ReadStateStore

23.  final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

25.  final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... ) @native()