BinaryTree Class Reference

An implementation of EventList using a binary search tree. More...

Inheritance diagram for BinaryTree:

Collaboration diagram for BinaryTree:

Public Member Functions
boolean	isEmpty ()
	Returns true if and only if the event list is empty (no event is scheduled). More...
void	clear ()
	Empties the event list, i.e., cancels all events.
void	add (Event ev)
	Adds a new event in the event list, according to the time of ev. More...
void	addFirst (Event ev)
	Adds a new event at the beginning of the event list. More...
void	addBefore (Event ev, Event other)
	Same as add, but adds the new event ev immediately before the event other in the list. More...
void	addAfter (Event ev, Event other)
	Same as add, but adds the new event ev immediately after the event other in the list. More...
Event	getFirst ()
	Returns the first event in the event list. More...
Event	getFirstOfClass (String cl)
	Returns the first event of the class cl (a subclass of Event) in the event list. More...
Iterator< Event >	iterator ()
ListIterator< Event >	listIterator ()
	Returns a list iterator over the elements of the class Event in this list. More...
boolean	remove (Event ev)
	Removes the event ev from the event list (cancels this event). More...
Event	removeFirst ()
	Removes the first event from the event list (to cancel or execute this event). More...
String	toString ()

Package Functions
public< E extends Event > E	getFirstOfClass (Class< E > cl)
	Returns the first event of the class E (a subclass of Event) in the event list. More...

Detailed Description

An implementation of EventList using a binary search tree.

Every event is stored into a tree node which has left and right children. Using the event time as a comparator the left child is always smaller than its parent whereas the right is greater or equal. This allows an average \(O(\log(n))\) time for adding an event and searching the first event, where \(n\) is the number of events in the structure. There is less overhead for adding and removing events than splay tree or red black tree. However, in the worst case, adding or removing could be done in time proportional to \(n\) because the binary search tree can be turned into a linked list.

Member Function Documentation

add()

void add

(

Event

ev

)

Adds a new event in the event list, according to the time of ev.

If the event list contains events scheduled to happen at the same time as ev, ev must be added after all these events.

Parameters

ev	event to be added

Implements EventList.

addAfter()

void addAfter	(	Event	ev,
		Event	other
	)

Same as add, but adds the new event ev immediately after the event other in the list.

Parameters

ev	event to be added
other	reference event after which ev will be added

Implements EventList.

addBefore()

void addBefore	(	Event	ev,
		Event	other
	)

Same as add, but adds the new event ev immediately before the event other in the list.

Parameters

ev	event to be added
other	reference event before which ev will be added

Implements EventList.

addFirst()

void addFirst

(

Event

ev

)

Adds a new event at the beginning of the event list.

The given event ev will occur at the current simulation time.

Parameters

ev	event to be added

Ajoute "ev" comme premier evenement dans l'arbre. Donc completement a gauche On met l'ancien premier evenement a droite de ev. (Necessaire quand on a des evenements simultanes)

Implements EventList.

getFirst()

Event getFirst

(

)

Returns the first event in the event list.

If the event list is empty, returns null.

Returns

the first event in the event list, or null if the list is empty

Implements EventList.

getFirstOfClass() [1/2]

Event getFirstOfClass

(

String

cl

)

Returns the first event of the class cl (a subclass of Event) in the event list.

If no such event is found, returns null.

Returns

the first event of class cl, or null if no such event exists in the list

Implements EventList.

getFirstOfClass() [2/2]

public<E extends Event> E getFirstOfClass ( Class< E >  cl )

package

Returns the first event of the class E (a subclass of Event) in the event list.

If no such event is found, returns null.

Returns

the first event of class cl, or null if no such event exists in the list

Implements EventList.

isEmpty()

boolean isEmpty

(

)

Returns true if and only if the event list is empty (no event is scheduled).

Returns

true if the event list is empty

Implements EventList.

listIterator()

ListIterator<Event> listIterator

(

)

Returns a list iterator over the elements of the class Event in this list.

Returns

a list iterator over the elements of the class Event in this list

Implements EventList.

remove()

boolean remove

(

Event

ev

)

Removes the event ev from the event list (cancels this event).

Returns true if and only if the event removal has succeeded.

Parameters

ev	event to be removed

Returns

true if the event was successfully removed from the list

Implements EventList.

removeFirst()

Event removeFirst

(

)

Removes the first event from the event list (to cancel or execute this event).

Returns the removed event. If the list is empty, then null is returned.

Returns

the first event removed from the list, or null if the list is empty

Implements EventList.

---

The documentation for this class was generated from the following file:

• BinaryTree.java