Data.Sequence.BSeq.Internal

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

Documentation

data BSeq a

A catenable queue intended for ephemeral use.

Constructors

Empty

Leaf a

Node (BSeq a) (BSeq a)

Instances

Functor BSeq

Defined in Data.Sequence.BSeq.Internal

Methods

fmap :: (a -> b) -> BSeq a -> BSeq b

(<$) :: a -> BSeq b -> BSeq a

Foldable BSeq

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

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

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

Defined in Data.Sequence.BSeq.Internal

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

fromList :: [c] -> BSeq c

Eq a => Eq (BSeq a)

Defined in Data.Sequence.BSeq.Internal

Methods

(==) :: BSeq a -> BSeq a -> Bool

(/=) :: BSeq a -> BSeq a -> Bool

Ord a => Ord (BSeq a)

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)

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)

Defined in Data.Sequence.BSeq.Internal

Methods

showsPrec :: Int -> BSeq a -> ShowS

show :: BSeq a -> String

showList :: [BSeq a] -> ShowS

Semigroup (BSeq a)

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)

Defined in Data.Sequence.BSeq.Internal

Methods

mempty :: BSeq a

mappend :: BSeq a -> BSeq a -> BSeq a

mconcat :: [BSeq a] -> BSeq a