********************************************************************
* NOTE: This file is generated automatically from the event * definition file PQueue.evt. ********************************************************************<* PRAGMA LL *> INTERFACEcall the following to generate an event:PQueueIE ; <*NOWARN*> IMPORT PQueue, Algorithm, View, Thread;PROCEDURE Setup ( initiator: Algorithm.T; size: INTEGER; doSort: BOOLEAN ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE InitSort ( initiator: Algorithm.T; vals: PQueue.Array ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE Insert ( initiator: Algorithm.T; el: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE HeapOpInit ( initiator: Algorithm.T; k: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE UpHeapStep ( initiator: Algorithm.T; k: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE HeapStep ( initiator: Algorithm.T; k, n: INTEGER; down: BOOLEAN ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE PlaceElement ( initiator: Algorithm.T; k: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE Remove ( initiator: Algorithm.T; ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE Compare ( initiator: Algorithm.T; k: INTEGER; n: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE Pause ( initiator: Algorithm.T; ) RAISES {Thread.Alerted}; <* LL = {} *> PROCEDURE SortStep ( initiator: Algorithm.T; k: INTEGER ) RAISES {Thread.Alerted}; <* LL = {} *> END PQueueIE.