arraylist-0.1.0.0: Memory-efficient ArrayList implementation

Safe HaskellNone
LanguageHaskell2010

ArrayList

Synopsis

Documentation

data ArrayList a Source #

Instances
Storable (ArrayList a) Source # 
Instance details

Defined in ArrayList

Methods

sizeOf :: ArrayList a -> Int #

alignment :: ArrayList a -> Int #

peekElemOff :: Ptr (ArrayList a) -> Int -> IO (ArrayList a) #

pokeElemOff :: Ptr (ArrayList a) -> Int -> ArrayList a -> IO () #

peekByteOff :: Ptr b -> Int -> IO (ArrayList a) #

pokeByteOff :: Ptr b -> Int -> ArrayList a -> IO () #

peek :: Ptr (ArrayList a) -> IO (ArrayList a) #

poke :: Ptr (ArrayList a) -> ArrayList a -> IO () #

Storable a => Initialize (ArrayList a) Source # 
Instance details

Defined in ArrayList

Methods

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

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

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

with :: Storable a => (ArrayList a -> IO (ArrayList a, b)) -> IO b Source #

free :: ArrayList a -> IO () Source #

pushR :: forall a. Storable a => ArrayList a -> a -> IO (ArrayList a) Source #

pushArrayR :: forall a. (Storable a, Prim a) => ArrayList a -> PrimArray a -> IO (ArrayList a) Source #

popL :: forall a. Storable a => ArrayList a -> IO (ArrayList a, Maybe a) Source #

dropWhileL Source #

Arguments

:: Storable a 
=> ArrayList a 
-> (a -> IO Bool)

predicate

-> IO (ArrayList a, Int) 

dropWhileScanL :: forall a b. Storable a => ArrayList a -> b -> (b -> a -> IO (Bool, b)) -> IO (ArrayList a, Int, b) Source #

dropScanL :: forall a b. Storable a => ArrayList a -> Int -> b -> (b -> a -> IO b) -> IO (ArrayList a, b) Source #

dropL :: forall a. Storable a => ArrayList a -> Int -> IO (ArrayList a) Source #

dump :: (Prim a, Storable a) => ArrayList a -> MutablePrimArray RealWorld a -> Int -> IO (ArrayList a) Source #

Deletes all elements from the linked list, copying them into the buffer specified by the pointer. Returns an empty linked list.

dumpMap :: (Storable a, Prim b) => ArrayList a -> (a -> b) -> MutablePrimArray RealWorld b -> Int -> IO (ArrayList a) Source #

Dump the elements into a MutablePrimArray, mapping over them first. This is a fairly niche function.

showDebug :: forall a. (Prim a, Storable a, Show a) => ArrayList a -> IO String Source #

Does not affect the contents of the ArrayList