pandora-0.2.2: A box of patterns and paradigms

Safe HaskellSafe
LanguageHaskell2010

Pandora.Paradigm.Structure.Specific.Graph

Synopsis

Documentation

data Graph a Source #

Acyclic graph structure without loops

Instances
Interpreted Graph Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

Associated Types

type Primary Graph a :: Type Source #

Methods

unwrap :: Graph a -> Primary Graph a Source #

Covariant Graph Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

Methods

(<$>) :: (a -> b) -> Graph a -> Graph b Source #

comap :: (a -> b) -> Graph a -> Graph b Source #

(<$) :: a -> Graph b -> Graph a Source #

($>) :: Graph a -> b -> Graph b Source #

void :: Graph a -> Graph () Source #

loeb :: Graph (a <-| Graph) -> Graph a Source #

(<&>) :: Graph a -> (a -> b) -> Graph b Source #

(<$$>) :: Covariant u => (a -> b) -> ((Graph :. u) := a) -> (Graph :. u) := b Source #

(<$$$>) :: (Covariant u, Covariant v) => (a -> b) -> ((Graph :. (u :. v)) := a) -> (Graph :. (u :. v)) := b Source #

(<$$$$>) :: (Covariant u, Covariant v, Covariant w) => (a -> b) -> ((Graph :. (u :. (v :. w))) := a) -> (Graph :. (u :. (v :. w))) := b Source #

(<&&>) :: Covariant u => ((Graph :. u) := a) -> (a -> b) -> (Graph :. u) := b Source #

(<&&&>) :: (Covariant u, Covariant v) => ((Graph :. (u :. v)) := a) -> (a -> b) -> (Graph :. (u :. v)) := b Source #

(<&&&&>) :: (Covariant u, Covariant v, Covariant w) => ((Graph :. (u :. (v :. w))) := a) -> (a -> b) -> (Graph :. (u :. (v :. w))) := b Source #

Traversable Graph Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

Methods

(->>) :: (Pointable u, Applicative u) => Graph a -> (a -> u b) -> (u :. Graph) := b Source #

traverse :: (Pointable u, Applicative u) => (a -> u b) -> Graph a -> (u :. Graph) := b Source #

sequence :: (Pointable u, Applicative u) => ((Graph :. u) := a) -> (u :. Graph) := a Source #

(->>>) :: (Pointable u, Applicative u, Traversable v) => ((v :. Graph) := a) -> (a -> u b) -> (u :. (v :. Graph)) := b Source #

(->>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w) => ((w :. (v :. Graph)) := a) -> (a -> u b) -> (u :. (w :. (v :. Graph))) := b Source #

(->>>>>) :: (Pointable u, Applicative u, Traversable v, Traversable w, Traversable j) => ((j :. (w :. (v :. Graph))) := a) -> (a -> u b) -> (u :. (j :. (w :. (v :. Graph)))) := b Source #

type Primary Graph a Source # 
Instance details

Defined in Pandora.Paradigm.Structure.Specific.Graph

loose :: Traversable t => t ~> Graph Source #

Transform any traversable structure into all loose edges graph