class
LevelZeroSkipListMerge extends SkipListMerge[Slice[Byte], Response]
Instance Constructors
-
new
LevelZeroSkipListMerge(hasTimeLeftAtLeast: FiniteDuration)
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
def
applyValue(newKeyValue: Fixed, oldKeyValue: Fixed, hasTimeLeftAtLeast: FiniteDuration): Fixed
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
implicit
val
groupingStrategy: Option[KeyValueGroupingStrategyInternal]
-
val
hasTimeLeftAtLeast: FiniteDuration
-
def
hashCode(): Int
-
def
insert(entry: MapEntry[Slice[Byte], Response], skipList: ConcurrentSkipListMap[Slice[Byte], Response])(implicit ordering: Ordering[Slice[Byte]]): Unit
-
def
insert(insertKey: Slice[Byte], insertValue: Response, skipList: ConcurrentSkipListMap[Slice[Byte], Response])(implicit ordering: Ordering[Slice[Byte]]): Unit
-
def
insert(insert: Range, skipList: ConcurrentSkipListMap[Slice[Byte], Response])(implicit ordering: Ordering[Slice[Byte]]): Unit
-
def
insert(insert: Fixed, skipList: ConcurrentSkipListMap[Slice[Byte], Response])(implicit ordering: Ordering[Slice[Byte]]): Unit
-
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(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
When inserting key-values that alter existing Range key-values in the skipList, they should be inserted into the skipList atomically and should only replace existing keys if all the new inserts have overwritten all the key ranges in the conflicting Range key-value.
reverse on the merge results ensures that changes happen atomically.