| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.RRBVector.Internal.Array
Description
This is an internal module.
It provides a thin wrapper over Data.Primitive.SmallArray with \(O(1)\) slicing.
Warning: No bound checks are performed!
Documentation
Instances
| Foldable Array Source # | |
Defined in Data.RRBVector.Internal.Array Methods fold :: Monoid m => Array m -> m # foldMap :: Monoid m => (a -> m) -> Array a -> m # foldMap' :: Monoid m => (a -> m) -> Array a -> m # foldr :: (a -> b -> b) -> b -> Array a -> b # foldr' :: (a -> b -> b) -> b -> Array a -> b # foldl :: (b -> a -> b) -> b -> Array a -> b # foldl' :: (b -> a -> b) -> b -> Array a -> b # foldr1 :: (a -> a -> a) -> Array a -> a # foldl1 :: (a -> a -> a) -> Array a -> a # elem :: Eq a => a -> Array a -> Bool # maximum :: Ord a => Array a -> a # minimum :: Ord a => Array a -> a # | |
| NFData a => NFData (Array a) Source # | |
Defined in Data.RRBVector.Internal.Array | |
data MutableArray s a Source #
wrap :: SmallArray a -> Array a Source #
replicateSnoc :: Int -> a -> a -> Array a Source #
itraverseStep :: Applicative f => Int -> (a -> Int) -> (Int -> a -> f b) -> Array a -> f (Array b) Source #
itraverseStep' :: Applicative f => Int -> (a -> Int) -> (Int -> a -> f b) -> Array a -> f (Array b) Source #