Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data ArrayList a
- size :: ArrayList a -> Int
- with :: Storable a => (ArrayList a -> IO (ArrayList a, b)) -> IO b
- new :: forall a. 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)
- dump :: (Prim a, Storable a) => ArrayList a -> MutablePrimArray RealWorld a -> Int -> IO (ArrayList a)
- dumpMap :: (Storable a, Prim b) => ArrayList a -> (a -> b) -> MutablePrimArray RealWorld b -> Int -> IO (ArrayList a)
- dumpList :: (Prim a, Storable a) => ArrayList a -> IO (ArrayList a, [a])
- clear :: Storable a => ArrayList a -> IO (ArrayList a)
- showDebug :: forall a. (Prim a, Storable a, Show a) => ArrayList a -> IO String
Documentation
Instances
Storable (ArrayList a) Source # | |
Defined in ArrayList 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 () # | |
Storable a => Initialize (ArrayList a) Source # | |
pushArrayR :: forall a. (Storable a, Prim a) => ArrayList a -> PrimArray a -> IO (ArrayList a) Source #
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 #
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.