ELynx.Topology.Rooted

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

THIS MODULE IS INCOMPLETE.

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, please see ELynx.Tree.Rooted. Please also see the note about tree traversals therein.

THIS MODULE IS INCOMPLETE.

Data type

data Topology a

Rooted topologies with leaf labels.

Constructors

Node

Fields

• forest :: Forest a

Leaf

Fields

• label :: a

Instances

Monad Topology

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

Defined in ELynx.Topology.Rooted

Methods

fmap :: (a -> b) -> Topology a -> Topology b

(<$) :: a -> Topology b -> Topology a

Applicative Topology

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

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

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)

Defined in ELynx.Topology.Rooted

Methods

(==) :: Topology a -> Topology a -> Bool

(/=) :: Topology a -> Topology a -> Bool

Data a => Data (Topology a)

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)

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)

Defined in ELynx.Topology.Rooted

Methods

showsPrec :: Int -> Topology a -> ShowS

show :: Topology a -> String

showList :: [Topology a] -> ShowS

Generic (Topology a)

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)

Defined in ELynx.Topology.Rooted

Methods

rnf :: Topology a -> ()

ToJSON a => ToJSON (Topology a)

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)

Defined in ELynx.Topology.Rooted

Methods

parseJSON :: Value -> Parser (Topology a)

parseJSONList :: Value -> Parser [Topology a]

type Rep (Topology a)

Defined in ELynx.Topology.Rooted

type Rep (Topology a) = D1 ('MetaData "Topology" "ELynx.Topology.Rooted" "elynx-tree-0.5.0.1-8lHaLcgw2sVHCDcE59DvPG" '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)))

type Forest a = NonEmpty (Topology a)

A shortcut.

fromTree :: Tree a -> Topology a

Convert a rooted rose tree to a rooted topology. Internal node labels are lost.

fromLabeledTree :: Tree e a -> Topology a

Convert a rooted, labeled rose tree to a rooted topology. Branch labels and internal node labels are lost.

Access leaves, branches and labels

leaves :: Topology a -> [a]

Set of leaves.

duplicateLeaves :: Ord a => Topology a -> Bool

Check if a topology has duplicate leaves.

identify :: Traversable t => t a -> t Int

Label the leaves with unique integers starting at 0.

Structure

degree :: Topology a -> Int

The degree of the root node.

prune :: Topology a -> Topology a

Prune degree two nodes.

dropLeavesWith :: (a -> Bool) -> Topology a -> Maybe (Topology a)

Drop leaves satisfying predicate.

Degree two nodes may arise.

Return Nothing if all leaves satisfy the predicate.

zipTreesWith :: (a1 -> a2 -> a) -> Topology a1 -> Topology a2 -> Maybe (Topology a)

Zip leaves of two equal topologies.

Return Nothing if the topologies are different.

zipTrees :: Topology a1 -> Topology a2 -> Maybe (Topology (a1, a2))

Zip leaves of two equal topologies.

Return Nothing if the topologies are different.