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

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


INTERFACE PQueueAlgClass;

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

<* PRAGMA LL *>

TYPE
  EventDataRec = RECORD
    stopAtSetup: BOOLEAN := TRUE;
    waitAtSetup: CARDINAL := 1;
    ctOfSetup: CARDINAL := 0;
    stopAtInitSort: BOOLEAN := TRUE;
    waitAtInitSort: CARDINAL := 1;
    ctOfInitSort: CARDINAL := 0;
    stopAtInsert: BOOLEAN := TRUE;
    waitAtInsert: CARDINAL := 1;
    ctOfInsert: CARDINAL := 0;
    stopAtHeapOpInit: BOOLEAN := TRUE;
    waitAtHeapOpInit: CARDINAL := 1;
    ctOfHeapOpInit: CARDINAL := 0;
    stopAtUpHeapStep: BOOLEAN := TRUE;
    waitAtUpHeapStep: CARDINAL := 1;
    ctOfUpHeapStep: CARDINAL := 0;
    stopAtHeapStep: BOOLEAN := TRUE;
    waitAtHeapStep: CARDINAL := 1;
    ctOfHeapStep: CARDINAL := 0;
    stopAtPlaceElement: BOOLEAN := TRUE;
    waitAtPlaceElement: CARDINAL := 1;
    ctOfPlaceElement: CARDINAL := 0;
    stopAtRemove: BOOLEAN := TRUE;
    waitAtRemove: CARDINAL := 1;
    ctOfRemove: CARDINAL := 0;
    stopAtCompare: BOOLEAN := TRUE;
    waitAtCompare: CARDINAL := 1;
    ctOfCompare: CARDINAL := 0;
    stopAtPause: BOOLEAN := TRUE;
    waitAtPause: CARDINAL := 1;
    ctOfPause: CARDINAL := 0;
    stopAtSortStep: BOOLEAN := TRUE;
    waitAtSortStep: CARDINAL := 1;
    ctOfSortStep: CARDINAL := 0;
  END;

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

      METHODS
      END;

REVEAL
  Algorithm.T <: AlgorithmClass.T;

END PQueueAlgClass.