| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell2010 |
Data.Graph.DAG.Node
- data NodeSchema a
- nlookup :: String -> NodeSchema a -> Maybe a
- nremove :: String -> NodeSchema a -> NodeSchema a
- ncombine :: NodeSchema a -> NodeSchema a -> NodeSchema a
- nadd :: String -> a -> NodeSchema a -> NodeSchema a
- nempty :: NodeSchema a
Documentation
data NodeSchema a Source
This is just a simple inductive list
Instances
| Functor NodeSchema | |
| Eq a => Eq (NodeSchema a) | |
| Show a => Show (NodeSchema a) | |
| Monoid (NodeSchema a) |
nlookup :: String -> NodeSchema a -> Maybe a Source
Simple lookup function.
nremove :: String -> NodeSchema a -> NodeSchema a Source
Delete a node from a collection of nodes.
ncombine :: NodeSchema a -> NodeSchema a -> NodeSchema a Source
We overwrite with rightward prescedence.
nadd :: String -> a -> NodeSchema a -> NodeSchema a Source
Uniquely append, or overwrite a node to a collection of nodes.
nempty :: NodeSchema a Source
Smart constructor for GNil.