Data.Sequence.BSeq

Description

A sequence, implemented as a binary tree, good performance when used ephemerally

Documentation

data BSeq a #

Instances

Functor BSeq #
Methods fmap :: (a -> b) -> BSeq a -> BSeq b # (<$) :: a -> BSeq b -> BSeq a #
Foldable BSeq #
Methods fold :: Monoid m => BSeq m -> m # foldMap :: Monoid m => (a -> m) -> BSeq a -> m # foldr :: (a -> b -> b) -> b -> BSeq a -> b # foldr' :: (a -> b -> b) -> b -> BSeq a -> b # foldl :: (b -> a -> b) -> b -> BSeq a -> b # foldl' :: (b -> a -> b) -> b -> BSeq a -> b # foldr1 :: (a -> a -> a) -> BSeq a -> a # foldl1 :: (a -> a -> a) -> BSeq a -> a # toList :: BSeq a -> [a] # null :: BSeq a -> Bool # length :: BSeq a -> Int # elem :: Eq a => a -> BSeq a -> Bool # maximum :: Ord a => BSeq a -> a # minimum :: Ord a => BSeq a -> a # sum :: Num a => BSeq a -> a # product :: Num a => BSeq a -> a #
Traversable BSeq #
Methods traverse :: Applicative f => (a -> f b) -> BSeq a -> f (BSeq b) # sequenceA :: Applicative f => BSeq (f a) -> f (BSeq a) # mapM :: Monad m => (a -> m b) -> BSeq a -> m (BSeq b) # sequence :: Monad m => BSeq (m a) -> m (BSeq a) #
Sequence BSeq #
Methods empty :: BSeq c # singleton :: c -> BSeq c # (><) :: BSeq c -> BSeq c -> BSeq c # viewl :: BSeq c -> ViewL BSeq c # viewr :: BSeq c -> ViewR BSeq c # (\|>) :: BSeq c -> c -> BSeq c # (<\|) :: c -> BSeq c -> BSeq c #