BTree.Store

Documentation

data BTree k v

Instances

Storable (BTree k v)

Defined in BTree.Store

Methods

sizeOf :: BTree k v -> Int

alignment :: BTree k v -> Int

peekElemOff :: Ptr (BTree k v) -> Int -> IO (BTree k v)

pokeElemOff :: Ptr (BTree k v) -> Int -> BTree k v -> IO ()

peekByteOff :: Ptr b -> Int -> IO (BTree k v)

pokeByteOff :: Ptr b -> Int -> BTree k v -> IO ()

peek :: Ptr (BTree k v) -> IO (BTree k v)

poke :: Ptr (BTree k v) -> BTree k v -> IO ()

(Storable k, Deinitialize v) => Deinitialize (BTree k v)

Defined in BTree.Store

Methods

deinitialize :: Ptr (BTree k v) -> IO ()

deinitializeElemOff :: Ptr (BTree k v) -> Int -> IO ()

deinitializeElems :: Ptr (BTree k v) -> Int -> IO ()

Initialize (BTree k v)

Defined in BTree.Store

Methods

initialize :: Ptr (BTree k v) -> IO ()

initializeElemOff :: Ptr (BTree k v) -> Int -> IO ()

initializeElems :: Ptr (BTree k v) -> Int -> IO ()

class Storable a => Initialize a where

Minimal complete definition

initialize

Methods

initialize :: Ptr a -> IO ()

Initialize the memory at a pointer. An implementation of this function may do nothing, or if the data contains more pointers, initialize may allocate additional memory.

initializeElemOff :: Ptr a -> Int -> IO ()

Can be overridden for efficiency

initializeElems :: Ptr a -> Int -> IO ()

Initialize a pointer representing an array with a given number of elements. This has a default implementation but may be overriden for efficency.

Instances

Initialize Char

Defined in BTree.Store

Methods

initialize :: Ptr Char -> IO ()

initializeElemOff :: Ptr Char -> Int -> IO ()

initializeElems :: Ptr Char -> Int -> IO ()

Initialize Int

Defined in BTree.Store

Methods

initialize :: Ptr Int -> IO ()

initializeElemOff :: Ptr Int -> Int -> IO ()

initializeElems :: Ptr Int -> Int -> IO ()

Initialize Int64

Defined in BTree.Store

Methods

initialize :: Ptr Int64 -> IO ()

initializeElemOff :: Ptr Int64 -> Int -> IO ()

initializeElems :: Ptr Int64 -> Int -> IO ()

Initialize Word

Defined in BTree.Store

Methods

initialize :: Ptr Word -> IO ()

initializeElemOff :: Ptr Word -> Int -> IO ()

initializeElems :: Ptr Word -> Int -> IO ()

Initialize Word8

Defined in BTree.Store

Methods

initialize :: Ptr Word8 -> IO ()

initializeElemOff :: Ptr Word8 -> Int -> IO ()

initializeElems :: Ptr Word8 -> Int -> IO ()

Initialize Word16

Defined in BTree.Store

Methods

initialize :: Ptr Word16 -> IO ()

initializeElemOff :: Ptr Word16 -> Int -> IO ()

initializeElems :: Ptr Word16 -> Int -> IO ()

Initialize Word32

Defined in BTree.Store

Methods

initialize :: Ptr Word32 -> IO ()

initializeElemOff :: Ptr Word32 -> Int -> IO ()

initializeElems :: Ptr Word32 -> Int -> IO ()

Initialize Word64

Defined in BTree.Store

Methods

initialize :: Ptr Word64 -> IO ()

initializeElemOff :: Ptr Word64 -> Int -> IO ()

initializeElems :: Ptr Word64 -> Int -> IO ()

Storable a => Initialize (ArrayList a)

Defined in ArrayList

Methods

initialize :: Ptr (ArrayList a) -> IO ()

initializeElemOff :: Ptr (ArrayList a) -> Int -> IO ()

initializeElems :: Ptr (ArrayList a) -> Int -> IO ()

Initialize (BTree k v)

Defined in BTree.Store

Methods

initialize :: Ptr (BTree k v) -> IO ()

initializeElemOff :: Ptr (BTree k v) -> Int -> IO ()

initializeElems :: Ptr (BTree k v) -> Int -> IO ()

class Storable a => Deinitialize a where

Minimal complete definition

deinitialize

Methods

deinitialize :: Ptr a -> IO ()

deinitializeElemOff :: Ptr a -> Int -> IO ()

Can be overridden for efficiency

deinitializeElems :: Ptr a -> Int -> IO ()

Free any memory pointed to by elements of the array. This has a default implementation but may be overriden for efficency.

Instances

Deinitialize Char

Defined in BTree.Store

Methods

deinitialize :: Ptr Char -> IO ()

deinitializeElemOff :: Ptr Char -> Int -> IO ()

deinitializeElems :: Ptr Char -> Int -> IO ()

Deinitialize Int

Defined in BTree.Store

Methods

deinitialize :: Ptr Int -> IO ()

deinitializeElemOff :: Ptr Int -> Int -> IO ()

deinitializeElems :: Ptr Int -> Int -> IO ()

Deinitialize Int64

Defined in BTree.Store

Methods

deinitialize :: Ptr Int64 -> IO ()

deinitializeElemOff :: Ptr Int64 -> Int -> IO ()

deinitializeElems :: Ptr Int64 -> Int -> IO ()

Deinitialize Word

Defined in BTree.Store

Methods

deinitialize :: Ptr Word -> IO ()

deinitializeElemOff :: Ptr Word -> Int -> IO ()

deinitializeElems :: Ptr Word -> Int -> IO ()

Deinitialize Word8

Defined in BTree.Store

Methods

deinitialize :: Ptr Word8 -> IO ()

deinitializeElemOff :: Ptr Word8 -> Int -> IO ()

deinitializeElems :: Ptr Word8 -> Int -> IO ()

Deinitialize Word16

Defined in BTree.Store

Methods

deinitialize :: Ptr Word16 -> IO ()

deinitializeElemOff :: Ptr Word16 -> Int -> IO ()

deinitializeElems :: Ptr Word16 -> Int -> IO ()

Deinitialize Word32

Defined in BTree.Store

Methods

deinitialize :: Ptr Word32 -> IO ()

deinitializeElemOff :: Ptr Word32 -> Int -> IO ()

deinitializeElems :: Ptr Word32 -> Int -> IO ()

Deinitialize Word64

Defined in BTree.Store

Methods

deinitialize :: Ptr Word64 -> IO ()

deinitializeElemOff :: Ptr Word64 -> Int -> IO ()

deinitializeElems :: Ptr Word64 -> Int -> IO ()

(Storable k, Deinitialize v) => Deinitialize (BTree k v)

Defined in BTree.Store

Methods

deinitialize :: Ptr (BTree k v) -> IO ()

deinitializeElemOff :: Ptr (BTree k v) -> Int -> IO ()

deinitializeElems :: Ptr (BTree k v) -> Int -> IO ()

data Decision

Constructors

Keep

Delete

new :: forall k v. (Storable k, Storable v) => IO (BTree k v)

free :: forall k v. (Storable k, Deinitialize v) => BTree k v -> IO ()

Release all memory allocated by the b-tree. Do not attempt to use the b-tree after calling this.

with :: (Storable k, Initialize v, Deinitialize v) => (BTree k v -> IO (a, BTree k v)) -> IO a

with_ :: (Storable k, Initialize v, Deinitialize v) => (BTree k v -> IO (BTree k v)) -> IO ()

lookup :: forall k v. (Ord k, Storable k, Storable v) => BTree k v -> k -> IO (Maybe v)

insert :: (Ord k, Storable k, Initialize v) => BTree k v -> k -> v -> IO (BTree k v)

modifyWithM_

Arguments

:: (Ord k, Storable k, Initialize v)

=> BTree k v

-> k

-> (v -> IO v)

value modification, happens for newly inserted elements and for previously existing elements

-> IO (BTree k v)

modifyWithM

Arguments

:: (Ord k, Storable k, Initialize v)

=> BTree k v

-> k

-> (v -> IO (a, v))

value modification, happens for newly inserted elements and for previously existing elements

-> IO (a, BTree k v)

modifyWithPtr

Arguments

:: (Ord k, Storable k, Initialize v)

=> BTree k v

-> k

-> Either r (Ptr v -> Int -> IO r)

modifications to newly inserted value

-> (Ptr v -> Int -> IO (r, Decision))

modification to value if key is found

-> IO (r, BTree k v)

foldrWithKey :: forall k v b. (Ord k, Storable k, Storable v) => (k -> v -> b -> IO b) -> b -> BTree k v -> IO b

toAscList :: forall k v. (Ord k, Storable k, Storable v) => BTree k v -> IO [(k, v)]

This is provided for convenience but is not something typically useful in production code.

Weird Operations

index :: forall k v. (Storable k, Storable v) => BTree k v -> (Int -> Int) -> Int -> IO v

indexNode :: forall k v. (Storable k, Storable v) => BTree k v -> (Int -> Int) -> Int -> IO (Ptr v, Int)

Force inlining

inlineModifyWithPtr

Arguments

:: (Ord k, Storable k, Initialize v)

=> BTree k v

-> k

-> Either r (Ptr v -> Int -> IO r)

modifications to newly inserted value

-> (Ptr v -> Int -> IO (r, Decision))

modification to value if key is found

-> IO (r, BTree k v)

inlineModifyWithM

Arguments

:: (Ord k, Storable k, Initialize v)

=> BTree k v

-> k

-> (v -> IO (a, v))

value modification, happens for newly inserted elements and for previously existing elements

-> IO (a, BTree k v)