haskey-btree-0.2.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 #

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 # 
Value Char Source # 
Value Double Source # 
Value Float Source # 
Value Int8 Source # 
Value Int16 Source # 
Value Int32 Source # 
Value Int64 Source # 
Value Integer Source # 
Value Word8 Source # 
Value Word16 Source # 
Value Word32 Source # 
Value Word64 Source # 
Value () Source # 

Methods

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

Value ByteString Source # 
Value Text Source # 
Value TxId Source # 
Value PageId Source # 
Value v => Value [v] Source # 

Methods

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

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

Methods

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

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

Methods

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

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