********************************************************************

      *  NOTE: This file is generated automatically from the event
      *        definition file UnionFind.evt.
      ********************************************************************


<* PRAGMA LL *>

MODULE UnionFindViewClass;

<*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 IsCompat(<*UNUSED*> v: T; alg: ZeusClass.T): BOOLEAN =
  <* LL.sup = VBT.mu *>
  BEGIN
    RETURN ISTYPE(alg, UnionFindAlgClass.T)
  END IsCompat;

PROCEDURE Setup (view: T
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END Setup;
PROCEDURE NewSet (view: T
    ; <*UNUSED*> nm: TEXT
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END NewSet;
PROCEDURE FinishedSets (view: T
    ; <*UNUSED*> numSets: INTEGER
    ; <*UNUSED*> usesRanks: BOOLEAN
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END FinishedSets;
PROCEDURE StartFind (view: T
    ; <*UNUSED*> id: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END StartFind;
PROCEDURE EndFind (view: T
    ; <*UNUSED*> id: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END EndFind;
PROCEDURE StartDoFind (view: T
    ; <*UNUSED*> id: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END StartDoFind;
PROCEDURE StepUp (view: T
    ; <*UNUSED*> child: INTEGER
    ; <*UNUSED*> parent: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END StepUp;
PROCEDURE Found (view: T
    ; <*UNUSED*> id: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END Found;
PROCEDURE StepDown (view: T
    ; <*UNUSED*> child: INTEGER
    ; <*UNUSED*> parent: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END StepDown;
PROCEDURE ChangeParent (view: T
    ; <*UNUSED*> child: INTEGER
    ; <*UNUSED*> parent: INTEGER
    ; <*UNUSED*> root: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END ChangeParent;
PROCEDURE EndDoFind (view: T
    ; <*UNUSED*> id: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END EndDoFind;
PROCEDURE StartUnion (view: T
    ; <*UNUSED*> id1: INTEGER
    ; <*UNUSED*> id2: INTEGER
    ; <*UNUSED*> bothRoots: BOOLEAN
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END StartUnion;
PROCEDURE FoundFirst (view: T
    ; <*UNUSED*> id1: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END FoundFirst;
PROCEDURE CompareRanks (view: T
    ; <*UNUSED*> id1: INTEGER
    ; <*UNUSED*> id2: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END CompareRanks;
PROCEDURE Unite (view: T
    ; <*UNUSED*> child: INTEGER
    ; <*UNUSED*> parent: INTEGER
    ; <*UNUSED*> pRank: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END Unite;
PROCEDURE EndUnion (view: T
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END EndUnion;

BEGIN
END UnionFindViewClass.