trait
NextLevel extends LevelRef
Abstract Value Members
-
abstract
def
appendixPath: Path
-
abstract
def
ceiling(key: Slice[Byte], readState: ThreadReadState): PutOption
-
abstract
def
close: IO[Close, Unit]
-
abstract
def
closeSegments(): IO[Error.Level, Unit]
-
abstract
def
collapse(segments: Iterable[Segment]): IO[Promise[Unit], IO[Error.Level, Int]]
-
abstract
def
containsSegmentWithMinKey(minKey: Slice[Byte]): Boolean
-
abstract
def
delete: IO[Delete, Unit]
-
abstract
def
existsOnDisk: Boolean
-
abstract
def
floor(key: Slice[Byte], readState: ThreadReadState): PutOption
-
abstract
def
foreachSegment[T](f: (Slice[Byte], Segment) ⇒ T): Unit
-
abstract
def
get(key: Slice[Byte], readState: ThreadReadState): PutOption
-
abstract
def
getSegment(minKey: Slice[Byte]): SegmentOption
-
abstract
def
hasNextLevel: Boolean
-
abstract
def
head(readState: ThreadReadState): PutOption
-
abstract
def
headKey(readState: ThreadReadState): SliceOption[Byte]
-
abstract
def
higher(key: Slice[Byte], readState: ThreadReadState): PutOption
-
abstract
def
inMemory: Boolean
-
abstract
def
isCopyable(map: Map[SliceOption[Byte], MemoryOption, Slice[Byte], Memory]): Boolean
-
abstract
def
isCopyable(minKey: Slice[Byte], maxKey: Slice[Byte], maxKeyInclusive: Boolean): Boolean
-
abstract
def
isEmpty: Boolean
-
abstract
def
isTrash: Boolean
-
abstract
def
isUnreserved(segment: Segment): Boolean
-
abstract
def
isUnreserved(minKey: Slice[Byte], maxKey: Slice[Byte], maxKeyInclusive: Boolean): Boolean
-
abstract
def
isZero: Boolean
-
abstract
def
keyValueCount: Int
-
abstract
def
last(readState: ThreadReadState): PutOption
-
abstract
def
lastKey(readState: ThreadReadState): SliceOption[Byte]
-
abstract
def
lastSegmentId: Option[Long]
-
abstract
def
levelNumber: Int
-
abstract
def
levelSize: Long
-
abstract
def
lower(key: Slice[Byte], readState: ThreadReadState): PutOption
-
abstract
def
meter: LevelMeter
-
abstract
def
meterFor(levelNumber: Int): Option[LevelMeter]
-
abstract
def
mightContainFunction(key: Slice[Byte]): Boolean
-
abstract
def
mightContainKey(key: Slice[Byte]): Boolean
-
abstract
def
minSegmentSize: Int
-
abstract
def
nextCompactionDelay: FiniteDuration
-
abstract
def
nextLevel: Option[NextLevel]
-
abstract
def
nextThrottlePushCount: Int
-
abstract
def
optimalSegmentsPushForward(take: Int): (Iterable[Segment], Iterable[Segment])
-
abstract
def
optimalSegmentsToCollapse(take: Int): Iterable[Segment]
-
abstract
def
partitionUnreservedCopyable(segments: Iterable[Segment]): (Iterable[Segment], Iterable[Segment])
-
abstract
def
pathDistributor: PathsDistributor
-
abstract
def
put(segments: Iterable[Segment]): IO[Promise[Unit], IO[Error.Level, Set[Int]]]
-
abstract
def
put(map: Map[SliceOption[Byte], MemoryOption, Slice[Byte], Memory]): IO[Promise[Unit], IO[Error.Level, Set[Int]]]
-
abstract
def
put(segment: Segment): IO[Promise[Unit], IO[Error.Level, Set[Int]]]
-
abstract
def
refresh(segment: Segment): IO[Promise[Unit], IO[Error.Level, Unit]]
-
abstract
def
releaseLocks: IO[Close, Unit]
-
abstract
def
removeSegments(segments: Iterable[Segment]): IO[Error.Level, Int]
-
abstract
def
rootPath: Path
-
abstract
def
segmentFilesOnDisk: Seq[Path]
-
abstract
def
segmentsCount(): Int
-
abstract
def
segmentsInLevel(): Iterable[Segment]
-
abstract
def
sizeOfSegments: Long
-
abstract
def
stateId: Long
-
abstract
def
take(count: Int): Slice[Segment]
-
abstract
def
takeLargeSegments(size: Int): Iterable[Segment]
-
abstract
def
takeSegments(size: Int, condition: (Segment) ⇒ Boolean): Iterable[Segment]
-
abstract
def
takeSmallSegments(size: Int): Iterable[Segment]
-
abstract
def
throttle: (LevelMeter) ⇒ Throttle
Concrete 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
finalize(): Unit
-
def
foldLeftLevels[T](initial: T)(f: (T, LevelRef) ⇒ T): T
-
def
foldRightLevels[T](initial: T)(f: (T, LevelRef) ⇒ T): T
-
def
foreachLevel[T](f: (LevelRef) ⇒ T): Unit
-
def
foreachRightLevel[T](f: (LevelRef) ⇒ T): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
def
mapLevels[T](f: (LevelRef) ⇒ T): Iterable[T]
-
def
mapRightLevels[T](f: (LevelRef) ⇒ T): Iterable[T]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
reverseLevels: ListBuffer[LevelRef]
-
def
reverseNextLevels: ListBuffer[NextLevel]
-
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 LevelRef
Inherited from Any
Levels that can have upper Levels or Levels that upper Levels can merge Segments or Maps into.