Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- newEmptySmallArray :: PrimMonad m => Int -> m (SmallMutableArray (PrimState m) a)
- list :: [a] -> SmallArray a
- unset :: Int -> SmallArray a -> SmallArray a
- set :: Int -> a -> SmallArray a -> SmallArray a
- insert :: Int -> a -> SmallArray a -> SmallArray a
- cons :: a -> SmallArray a -> SmallArray a
- orderedPair :: Int -> e -> Int -> e -> SmallArray e
- find :: (a -> Bool) -> SmallArray a -> Maybe a
- findWithIndex :: (a -> Bool) -> SmallArray a -> Maybe (Int, a)
- elementsUnfoldM :: Monad m => SmallArray e -> UnfoldM m e
- onFoundElementFocus :: Monad m => (a -> Bool) -> (a -> Bool) -> Focus a m b -> Focus (SmallArray a) m b
- focusOnFoundElement :: Monad m => Focus a m b -> (a -> Bool) -> (a -> Bool) -> SmallArray a -> m (b, SmallArray a)
- toList :: forall a. SmallArray a -> [a]
Documentation
newEmptySmallArray :: PrimMonad m => Int -> m (SmallMutableArray (PrimState m) a) Source #
A workaround for the weird forcing of undefined
values int newSmallArray
list :: [a] -> SmallArray a Source #
unset :: Int -> SmallArray a -> SmallArray a Source #
Remove an element.
set :: Int -> a -> SmallArray a -> SmallArray a Source #
insert :: Int -> a -> SmallArray a -> SmallArray a Source #
cons :: a -> SmallArray a -> SmallArray a Source #
orderedPair :: Int -> e -> Int -> e -> SmallArray e Source #
findWithIndex :: (a -> Bool) -> SmallArray a -> Maybe (Int, a) Source #
elementsUnfoldM :: Monad m => SmallArray e -> UnfoldM m e Source #
onFoundElementFocus :: Monad m => (a -> Bool) -> (a -> Bool) -> Focus a m b -> Focus (SmallArray a) m b Source #
focusOnFoundElement :: Monad m => Focus a m b -> (a -> Bool) -> (a -> Bool) -> SmallArray a -> m (b, SmallArray a) Source #
toList :: forall a. SmallArray a -> [a] Source #