Examples of SplayTree

umontreal.iro.lecuyer.simevents.eventlist.SplayTree
An implementation of {@link EventList} using a splay tree.This tree is like a binary search tree except that when it is modified, the affected node is moved to the top. The rebalancing scheme is simpler than for a red black tree and can avoid the worst case of the linked list. This gives a O(log(n)) average time for adding or removing an event, where n is the size of the event list.

Examples of umontreal.iro.lecuyer.simevents.eventlist.SplayTree

    * Constructs a new simulator using a splay tree for the
    *   event list.
    * 
    */
   public Simulator() {
     eventList  = new SplayTree();
   }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.