| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Database.Graph.HGraphStorage.FreeList
Description
Free list management
- data FreeList a = FreeList {}
- initFreeList :: (Binary a, MonadIO m) => Integer -> Handle -> IO () -> m (FreeList a)
- closeFreeList :: (Binary a, MonadIO m) => FreeList a -> m Bool
- addToFreeList :: (Binary a, MonadIO m) => a -> FreeList a -> m ()
- getFromFreeList :: (Binary a, Eq a, Default a, MonadIO m) => FreeList a -> m (Maybe a)
Documentation
Free List structure
initFreeList :: (Binary a, MonadIO m) => Integer -> Handle -> IO () -> m (FreeList a) Source
position handle
closeFreeList :: (Binary a, MonadIO m) => FreeList a -> m Bool Source
Close underlying handle and return if we have still objects in the list
addToFreeList :: (Binary a, MonadIO m) => a -> FreeList a -> m () Source
Add object to list