********************************************************************
* NOTE: This file is generated automatically from the event * definition file UnionFind.evt. ********************************************************************<* PRAGMA LL *> MODULE; <*NOWARN*> IMPORT ZeusClass, UnionFindAlgClass, ViewClass; REVEAL T = Public BRANDED OBJECT OVERRIDES <* LL.sup = VBT.mu *> isCompat := IsCompat; <* LL.sup < VBT.mu *> oeSetup := Setup; oeNewSet := NewSet; oeFinishedSets := FinishedSets; oeStartFind := StartFind; oeEndFind := EndFind; oeStartDoFind := StartDoFind; oeStepUp := StepUp; oeFound := Found; oeStepDown := StepDown; oeChangeParent := ChangeParent; oeEndDoFind := EndDoFind; oeStartUnion := StartUnion; oeFoundFirst := FoundFirst; oeCompareRanks := CompareRanks; oeUnite := Unite; oeEndUnion := EndUnion; <* LL.sup = VBT.mu *> END; PROCEDURE UnionFindViewClass IsCompat (<*UNUSED*> v: T; alg: ZeusClass.T): BOOLEAN = <* LL.sup = VBT.mu *> BEGIN RETURN ISTYPE(alg, UnionFindAlgClass.T) END IsCompat; PROCEDURESetup (view: T ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END Setup; PROCEDURENewSet (view: T ; <*UNUSED*> nm: TEXT ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END NewSet; PROCEDUREFinishedSets (view: T ; <*UNUSED*> numSets: INTEGER ; <*UNUSED*> usesRanks: BOOLEAN ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END FinishedSets; PROCEDUREStartFind (view: T ; <*UNUSED*> id: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END StartFind; PROCEDUREEndFind (view: T ; <*UNUSED*> id: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END EndFind; PROCEDUREStartDoFind (view: T ; <*UNUSED*> id: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END StartDoFind; PROCEDUREStepUp (view: T ; <*UNUSED*> child: INTEGER ; <*UNUSED*> parent: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END StepUp; PROCEDUREFound (view: T ; <*UNUSED*> id: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END Found; PROCEDUREStepDown (view: T ; <*UNUSED*> child: INTEGER ; <*UNUSED*> parent: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END StepDown; PROCEDUREChangeParent (view: T ; <*UNUSED*> child: INTEGER ; <*UNUSED*> parent: INTEGER ; <*UNUSED*> root: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END ChangeParent; PROCEDUREEndDoFind (view: T ; <*UNUSED*> id: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END EndDoFind; PROCEDUREStartUnion (view: T ; <*UNUSED*> id1: INTEGER ; <*UNUSED*> id2: INTEGER ; <*UNUSED*> bothRoots: BOOLEAN ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END StartUnion; PROCEDUREFoundFirst (view: T ; <*UNUSED*> id1: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END FoundFirst; PROCEDURECompareRanks (view: T ; <*UNUSED*> id1: INTEGER ; <*UNUSED*> id2: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END CompareRanks; PROCEDUREUnite (view: T ; <*UNUSED*> child: INTEGER ; <*UNUSED*> parent: INTEGER ; <*UNUSED*> pRank: INTEGER ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END Unite; PROCEDUREEndUnion (view: T ) = <* LL.sup < VBT.mu *> BEGIN view.evtHandled := FALSE; END EndUnion; BEGIN END UnionFindViewClass.