Safe Haskell	Safe-Inferred
Language	Haskell2010

Math.Tools.LeafTree

Documentation

data LeafTree a Source #

Constructors

Leaf
Fields leaf :: a
SubTree
Fields subtrees :: [LeafTree a]

Instances

Instances details

MonadFail LeafTree Source #
Instance details Defined in Math.Tools.LeafTree Methods fail :: String -> LeafTree a #
Alternative LeafTree Source #
Instance details Defined in Math.Tools.LeafTree Methods empty :: LeafTree a # (<\|>) :: LeafTree a -> LeafTree a -> LeafTree a # some :: LeafTree a -> LeafTree [a] # many :: LeafTree a -> LeafTree [a] #
Applicative LeafTree Source #
Instance details Defined in Math.Tools.LeafTree Methods pure :: a -> LeafTree a # (<>) :: LeafTree (a -> b) -> LeafTree a -> LeafTree b # liftA2 :: (a -> b -> c) -> LeafTree a -> LeafTree b -> LeafTree c # (>) :: LeafTree a -> LeafTree b -> LeafTree b # (<*) :: LeafTree a -> LeafTree b -> LeafTree a #
Functor LeafTree Source #
Instance details Defined in Math.Tools.LeafTree Methods fmap :: (a -> b) -> LeafTree a -> LeafTree b # (<$) :: a -> LeafTree b -> LeafTree a #
Monad LeafTree Source #
Instance details Defined in Math.Tools.LeafTree Methods (>>=) :: LeafTree a -> (a -> LeafTree b) -> LeafTree b # (>>) :: LeafTree a -> LeafTree b -> LeafTree b # return :: a -> LeafTree a #
Monoid a => Monoid (LeafTree a) Source #
Instance details Defined in Math.Tools.LeafTree Methods mempty :: LeafTree a # mappend :: LeafTree a -> LeafTree a -> LeafTree a # mconcat :: [LeafTree a] -> LeafTree a #
Semigroup a => Semigroup (LeafTree a) Source #
Instance details Defined in Math.Tools.LeafTree Methods (<>) :: LeafTree a -> LeafTree a -> LeafTree a # sconcat :: NonEmpty (LeafTree a) -> LeafTree a # stimes :: Integral b => b -> LeafTree a -> LeafTree a #
Show a => Show (LeafTree a) Source #
Instance details Defined in Math.Tools.LeafTree Methods showsPrec :: Int -> LeafTree a -> ShowS # show :: LeafTree a -> String # showList :: [LeafTree a] -> ShowS #
Binary a => Binary (LeafTree a) Source #
Instance details Defined in Math.Tools.LeafTree Methods put :: LeafTree a -> Put # get :: Get (LeafTree a) # putList :: [LeafTree a] -> Put #
Visitor (LeafTree e) Source #
Instance details Defined in Math.Tools.LeafTree Associated Types data Fold (LeafTree e) :: Type -> Type Source # Methods visit :: Fold (LeafTree e) a -> LeafTree e -> a Source #
data Fold (LeafTree e) a Source #
Instance details Defined in Math.Tools.LeafTree data Fold (LeafTree e) a = LeafTreeFold (e -> a) ([a] -> a)

zipWith :: (a -> b -> c) -> LeafTree a -> LeafTree b -> LeafTree c Source #

in_subtree :: Int -> LeafTree a -> LeafTree a Source #

isLeaf :: LeafTree a -> Bool Source #

leavesTreeFold :: Fold (Tree e n) (LeafTree n) Source #