|
Module Simantics/RouteGraphThis module is undocumented. This is a list of its definitions. CANBEMADELEGAL :: ConnectionJudgementType The connection points may not be connected as they are, but the connection would become legal if more connection points were added to it. ConnectionPoint :: String -> String -> ConnectorIdentification CreateLine :: Double -> Boolean -> RouteGraphModification CreateLink :: Integer -> Integer -> RouteGraphModification Element :: String -> ConnectorIdentification ILLEGAL :: ConnectionJudgementType The connection points may not be connected to each other. LEGAL :: ConnectionJudgementType The connection points may be connected as they are. RemoveLink :: Integer -> Integer -> RouteGraphModification RemoveNode :: Integer -> RouteGraphModification RouteGraphStructure :: Resource -> [ConnectorIdentification] -> Integer -> [Integer] -> RouteGraphStructure UpdateLine :: Integer -> Double -> Boolean -> RouteGraphModification canTerminalBeConnected :: Resource -> Resource -> Resource -> <ReadGraph,Proc> Boolean
Returns getModelingRules :: Resource -> <ReadGraph,Proc> Maybe IModelingRules Returns the modeling rules of the given diagram resource, or judgeConnection :: IModelingRules -> [IConnectionPoint] -> <ReadGraph,Proc> ConnectionJudgement
Tells whether the given connection points may be connected to each other under the given modeling rules and what the type of the connection would be. makeIConnectionPoint :: Resource -> Resource -> <Proc> IConnectionPoint
Returns the connection point that consists of the given component and the given terminal relation of it, for use with judgeConnection. matchRouteGraph :: [Resource] -> Integer -> [Integer] -> <ReadGraph> Maybe [Resource]
Resolves the route nodes of one connection. The nodes are numbered so that
the given modifyRouteGraph :: RouteGraphStructure -> [RouteGraphModification] -> <Proc,WriteGraph> [Resource]
Resolves the connection that |