Safe Haskell	Safe-Inferred
Language	GHC2021

Database.LSMTree.Internal.Entry

Contents

Value resolution/merging

Synopsis

data Entry v b
- = Insert !v
- | InsertWithBlob !v !b
- | Upsert !v
- | Delete
hasBlob :: Entry v b -> Bool
onValue :: v' -> (v -> v') -> Entry v b -> v'
onBlobRef :: b' -> (b -> b') -> Entry v b -> b'
newtype NumEntries = NumEntries Int
unNumEntries :: NumEntries -> Int
combine :: (v -> v -> v) -> Entry v b -> Entry v b -> Entry v b
combineUnion :: (v -> v -> v) -> Entry v b -> Entry v b -> Entry v b
combineMaybe :: (v -> v -> v) -> Maybe (Entry v b) -> Maybe (Entry v b) -> Maybe (Entry v b)

Documentation

data Entry v b Source #

Constructors

Insert !v
InsertWithBlob !v !b
Upsert !v
Delete

Instances

Instances details

Bifoldable Entry Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods bifold :: Monoid m => Entry m m -> m # bifoldMap :: Monoid m => (a -> m) -> (b -> m) -> Entry a b -> m # bifoldr :: (a -> c -> c) -> (b -> c -> c) -> c -> Entry a b -> c # bifoldl :: (c -> a -> c) -> (c -> b -> c) -> c -> Entry a b -> c #
Bifunctor Entry Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods bimap :: (a -> b) -> (c -> d) -> Entry a c -> Entry b d # first :: (a -> b) -> Entry a c -> Entry b c # second :: (b -> c) -> Entry a b -> Entry a c #
Foldable (Entry v) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods fold :: Monoid m => Entry v m -> m # foldMap :: Monoid m => (a -> m) -> Entry v a -> m # foldMap' :: Monoid m => (a -> m) -> Entry v a -> m # foldr :: (a -> b -> b) -> b -> Entry v a -> b # foldr' :: (a -> b -> b) -> b -> Entry v a -> b # foldl :: (b -> a -> b) -> b -> Entry v a -> b # foldl' :: (b -> a -> b) -> b -> Entry v a -> b # foldr1 :: (a -> a -> a) -> Entry v a -> a # foldl1 :: (a -> a -> a) -> Entry v a -> a # toList :: Entry v a -> [a] # null :: Entry v a -> Bool # length :: Entry v a -> Int # elem :: Eq a => a -> Entry v a -> Bool # maximum :: Ord a => Entry v a -> a # minimum :: Ord a => Entry v a -> a # sum :: Num a => Entry v a -> a # product :: Num a => Entry v a -> a #
Traversable (Entry v) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods traverse :: Applicative f => (a -> f b) -> Entry v a -> f (Entry v b) # sequenceA :: Applicative f => Entry v (f a) -> f (Entry v a) # mapM :: Monad m => (a -> m b) -> Entry v a -> m (Entry v b) # sequence :: Monad m => Entry v (m a) -> m (Entry v a) #
Functor (Entry v) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods fmap :: (a -> b) -> Entry v a -> Entry v b # (<$) :: a -> Entry v b -> Entry v a #
(Show b, Show v) => Show (Entry v b) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods showsPrec :: Int -> Entry v b -> ShowS # show :: Entry v b -> String # showList :: [Entry v b] -> ShowS #
(NFData v, NFData b) => NFData (Entry v b) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods rnf :: Entry v b -> () #
(Eq b, Eq v) => Eq (Entry v b) Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods (==) :: Entry v b -> Entry v b -> Bool # (/=) :: Entry v b -> Entry v b -> Bool #

hasBlob :: Entry v b -> Bool Source #

onValue :: v' -> (v -> v') -> Entry v b -> v' Source #

onBlobRef :: b' -> (b -> b') -> Entry v b -> b' Source #

newtype NumEntries Source #

A count of entries, for example the number of entries in a run.

This number is limited by the machine's word size. On 32-bit systems, the maximum number we can represent is 2^31 which is roughly 2 billion. This should be a sufficiently large limit that we never reach it in practice. By extension for 64-bit and higher-bit systems this limit is also sufficiently large.

Constructors

NumEntries Int

Instances

Instances details

Monoid NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods mempty :: NumEntries # mappend :: NumEntries -> NumEntries -> NumEntries # mconcat :: [NumEntries] -> NumEntries #
Semigroup NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods (<>) :: NumEntries -> NumEntries -> NumEntries # sconcat :: NonEmpty NumEntries -> NumEntries # stimes :: Integral b => b -> NumEntries -> NumEntries #
Show NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods showsPrec :: Int -> NumEntries -> ShowS # show :: NumEntries -> String # showList :: [NumEntries] -> ShowS #
NFData NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods rnf :: NumEntries -> () #
Eq NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods (==) :: NumEntries -> NumEntries -> Bool # (/=) :: NumEntries -> NumEntries -> Bool #
Ord NumEntries Source #
Instance details Defined in Database.LSMTree.Internal.Entry Methods compare :: NumEntries -> NumEntries -> Ordering # (<) :: NumEntries -> NumEntries -> Bool # (<=) :: NumEntries -> NumEntries -> Bool # (>) :: NumEntries -> NumEntries -> Bool # (>=) :: NumEntries -> NumEntries -> Bool # max :: NumEntries -> NumEntries -> NumEntries # min :: NumEntries -> NumEntries -> NumEntries #

unNumEntries :: NumEntries -> Int Source #

Value resolution/merging

combine :: (v -> v -> v) -> Entry v b -> Entry v b -> Entry v b Source #

Given a value-merge function, combine entries. Only take a blob from the left entry.

Note: Entry is a semigroup with combine if the (v -> v -> v) argument is associative.

combineUnion :: (v -> v -> v) -> Entry v b -> Entry v b -> Entry v b Source #

Combine two entries of runs that have been unioned together. If any one has a value, the result should have a value (represented by Insert). If both have a value, these values get combined monoidally. Only take a blob from the left entry.

Note: Entry is a semigroup with combineUnion if the (v -> v -> v) argument is associative.

combineMaybe :: (v -> v -> v) -> Maybe (Entry v b) -> Maybe (Entry v b) -> Maybe (Entry v b) Source #