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

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


<* PRAGMA LL *>

MODULE DGraphViewClass;

<*NOWARN*> IMPORT AdjMatrix, ZeusClass, DGraphAlgClass, ViewClass;

REVEAL
  T = Public BRANDED OBJECT
      OVERRIDES
        <* LL.sup = VBT.mu *>
        isCompat := IsCompat;
        <* LL.sup < VBT.mu *>
        oeSetup := Setup;
        oeAddEdge := AddEdge;
        oeMarkEdge := MarkEdge;
        oeUnMarkEdge := UnMarkEdge;
        oeMarkVertex := MarkVertex;
        oeUnMarkVertex := UnMarkVertex;
        oeNewTree := NewTree;
        oeHighlight := Highlight;
        oeAddChild := AddChild;
        oeRemoveChild := RemoveChild;
        <* LL.sup = VBT.mu *>
      END;

PROCEDURE IsCompat(<*UNUSED*> v: T; alg: ZeusClass.T): BOOLEAN =
  <* LL.sup = VBT.mu *>
  BEGIN
    RETURN ISTYPE(alg, DGraphAlgClass.T)
  END IsCompat;

PROCEDURE Setup (view: T
    ; <*UNUSED*> m: AdjMatrix.T
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END Setup;
PROCEDURE AddEdge (view: T
    ; <*UNUSED*> from: INTEGER
    ; <*UNUSED*> to: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END AddEdge;
PROCEDURE MarkEdge (view: T
    ; <*UNUSED*> from: INTEGER
    ; <*UNUSED*> to: INTEGER
    ; <*UNUSED*> depth: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END MarkEdge;
PROCEDURE UnMarkEdge (view: T
    ; <*UNUSED*> from: INTEGER
    ; <*UNUSED*> to: INTEGER
    ; <*UNUSED*> depth: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END UnMarkEdge;
PROCEDURE MarkVertex (view: T
    ; <*UNUSED*> v: INTEGER
    ; <*UNUSED*> depth: INTEGER
    ; <*UNUSED*> rcset: AdjMatrix.RCSet
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END MarkVertex;
PROCEDURE UnMarkVertex (view: T
    ; <*UNUSED*> v: INTEGER
    ; <*UNUSED*> depth: INTEGER
    ; <*UNUSED*> rcset: AdjMatrix.RCSet
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END UnMarkVertex;
PROCEDURE NewTree (view: T
    ; <*UNUSED*> root: INTEGER
    ; <*UNUSED*> label: TEXT
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END NewTree;
PROCEDURE Highlight (view: T
    ; <*UNUSED*> node: INTEGER
    ; <*UNUSED*> highlight: REAL
    ; <*UNUSED*> nodeOnly: BOOLEAN
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END Highlight;
PROCEDURE AddChild (view: T
    ; <*UNUSED*> parent: INTEGER
    ; <*UNUSED*> pred: INTEGER
    ; <*UNUSED*> child: INTEGER
    ; <*UNUSED*> label: TEXT
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END AddChild;
PROCEDURE RemoveChild (view: T
    ; <*UNUSED*> parent: INTEGER
    ; <*UNUSED*> ch: INTEGER
) =
  <* LL.sup < VBT.mu *>
  BEGIN
    view.evtHandled := FALSE;
  END RemoveChild;

BEGIN
END DGraphViewClass.