Database.Haskey.Alloc.Concurrent.Meta

This module implements data structures and function related to the metadata of the concurrent page allocator.

Documentation

data CurrentMetaPage

Data type used to point to the most recent version of the meta data.

Constructors

Meta1

Meta2

data ConcurrentMeta k v

Meta data of the page allocator.

Constructors

ConcurrentMeta

Fields

• concurrentMetaRevision :: TxId
• concurrentMetaDataNumPages :: S TypeData PageId
• concurrentMetaIndexNumPages :: S TypeIndex PageId
• concurrentMetaTree :: Tree k v
• concurrentMetaDataFreeTree :: S TypeData FreeTree
• concurrentMetaIndexFreeTree :: S TypeIndex FreeTree
• concurrentMetaOverflowTree :: OverflowTree
• concurrentMetaDataFreshUnusedPages :: S TypeData (Set DirtyFree)
• concurrentMetaIndexFreshUnusedPages :: S TypeIndex (Set DirtyFree)

Instances

(Show k, Show v) => Show (ConcurrentMeta k v)

Methods

showsPrec :: Int -> ConcurrentMeta k v -> ShowS

show :: ConcurrentMeta k v -> String

showList :: [ConcurrentMeta k v] -> ShowS

Generic (ConcurrentMeta k v)

Associated Types

type Rep (ConcurrentMeta k v) :: * -> *

Methods

from :: ConcurrentMeta k v -> Rep (ConcurrentMeta k v) x

to :: Rep (ConcurrentMeta k v) x -> ConcurrentMeta k v

(Binary k, Binary v) => Binary (ConcurrentMeta k v)

Methods

put :: ConcurrentMeta k v -> Put

get :: Get (ConcurrentMeta k v)

putList :: [ConcurrentMeta k v] -> Put

type Rep (ConcurrentMeta k v)

type Rep (ConcurrentMeta k v) = D1 (MetaData "ConcurrentMeta" "Database.Haskey.Alloc.Concurrent.Meta" "haskey-0.1.0.0-Bj1GeZXJASRBI49cDY743O" False) (C1 (MetaCons "ConcurrentMeta" PrefixI True) ((:*:) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "concurrentMetaRevision") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 TxId)) (S1 (MetaSel (Just Symbol "concurrentMetaDataNumPages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeData PageId)))) ((:*:) (S1 (MetaSel (Just Symbol "concurrentMetaIndexNumPages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeIndex PageId))) (S1 (MetaSel (Just Symbol "concurrentMetaTree") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (Tree k v))))) ((:*:) ((:*:) (S1 (MetaSel (Just Symbol "concurrentMetaDataFreeTree") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeData FreeTree))) (S1 (MetaSel (Just Symbol "concurrentMetaIndexFreeTree") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeIndex FreeTree)))) ((:*:) (S1 (MetaSel (Just Symbol "concurrentMetaOverflowTree") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 OverflowTree)) ((:*:) (S1 (MetaSel (Just Symbol "concurrentMetaDataFreshUnusedPages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeData (Set DirtyFree)))) (S1 (MetaSel (Just Symbol "concurrentMetaIndexFreshUnusedPages") NoSourceUnpackedness NoSourceStrictness DecidedLazy) (Rec0 (S TypeIndex (Set DirtyFree)))))))))

class StoreM FilePath m => ConcurrentMetaStoreM m where

A class representing the storage requirements of the page allocator.

A store supporting the page allocator should be an instance of this class.

Minimal complete definition

putConcurrentMeta, readConcurrentMeta

Methods

putConcurrentMeta :: (Key k, Value v) => FilePath -> ConcurrentMeta k v -> m ()

Write the meta-data structure to a certain page.

readConcurrentMeta :: (Key k, Value v) => FilePath -> Proxy k -> Proxy v -> m (Maybe (ConcurrentMeta k v))

Try to read the meta-data structure from a handle, or return Nothing if the handle doesn't contain a meta page.

Instances

(Applicative m, Monad m, MonadIO m, MonadThrow m) => ConcurrentMetaStoreM (FileStoreT FilePath m)

Methods

putConcurrentMeta :: (Key k, Value v) => FilePath -> ConcurrentMeta k v -> FileStoreT FilePath m ()

readConcurrentMeta :: (Key k, Value v) => FilePath -> Proxy * k -> Proxy * v -> FileStoreT FilePath m (Maybe (ConcurrentMeta k v))

(Applicative m, Monad m, MonadIO m, MonadThrow m) => ConcurrentMetaStoreM (MemoryStoreT FilePath m)

Methods

putConcurrentMeta :: (Key k, Value v) => FilePath -> ConcurrentMeta k v -> MemoryStoreT FilePath m ()

readConcurrentMeta :: (Key k, Value v) => FilePath -> Proxy * k -> Proxy * v -> MemoryStoreT FilePath m (Maybe (ConcurrentMeta k v))