Redefine how Aspect Cliques are found (fixes MPSCR-60)
Now algorithm for finding aspect cliques includes 3 stages: 1) topological sort (as before) 2) bottom-up pass with initial assignment of clique ids (as before) 3) top-down pass (i.e. in reverse topo sort order) (added stage) The 3rd stage handles case when hierarchy of langs with required aspect include branching point (with no join further down), as in the case of closuresExt & collectionsExt both extending blExt, but unrelated to each other (neither extends the other).
This commit is contained in:
parent
bb5412230a
commit
e7d23f9b6d