mirror of
https://github.com/anoma/juvix.git
synced 2024-12-12 14:28:08 +03:00
Sort the identifiers topologically in the Core-to-GEB translation (#1854)
This commit is contained in:
Łukasz Czajka
GitHub
parent
5d2dacf3bd
commit
26424b1338
@ -57,8 +57,9 @@ fromCore :: Core.InfoTable -> (Morphism, Object)
|
||||
fromCore tab = case tab ^. Core.infoMain of
|
||||
Just sym ->
|
||||
let node = fromJust $ HashMap.lookup sym (tab ^. Core.identContext)
|
||||
idents = HashMap.delete sym (tab ^. Core.infoIdentifiers)
|
||||
morph = run (runReader emptyEnv (goIdents node (HashMap.elems idents)))
|
||||
syms = reverse $ filter (/= sym) $ Core.createIdentDependencyInfo tab ^. Core.depInfoTopSort
|
||||
idents = map (\s -> fromJust $ HashMap.lookup s (tab ^. Core.infoIdentifiers)) syms
|
||||
morph = run (runReader emptyEnv (goIdents node idents))
|
||||
obj = convertType (Info.getNodeType node)
|
||||
in (morph, obj)
|
||||
Nothing ->
|
||||
|
||||
@ -1,216 +1,8 @@
|
||||
module Juvix.Compiler.Core.Extra
|
||||
( module Juvix.Compiler.Core.Extra,
|
||||
module Juvix.Compiler.Core.Extra.Base,
|
||||
module Juvix.Compiler.Core.Extra.Recursors,
|
||||
module Juvix.Compiler.Core.Extra.Info,
|
||||
module Juvix.Compiler.Core.Extra.Equality,
|
||||
module Juvix.Compiler.Core.Extra.Recursors.Fold.Named,
|
||||
module Juvix.Compiler.Core.Extra.Recursors.Map.Named,
|
||||
( module Juvix.Compiler.Core.Extra.Utils,
|
||||
module Juvix.Compiler.Core.Extra.IdentDependencyInfo,
|
||||
)
|
||||
where
|
||||
|
||||
import Data.HashMap.Strict qualified as HashMap
|
||||
import Data.HashSet qualified as HashSet
|
||||
import Data.Set qualified as Set
|
||||
import Juvix.Compiler.Core.Data.BinderList qualified as BL
|
||||
import Juvix.Compiler.Core.Data.InfoTable
|
||||
import Juvix.Compiler.Core.Extra.Base
|
||||
import Juvix.Compiler.Core.Extra.Equality
|
||||
import Juvix.Compiler.Core.Extra.Info
|
||||
import Juvix.Compiler.Core.Extra.Recursors
|
||||
import Juvix.Compiler.Core.Extra.Recursors.Fold.Named
|
||||
import Juvix.Compiler.Core.Extra.Recursors.Map.Named
|
||||
import Juvix.Compiler.Core.Info.TypeInfo
|
||||
import Juvix.Compiler.Core.Language
|
||||
|
||||
isClosed :: Node -> Bool
|
||||
isClosed = not . has freeVars
|
||||
|
||||
freeVarsSorted :: Node -> Set Var
|
||||
freeVarsSorted n = Set.fromList (n ^.. freeVars)
|
||||
|
||||
freeVarsSet :: Node -> HashSet Var
|
||||
freeVarsSet n = HashSet.fromList (n ^.. freeVars)
|
||||
|
||||
freeVars :: SimpleFold Node Var
|
||||
freeVars f = ufoldNA reassemble go
|
||||
where
|
||||
go k = \case
|
||||
NVar var@(Var _ idx)
|
||||
| idx >= k -> NVar <$> f (shiftVar (-k) var)
|
||||
n -> pure n
|
||||
|
||||
getIdents :: Node -> HashSet Ident
|
||||
getIdents n = HashSet.fromList (n ^.. nodeIdents)
|
||||
|
||||
nodeIdents :: Traversal' Node Ident
|
||||
nodeIdents f = ufoldA reassemble go
|
||||
where
|
||||
go = \case
|
||||
NIdt i -> NIdt <$> f i
|
||||
n -> pure n
|
||||
|
||||
countFreeVarOccurrences :: Index -> Node -> Int
|
||||
countFreeVarOccurrences idx = gatherN go 0
|
||||
where
|
||||
go k acc = \case
|
||||
NVar (Var _ idx') | idx' == idx + k -> acc + 1
|
||||
_ -> acc
|
||||
|
||||
shiftVar :: Index -> Var -> Var
|
||||
shiftVar m = over varIndex (+ m)
|
||||
|
||||
-- | increase all free variable indices by a given value
|
||||
shift :: Index -> Node -> Node
|
||||
shift 0 = id
|
||||
shift m = umapN go
|
||||
where
|
||||
go k = \case
|
||||
NVar v
|
||||
| v ^. varIndex >= k -> NVar (shiftVar m v)
|
||||
n -> n
|
||||
|
||||
-- | Prism for NRec
|
||||
_NRec :: SimpleFold Node LetRec
|
||||
_NRec f = \case
|
||||
NRec l -> NRec <$> f l
|
||||
n -> pure n
|
||||
|
||||
-- | Prism for NLam
|
||||
_NLam :: SimpleFold Node Lambda
|
||||
_NLam f = \case
|
||||
NLam l -> NLam <$> f l
|
||||
n -> pure n
|
||||
|
||||
-- | Fold over all of the transitive descendants of a Node, including itself.
|
||||
cosmos :: SimpleFold Node Node
|
||||
cosmos f = ufoldA reassemble f
|
||||
|
||||
-- | The list should not contain repeated indices.
|
||||
-- if fv = x1, x2, .., xn
|
||||
-- the result is of the form λx1 λx2 .. λ xn b
|
||||
captureFreeVars :: [(Index, Binder)] -> Node -> Node
|
||||
captureFreeVars fv
|
||||
| n == 0 = id
|
||||
| otherwise = mkLambdasB infos . mapFreeVars
|
||||
where
|
||||
(indices, infos) = unzip fv
|
||||
n = length fv
|
||||
s :: HashMap Index Index
|
||||
s = HashMap.fromList (zip (reverse indices) [0 ..])
|
||||
mapFreeVars :: Node -> Node
|
||||
mapFreeVars = dmapN go
|
||||
where
|
||||
go :: Index -> Node -> Node
|
||||
go k = \case
|
||||
NVar (Var i u)
|
||||
| Just v <- s ^. at (u - k) -> NVar (Var i (v + k))
|
||||
m -> m
|
||||
|
||||
-- captures all free variables of a node. It also returns the list of captured
|
||||
-- variables in left-to-right order: if snd is of the form λxλy... then fst is
|
||||
-- [x, y]
|
||||
captureFreeVarsCtx :: BinderList Binder -> Node -> ([(Var, Binder)], Node)
|
||||
captureFreeVarsCtx bl n =
|
||||
let assocs = freeVarsCtx bl n
|
||||
in (assocs, captureFreeVars (map (first (^. varIndex)) assocs) n)
|
||||
|
||||
freeVarsCtx' :: BinderList Binder -> Node -> [Var]
|
||||
freeVarsCtx' bl = map fst . freeVarsCtx bl
|
||||
|
||||
-- | the output list does not contain repeated elements and is sorted by *decreasing* variable index.
|
||||
-- The indices are relative to the given binder list
|
||||
freeVarsCtx :: BinderList Binder -> Node -> [(Var, Binder)]
|
||||
freeVarsCtx ctx n =
|
||||
BL.lookupsSortedRev ctx . run . fmap fst . runOutputList $ go (freeVarsSorted n)
|
||||
where
|
||||
go ::
|
||||
-- set of free variables relative to the original ctx
|
||||
Set Var ->
|
||||
Sem '[Output Var] ()
|
||||
go fv = case Set.minView fv of
|
||||
Nothing -> return ()
|
||||
Just (v, vs) -> do
|
||||
output v
|
||||
let idx = v ^. varIndex
|
||||
bi = BL.lookup idx ctx
|
||||
freevarsbi' :: Set Var
|
||||
freevarsbi' = Set.mapMonotonic (over varIndex (+ (idx + 1))) (freeVarsSorted (bi ^. binderType))
|
||||
go (freevarsbi' <> vs)
|
||||
|
||||
-- | subst for multiple bindings
|
||||
substs :: [Node] -> Node -> Node
|
||||
substs t = umapN go
|
||||
where
|
||||
len = length t
|
||||
go k n = case n of
|
||||
NVar (Var i idx)
|
||||
| idx >= k, idx - k < len -> shift k (t !! (idx - k))
|
||||
| idx > k -> mkVar i (idx - len)
|
||||
_ -> n
|
||||
|
||||
-- | substitute a term t for the free variable with de Bruijn index 0, avoiding
|
||||
-- variable capture; shifts all free variabes with de Bruijn index > 0 by -1 (as
|
||||
-- if the topmost binder was removed)
|
||||
subst :: Node -> Node -> Node
|
||||
subst t = substs [t]
|
||||
|
||||
-- | reduce all beta redexes present in a term and the ones created immediately
|
||||
-- downwards (i.e., a "beta-development")
|
||||
developBeta :: Node -> Node
|
||||
developBeta = umap go
|
||||
where
|
||||
go :: Node -> Node
|
||||
go n = case n of
|
||||
NApp (App _ (NLam (Lambda {..})) arg) -> subst arg _lambdaBody
|
||||
_ -> n
|
||||
|
||||
etaExpand :: Int -> Node -> Node
|
||||
etaExpand 0 n = n
|
||||
etaExpand k n = mkLambdas' k (mkApps' (shift k n) (map mkVar' (reverse [0 .. k - 1])))
|
||||
|
||||
-- | substitution of all free variables for values in an environment
|
||||
substEnv :: Env -> Node -> Node
|
||||
substEnv env
|
||||
| null env = id
|
||||
| otherwise = umapN go
|
||||
where
|
||||
go k n = case n of
|
||||
NVar (Var _ idx)
|
||||
| idx >= k -> env !! (idx - k)
|
||||
_ -> n
|
||||
|
||||
convertClosures :: Node -> Node
|
||||
convertClosures = umap go
|
||||
where
|
||||
go :: Node -> Node
|
||||
go n = case n of
|
||||
Closure env (Lambda i bi b) -> substEnv env (mkLambda i bi b)
|
||||
_ -> n
|
||||
|
||||
convertRuntimeNodes :: Node -> Node
|
||||
convertRuntimeNodes = convertClosures
|
||||
|
||||
argumentInfoFromBinder :: Binder -> ArgumentInfo
|
||||
argumentInfoFromBinder i =
|
||||
ArgumentInfo
|
||||
{ _argumentName = i ^. binderName,
|
||||
_argumentLocation = i ^. binderLocation,
|
||||
_argumentType = i ^. binderType,
|
||||
_argumentIsImplicit = Explicit
|
||||
}
|
||||
|
||||
patternBinders :: SimpleFold Pattern PatternBinder
|
||||
patternBinders f p = case p of
|
||||
PatWildcard {} -> pure p
|
||||
PatConstr c -> traverseOf patternConstrArgs (traverse (patternBinders f)) c $> p
|
||||
PatBinder b -> f b $> p
|
||||
|
||||
patternBindersNum :: Pattern -> Int
|
||||
patternBindersNum = length . (^.. patternBinders)
|
||||
|
||||
patternType :: Pattern -> Node
|
||||
patternType = \case
|
||||
PatWildcard w -> getInfoType (w ^. patternWildcardInfo)
|
||||
PatBinder b -> b ^. patternBinder . binderType
|
||||
PatConstr c -> getInfoType (c ^. patternConstrInfo)
|
||||
import Juvix.Compiler.Core.Extra.IdentDependencyInfo
|
||||
import Juvix.Compiler.Core.Extra.Utils
|
||||
|
||||
27
src/Juvix/Compiler/Core/Extra/IdentDependencyInfo.hs
Normal file
27
src/Juvix/Compiler/Core/Extra/IdentDependencyInfo.hs
Normal file
@ -0,0 +1,27 @@
|
||||
module Juvix.Compiler.Core.Extra.IdentDependencyInfo where
|
||||
|
||||
import Data.HashMap.Strict qualified as HashMap
|
||||
import Data.HashSet qualified as HashSet
|
||||
import Juvix.Compiler.Core.Data.InfoTable
|
||||
import Juvix.Compiler.Core.Extra.Utils
|
||||
import Juvix.Compiler.Core.Language
|
||||
|
||||
type IdentDependencyInfo = DependencyInfo Symbol
|
||||
|
||||
createIdentDependencyInfo :: InfoTable -> IdentDependencyInfo
|
||||
createIdentDependencyInfo tab = createDependencyInfo graph startVertices
|
||||
where
|
||||
graph :: HashMap Symbol (HashSet Symbol)
|
||||
graph =
|
||||
fmap
|
||||
( \IdentifierInfo {..} ->
|
||||
HashSet.map (\Ident {..} -> _identSymbol) $
|
||||
getIdents (fromJust $ HashMap.lookup _identifierSymbol (tab ^. identContext))
|
||||
)
|
||||
(tab ^. infoIdentifiers)
|
||||
|
||||
startVertices :: HashSet Symbol
|
||||
startVertices = HashSet.fromList syms
|
||||
|
||||
syms :: [Symbol]
|
||||
syms = map (^. identifierSymbol) (HashMap.elems (tab ^. infoIdentifiers))
|
||||
216
src/Juvix/Compiler/Core/Extra/Utils.hs
Normal file
216
src/Juvix/Compiler/Core/Extra/Utils.hs
Normal file
@ -0,0 +1,216 @@
|
||||
module Juvix.Compiler.Core.Extra.Utils
|
||||
( module Juvix.Compiler.Core.Extra.Utils,
|
||||
module Juvix.Compiler.Core.Extra.Base,
|
||||
module Juvix.Compiler.Core.Extra.Recursors,
|
||||
module Juvix.Compiler.Core.Extra.Info,
|
||||
module Juvix.Compiler.Core.Extra.Equality,
|
||||
module Juvix.Compiler.Core.Extra.Recursors.Fold.Named,
|
||||
module Juvix.Compiler.Core.Extra.Recursors.Map.Named,
|
||||
)
|
||||
where
|
||||
|
||||
import Data.HashMap.Strict qualified as HashMap
|
||||
import Data.HashSet qualified as HashSet
|
||||
import Data.Set qualified as Set
|
||||
import Juvix.Compiler.Core.Data.BinderList qualified as BL
|
||||
import Juvix.Compiler.Core.Data.InfoTable
|
||||
import Juvix.Compiler.Core.Extra.Base
|
||||
import Juvix.Compiler.Core.Extra.Equality
|
||||
import Juvix.Compiler.Core.Extra.Info
|
||||
import Juvix.Compiler.Core.Extra.Recursors
|
||||
import Juvix.Compiler.Core.Extra.Recursors.Fold.Named
|
||||
import Juvix.Compiler.Core.Extra.Recursors.Map.Named
|
||||
import Juvix.Compiler.Core.Info.TypeInfo
|
||||
import Juvix.Compiler.Core.Language
|
||||
|
||||
isClosed :: Node -> Bool
|
||||
isClosed = not . has freeVars
|
||||
|
||||
freeVarsSorted :: Node -> Set Var
|
||||
freeVarsSorted n = Set.fromList (n ^.. freeVars)
|
||||
|
||||
freeVarsSet :: Node -> HashSet Var
|
||||
freeVarsSet n = HashSet.fromList (n ^.. freeVars)
|
||||
|
||||
freeVars :: SimpleFold Node Var
|
||||
freeVars f = ufoldNA reassemble go
|
||||
where
|
||||
go k = \case
|
||||
NVar var@(Var _ idx)
|
||||
| idx >= k -> NVar <$> f (shiftVar (-k) var)
|
||||
n -> pure n
|
||||
|
||||
getIdents :: Node -> HashSet Ident
|
||||
getIdents n = HashSet.fromList (n ^.. nodeIdents)
|
||||
|
||||
nodeIdents :: Traversal' Node Ident
|
||||
nodeIdents f = ufoldA reassemble go
|
||||
where
|
||||
go = \case
|
||||
NIdt i -> NIdt <$> f i
|
||||
n -> pure n
|
||||
|
||||
countFreeVarOccurrences :: Index -> Node -> Int
|
||||
countFreeVarOccurrences idx = gatherN go 0
|
||||
where
|
||||
go k acc = \case
|
||||
NVar (Var _ idx') | idx' == idx + k -> acc + 1
|
||||
_ -> acc
|
||||
|
||||
shiftVar :: Index -> Var -> Var
|
||||
shiftVar m = over varIndex (+ m)
|
||||
|
||||
-- | increase all free variable indices by a given value
|
||||
shift :: Index -> Node -> Node
|
||||
shift 0 = id
|
||||
shift m = umapN go
|
||||
where
|
||||
go k = \case
|
||||
NVar v
|
||||
| v ^. varIndex >= k -> NVar (shiftVar m v)
|
||||
n -> n
|
||||
|
||||
-- | Prism for NRec
|
||||
_NRec :: SimpleFold Node LetRec
|
||||
_NRec f = \case
|
||||
NRec l -> NRec <$> f l
|
||||
n -> pure n
|
||||
|
||||
-- | Prism for NLam
|
||||
_NLam :: SimpleFold Node Lambda
|
||||
_NLam f = \case
|
||||
NLam l -> NLam <$> f l
|
||||
n -> pure n
|
||||
|
||||
-- | Fold over all of the transitive descendants of a Node, including itself.
|
||||
cosmos :: SimpleFold Node Node
|
||||
cosmos f = ufoldA reassemble f
|
||||
|
||||
-- | The list should not contain repeated indices.
|
||||
-- if fv = x1, x2, .., xn
|
||||
-- the result is of the form λx1 λx2 .. λ xn b
|
||||
captureFreeVars :: [(Index, Binder)] -> Node -> Node
|
||||
captureFreeVars fv
|
||||
| n == 0 = id
|
||||
| otherwise = mkLambdasB infos . mapFreeVars
|
||||
where
|
||||
(indices, infos) = unzip fv
|
||||
n = length fv
|
||||
s :: HashMap Index Index
|
||||
s = HashMap.fromList (zip (reverse indices) [0 ..])
|
||||
mapFreeVars :: Node -> Node
|
||||
mapFreeVars = dmapN go
|
||||
where
|
||||
go :: Index -> Node -> Node
|
||||
go k = \case
|
||||
NVar (Var i u)
|
||||
| Just v <- s ^. at (u - k) -> NVar (Var i (v + k))
|
||||
m -> m
|
||||
|
||||
-- captures all free variables of a node. It also returns the list of captured
|
||||
-- variables in left-to-right order: if snd is of the form λxλy... then fst is
|
||||
-- [x, y]
|
||||
captureFreeVarsCtx :: BinderList Binder -> Node -> ([(Var, Binder)], Node)
|
||||
captureFreeVarsCtx bl n =
|
||||
let assocs = freeVarsCtx bl n
|
||||
in (assocs, captureFreeVars (map (first (^. varIndex)) assocs) n)
|
||||
|
||||
freeVarsCtx' :: BinderList Binder -> Node -> [Var]
|
||||
freeVarsCtx' bl = map fst . freeVarsCtx bl
|
||||
|
||||
-- | the output list does not contain repeated elements and is sorted by *decreasing* variable index.
|
||||
-- The indices are relative to the given binder list
|
||||
freeVarsCtx :: BinderList Binder -> Node -> [(Var, Binder)]
|
||||
freeVarsCtx ctx n =
|
||||
BL.lookupsSortedRev ctx . run . fmap fst . runOutputList $ go (freeVarsSorted n)
|
||||
where
|
||||
go ::
|
||||
-- set of free variables relative to the original ctx
|
||||
Set Var ->
|
||||
Sem '[Output Var] ()
|
||||
go fv = case Set.minView fv of
|
||||
Nothing -> return ()
|
||||
Just (v, vs) -> do
|
||||
output v
|
||||
let idx = v ^. varIndex
|
||||
bi = BL.lookup idx ctx
|
||||
freevarsbi' :: Set Var
|
||||
freevarsbi' = Set.mapMonotonic (over varIndex (+ (idx + 1))) (freeVarsSorted (bi ^. binderType))
|
||||
go (freevarsbi' <> vs)
|
||||
|
||||
-- | subst for multiple bindings
|
||||
substs :: [Node] -> Node -> Node
|
||||
substs t = umapN go
|
||||
where
|
||||
len = length t
|
||||
go k n = case n of
|
||||
NVar (Var i idx)
|
||||
| idx >= k, idx - k < len -> shift k (t !! (idx - k))
|
||||
| idx > k -> mkVar i (idx - len)
|
||||
_ -> n
|
||||
|
||||
-- | substitute a term t for the free variable with de Bruijn index 0, avoiding
|
||||
-- variable capture; shifts all free variabes with de Bruijn index > 0 by -1 (as
|
||||
-- if the topmost binder was removed)
|
||||
subst :: Node -> Node -> Node
|
||||
subst t = substs [t]
|
||||
|
||||
-- | reduce all beta redexes present in a term and the ones created immediately
|
||||
-- downwards (i.e., a "beta-development")
|
||||
developBeta :: Node -> Node
|
||||
developBeta = umap go
|
||||
where
|
||||
go :: Node -> Node
|
||||
go n = case n of
|
||||
NApp (App _ (NLam (Lambda {..})) arg) -> subst arg _lambdaBody
|
||||
_ -> n
|
||||
|
||||
etaExpand :: Int -> Node -> Node
|
||||
etaExpand 0 n = n
|
||||
etaExpand k n = mkLambdas' k (mkApps' (shift k n) (map mkVar' (reverse [0 .. k - 1])))
|
||||
|
||||
-- | substitution of all free variables for values in an environment
|
||||
substEnv :: Env -> Node -> Node
|
||||
substEnv env
|
||||
| null env = id
|
||||
| otherwise = umapN go
|
||||
where
|
||||
go k n = case n of
|
||||
NVar (Var _ idx)
|
||||
| idx >= k -> env !! (idx - k)
|
||||
_ -> n
|
||||
|
||||
convertClosures :: Node -> Node
|
||||
convertClosures = umap go
|
||||
where
|
||||
go :: Node -> Node
|
||||
go n = case n of
|
||||
Closure env (Lambda i bi b) -> substEnv env (mkLambda i bi b)
|
||||
_ -> n
|
||||
|
||||
convertRuntimeNodes :: Node -> Node
|
||||
convertRuntimeNodes = convertClosures
|
||||
|
||||
argumentInfoFromBinder :: Binder -> ArgumentInfo
|
||||
argumentInfoFromBinder i =
|
||||
ArgumentInfo
|
||||
{ _argumentName = i ^. binderName,
|
||||
_argumentLocation = i ^. binderLocation,
|
||||
_argumentType = i ^. binderType,
|
||||
_argumentIsImplicit = Explicit
|
||||
}
|
||||
|
||||
patternBinders :: SimpleFold Pattern PatternBinder
|
||||
patternBinders f p = case p of
|
||||
PatWildcard {} -> pure p
|
||||
PatConstr c -> traverseOf patternConstrArgs (traverse (patternBinders f)) c $> p
|
||||
PatBinder b -> f b $> p
|
||||
|
||||
patternBindersNum :: Pattern -> Int
|
||||
patternBindersNum = length . (^.. patternBinders)
|
||||
|
||||
patternType :: Pattern -> Node
|
||||
patternType = \case
|
||||
PatWildcard w -> getInfoType (w ^. patternWildcardInfo)
|
||||
PatBinder b -> b ^. patternBinder . binderType
|
||||
PatConstr c -> getInfoType (c ^. patternConstrInfo)
|
||||
@ -14,7 +14,8 @@ data DependencyInfo n = DependencyInfo
|
||||
{ _depInfoGraph :: Graph,
|
||||
_depInfoNodeFromVertex :: Vertex -> (n, HashSet n),
|
||||
_depInfoVertexFromName :: n -> Maybe Vertex,
|
||||
_depInfoReachable :: HashSet n
|
||||
_depInfoReachable :: HashSet n,
|
||||
_depInfoTopSort :: [n]
|
||||
}
|
||||
|
||||
makeLenses ''DependencyInfo
|
||||
@ -25,7 +26,8 @@ createDependencyInfo edges startNames =
|
||||
{ _depInfoGraph = graph,
|
||||
_depInfoNodeFromVertex = \v -> let (_, x, y) = nodeFromVertex v in (x, HashSet.fromList y),
|
||||
_depInfoVertexFromName = vertexFromName,
|
||||
_depInfoReachable = reachableNames
|
||||
_depInfoReachable = reachableNames,
|
||||
_depInfoTopSort = topSortedNames
|
||||
}
|
||||
where
|
||||
graph :: Graph
|
||||
@ -41,6 +43,8 @@ createDependencyInfo edges startNames =
|
||||
concatMap (Graph.reachable graph) startVertices
|
||||
startVertices :: [Vertex]
|
||||
startVertices = mapMaybe vertexFromName (HashSet.toList startNames)
|
||||
topSortedNames :: [n]
|
||||
topSortedNames = map (\v -> case nodeFromVertex v of (_, n, _) -> n) (Graph.topSort graph)
|
||||
|
||||
nameFromVertex :: DependencyInfo n -> Vertex -> n
|
||||
nameFromVertex depInfo v = fst $ (depInfo ^. depInfoNodeFromVertex) v
|
||||
|
||||
Loading…
Reference in New Issue
Block a user