Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.RAList.Tree

Synopsis

newtype Leaf a = Lf a
data Node f a = Nd (f a) (f a)
data Dir a
- = L a
- | R a

Documentation

newtype Leaf a Source #

A Leaf is isomorphic to Identity , but we reimplement it here to have domain specific type. The short constructor name is a bonus.

Constructors

Lf a

Instances

Instances details

Functor Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fmap :: (a -> b) -> Leaf a -> Leaf b Source # (<$) :: a -> Leaf b -> Leaf a Source #
Foldable Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fold :: Monoid m => Leaf m -> m Source # foldMap :: Monoid m => (a -> m) -> Leaf a -> m Source # foldMap' :: Monoid m => (a -> m) -> Leaf a -> m Source # foldr :: (a -> b -> b) -> b -> Leaf a -> b Source # foldr' :: (a -> b -> b) -> b -> Leaf a -> b Source # foldl :: (b -> a -> b) -> b -> Leaf a -> b Source # foldl' :: (b -> a -> b) -> b -> Leaf a -> b Source # foldr1 :: (a -> a -> a) -> Leaf a -> a Source # foldl1 :: (a -> a -> a) -> Leaf a -> a Source # toList :: Leaf a -> [a] Source # null :: Leaf a -> Bool Source # length :: Leaf a -> Int Source # elem :: Eq a => a -> Leaf a -> Bool Source # maximum :: Ord a => Leaf a -> a Source # minimum :: Ord a => Leaf a -> a Source # sum :: Num a => Leaf a -> a Source # product :: Num a => Leaf a -> a Source #
Traversable Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods traverse :: Applicative f => (a -> f b) -> Leaf a -> f ( Leaf b) Source # sequenceA :: Applicative f => Leaf (f a) -> f ( Leaf a) Source # mapM :: Monad m => (a -> m b) -> Leaf a -> m ( Leaf b) Source # sequence :: Monad m => Leaf (m a) -> m ( Leaf a) Source #
Distributive Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods distribute :: Functor f => f ( Leaf a) -> Leaf (f a) Source # collect :: Functor f => (a -> Leaf b) -> f a -> Leaf (f b) Source # distributeM :: Monad m => m ( Leaf a) -> Leaf (m a) Source # collectM :: Monad m => (a -> Leaf b) -> m a -> Leaf (m b) Source #
Representable Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Associated Types type Rep Leaf Source # Methods tabulate :: ( Rep Leaf -> a) -> Leaf a Source # index :: Leaf a -> Rep Leaf -> a Source #
Traversable1 Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods traverse1 :: Apply f => (a -> f b) -> Leaf a -> f ( Leaf b) Source # sequence1 :: Apply f => Leaf (f b) -> f ( Leaf b) Source #
Foldable1 Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fold1 :: Semigroup m => Leaf m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> Leaf a -> m Source # toNonEmpty :: Leaf a -> NonEmpty a Source #
Eq a => Eq ( Leaf a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods (==) :: Leaf a -> Leaf a -> Bool Source # (/=) :: Leaf a -> Leaf a -> Bool Source #
Ord a => Ord ( Leaf a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods compare :: Leaf a -> Leaf a -> Ordering Source # (<) :: Leaf a -> Leaf a -> Bool Source # (<=) :: Leaf a -> Leaf a -> Bool Source # (>) :: Leaf a -> Leaf a -> Bool Source # (>=) :: Leaf a -> Leaf a -> Bool Source # max :: Leaf a -> Leaf a -> Leaf a Source # min :: Leaf a -> Leaf a -> Leaf a Source #
Show a => Show ( Leaf a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods showsPrec :: Int -> Leaf a -> ShowS Source # show :: Leaf a -> String Source # showList :: [ Leaf a] -> ShowS Source #
NFData a => NFData ( Leaf a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods rnf :: Leaf a -> () Source #
Hashable a => Hashable ( Leaf a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods hashWithSalt :: Int -> Leaf a -> Int Source # hash :: Leaf a -> Int Source #
type Rep Leaf Source #
Instance details Defined in Data.RAList.Tree.Internal type Rep Leaf = ()

data Node f a Source #

Node is a product of two f . This way we can form a perfect binary tree.

Constructors

Nd (f a) (f a)

Instances

Instances details

Functor f => Functor ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fmap :: (a -> b) -> Node f a -> Node f b Source # (<$) :: a -> Node f b -> Node f a Source #
Foldable f => Foldable ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fold :: Monoid m => Node f m -> m Source # foldMap :: Monoid m => (a -> m) -> Node f a -> m Source # foldMap' :: Monoid m => (a -> m) -> Node f a -> m Source # foldr :: (a -> b -> b) -> b -> Node f a -> b Source # foldr' :: (a -> b -> b) -> b -> Node f a -> b Source # foldl :: (b -> a -> b) -> b -> Node f a -> b Source # foldl' :: (b -> a -> b) -> b -> Node f a -> b Source # foldr1 :: (a -> a -> a) -> Node f a -> a Source # foldl1 :: (a -> a -> a) -> Node f a -> a Source # toList :: Node f a -> [a] Source # null :: Node f a -> Bool Source # length :: Node f a -> Int Source # elem :: Eq a => a -> Node f a -> Bool Source # maximum :: Ord a => Node f a -> a Source # minimum :: Ord a => Node f a -> a Source # sum :: Num a => Node f a -> a Source # product :: Num a => Node f a -> a Source #
Traversable f => Traversable ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods traverse :: Applicative f0 => (a -> f0 b) -> Node f a -> f0 ( Node f b) Source # sequenceA :: Applicative f0 => Node f (f0 a) -> f0 ( Node f a) Source # mapM :: Monad m => (a -> m b) -> Node f a -> m ( Node f b) Source # sequence :: Monad m => Node f (m a) -> m ( Node f a) Source #
Distributive f => Distributive ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods distribute :: Functor f0 => f0 ( Node f a) -> Node f (f0 a) Source # collect :: Functor f0 => (a -> Node f b) -> f0 a -> Node f (f0 b) Source # distributeM :: Monad m => m ( Node f a) -> Node f (m a) Source # collectM :: Monad m => (a -> Node f b) -> m a -> Node f (m b) Source #
Representable f => Representable ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Associated Types type Rep ( Node f) Source # Methods tabulate :: ( Rep ( Node f) -> a) -> Node f a Source # index :: Node f a -> Rep ( Node f) -> a Source #
Traversable1 f => Traversable1 ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods traverse1 :: Apply f0 => (a -> f0 b) -> Node f a -> f0 ( Node f b) Source # sequence1 :: Apply f0 => Node f (f0 b) -> f0 ( Node f b) Source #
Foldable1 f => Foldable1 ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fold1 :: Semigroup m => Node f m -> m Source # foldMap1 :: Semigroup m => (a -> m) -> Node f a -> m Source # toNonEmpty :: Node f a -> NonEmpty a Source #
Eq (f a) => Eq ( Node f a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods (==) :: Node f a -> Node f a -> Bool Source # (/=) :: Node f a -> Node f a -> Bool Source #
Ord (f a) => Ord ( Node f a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods compare :: Node f a -> Node f a -> Ordering Source # (<) :: Node f a -> Node f a -> Bool Source # (<=) :: Node f a -> Node f a -> Bool Source # (>) :: Node f a -> Node f a -> Bool Source # (>=) :: Node f a -> Node f a -> Bool Source # max :: Node f a -> Node f a -> Node f a Source # min :: Node f a -> Node f a -> Node f a Source #
Show (f a) => Show ( Node f a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods showsPrec :: Int -> Node f a -> ShowS Source # show :: Node f a -> String Source # showList :: [ Node f a] -> ShowS Source #
NFData (f a) => NFData ( Node f a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods rnf :: Node f a -> () Source #
Hashable (f a) => Hashable ( Node f a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods hashWithSalt :: Int -> Node f a -> Int Source # hash :: Node f a -> Int Source #
type Rep ( Node f) Source #
Instance details Defined in Data.RAList.Tree.Internal type Rep ( Node f) = Dir ( Rep f)

data Dir a Source #

Direction in Node .

Constructors

L a
R a

Instances

Instances details

Functor Dir Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fmap :: (a -> b) -> Dir a -> Dir b Source # (<$) :: a -> Dir b -> Dir a Source #
Foldable Dir Source #
Instance details Defined in Data.RAList.Tree.Internal Methods fold :: Monoid m => Dir m -> m Source # foldMap :: Monoid m => (a -> m) -> Dir a -> m Source # foldMap' :: Monoid m => (a -> m) -> Dir a -> m Source # foldr :: (a -> b -> b) -> b -> Dir a -> b Source # foldr' :: (a -> b -> b) -> b -> Dir a -> b Source # foldl :: (b -> a -> b) -> b -> Dir a -> b Source # foldl' :: (b -> a -> b) -> b -> Dir a -> b Source # foldr1 :: (a -> a -> a) -> Dir a -> a Source # foldl1 :: (a -> a -> a) -> Dir a -> a Source # toList :: Dir a -> [a] Source # null :: Dir a -> Bool Source # length :: Dir a -> Int Source # elem :: Eq a => a -> Dir a -> Bool Source # maximum :: Ord a => Dir a -> a Source # minimum :: Ord a => Dir a -> a Source # sum :: Num a => Dir a -> a Source # product :: Num a => Dir a -> a Source #
Traversable Dir Source #
Instance details Defined in Data.RAList.Tree.Internal Methods traverse :: Applicative f => (a -> f b) -> Dir a -> f ( Dir b) Source # sequenceA :: Applicative f => Dir (f a) -> f ( Dir a) Source # mapM :: Monad m => (a -> m b) -> Dir a -> m ( Dir b) Source # sequence :: Monad m => Dir (m a) -> m ( Dir a) Source #
Eq a => Eq ( Dir a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods (==) :: Dir a -> Dir a -> Bool Source # (/=) :: Dir a -> Dir a -> Bool Source #
Ord a => Ord ( Dir a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods compare :: Dir a -> Dir a -> Ordering Source # (<) :: Dir a -> Dir a -> Bool Source # (<=) :: Dir a -> Dir a -> Bool Source # (>) :: Dir a -> Dir a -> Bool Source # (>=) :: Dir a -> Dir a -> Bool Source # max :: Dir a -> Dir a -> Dir a Source # min :: Dir a -> Dir a -> Dir a Source #
Show a => Show ( Dir a) Source #
Instance details Defined in Data.RAList.Tree.Internal Methods showsPrec :: Int -> Dir a -> ShowS Source # show :: Dir a -> String Source # showList :: [ Dir a] -> ShowS Source #