haskey-btree-0.3.0.0: B+-tree implementation in Haskell.

Safe HaskellNone
LanguageHaskell2010

Data.BTree.Primitives.Ids

Synopsis

Documentation

newtype PageId #

Reference to a stored page.

Constructors

PageId 

Fields

Instances
Eq PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

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

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

Num PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Ord PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Show PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Binary PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

put :: PageId -> Put #

get :: Get PageId #

putList :: [PageId] -> Put #

Value PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Key PageId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

narrow :: PageId -> PageId -> (PageId, PageId) #

type OverflowId = (TxId, Word32) #

Reference to a stored overflow page.

An overflow id is the combination of the transaction id that generated it, and a counter.

newtype PageCount #

Type used to indicate the size of storage pools.

Constructors

PageCount 
Instances
Enum PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

Eq PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

Num PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

Ord PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

Show PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

Binary PageCount # 
Instance details

Defined in Data.BTree.Primitives.Ids

newtype PageSize #

Type used to indicate the size of a single physical page in bytes.

Constructors

PageSize 

Fields

Instances
Enum PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Eq PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Integral PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Num PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Ord PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Real PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Show PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Binary PageSize # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

put :: PageSize -> Put #

get :: Get PageSize #

putList :: [PageSize] -> Put #

newtype NodeId (height :: Nat) key val #

Reference to a stored Node.

NodeId has phantom type arguments for the parameters of Node to be able to enforce consistency. In a setting with a single storage pool this Id will essentially be a PageId with just the extra typing. In a multi storage pool setting NodeIds will additionally have to be resolved to PageIds by the node allocator.

Constructors

NodeId 

Fields

Instances
Eq (NodeId height key val) # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

(==) :: NodeId height key val -> NodeId height key val -> Bool #

(/=) :: NodeId height key val -> NodeId height key val -> Bool #

Num (NodeId height key val) # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

(+) :: NodeId height key val -> NodeId height key val -> NodeId height key val #

(-) :: NodeId height key val -> NodeId height key val -> NodeId height key val #

(*) :: NodeId height key val -> NodeId height key val -> NodeId height key val #

negate :: NodeId height key val -> NodeId height key val #

abs :: NodeId height key val -> NodeId height key val #

signum :: NodeId height key val -> NodeId height key val #

fromInteger :: Integer -> NodeId height key val #

Ord (NodeId height key val) # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

compare :: NodeId height key val -> NodeId height key val -> Ordering #

(<) :: NodeId height key val -> NodeId height key val -> Bool #

(<=) :: NodeId height key val -> NodeId height key val -> Bool #

(>) :: NodeId height key val -> NodeId height key val -> Bool #

(>=) :: NodeId height key val -> NodeId height key val -> Bool #

max :: NodeId height key val -> NodeId height key val -> NodeId height key val #

min :: NodeId height key val -> NodeId height key val -> NodeId height key val #

Show (NodeId height key val) # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

showsPrec :: Int -> NodeId height key val -> ShowS #

show :: NodeId height key val -> String #

showList :: [NodeId height key val] -> ShowS #

Binary (NodeId height key val) # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

put :: NodeId height key val -> Put #

get :: Get (NodeId height key val) #

putList :: [NodeId height key val] -> Put #

nodeIdToPageId :: NodeId height key val -> PageId #

Convert a NodeId to a PageId

pageIdToNodeId :: PageId -> NodeId height key val #

Convert a PageId to a NodeId

newtype TxId #

Transaction ids that are used as revision numbers.

Constructors

TxId 

Fields

Instances
Eq TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

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

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

Num TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

(+) :: TxId -> TxId -> TxId #

(-) :: TxId -> TxId -> TxId #

(*) :: TxId -> TxId -> TxId #

negate :: TxId -> TxId #

abs :: TxId -> TxId #

signum :: TxId -> TxId #

fromInteger :: Integer -> TxId #

Ord TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

compare :: TxId -> TxId -> Ordering #

(<) :: TxId -> TxId -> Bool #

(<=) :: TxId -> TxId -> Bool #

(>) :: TxId -> TxId -> Bool #

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

max :: TxId -> TxId -> TxId #

min :: TxId -> TxId -> TxId #

Show TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

showsPrec :: Int -> TxId -> ShowS #

show :: TxId -> String #

showList :: [TxId] -> ShowS #

Binary TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

put :: TxId -> Put #

get :: Get TxId #

putList :: [TxId] -> Put #

Hashable TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

hashWithSalt :: Int -> TxId -> Int #

hash :: TxId -> Int #

Value TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

fixedSize :: Proxy TxId -> Maybe Int #

Key TxId # 
Instance details

Defined in Data.BTree.Primitives.Ids

Methods

narrow :: TxId -> TxId -> (TxId, TxId) #