DIRECTORY Collections, LichenDataStructure, PairCollections, IntFunctions;LichenStructuring: CEDAR DEFINITIONSIMPORTS Collections=BEGINOPEN LichenDataStructure, Colls:Collections, PairColls:PairCollections, IntFns:IntFunctions;Set: TYPE ~ LichenDataStructure.Set;Relation: TYPE ~ LichenDataStructure.Relation;Function: TYPE ~ LichenDataStructure.Function;OneToOne: TYPE ~ LichenDataStructure.OneToOne;Seq: TYPE ~ LichenDataStructure.Seq;Thing: TYPE ~ REF ANY --actually UNION [Port, Wire]--;StepTriple: TYPE ~ RECORD [parent: StepNode, step: NameStep, child: StepNode];StepDAG: TYPE ~ REF StepDAGPrivate;StepDAGPrivate: TYPE ~ RECORD [down: Function--parent StepNode _ Decomp--,up: OneToOne--child stepNode f Ups--,cands: Set--of StepNode--,root: Thing];Decomp: TYPE ~ REF OneToOne--NameStep _ child StepNode--;Ups: TYPE ~ REF Relation--parent StepNode X NameStep--;StepNode: TYPE ~ REF ANY --actually UNION [Thing, Fake]--;Fake: TYPE ~ REF ANY;CreateDAG: PROC [root: StepNode, ups: BOOL] RETURNS [dag: StepDAG];VerifyDAG: PROC [dag: StepDAG, mayBeLone: StepNode, midThings: BOOL];InsertInDAG: PROC [dag: StepDAG, parent: StepNode, parts: SteppyName, thing: Thing];AddLink: PROC [dag: StepDAG, parent: StepNode, step: NameStep, child: StepNode, downRed: BOOL];GetDown: PROC [dag: StepDAG, parent: StepNode, step: NameStep, mayAdd: BOOL] RETURNS [child: StepNode];GetDecomp: PROC [dag: StepDAG, parent: StepNode, mayAdd: BOOL] RETURNS [dec: Decomp];GetUps: PROC [dag: StepDAG, child: StepNode, mayAdd: BOOL] RETURNS [ups: Ups];RemoveLink: PROC [dag: StepDAG, parent: StepNode, step: NameStep, child: StepNode, cleanup: CleanOption];CleanOption: TYPE ~ {ignore, wontBeNeeded, ifFake, do};ReplaceNode: PROC [dag: StepDAG, doomed, survivor: StepNode];RemoveLeaf: PROC [dag: StepDAG, leaf: StepNode];CreateTreeSpace: PROC [dag: StepDAG] RETURNS [treeSpace: Colls.Space];IsThing: PROC [node: StepNode] RETURNS [BOOL] ~ INLINE {RETURN [WITH node SELECT FROMx: Port => TRUE,x: Wire => TRUE,x: Fake => FALSE,ENDCASE => ERROR]};RawLeaf: PROC [dag: StepDAG, node: StepNode] RETURNS [BOOL] ~ INLINE {RETURN [node#dag.root AND (WITH node SELECT FROMx: Port => TRUE,x: Wire => TRUE,x: Fake => FALSE,ENDCASE => ERROR)]};IsKidCand: PROC [dag: StepDAG, node: StepNode] RETURNS [BOOL] ~ INLINE {RETURN [node#dag.root AND (WITH node SELECT FROMx: Port => TRUE,x: Wire => TRUE,x: Fake => dag.cands.HasMember[x],ENDCASE => ERROR)]};END.     LichenStructuring.MesaLast tweaked by Mike Spreitzer on September 18, 1987 11:25:38 am PDTDoesn't matter what it is, only the identity is used (and the fact that it's runtime-distinguishable from a Thing).  Let's use its Decomp (actually, that choice is depended on now).Э╩и  Ц"cedar" styleШ codeЩKЪЬDЩDЧKШ KЪ╧k	ЬAШJKШ Ъ╧nЬЭЬЭШ$KЪЭЬШKЪЬШЧKЪЭШKШ KЪЭЬЮЬЮ	ЬЮЬШ\KШ KЪЬЭЬШ$KЪЬ
ЭЬ Ш.KЪЬ
ЭЬ Ш.KЪЬ
ЭЬ Ш.KЪЬЭЬШ$KШ KЪ	ЬЭЬЭЬЭЬ╧cЬШ6KШ KЪЬЭЬЭЬ5ШNKШ KЪЬ	ЭЬЭЬШ#ЪЬЭЬЭЬШKЪЬЯ╨cmЯ	ЬШ+KЪЬЯаЯЬШ%KЪЬ
ЯЬШKШKШЧKШ KЪ	ЬЭЬЭЬ	ЯаЯЬШ9KЪ	ЬЭЬЭЬ	ЯаЯЬШ7KШ KЪ	Ь
ЭЬЭЬЭЬЯ ЬШ:ЪЬЭЬЭЬЭЬШKЪЬ╡Щ╡ЧKШ KЪЮ	ЬЭЬЭЬЭЬШCKЪЮ	ЬЭЬ0ЭЬШEKШ KЪЮЬЭЬCШTKЪЮЬЭЬLЭЬШ_KЪЮЬЭЬ:ЭЬЭЬШgKЪЮ	ЬЭЬ*ЭЬЭЬШUKЪЮЬЭЬ)ЭЬЭЬШNЪЮ
ЬЭЬYШiKЪЬЭЬ&Ш7ЧKЪЮЬЭЬ,Ш=KЪЮ
ЬЭЬ Ш0KШ KЪЮЬЭЬЭЬШFKШ Ъ
ЮЬЭЬЭЬЭЬЭЬШ8ЪЭЬЭЬЭЬЭШKЪЬЭЬШKЪЬЭЬШKЪЬЭЬШKЪЭЬЭЬШЧЧKШ Ъ
ЮЬЭЬ ЭЬЭЬЭЬШFЪ	ЭЬЭЬЭЬЭЬЭШ0KЪЬЭЬШKЪЬЭЬШKЪЬЭЬШKЪЭЬЭЬШЧKШ ЧЪ
Ю	ЬЭЬ ЭЬЭЬЭЬШHЪ	ЭЬЭЬЭЬЭЬЭШ0KЪЬЭЬШKЪЬЭЬШKЪЬ"Ш"KЪЭЬЭЬШЧЧKШ KЪЭЬШЧ ЕЧ    	╕  x  