Safe Haskell	None
Language	Haskell2010

Data.Falsify.Tree

Contents

Properties
BST
Balancing
Debugging

Description

Binary trees

Intended for qualified import.

import Data.Falsify.Tree (Tree(..))
import qualified Data.Falsify.Tree as Tree

Synopsis

data Tree a where
- Leaf
- pattern Branch :: a -> Tree a -> Tree a -> Tree a
size :: Tree a -> Word
weight :: Tree a -> Word
height :: Tree a -> Word
lookup :: Ord a => a -> Tree (a, b) -> Maybe b
isWeightBalanced :: Tree a -> Bool
isHeightBalanced :: Tree a -> Bool
render :: Tree String -> String

Documentation

data Tree a Source #

Binary tree

Each branch caches the size of the subtree, so that size can be O(1).

Constructors

Leaf

Bundled Patterns

pattern Branch :: a -> Tree a -> Tree a -> Tree a

Instances

Instances details

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