Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newtype PageId = PageId {
- fromPageId :: Word64
- type OverflowId = (TxId, Word32)
- newtype PageCount = PageCount {}
- newtype PageSize = PageSize {}
- newtype NodeId (height :: Nat) key val = NodeId {
- fromNodeId :: Word64
- nodeIdToPageId :: NodeId height key val -> PageId
- pageIdToNodeId :: PageId -> NodeId height key val
- newtype TxId = TxId {}
Documentation
Reference to a stored page.
type OverflowId = (TxId, Word32) Source #
Reference to a stored overflow page.
An overflow id is the combination of the transaction id that generated it, and a counter.
Type used to indicate the size of storage pools.
Instances
Enum PageCount Source # | |
Defined in Data.BTree.Primitives.Ids succ :: PageCount -> PageCount # pred :: PageCount -> PageCount # fromEnum :: PageCount -> Int # enumFrom :: PageCount -> [PageCount] # enumFromThen :: PageCount -> PageCount -> [PageCount] # enumFromTo :: PageCount -> PageCount -> [PageCount] # enumFromThenTo :: PageCount -> PageCount -> PageCount -> [PageCount] # | |
Eq PageCount Source # | |
Num PageCount Source # | |
Defined in Data.BTree.Primitives.Ids | |
Ord PageCount Source # | |
Defined in Data.BTree.Primitives.Ids | |
Show PageCount Source # | |
Binary PageCount Source # | |
Type used to indicate the size of a single physical page in bytes.
Instances
Enum PageSize Source # | |
Defined in Data.BTree.Primitives.Ids | |
Eq PageSize Source # | |
Integral PageSize Source # | |
Defined in Data.BTree.Primitives.Ids | |
Num PageSize Source # | |
Ord PageSize Source # | |
Defined in Data.BTree.Primitives.Ids | |
Real PageSize Source # | |
Defined in Data.BTree.Primitives.Ids toRational :: PageSize -> Rational # | |
Show PageSize Source # | |
Binary PageSize Source # | |
newtype NodeId (height :: Nat) key val Source #
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 NodeId
s will additionally have to be resolved to
PageId
s by the node allocator.
Instances
Eq (NodeId height key val) Source # | |
Num (NodeId height key val) Source # | |
Defined in Data.BTree.Primitives.Ids (+) :: 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) Source # | |
Defined in Data.BTree.Primitives.Ids 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) Source # | |
Binary (NodeId height key val) Source # | |