Copyright	(c) Dominik Schrempf 2021
License	GPL-3.0-or-later
Maintainer	dominik.schrempf@gmail.com
Stability	unstable
Portability	portable
Safe Haskell	None
Language	Haskell2010

ELynx.Topology.Rooted

Contents

Data type
Access leaves, branches and labels
Structure

Description

Creation date: Sat Jul 11 10:28:28 2020.

A rooted Topology differs from a classical rooted rose Tree in that it does not have internal node labels. The leaves have labels.

For rooted trees with branch labels, see ELynx.Tree.Rooted.

Synopsis

data Topology a
- = Node {
  - forest :: Forest a
  }
- | Leaf {
  - label :: a
  }
type Forest a = NonEmpty (Topology a)
fromRoseTree :: Tree a -> Topology a
fromBranchLabelTree :: Tree e a -> Topology a
toBranchLabelTreeWith :: e -> a -> Topology a -> Tree e a
leaves :: Topology a -> [a]
duplicateLeaves :: Ord a => Topology a -> Bool
setLeaves :: Traversable t => [b] -> t a -> Maybe (t b)
identify :: Traversable t => t a -> t Int
degree :: Topology a -> Int
depth :: Topology a -> Int
prune :: Topology a -> Topology a
dropLeavesWith :: (a -> Bool) -> Topology a -> Maybe (Topology a)
zipTopologiesWith :: (a1 -> a2 -> a) -> Topology a1 -> Topology a2 -> Maybe (Topology a)
zipTopologies :: Topology a1 -> Topology a2 -> Maybe (Topology (a1, a2))

Data type

data Topology a Source #

Rooted topologies with leaf labels.

Constructors

Node
Fields forest :: Forest a
Leaf
Fields label :: a

Instances

Instances details

Monad Topology Source #
Instance details Defined in ELynx.Topology.Rooted Methods (>>=) :: Topology a -> (a -> Topology b) -> Topology b # (>>) :: Topology a -> Topology b -> Topology b # return :: a -> Topology a #
Functor Topology Source #
Instance details Defined in ELynx.Topology.Rooted Methods fmap :: (a -> b) -> Topology a -> Topology b # (<$) :: a -> Topology b -> Topology a #
Applicative Topology Source #
Instance details Defined in ELynx.Topology.Rooted Methods pure :: a -> Topology a # (<>) :: Topology (a -> b) -> Topology a -> Topology b # liftA2 :: (a -> b -> c) -> Topology a -> Topology b -> Topology c # (>) :: Topology a -> Topology b -> Topology b # (<*) :: Topology a -> Topology b -> Topology a #
Foldable Topology Source #
Instance details Defined in ELynx.Topology.Rooted Methods fold :: Monoid m => Topology m -> m # foldMap :: Monoid m => (a -> m) -> Topology a -> m # foldMap' :: Monoid m => (a -> m) -> Topology a -> m # foldr :: (a -> b -> b) -> b -> Topology a -> b # foldr' :: (a -> b -> b) -> b -> Topology a -> b # foldl :: (b -> a -> b) -> b -> Topology a -> b # foldl' :: (b -> a -> b) -> b -> Topology a -> b # foldr1 :: (a -> a -> a) -> Topology a -> a # foldl1 :: (a -> a -> a) -> Topology a -> a # toList :: Topology a -> [a] # null :: Topology a -> Bool # length :: Topology a -> Int # elem :: Eq a => a -> Topology a -> Bool # maximum :: Ord a => Topology a -> a # minimum :: Ord a => Topology a -> a # sum :: Num a => Topology a -> a # product :: Num a => Topology a -> a #
Traversable Topology Source #
Instance details Defined in ELynx.Topology.Rooted Methods traverse :: Applicative f => (a -> f b) -> Topology a -> f (Topology b) # sequenceA :: Applicative f => Topology (f a) -> f (Topology a) # mapM :: Monad m => (a -> m b) -> Topology a -> m (Topology b) # sequence :: Monad m => Topology (m a) -> m (Topology a) #
Eq a => Eq (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods (==) :: Topology a -> Topology a -> Bool # (/=) :: Topology a -> Topology a -> Bool #
Data a => Data (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Topology a -> c (Topology a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Topology a) # toConstr :: Topology a -> Constr # dataTypeOf :: Topology a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Topology a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Topology a)) # gmapT :: (forall b. Data b => b -> b) -> Topology a -> Topology a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Topology a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Topology a -> r # gmapQ :: (forall d. Data d => d -> u) -> Topology a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Topology a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Topology a -> m (Topology a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Topology a -> m (Topology a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Topology a -> m (Topology a) #
Read a => Read (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods readsPrec :: Int -> ReadS (Topology a) # readList :: ReadS [Topology a] # readPrec :: ReadPrec (Topology a) # readListPrec :: ReadPrec [Topology a] #
Show a => Show (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods showsPrec :: Int -> Topology a -> ShowS # show :: Topology a -> String # showList :: [Topology a] -> ShowS #
Generic (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Associated Types type Rep (Topology a) :: Type -> Type # Methods from :: Topology a -> Rep (Topology a) x # to :: Rep (Topology a) x -> Topology a #
NFData a => NFData (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods rnf :: Topology a -> () #
ToJSON a => ToJSON (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods toJSON :: Topology a -> Value # toEncoding :: Topology a -> Encoding # toJSONList :: [Topology a] -> Value # toEncodingList :: [Topology a] -> Encoding #
FromJSON a => FromJSON (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted Methods parseJSON :: Value -> Parser (Topology a) # parseJSONList :: Value -> Parser [Topology a] #
type Rep (Topology a) Source #
Instance details Defined in ELynx.Topology.Rooted type Rep (Topology a) = D1 ('MetaData "Topology" "ELynx.Topology.Rooted" "elynx-tree-0.6.0.0-FQkEU9t6m33732ommPyIXg" 'False) (C1 ('MetaCons "Node" 'PrefixI 'True) (S1 ('MetaSel ('Just "forest") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Forest a))) :+: C1 ('MetaCons "Leaf" 'PrefixI 'True) (S1 ('MetaSel ('Just "label") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a)))