Copyright	(c) Atze van der Ploeg 2014
License	BSD-style
Maintainer	atzeus@gmail.org
Stability	provisional
Portability	portable
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.Sequence.BSeq

Description

A catenable qeueue, implemented as a binary tree, with good amortized performance when used ephemerally.

Synopsis

module Data.SequenceClass
data BSeq a

Documentation

module Data.SequenceClass

data BSeq a Source #

A catenable queue intended for ephemeral use.

Instances

Instances details

Functor BSeq Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods fmap :: (a -> b) -> BSeq a -> BSeq b # (<$) :: a -> BSeq b -> BSeq a #
Foldable BSeq Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods fold :: Monoid m => BSeq m -> m # foldMap :: Monoid m => (a -> m) -> BSeq a -> 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 Source #
Instance details Defined in Data.Sequence.BSeq.Internal 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) #
Show1 BSeq Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods liftShowsPrec :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> Int -> BSeq a -> ShowS # liftShowList :: (Int -> a -> ShowS) -> ([a] -> ShowS) -> [BSeq a] -> ShowS #
Sequence BSeq Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods empty :: BSeq c Source # singleton :: c -> BSeq c Source # (><) :: BSeq c -> BSeq c -> BSeq c Source # viewl :: BSeq c -> ViewL BSeq c Source # viewr :: BSeq c -> ViewR BSeq c Source # (\|>) :: BSeq c -> c -> BSeq c Source # (<\|) :: c -> BSeq c -> BSeq c Source # fromList :: [c] -> BSeq c Source #
Eq a => Eq (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods (==) :: BSeq a -> BSeq a -> Bool # (/=) :: BSeq a -> BSeq a -> Bool #
Ord a => Ord (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods compare :: BSeq a -> BSeq a -> Ordering # (<) :: BSeq a -> BSeq a -> Bool # (<=) :: BSeq a -> BSeq a -> Bool # (>) :: BSeq a -> BSeq a -> Bool # (>=) :: BSeq a -> BSeq a -> Bool # max :: BSeq a -> BSeq a -> BSeq a # min :: BSeq a -> BSeq a -> BSeq a #
Read a => Read (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods readsPrec :: Int -> ReadS (BSeq a) # readList :: ReadS [BSeq a] # readPrec :: ReadPrec (BSeq a) # readListPrec :: ReadPrec [BSeq a] #
Show a => Show (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods showsPrec :: Int -> BSeq a -> ShowS # show :: BSeq a -> String # showList :: [BSeq a] -> ShowS #
Semigroup (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods (<>) :: BSeq a -> BSeq a -> BSeq a # sconcat :: NonEmpty (BSeq a) -> BSeq a # stimes :: Integral b => b -> BSeq a -> BSeq a #
Monoid (BSeq a) Source #
Instance details Defined in Data.Sequence.BSeq.Internal Methods mempty :: BSeq a # mappend :: BSeq a -> BSeq a -> BSeq a # mconcat :: [BSeq a] -> BSeq a #