Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- type Array = SmallArray
- type MArray = SmallMutableArray
- nullSmallArray :: SmallArray a -> Bool
- lastSmallArray# :: SmallArray a -> (# a #)
- singletonSmallArray :: a -> Array a
- twoSmallArray :: a -> a -> Array a
- updateSmallArray :: Array a -> Int -> a -> Array a
- modifySmallArray :: Array a -> Int -> (a -> a) -> Array a
- modifySmallArrayF :: Functor f => Array a -> Int -> (a -> f a) -> f (Array a)
- modifySmallArray' :: Array a -> Int -> (a -> a) -> Array a
- updateResizeSmallArray :: Array a -> Int -> a -> Array a
- popSmallArray :: Array a -> Array a
- undefinedElem :: forall a. a
- ifoldrStepSmallArray :: Int -> Int -> (Int -> a -> b -> b) -> b -> SmallArray a -> b
- ifoldlStepSmallArray :: Int -> Int -> (Int -> b -> a -> b) -> b -> SmallArray a -> b
- ifoldrStepSmallArray' :: Int -> Int -> (Int -> a -> b -> b) -> b -> SmallArray a -> b
- ifoldlStepSmallArray' :: Int -> Int -> (Int -> b -> a -> b) -> b -> SmallArray a -> b
- imapStepSmallArray :: Int -> Int -> (Int -> a -> b) -> SmallArray a -> SmallArray b
- imapStepSmallArray' :: Int -> (a -> Int) -> (Int -> a -> b) -> SmallArray a -> SmallArray b
- itraverseStepSmallArray :: Applicative f => Int -> Int -> (Int -> a -> f b) -> SmallArray a -> f (SmallArray b)
- modifySmallArray# :: Array a -> Int -> (a -> (# a #)) -> Array a
- mapSmallArray# :: (a -> (# b #)) -> SmallArray a -> SmallArray b
- shrinkSmallMutableArray_ :: PrimMonad m => MArray (PrimState m) a -> Int -> m (MArray (PrimState m) a)
- snocSmallArray :: Array a -> a -> Array a
- unsnocSmallArray :: SmallArray a -> Maybe (SmallArray a, a)
Documentation
type Array = SmallArray Source #
type MArray = SmallMutableArray Source #
nullSmallArray :: SmallArray a -> Bool Source #
lastSmallArray# :: SmallArray a -> (# a #) Source #
singletonSmallArray :: a -> Array a Source #
twoSmallArray :: a -> a -> Array a Source #
popSmallArray :: Array a -> Array a Source #
undefinedElem :: forall a. a Source #
ifoldrStepSmallArray :: Int -> Int -> (Int -> a -> b -> b) -> b -> SmallArray a -> b Source #
ifoldlStepSmallArray :: Int -> Int -> (Int -> b -> a -> b) -> b -> SmallArray a -> b Source #
ifoldrStepSmallArray' :: Int -> Int -> (Int -> a -> b -> b) -> b -> SmallArray a -> b Source #
ifoldlStepSmallArray' :: Int -> Int -> (Int -> b -> a -> b) -> b -> SmallArray a -> b Source #
imapStepSmallArray :: Int -> Int -> (Int -> a -> b) -> SmallArray a -> SmallArray b Source #
imapStepSmallArray' :: Int -> (a -> Int) -> (Int -> a -> b) -> SmallArray a -> SmallArray b Source #
itraverseStepSmallArray :: Applicative f => Int -> Int -> (Int -> a -> f b) -> SmallArray a -> f (SmallArray b) Source #
mapSmallArray# :: (a -> (# b #)) -> SmallArray a -> SmallArray b Source #
shrinkSmallMutableArray_ :: PrimMonad m => MArray (PrimState m) a -> Int -> m (MArray (PrimState m) a) Source #
Used to support older ghcs.
snocSmallArray :: Array a -> a -> Array a Source #
unsnocSmallArray :: SmallArray a -> Maybe (SmallArray a, a) Source #