Examples of umontreal.iro.lecuyer.simevents.Event

umontreal.iro.lecuyer.simevents.Event
This abstract class provides event scheduling tools. Each type of event should be defined as a subclass of the class Event, and should provide an implementation of the method {@link #actions actions} which is executed when an event of this type occurs.The instances of these subclasses are the actual events.
Each event is linked to a simulator represented by an instance of {@link Simulator} before it can be scheduled and processed.A default simulator, given by Simulator.getDefaultSimulator, is used if no simulator is linked explicitly with an event. When an event is constructed, it is not scheduled. It must be scheduled separately by calling one of the scheduling methods {@link #schedule schedule}, {@link #scheduleNext scheduleNext}, {@link #scheduleBefore scheduleBefore}, etc. An event can also be cancelled before it occurs.
A scheduled event has an associated time at which it will happen and a priority, which can be queried using the methods {@link #time time} and {@link #priority priority}, respectively. By default, events occur in ascending order of time, and have priority 1. Events with the same time occur in ascending order of priority. For example, if events e1 and e2 occur at the same time with priority 2 and 1 respectively, then e2 will occur before e1. Events with the same time and priority occur in the order they were scheduled.


   public Event getFirstOfClass (String cl) {
      Iterator<Node> itr = tree.values().iterator();
      while (itr.hasNext()) {
         Node node = itr.next();
         Event ev = node.getFirstOfClass (cl);
         if (ev != null)
            return ev;
      }
      return null;
   }

View Full Code Here

   }


   public Event removeFirst() {
      if (tree.isEmpty())
         return null;
      Event evKey = tree.firstKey();
      Node node = tree.get (evKey);
      Event first = node.events.get (0);
      node.events.remove (0);
      if (node.events.isEmpty()) {
         tree.remove (evKey);
         synchronized (RedblackTree.class) {
            node.nextNode = free; free = node;

View Full Code Here

      }


      public void addAfter (Event ev, Event other) {
         ListIterator<Event> itr = events.listIterator();
         while (itr.hasNext()) {
            Event listev = itr.next();
            if (listev == other) {
               itr.add (ev);
               return;
            }
         }

View Full Code Here

      }


      public void addBefore (Event ev, Event other) {
         ListIterator<Event> itr = events.listIterator();
         while (itr.hasNext()) {
            Event listev = itr.next();
            if (listev == other) {
               itr.previous();
               itr.add (ev);
               return;
            }

View Full Code Here

      }


      public Event getFirstOfClass (String cl) {
         Iterator<Event> itr = events.iterator();
         while (itr.hasNext()) {
            Event listev = itr.next();
            if (listev.getClass().getName().equals (cl))
               return listev;
         }
         return null;
      }

View Full Code Here


      @SuppressWarnings("unchecked")
      public <E extends Event> E getFirstOfClass (Class<E> cl) {
         Iterator<Event> itr = events.iterator();
         while (itr.hasNext()) {
            Event listev = itr.next();
            if (listev.getClass() == cl)
               return (E)listev;
         }
         return null;
      }

View Full Code Here

       * Returns true if the node becomes empty.
       */
      public boolean remove (Event ev) {
         Iterator<Event> itr = events.iterator();
         while (itr.hasNext()) {
            Event listev = itr.next();
            if (listev == ev) {
               itr.remove();
               return events.isEmpty();
            }
         }

View Full Code Here


   public Event removeFirst() {
      if (first == null)
         return null;


      Event ev = first.ev;
      Node temp = first;
      first = first.succ;
      if (first == null)
         last = null;
      else

View Full Code Here

      public Event next() {
         if (!hasNext())
            throw new NoSuchElementException();


         ++nextIndex;
         Event ev = next.ev;
         lastRet = next;
         prev = next;
         next = next.succ;
         return ev;
      }

View Full Code Here

      public Event previous() {
         if (!hasPrevious())
            throw new NoSuchElementException();


         --nextIndex;
         Event ev = prev.ev;
         lastRet = prev;
         next = prev;
         prev = prev.prec;
         return ev;
      }

View Full Code Here

0 1 2

TOP

Related Classes of umontreal.iro.lecuyer.simevents.Event

umontreal.iro.lecuyer.simevents.eventlist.BinaryTree

umontreal.iro.lecuyer.simevents.eventlist.BinaryTree$BTItr

umontreal.iro.lecuyer.simevents.eventlist.DoublyLinked

umontreal.iro.lecuyer.simevents.eventlist.DoublyLinked$DLItr

umontreal.iro.lecuyer.simevents.eventlist.Henriksen

umontreal.iro.lecuyer.simevents.eventlist.Henriksen$HItr

umontreal.iro.lecuyer.simevents.eventlist.RedblackTree

umontreal.iro.lecuyer.simevents.eventlist.RedblackTree$Node

umontreal.iro.lecuyer.simevents.eventlist.RedblackTree$RBItr

umontreal.iro.lecuyer.simevents.eventlist.SplayTree

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.