Safe Haskell	Safe
Language	Haskell2010

Data.Apart.Structures.Tree.Binary

Synopsis

type Binary = Cofree Branches
data Branches a
- = End
- | Less a
- | Greater a
- | Branches a a
ls :: Binary a -> Segmented Binary a
gt :: Binary a -> Segmented Binary a
singleton :: a -> Binary a
insert :: Ord a => Binary a -> a -> Binary a
height :: Binary a -> Int
factor :: Binary a -> Int

Documentation

type Binary = Cofree Branches Source #

data Branches a Source #

Constructors

End	No children
Less a	Left child
Greater a	Right child
Branches a a	Both

Instances

Functor Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods fmap :: (a -> b) -> Branches a -> Branches b # (<$) :: a -> Branches b -> Branches a #
Foldable Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods fold :: Monoid m => Branches m -> m # foldMap :: Monoid m => (a -> m) -> Branches a -> m # foldr :: (a -> b -> b) -> b -> Branches a -> b # foldr' :: (a -> b -> b) -> b -> Branches a -> b # foldl :: (b -> a -> b) -> b -> Branches a -> b # foldl' :: (b -> a -> b) -> b -> Branches a -> b # foldr1 :: (a -> a -> a) -> Branches a -> a # foldl1 :: (a -> a -> a) -> Branches a -> a # toList :: Branches a -> [a] # null :: Branches a -> Bool # length :: Branches a -> Int # elem :: Eq a => a -> Branches a -> Bool # maximum :: Ord a => Branches a -> a # minimum :: Ord a => Branches a -> a # sum :: Num a => Branches a -> a # product :: Num a => Branches a -> a #
Traversable Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods traverse :: Applicative f => (a -> f b) -> Branches a -> f (Branches b) # sequenceA :: Applicative f => Branches (f a) -> f (Branches a) # mapM :: Monad m => (a -> m b) -> Branches a -> m (Branches b) # sequence :: Monad m => Branches (m a) -> m (Branches a) #
Apply Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods (<.>) :: Branches (a -> b) -> Branches a -> Branches b (.>) :: Branches a -> Branches b -> Branches b (<.) :: Branches a -> Branches b -> Branches a liftF2 :: (a -> b -> c) -> Branches a -> Branches b -> Branches c
Alt Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods (<!>) :: Branches a -> Branches a -> Branches a some :: Applicative Branches => Branches a -> Branches [a] many :: Applicative Branches => Branches a -> Branches [a]
Bind Branches Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods (>>-) :: Branches a -> (a -> Branches b) -> Branches b join :: Branches (Branches a) -> Branches a
Show a => Show (Branches a) Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods showsPrec :: Int -> Branches a -> ShowS # show :: Branches a -> String # showList :: [Branches a] -> ShowS #
Semigroup (Branches a) Source #
Instance details Defined in Data.Apart.Structures.Tree.Binary Methods (<>) :: Branches a -> Branches a -> Branches a # sconcat :: NonEmpty (Branches a) -> Branches a # stimes :: Integral b => b -> Branches a -> Branches a #

ls :: Binary a -> Segmented Binary a Source #

Get x from Branches x y or from Less x.

gt :: Binary a -> Segmented Binary a Source #

Get y from Branches x y or from Greater y.

singleton :: a -> Binary a Source #

insert :: Ord a => Binary a -> a -> Binary a Source #

height :: Binary a -> Int Source #

The way to the most remote branch.

factor :: Binary a -> Int Source #

Balance factor for root node.