Safe Haskell | None |
---|---|
Language | Haskell2010 |
Synopsis
- data Chunks a
- = ChunksCons !(SmallArray a) !(Chunks a)
- | ChunksNil
- reverse :: Chunks a -> Chunks a
- reverseOnto :: Chunks a -> Chunks a -> Chunks a
Documentation
A list of chunks. This is a foundation on top of which efficient builder-like abstractions can be implemented. There are no restrictions on the number of elements in each chunk, although extremely small chunks (singleton or doubleton chunks) may lead to poor performance.
ChunksCons !(SmallArray a) !(Chunks a) | |
ChunksNil |
Instances
Foldable Chunks Source # | |
Defined in Data.Chunks fold :: Monoid m => Chunks m -> m # foldMap :: Monoid m => (a -> m) -> Chunks a -> m # foldr :: (a -> b -> b) -> b -> Chunks a -> b # foldr' :: (a -> b -> b) -> b -> Chunks a -> b # foldl :: (b -> a -> b) -> b -> Chunks a -> b # foldl' :: (b -> a -> b) -> b -> Chunks a -> b # foldr1 :: (a -> a -> a) -> Chunks a -> a # foldl1 :: (a -> a -> a) -> Chunks a -> a # elem :: Eq a => a -> Chunks a -> Bool # maximum :: Ord a => Chunks a -> a # minimum :: Ord a => Chunks a -> a # | |
IsList (Chunks a) Source # | |
Eq a => Eq (Chunks a) Source # | |
Show a => Show (Chunks a) Source # | |
Semigroup (Chunks a) Source # | |
Monoid (Chunks a) Source # | |
type Item (Chunks a) Source # | |
Defined in Data.Chunks |