Subject: computing class graphs using strategies
From: Karl Lieberherr (lieber@ccs.neu.edu)
Date: Tue Oct 31 2000 - 17:43:58 EST
DJ supports the very useful feature that you can maintain
multiple class graphs that you compute from the basic
class graph using strategies.
In
http://www.ccs.neu.edu/home/lieber/com1205/f00/hw/4/os-phase1-better/
there is a complete example from hw 4 that uses this feature
to get rid of the unwanted tail edges in the class graph.
You may want to use this feature in your project later
to solve the problem once and for all.
Unfortunately, there was a little wrinkle in the DJ code
for this feature. Doug Orleans has ironed it and
he proposed a workaround and I implemented
the workaround for an example in:
http://www.ccs.neu.edu/home/lieber/com1205/f00/hw/4/os-phase1-better/
If you want to use this feature of DJ, you need to follow the
workaround instructions.
Notice how the oo features help to deal with such bug fixes.
-- Karl L.
This archive was generated by hypermail 2b28 : Tue Oct 31 2000 - 17:48:19 EST