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

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


INTERFACE SearchTreeAlgClass;

<*NOWARN*> IMPORT Algorithm, RedBlackAlg, AlgorithmClass;

<* PRAGMA LL *>

TYPE
  EventDataRec = RECORD
    stopAtNewNode: BOOLEAN := TRUE;
    waitAtNewNode: CARDINAL := 1;
    ctOfNewNode: CARDINAL := 0;
    stopAtCompareKeys: BOOLEAN := TRUE;
    waitAtCompareKeys: CARDINAL := 1;
    ctOfCompareKeys: CARDINAL := 0;
    stopAtAddLeaf: BOOLEAN := TRUE;
    waitAtAddLeaf: CARDINAL := 1;
    ctOfAddLeaf: CARDINAL := 0;
    stopAtNewSearchKey: BOOLEAN := TRUE;
    waitAtNewSearchKey: CARDINAL := 1;
    ctOfNewSearchKey: CARDINAL := 0;
    stopAtSearchEnd: BOOLEAN := TRUE;
    waitAtSearchEnd: CARDINAL := 1;
    ctOfSearchEnd: CARDINAL := 0;
    stopAtGoLeft: BOOLEAN := TRUE;
    waitAtGoLeft: CARDINAL := 1;
    ctOfGoLeft: CARDINAL := 0;
    stopAtSpliceOut: BOOLEAN := TRUE;
    waitAtSpliceOut: CARDINAL := 1;
    ctOfSpliceOut: CARDINAL := 0;
    stopAtCopy: BOOLEAN := TRUE;
    waitAtCopy: CARDINAL := 1;
    ctOfCopy: CARDINAL := 0;
    stopAtCurrentNode: BOOLEAN := TRUE;
    waitAtCurrentNode: CARDINAL := 1;
    ctOfCurrentNode: CARDINAL := 0;
    stopAtSetType: BOOLEAN := TRUE;
    waitAtSetType: CARDINAL := 1;
    ctOfSetType: CARDINAL := 0;
    stopAtRedRedClash: BOOLEAN := TRUE;
    waitAtRedRedClash: CARDINAL := 1;
    ctOfRedRedClash: CARDINAL := 0;
    stopAtCheckUncle: BOOLEAN := TRUE;
    waitAtCheckUncle: CARDINAL := 1;
    ctOfCheckUncle: CARDINAL := 0;
    stopAtRotate: BOOLEAN := TRUE;
    waitAtRotate: CARDINAL := 1;
    ctOfRotate: CARDINAL := 0;
  END;

  T <: Public;
  Public = Algorithm.T OBJECT
      eventDataRec: EventDataRec;

      METHODS
      END;

REVEAL
  Algorithm.T <: AlgorithmClass.T;

END SearchTreeAlgClass.