dag 0.1.0.1 → 0.1.0.2

raw patch · 2 files changed

+56/−1 lines, 2 filesPVP ok

version bump matches the API change (PVP)

API changes (from Hackage documentation)

Files

• dag.cabal +2/−1
• src/Data/Graph/DAG/Node.hs +54/−0

@@ -1,5 +1,5 @@ Name:                   dag-Version:                0.1.0.1+Version:                0.1.0.2 Author:                 Athan Clark <athan.clark@gmail.com> Maintainer:             Athan Clark <athan.clark@gmail.com> License:                BSD3@@ -94,6 +94,7 @@   Exposed-Modules:      Data.Graph.DAG                         Data.Graph.DAG.Edge                         Data.Graph.DAG.Edge.Utils+                        Data.Graph.DAG.Node   Build-Depends:        base >= 4.7 && < 5                       , constraints                       , singletons

@@ -0,0 +1,54 @@+module Data.Graph.DAG.Node+        ( NodeSchema+        , nlookup+        , nremove+        , ncombine+        , nadd+        , nempty+        ) where++import Data.Monoid++-- | This is just a simple inductive list+data NodeSchema a = GNil+                  | GCons String a (NodeSchema a)+  deriving (Show, Eq)++instance Functor NodeSchema where+  fmap f GNil = GNil+  fmap f (GCons k x xs) = GCons k (f x) $ fmap f xs++-- | Simple lookup function.+nlookup :: String -> NodeSchema a -> Maybe a+nlookup _ GNil = Nothing+nlookup k1 (GCons k2 x xs) | k1 == k2 = Just x+                           | otherwise = nlookup k1 xs++-- | We overwrite with rightward prescedence.+ncombine :: NodeSchema a -> NodeSchema a -> NodeSchema a+ncombine GNil ys = ys+ncombine (GCons k1 x xs)+         (GCons k2 y ys) | k1 == k2 =+  GCons k1 y $ ncombine xs ys+                         | otherwise =+  GCons k1 x $ GCons k2 y $ ncombine xs ys++-- | Delete a node from a collection of nodes.+nremove :: String -> NodeSchema a -> NodeSchema a+nremove _ GNil = GNil+nremove k1 (GCons k2 x xs) | k1 == k2 = xs+                           | otherwise = nremove k1 xs++-- | Uniquely append, or overwrite a node to a collection of nodes.+nadd :: String -> a -> NodeSchema a -> NodeSchema a+nadd k a GNil = GCons k a GNil+nadd k1 a (GCons k2 x xs) | k1 == k2 = GCons k1 a xs+                          | otherwise = GCons k2 x $ nadd k1 a xs++-- | Smart constructor for @GNil@.+nempty :: NodeSchema a+nempty = GNil++instance Monoid (NodeSchema a) where+  mempty = GNil+  mappend = ncombine