// tg.cd -- class dictionary for Demeter traversal graphs
// $Id: tg.cd,v 1.4 1997/10/10 04:58:50 dougo Exp $

package EDU.neu.ccs.demeter.common.tg;

import java.util.*;

*noparse*

*interface* *public* ClassNameI = .
*interface* *public* PartNameI = .
*interface* *public* StrategyGraphI = .

// Data structures for traversal graph calculation.
// Cycles here are cycles in the object graph too!
*public* TraversalGraph	= <vertexdict> Hashtable <vertices> DList(TGVertex).
*public* TGVertex	= <classname> ClassNameI *l +
			  "incoming:" *l + <incoming> List(TGEdge) - *l
			  "outgoing:" *l + <outgoing> List(TGEdge) - *l
			  <intercopyEdges> List(Pair(int,int))
			  <mark> TGMark "." - *l.
*public* TGEdge		: TGCEdge | TGAEdge | TGIEdge
			*common* "from:" <source> TGVertex
				 "to:" <dest> TGVertex
				 <mark> TGMark *l.
*public* TGCEdge	= "->" *s <name> PartNameI.	// const
*public* TGAEdge	= "=>" *s.			// alt
*public* TGIEdge	= ":>" *s.			// inh

TGMark			= <forw> BitSet <back> BitSet <both> BitSet.

// Parameterized class definitions.
List(S) ~ {*s S}.
DList(S) ~ S { *l *l S } *l .
Pair(X,Y) = "<" <x> X "," *s <y> Y ">".

*visitors*

// abstract visitors
*public* TGEdgeVisitor	: .