lsm-tree-1.0.0.0: Log-structured merge-trees
Safe HaskellSafe-Inferred
LanguageGHC2021

Database.LSMTree.Internal.WriteBuffer

Description

The in-memory LSM level 0.

Synopsis

Documentation

data WriteBuffer Source #

Instances

Instances details
Show WriteBuffer Source # 
Instance details

Defined in Database.LSMTree.Internal.WriteBuffer

Methods

showsPrec :: Int -> WriteBuffer -> ShowS #

show :: WriteBuffer -> String #

showList :: [WriteBuffer] -> ShowS #

NFData WriteBuffer Source # 
Instance details

Defined in Database.LSMTree.Internal.WriteBuffer

Methods

rnf :: WriteBuffer -> () #

Eq WriteBuffer Source # 
Instance details

Defined in Database.LSMTree.Internal.WriteBuffer

Methods

(==) :: WriteBuffer -> WriteBuffer -> Bool #

(/=) :: WriteBuffer -> WriteBuffer -> Bool #

empty :: WriteBuffer Source #

numEntries :: WriteBuffer -> NumEntries Source #

\( O(1) \)

fromMap :: Map SerialisedKey (Entry SerialisedValue BlobSpan) -> WriteBuffer Source #

\( O(1)) \)

toMap :: WriteBuffer -> Map SerialisedKey (Entry SerialisedValue BlobSpan) Source #

\( O(1) \)

fromList Source #

Arguments

:: ResolveSerialisedValue

merge function

-> [(SerialisedKey, Entry SerialisedValue BlobSpan)] 
-> WriteBuffer 

\( O(n \log n) \)

toList :: WriteBuffer -> [(SerialisedKey, Entry SerialisedValue BlobSpan)] Source #

\( O(n) \)

addEntry Source #

Arguments

:: ResolveSerialisedValue

merge function

-> SerialisedKey 
-> Entry SerialisedValue BlobSpan 
-> WriteBuffer 
-> WriteBuffer 

null :: WriteBuffer -> Bool Source #

lookups :: WriteBuffer -> Vector SerialisedKey -> Vector (Maybe (Entry SerialisedValue BlobSpan)) Source #

lookup :: WriteBuffer -> SerialisedKey -> Maybe (Entry SerialisedValue BlobSpan) Source #

rangeLookups :: WriteBuffer -> Range SerialisedKey -> [(SerialisedKey, Entry SerialisedValue BlobSpan)] Source #

We return Entry so we can properly combine lookup results.

Note: Deletes are not filtered out.