Instance Constructors
-
new
SegmentReadState(keyValue: (Slice[Byte], Persistent), lower: TupleOrNone[Slice[Byte], Persistent], isSequential: Boolean)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
existsS(f: (SegmentReadState) ⇒ Boolean): Boolean
-
def
finalize(): Unit
-
def
flatMapOptionS[B](f: (SegmentReadState) ⇒ Option[B]): Option[B]
-
-
def
flatMapSomeS[T2](none: T2)(f: (SegmentReadState) ⇒ T2): T2
-
def
foldLeftS[B](initial: B)(f: (B, SegmentReadState) ⇒ B): B
-
def
forallS(f: (SegmentReadState) ⇒ Boolean): Boolean
-
-
final
def
getClass(): Class[_]
-
-
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
isNoneS: Boolean
-
var
isSequential: Boolean
-
def
isSomeS: Boolean
-
var
keyValue: (Slice[Byte], Persistent)
-
var
lower: TupleOrNone[Slice[Byte], Persistent]
-
def
mapS[B](f: (SegmentReadState) ⇒ B): Option[B]
-
final
def
ne(arg0: AnyRef): Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
def
toString(): String
-
def
valueOrElseS[B](f: (SegmentReadState) ⇒ B, orElse: B): B
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Stores read state of each accessed Segment. This cache is currently managed in swaydb.core.Core.readStates.
Both Get and Higher functions mutate keyValue. But lower can only mutate lower as it depends on get to fetch the end key-value for faster lower search and should not mutate get's set keyValue.