From ddfd0c9824a6e2e9f4519fc815f33cebd235d00a Mon Sep 17 00:00:00 2001 From: Zoltan Somogyi Date: Thu, 14 Aug 2025 08:50:08 +0200 Subject: [PATCH] Add a comment. --- compiler/d_file_deps.m | 9 ++++++--- 1 file changed, 6 insertions(+), 3 deletions(-) diff --git a/compiler/d_file_deps.m b/compiler/d_file_deps.m index de0f6d05e..ced5d304a 100644 --- a/compiler/d_file_deps.m +++ b/compiler/d_file_deps.m @@ -243,11 +243,14 @@ compute_dep_graphs_gendep(ProgressStream, Globals, ModuleName, DepsMap, digraph.to_assoc_list(IndirectDepsGraph, IndirectDepsGraphEdges), digraph.to_assoc_list(IndirectOptDepsGraph, IndirectOptDepsGraphEdges), digraph.to_assoc_list(TransOptDepsGraph, TransOptDepsGraphEdges), - AllDepsGraphsEdges0 = IntDepsGraphEdges ++ ImpDepsGraphEdges ++ + AllDepsGraphsEdges = IntDepsGraphEdges ++ ImpDepsGraphEdges ++ IndirectDepsGraphEdges ++ IndirectOptDepsGraphEdges ++ TransOptDepsGraphEdges, - % ZZZ list.sort_and_remove_dups(FourDepsGraphsEdges0, AllDepsGraphsEdges), - digraph.from_assoc_list(AllDepsGraphsEdges0, AllDepsGraph), + % Many edges exist in more than one of these graphs. However, + % removing the duplicates by calling list.sort_and_remove_dups + % costs more time than would be saved by digraph.from_assoc_list + % not having to add the duplicate edges. + digraph.from_assoc_list(AllDepsGraphsEdges, AllDepsGraph), DepGraphs = dep_graphs(IntDepsGraph, ImpDepsGraph, IndirectDepsGraph, IndirectOptDepsGraph, TransOptDepsGraph,