Pandora.Paradigm.Structure.Graph

Documentation

data Graph a

Acyclic graph structure without loops

Instances

Covariant Graph

Defined in Pandora.Paradigm.Structure.Graph

Methods

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

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

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

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

void :: Graph a -> Graph ()

loeb :: Graph (Graph a -> a) -> Graph a

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

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

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

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

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

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

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

Traversable Graph

Defined in Pandora.Paradigm.Structure.Graph

Methods

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

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

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

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

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

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

Composition Graph

Defined in Pandora.Paradigm.Structure.Graph

Associated Types

type Primary Graph a :: Type

Methods

unwrap :: Graph a -> Primary Graph a

type Primary Graph a

Defined in Pandora.Paradigm.Structure.Graph

type Primary Graph a = (Edges :. Twister Edges) > a

loose :: Traversable t => t a -> Graph a

Transform any traversable structure into all loose edges graph