From: Helge S. <Hel...@gm...> - 2003-08-30 09:31:28
|
Curt Arnold wrote: > > Inger, Matthew wrote: > > > > more info from what i've been looking at in CCTask. I haven't tried > > this out yet, but it's to give you an idea of what i was thinking. > > Anyone have any comments? > > Definitely Helge's dependency graph brings out the worst in the current > dependency analysis algorithm. However, I believe the best approach is > to focus our efforts on having one analysis algorithm that handles both > Helge's graph and more typical cases well instead of allowing multiple > algorithms to sprout. If we had multiple algorithms that each were > substantially superior for different classes of graphs, then a user > selectable strategy could be appropriate. I agree with Curt. We need no user selectable strategy, if a better algorithm has no substantially disadvantage for some one. Dominique's results aren't a counterexample for my patch. Tagging dependency informations with the actual visitor simplifies the algorithm and eliminates the resource consuming stack data structure. Optimal translation order isn't achieved by the current algorithm, but could be added in both algorithm by returning the smallest failing dependency depth from 'walkDependencies' and sorting in 'execute'. Helge -- Helge Schulz http://www.openshore.org |