LevelZeroSkipListMerger

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def applyValue(newKeyValue: Fixed, oldKeyValue: Fixed)(implicit timeOrder: TimeOrder[Slice[Byte]], functionStore: FunctionStore): Fixed

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

implicit val groupingStrategy: Option[KeyValueGroupingStrategyInternal]

def hashCode(): Int

def insert(entry: MapEntry[Slice[Byte], SegmentResponse], skipList: ConcurrentSkipListMap[Slice[Byte], SegmentResponse])(implicit keyOrder: KeyOrder[Slice[Byte]], timeOrder: TimeOrder[Slice[Byte]], functionStore: FunctionStore): Unit

def insert(insertKey: Slice[Byte], insertValue: SegmentResponse, skipList: ConcurrentSkipListMap[Slice[Byte], SegmentResponse])(implicit keyOrder: KeyOrder[Slice[Byte]], timeOrder: TimeOrder[Slice[Byte]], functionStore: FunctionStore): Unit

def insert(insert: Range, skipList: ConcurrentSkipListMap[Slice[Byte], SegmentResponse])(implicit keyOrder: KeyOrder[Slice[Byte]], timeOrder: TimeOrder[Slice[Byte]], functionStore: FunctionStore): Unit

Inserts the input Memory.Range key-value into skipList and always maintaining the previous state of the skipList before applying the new state so that all read queries read the latest write.

def insert(insert: Fixed, skipList: ConcurrentSkipListMap[Slice[Byte], SegmentResponse])(implicit keyOrder: KeyOrder[Slice[Byte]], timeOrder: TimeOrder[Slice[Byte]], functionStore: FunctionStore): Unit

Inserts a Memory.Fixed key-value into skipList.

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

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

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit