-- Hoogle documentation, generated by Haddock
-- See Hoogle, http://www.haskell.org/hoogle/


-- | Memory-efficient ArrayList implementation
--   
--   An ArrayList that carries information about the amount of data in it
--   that is actually used, and tries to keep space usage to a minimum.
@package arraylist
@version 0.1.0.0

module ArrayList
data ArrayList a
size :: ArrayList a -> Int
with :: Storable a => (ArrayList a -> IO (ArrayList a, b)) -> IO b
new :: Storable a => IO (ArrayList a)
free :: ArrayList a -> IO ()
pushR :: forall a. Storable a => ArrayList a -> a -> IO (ArrayList a)
pushArrayR :: forall a. (Storable a, Prim a) => ArrayList a -> PrimArray a -> IO (ArrayList a)
popL :: forall a. Storable a => ArrayList a -> IO (ArrayList a, Maybe a)
dropWhileL :: forall a. Storable a => ArrayList a -> (a -> IO Bool) -> IO (ArrayList a, Int)
dropWhileScanL :: forall a b. Storable a => ArrayList a -> b -> (b -> a -> IO (Bool, b)) -> IO (ArrayList a, Int, b)
dropScanL :: forall a b. Storable a => ArrayList a -> Int -> b -> (b -> a -> IO b) -> IO (ArrayList a, b)
dropL :: forall a. Storable a => ArrayList a -> Int -> IO (ArrayList a)

-- | Deletes all elements from the linked list, copying them into the
--   buffer specified by the pointer. Returns an empty linked list.
dump :: (Prim a, Storable a) => ArrayList a -> MutablePrimArray RealWorld a -> Int -> IO (ArrayList a)

-- | Dump the elements into a <a>MutablePrimArray</a>, mapping over them
--   first. This is a fairly niche function.
dumpMap :: (Storable a, Prim b) => ArrayList a -> (a -> b) -> MutablePrimArray RealWorld b -> Int -> IO (ArrayList a)
clear :: Storable a => ArrayList a -> IO (ArrayList a)

-- | Does not affect the contents of the ArrayList
showDebug :: forall a. (Prim a, Storable a, Show a) => ArrayList a -> IO String
instance Foreign.Storable.Storable (ArrayList.ArrayList a)
instance Foreign.Storable.Storable a => Initialize.Initialize (ArrayList.ArrayList a)