uni-graphs 2.2.0.0 → 2.2.1.0
raw patch · 3 files changed
+14/−13 lines, 3 filesdep ~basePVP: major bump suggested
API removals or changes: PVP suggests a major version bump
Dependency ranges changed: base
API changes (from Hackage documentation)
- Graphs.EmptyGraphSort: instance (ArcTypeConfig arcTypeConfig) => HasConfigValue arcTypeConfig EmptyArcTypeParms
- Graphs.EmptyGraphSort: instance (GraphConfig graphConfig) => HasConfig graphConfig EmptyGraphParms
- Graphs.EmptyGraphSort: instance (NodeTypeConfig nodeTypeConfig) => HasConfigValue nodeTypeConfig EmptyNodeTypeParms
- Graphs.GetAttributes: instance (Read arcType) => Read (ArcAttributes arcType)
- Graphs.GetAttributes: instance (Read nodeType) => Read (NodeAttributes nodeType)
- Graphs.GetAttributes: instance (Show arcType) => Show (ArcAttributes arcType)
- Graphs.GetAttributes: instance (Show nodeType) => Show (NodeAttributes nodeType)
- Graphs.Graph: instance (Show (PartialShow a)) => Show (PartialShow [a])
- Graphs.GraphConfigure: instance [overlap ok] (HasModifyValue NodeArcsHidden graph node) => HasNodeModifies graph node
- Graphs.GraphConfigure: instance [overlap ok] (HasModifyValue option graph object) => HasModifyValue (Maybe option) graph object
- Graphs.GraphDisp: instance (Eq graph) => Eq (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.GraphDisp: instance (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => Destroyable (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.GraphDisp: instance (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => Destructible (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.GraphDisp: instance (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => HasDelayer (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.GraphDisp: instance (Ord graph) => Ord (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.EmptyGraphSort: instance ArcTypeConfig arcTypeConfig => HasConfigValue arcTypeConfig EmptyArcTypeParms
+ Graphs.EmptyGraphSort: instance GraphConfig graphConfig => HasConfig graphConfig EmptyGraphParms
+ Graphs.EmptyGraphSort: instance NodeTypeConfig nodeTypeConfig => HasConfigValue nodeTypeConfig EmptyNodeTypeParms
+ Graphs.GetAttributes: instance Read arcType => Read (ArcAttributes arcType)
+ Graphs.GetAttributes: instance Read nodeType => Read (NodeAttributes nodeType)
+ Graphs.GetAttributes: instance Show arcType => Show (ArcAttributes arcType)
+ Graphs.GetAttributes: instance Show nodeType => Show (NodeAttributes nodeType)
+ Graphs.Graph: instance Show (PartialShow a) => Show (PartialShow [a])
+ Graphs.GraphConfigure: instance [overlap ok] HasModifyValue NodeArcsHidden graph node => HasNodeModifies graph node
+ Graphs.GraphConfigure: instance [overlap ok] HasModifyValue option graph object => HasModifyValue (Maybe option) graph object
+ Graphs.GraphDisp: instance Eq graph => Eq (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.GraphDisp: instance GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => Destroyable (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.GraphDisp: instance GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => Destructible (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.GraphDisp: instance GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => HasDelayer (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.GraphDisp: instance Ord graph => Ord (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.FindCycle: findCycle :: (Ord a) => [a] -> (a -> [a]) -> Maybe [a]
+ Graphs.FindCycle: findCycle :: Ord a => [a] -> (a -> [a]) -> Maybe [a]
- Graphs.GetAncestors: getAncestors :: (Graph graph) => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
+ Graphs.GetAncestors: getAncestors :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
- Graphs.GetAncestors: getAncestorsGeneric :: (Ord node) => Bool -> (node -> IO [node]) -> (node -> IO Bool) -> node -> IO [node]
+ Graphs.GetAncestors: getAncestorsGeneric :: Ord node => Bool -> (node -> IO [node]) -> (node -> IO Bool) -> node -> IO [node]
- Graphs.GetAncestors: getAncestorsPure :: (Ord node) => (node -> [node]) -> node -> [node]
+ Graphs.GetAncestors: getAncestorsPure :: Ord node => (node -> [node]) -> node -> [node]
- Graphs.GetAncestors: getDescendants :: (Graph graph) => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
+ Graphs.GetAncestors: getDescendants :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
- Graphs.GetAncestors: isAncestorPure :: (Ord node) => (node -> [node]) -> node -> node -> Bool
+ Graphs.GetAncestors: isAncestorPure :: Ord node => (node -> [node]) -> node -> node -> Bool
- Graphs.Graph: getArcLabel :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO arcLabel
+ Graphs.Graph: getArcLabel :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO arcLabel
- Graphs.Graph: getArcType :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO ArcType
+ Graphs.Graph: getArcType :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO ArcType
- Graphs.Graph: getArcTypeLabel :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> ArcType -> IO arcTypeLabel
+ Graphs.Graph: getArcTypeLabel :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> ArcType -> IO arcTypeLabel
- Graphs.Graph: getArcTypes :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [ArcType]
+ Graphs.Graph: getArcTypes :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [ArcType]
- Graphs.Graph: getArcs :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [Arc]
+ Graphs.Graph: getArcs :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [Arc]
- Graphs.Graph: getArcsIn :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO [Arc]
+ Graphs.Graph: getArcsIn :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO [Arc]
- Graphs.Graph: getArcsOut :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO [Arc]
+ Graphs.Graph: getArcsOut :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO [Arc]
- Graphs.Graph: getNodeLabel :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO nodeLabel
+ Graphs.Graph: getNodeLabel :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO nodeLabel
- Graphs.Graph: getNodeType :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO NodeType
+ Graphs.Graph: getNodeType :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> IO NodeType
- Graphs.Graph: getNodeTypeLabel :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> NodeType -> IO nodeTypeLabel
+ Graphs.Graph: getNodeTypeLabel :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> NodeType -> IO nodeTypeLabel
- Graphs.Graph: getNodeTypes :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [NodeType]
+ Graphs.Graph: getNodeTypes :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [NodeType]
- Graphs.Graph: getNodes :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [Node]
+ Graphs.Graph: getNodes :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO [Node]
- Graphs.Graph: getSource :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO Node
+ Graphs.Graph: getSource :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO Node
- Graphs.Graph: getTarget :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO Node
+ Graphs.Graph: getTarget :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Arc -> IO Node
- Graphs.Graph: newArc :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> ArcType -> arcLabel -> Node -> Node -> IO Arc
+ Graphs.Graph: newArc :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> ArcType -> arcLabel -> Node -> Node -> IO Arc
- Graphs.Graph: newArcType :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> arcTypeLabel -> IO ArcType
+ Graphs.Graph: newArcType :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> arcTypeLabel -> IO ArcType
- Graphs.Graph: newEmptyGraph :: (Graph graph) => IO (graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel)
+ Graphs.Graph: newEmptyGraph :: Graph graph => IO (graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel)
- Graphs.Graph: newGraph :: (Graph graph) => GraphConnection nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO (graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel)
+ Graphs.Graph: newGraph :: Graph graph => GraphConnection nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO (graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel)
- Graphs.Graph: newNode :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> NodeType -> nodeLabel -> IO Node
+ Graphs.Graph: newNode :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> NodeType -> nodeLabel -> IO Node
- Graphs.Graph: newNodeType :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> nodeTypeLabel -> IO NodeType
+ Graphs.Graph: newNodeType :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> nodeTypeLabel -> IO NodeType
- Graphs.Graph: shareGraph :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> GraphConnection nodeLabel nodeTypeLabel arcLabel arcTypeLabel
+ Graphs.Graph: shareGraph :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> GraphConnection nodeLabel nodeTypeLabel arcLabel arcTypeLabel
- Graphs.Graph: update :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Update nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO ()
+ Graphs.Graph: update :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Update nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> IO ()
- Graphs.GraphConfigure: ($$) :: (HasConfig option configuration) => option -> configuration -> configuration
+ Graphs.GraphConfigure: ($$) :: HasConfig option configuration => option -> configuration -> configuration
- Graphs.GraphConfigure: class (HasModifyValue NodeArcsHidden graph node) => HasNodeModifies graph node
+ Graphs.GraphConfigure: class HasModifyValue NodeArcsHidden graph node => HasNodeModifies graph node
- Graphs.GraphConfigure: configUsed :: (HasConfig option configuration) => option -> configuration -> Bool
+ Graphs.GraphConfigure: configUsed :: HasConfig option configuration => option -> configuration -> Bool
- Graphs.GraphConfigure: def :: (ModifyHasDef modification) => modification
+ Graphs.GraphConfigure: def :: ModifyHasDef modification => modification
- Graphs.GraphConfigure: isDef :: (ModifyHasDef modification) => modification -> Bool
+ Graphs.GraphConfigure: isDef :: ModifyHasDef modification => modification -> Bool
- Graphs.GraphConfigure: mapMMenuPrim :: (Monad m) => (a -> m b) -> MenuPrim c a -> m (MenuPrim c b)
+ Graphs.GraphConfigure: mapMMenuPrim :: Monad m => (a -> m b) -> MenuPrim c a -> m (MenuPrim c b)
- Graphs.GraphConfigure: mapMMenuPrim' :: (Monad m) => (c -> m d) -> MenuPrim c a -> m (MenuPrim d a)
+ Graphs.GraphConfigure: mapMMenuPrim' :: Monad m => (c -> m d) -> MenuPrim c a -> m (MenuPrim d a)
- Graphs.GraphDisp: class (Kind1 arcTypeConfig) => ArcTypeConfig arcTypeConfig
+ Graphs.GraphDisp: class Kind1 arcTypeConfig => ArcTypeConfig arcTypeConfig
- Graphs.GraphDisp: class (Typeable1 nodeType) => NodeTypeClass nodeType
+ Graphs.GraphDisp: class Typeable1 nodeType => NodeTypeClass nodeType
- Graphs.GraphDisp: class (Kind1 nodeTypeConfig) => NodeTypeConfig nodeTypeConfig
+ Graphs.GraphDisp: class Kind1 nodeTypeConfig => NodeTypeConfig nodeTypeConfig
- Graphs.GraphDisp: class (Eq1 takesParm) => Ord1 takesParm
+ Graphs.GraphDisp: class Eq1 takesParm => Ord1 takesParm
- Graphs.GraphDisp: compare1 :: (Ord1 takesParm) => takesParm value1 -> takesParm value1 -> Ordering
+ Graphs.GraphDisp: compare1 :: Ord1 takesParm => takesParm value1 -> takesParm value1 -> Ordering
- Graphs.GraphDisp: displaySort :: (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms
+ Graphs.GraphDisp: displaySort :: GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms
- Graphs.GraphDisp: emptyGraphParms :: (GraphParms graphParms) => graphParms
+ Graphs.GraphDisp: emptyGraphParms :: GraphParms graphParms => graphParms
- Graphs.GraphDisp: eq1 :: (Eq1 takesParm) => takesParm value1 -> takesParm value1 -> Bool
+ Graphs.GraphDisp: eq1 :: Eq1 takesParm => takesParm value1 -> takesParm value1 -> Bool
- Graphs.GraphDisp: getMultipleNodes :: (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> (Event (WrappedNode node) -> IO a) -> IO a
+ Graphs.GraphDisp: getMultipleNodes :: GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> (Event (WrappedNode node) -> IO a) -> IO a
- Graphs.GraphDisp: getMultipleNodesPrim :: (DeleteNode graph node) => graph -> (Event (WrappedNode node) -> IO a) -> IO a
+ Graphs.GraphDisp: getMultipleNodesPrim :: DeleteNode graph node => graph -> (Event (WrappedNode node) -> IO a) -> IO a
- Graphs.GraphDisp: newGraph :: (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> graphParms -> IO (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
+ Graphs.GraphDisp: newGraph :: GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> graphParms -> IO (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms)
- Graphs.GraphDisp: newGraphPrim :: (NewGraph graph graphParms) => graphParms -> IO graph
+ Graphs.GraphDisp: newGraphPrim :: NewGraph graph graphParms => graphParms -> IO graph
- Graphs.GraphDisp: newtype (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms
+ Graphs.GraphDisp: newtype GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms
- Graphs.GraphDisp: redraw :: (GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> IO ()
+ Graphs.GraphDisp: redraw :: GraphAll graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms => (Graph graph graphParms node nodeType nodeTypeParms arc arcType arcTypeParms) -> IO ()
- Graphs.GraphDisp: redrawPrim :: (GraphClass graph) => graph -> IO ()
+ Graphs.GraphDisp: redrawPrim :: GraphClass graph => graph -> IO ()
- Graphs.GraphOps: isAncestor :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> Node -> IO Bool
+ Graphs.GraphOps: isAncestor :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> Node -> Node -> IO Bool
- Graphs.GraphOps: isAncestorBy :: (Ord key) => (key -> IO [key]) -> key -> key -> IO Bool
+ Graphs.GraphOps: isAncestorBy :: Ord key => (key -> IO [key]) -> key -> key -> IO Bool
- Graphs.PureGraph: addNode :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> nodeInfo -> [(arcInfo, nodeInfo)] -> PureGraph nodeInfo arcInfo
+ Graphs.PureGraph: addNode :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> nodeInfo -> [(arcInfo, nodeInfo)] -> PureGraph nodeInfo arcInfo
- Graphs.PureGraph: deleteNode :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> nodeInfo -> PureGraph nodeInfo arcInfo
+ Graphs.PureGraph: deleteNode :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> nodeInfo -> PureGraph nodeInfo arcInfo
- Graphs.PureGraph: emptyPureGraph :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo
+ Graphs.PureGraph: emptyPureGraph :: Ord nodeInfo => PureGraph nodeInfo arcInfo
- Graphs.PureGraph: nodeExists :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> nodeInfo -> Bool
+ Graphs.PureGraph: nodeExists :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> nodeInfo -> Bool
- Graphs.PureGraph: toAllNodes :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> [nodeInfo]
+ Graphs.PureGraph: toAllNodes :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> [nodeInfo]
- Graphs.PureGraph: toNodeParents :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> nodeInfo -> Maybe [nodeInfo]
+ Graphs.PureGraph: toNodeParents :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> nodeInfo -> Maybe [nodeInfo]
- Graphs.PureGraphMakeConsistent: pureGraphMakeConsistent :: (Ord nodeInfo) => PureGraph nodeInfo arcInfo -> PureGraph nodeInfo arcInfo
+ Graphs.PureGraphMakeConsistent: pureGraphMakeConsistent :: Ord nodeInfo => PureGraph nodeInfo arcInfo -> PureGraph nodeInfo arcInfo
- Graphs.RemoveAncestors: removeAncestors :: (Graph graph) => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> [Node] -> IO [Node]
+ Graphs.RemoveAncestors: removeAncestors :: Graph graph => graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> [Node] -> IO [Node]
- Graphs.RemoveAncestors: removeAncestorsByPure :: (Ord node) => (node -> [node]) -> [node] -> [node]
+ Graphs.RemoveAncestors: removeAncestorsByPure :: Ord node => (node -> [node]) -> [node] -> [node]
- Graphs.TopSort: topSort :: (Ord a) => [(a, a)] -> [a]
+ Graphs.TopSort: topSort :: Ord a => [(a, a)] -> [a]
- Graphs.TopSort: topSort1 :: (Ord a) => [(a, a)] -> [a] -> [a]
+ Graphs.TopSort: topSort1 :: Ord a => [(a, a)] -> [a] -> [a]
- Graphs.VersionDag: deleteVersion :: (Ord nodeKey) => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO ()
+ Graphs.VersionDag: deleteVersion :: Ord nodeKey => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO ()
- Graphs.VersionDag: getNodeInfos :: (Ord nodeKey) => VersionDag nodeKey nodeInfo arcInfo -> IO [nodeInfo]
+ Graphs.VersionDag: getNodeInfos :: Ord nodeKey => VersionDag nodeKey nodeInfo arcInfo -> IO [nodeInfo]
- Graphs.VersionDag: lookupNodeKey :: (Ord nodeKey) => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO (Maybe nodeInfo)
+ Graphs.VersionDag: lookupNodeKey :: Ord nodeKey => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO (Maybe nodeInfo)
- Graphs.VersionDag: nodeKeyExists :: (Ord nodeKey) => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO Bool
+ Graphs.VersionDag: nodeKeyExists :: Ord nodeKey => VersionDag nodeKey nodeInfo arcInfo -> nodeKey -> IO Bool
Files
- Graphs/GetAttributes.hs +7/−4
- Graphs/SimpleGraph.hs +3/−2
- uni-graphs.cabal +4/−7
Graphs/GetAttributes.hs view
@@ -15,7 +15,7 @@ displayError, -- :: String -> IO () ) where -import Control.Exception+import Control.Exception as Exception import Util.Dynamics import Util.Registry hiding (getValue)@@ -256,15 +256,18 @@ newtype CancelException = CancelException () deriving (Typeable) cancelQuery :: IO anything-cancelQuery = throwDyn (CancelException ())+cancelQuery = throw $ toDyn (CancelException ()) allowCancel :: IO a -> IO (Maybe a) allowCancel action =- catchDyn+ Exception.catchJust+ (\ e -> case fromDynamic e of+ Just (CancelException ()) -> return $ Just ()+ _ -> return Nothing) (do result <- action return (Just result) )- (\ (CancelException ()) -> return Nothing)+ (\ _ -> return Nothing)
Graphs/SimpleGraph.hs view
@@ -42,7 +42,7 @@ import Data.List(delete) import Control.Concurrent-import Control.Exception(try)+import Control.Exception import Util.Computation (done) import Util.Object@@ -341,7 +341,8 @@ (clientSink clientData update) case result of Left exception ->- putStrLn ("Client error "++(show exception))+ putStrLn ("Client error " +++ show (exception :: SomeException)) Right () -> done else done
uni-graphs.cabal view
@@ -1,5 +1,5 @@ name: uni-graphs-version: 2.2.0.0+version: 2.2.1.0 build-type: Simple license: LGPL license-file: LICENSE@@ -10,7 +10,7 @@ synopsis: Graphs description: Graphs toolkit cabal-version: >= 1.4-Tested-With: GHC==6.8.3, GHC==6.10.4, GHC==6.12.3+Tested-With: GHC==6.10.4, GHC==6.12.3 flag debug description: add debug traces@@ -25,13 +25,10 @@ Graphs.EmptyGraphSort, Graphs.PureGraph, Graphs.PureGraphPrune, Graphs.PureGraphToGraph, Graphs.VersionDag, Graphs.PureGraphMakeConsistent - build-depends: base >=3 && < 4, containers, mtl, uni-util, uni-events,+ build-depends: base >=4 && < 5, containers, mtl, uni-util, uni-events, uni-reactor, uni-htk if flag(debug) cpp-options: -DDEBUG - if impl(ghc < 6.10)- extensions: PatternSignatures- else- ghc-options: -fwarn-unused-imports -fno-warn-warnings-deprecations+ ghc-options: -fwarn-unused-imports -fno-warn-warnings-deprecations