Data.Seqn.Internal.Tree

This is an internal module. You probably don't need to import this. Use Data.Seqn.Seq instead.

WARNING

Definitions in this module allow violating invariants that would otherwise be guaranteed by Data.Seqn.Seq. Use at your own risk!

Tree

data Tree a

Constructors

Bin !Int !a !(Tree a) !(Tree a)

Tip

Instances

NFData1 Tree

Defined in Data.Seqn.Internal.Tree

Methods

liftRnf :: (a -> ()) -> Tree a -> ()

NFData a => NFData (Tree a)

Defined in Data.Seqn.Internal.Tree

Methods

rnf :: Tree a -> ()

Basic

size :: Tree a -> Int

bin :: a -> Tree a -> Tree a -> Tree a

Folds

foldl' :: (b -> a -> b) -> b -> Tree a -> b

ifoldl' :: (Int -> b -> a -> b) -> b -> Int -> Tree a -> b

foldr' :: (a -> b -> b) -> b -> Tree a -> b

ifoldr' :: (Int -> a -> b -> b) -> b -> Int -> Tree a -> b

traverse :: Applicative f => (a -> f b) -> Tree a -> f (Tree b)

itraverse :: Applicative f => (Int -> a -> f b) -> Int -> Tree a -> f (Tree b)

Construct

generateA :: Applicative f => (Int -> f a) -> Int -> Int -> f (Tree a)

Index

adjustF :: Functor f => (a -> f a) -> Int -> Tree a -> f (Tree a)

insertAt :: Int -> a -> Tree a -> Tree a

deleteAt :: Int -> Tree a -> Tree a

Slice

cons :: a -> Tree a -> Tree a

snoc :: Tree a -> a -> Tree a

uncons :: Tree a -> SMaybe (S2 a (Tree a))

unsnoc :: Tree a -> SMaybe (S2 (Tree a) a)

splitAtF :: Biapplicative f => Int -> Tree a -> f (Tree a) (S2 a (Tree a))

Transform

mapMaybeA :: Applicative f => (a -> f (Maybe b)) -> Tree a -> f (Tree b)

mapEitherA :: Applicative f => (a -> f (Either b c)) -> Tree a -> f (S2 (Tree b) (Tree c))

Zip and unzip

zipWithStreamM :: Monad m => (a -> b -> m c) -> Tree a -> Stream b -> m (Tree c)

unzipWithA :: Applicative f => (a -> f (b, c)) -> Tree a -> f (S2 (Tree b) (Tree c))

unzipWith3A :: Applicative f => (a -> f (b, c, d)) -> Tree a -> f (S3 (Tree b) (Tree c) (Tree d))

Tree helpers

fold :: b -> (Int -> a -> b -> b -> b) -> (Int -> a -> b -> b) -> (Int -> a -> b -> b) -> (a -> b) -> Tree a -> b

foldSimple :: b -> (Int -> a -> b -> b -> b) -> Tree a -> b

link :: a -> Tree a -> Tree a -> Tree a

glue :: Tree a -> Tree a -> Tree a

merge :: Tree a -> Tree a -> Tree a

balanceL :: a -> Tree a -> Tree a -> Tree a

balanceR :: a -> Tree a -> Tree a -> Tree a

Testing

valid :: Tree a -> Bool

debugShowsPrec :: Show a => Int -> Tree a -> ShowS