trait ReadStateStore extends AnyRef
Base trait for a versioned key-value store which provides read operations. Each instance of a
ReadStateStore represents a specific version of state data, and such instances are created
through a StateStoreProvider.
abort method will be called when the task is completed - please clean up the resources in
the method.
- Alphabetic
- By Inheritance
- ReadStateStore
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
abstract
def
abort(): Unit
Clean up the resource.
Clean up the resource.
The method name is to respect backward compatibility on StateStore.
-
abstract
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.
-
abstract
def
id: StateStoreId
Unique identifier of the store
-
abstract
def
iterator(): Iterator[UnsafeRowPair]
Return an iterator containing all the key-value pairs in the StateStore.
-
abstract
def
version: Long
Version of the data in this store before committing updates.
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
getRange(start: Option[UnsafeRow], end: Option[UnsafeRow]): Iterator[UnsafeRowPair]
Get key value pairs with optional approximate
startandendextents.Get key value pairs with optional approximate
startandendextents. If the State Store implementation maintains indices for the data based on the optionalkeyIndexOrdinalover fieldskeySchema(seeStateStoreProvider.init()), then it can usestartandendto 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
keyIndexOrdinalcolumn set with appropriate starting value.- end
UnsafeRow having the
keyIndexOrdinalcolumn 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.
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()