Hets - the Heterogeneous Tool Set

Copyright(c) Christian Maeder and DFKI GmbH 2009
LicenseGPLv2 or higher, see LICENSE.txt
MaintainerChristian.Maeder@dfki.de
Stabilityprovisional
Portabilitynon-portable(Logic)
Safe HaskellNone

Static.ComputeTheory

Description

compute the theory of a node

Synopsis

Documentation

markFree :: LibEnv -> DGraph -> DGraph

mark all nodes if they have incoming hiding edges. Assume reference nodes to other libraries being properly marked already.

renumberDGLinks :: EdgeId -> EdgeId -> DGraph -> DGraph

iterate all edgeId entries of the dg and increase all that are equal or above the old lId (1st param) so they will be above the desired nextLId (2nd param)