pvector-0.1.0.0: Fast persistent vectors
Safe HaskellNone
LanguageHaskell2010

Data.Vector.Persistent.Internal.Array

Synopsis

Documentation

twoSmallArray :: a -> a -> Array a Source #

modifySmallArray :: Array a -> Int -> (a -> a) -> Array a Source #

modifySmallArrayF :: Functor f => Array a -> Int -> (a -> f a) -> f (Array a) Source #

modifySmallArray' :: Array a -> Int -> (a -> 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 #

modifySmallArray# :: Array a -> Int -> (a -> (# a #)) -> Array a 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.