********************************************************************
* NOTE: This file is generated automatically from the event
* definition file SearchTree.evt.
********************************************************************
<* PRAGMA LL *>
INTERFACE SearchTreeIE ;
<*NOWARN*> IMPORT Algorithm, RedBlackAlg, View, Thread;
call the following to generate an event:
PROCEDURE NewNode (
initiator: Algorithm.T;
node: INTEGER; key: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE CompareKeys (
initiator: Algorithm.T;
node: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE AddLeaf (
initiator: Algorithm.T;
node: INTEGER; childNum: CARDINAL
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE NewSearchKey (
initiator: Algorithm.T;
key: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE SearchEnd (
initiator: Algorithm.T;
node: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE GoLeft (
initiator: Algorithm.T;
node: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE SpliceOut (
initiator: Algorithm.T;
parent, child: INTEGER; save: BOOLEAN
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE Copy (
initiator: Algorithm.T;
source, dest: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE CurrentNode (
initiator: Algorithm.T;
node: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE SetType (
initiator: Algorithm.T;
node: INTEGER; type, pType: RedBlackAlg.NodeType
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE RedRedClash (
initiator: Algorithm.T;
child, parent: INTEGER; on: BOOLEAN
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE CheckUncle (
initiator: Algorithm.T;
child: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
PROCEDURE Rotate (
initiator: Algorithm.T;
child, parent: INTEGER
) RAISES {Thread.Alerted};
<* LL = {} *>
END SearchTreeIE.