********************************************************************
* NOTE: This file is generated automatically from the event
* definition file UnionFind.evt.
********************************************************************
<* PRAGMA LL *>
INTERFACE UnionFindIE ;
<*NOWARN*> IMPORT Algorithm, View, Thread;
call the following to generate an event:
PROCEDURE Setup (
initiator: Algorithm.T;
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE NewSet (
initiator: Algorithm.T;
nm: TEXT
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE FinishedSets (
initiator: Algorithm.T;
numSets: INTEGER; usesRanks: BOOLEAN
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE StartFind (
initiator: Algorithm.T;
id: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE EndFind (
initiator: Algorithm.T;
id: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE StartDoFind (
initiator: Algorithm.T;
id: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE StepUp (
initiator: Algorithm.T;
child, parent: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE Found (
initiator: Algorithm.T;
id: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE StepDown (
initiator: Algorithm.T;
child, parent: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE ChangeParent (
initiator: Algorithm.T;
child, parent, root: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE EndDoFind (
initiator: Algorithm.T;
id: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE StartUnion (
initiator: Algorithm.T;
id1, id2: INTEGER; bothRoots: BOOLEAN
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE FoundFirst (
initiator: Algorithm.T;
id1: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE CompareRanks (
initiator: Algorithm.T;
id1, id2: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE Unite (
initiator: Algorithm.T;
child, parent, pRank: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE EndUnion (
initiator: Algorithm.T;
) RAISES {Thread.Alerted};
<* LL = {} *>
END UnionFindIE.