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

Safe HaskellSafe
LanguageHaskell2010

Data.BTree.Primitives.Value

Documentation

class (Binary v, Show v, Typeable v) => Value v where Source #

Minimal complete definition

Nothing

Methods

fixedSize :: Proxy v -> Maybe Int Source #

Just with the size in bytes if v is a fixed sized value, Nothing if v is variable sized.

Instances
Value Bool Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Char Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Double Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Float Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Int8 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Int16 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Int32 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Int64 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Integer Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Word8 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Word16 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Word32 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Word64 Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value () Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Methods

fixedSize :: Proxy () -> Maybe Int Source #

Value ByteString Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value Text Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Value TxId Source # 
Instance details

Defined in Data.BTree.Primitives.Ids

Value PageId Source # 
Instance details

Defined in Data.BTree.Primitives.Ids

Value v => Value [v] Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Methods

fixedSize :: Proxy [v] -> Maybe Int Source #

(Value k1, Value k2) => Value (k1, k2) Source # 
Instance details

Defined in Data.BTree.Primitives.Value

Methods

fixedSize :: Proxy (k1, k2) -> Maybe Int Source #

(Value k, Value v) => Value (Tree k v) Source # 
Instance details

Defined in Data.BTree.Impure.Internal.Structures

Methods

fixedSize :: Proxy (Tree k v) -> Maybe Int Source #

(Value k, Value v) => Value (NonEmptyTree k v) Source # 
Instance details

Defined in Data.BTree.Impure.NonEmpty