src/Queue.as

   1 package
   2 {
   3    /**
   4     * A queue that works by the FIFO (first in, first out) principle.
   5     * It can store any type of data and has no fixed size.
   6     * @author Tox, webcodesign.de
   7     */
   8    public class Queue
   9    {
  10       private var q:Array = [];
  11       public var l:int = 0;
  12
  13       /**
  14        * CTOR
  15        */
  16       public function Queue() { }
  17
  18
  19                 public function dump():void {
  20                         for (var i:int = 0; i < q.length; i++) {
  21                                 trace("[" + i + "]=",q[i]);
  22                         }
  23                 }
  24
  25       /**
  26        * Writes data to the end of the queue.
  27        * @param   d   Data to write, can be of any type.
  28        */
  29       public function write(d:*):void {q.push(d);}
  30
  31       /**
  32        * Reads data from the beginning of the queue.
  33        * @return   Data stored at the beginning of the queue.
  34        */
  35       public function read():* { l--; return (empty) ? null : q.shift(); }
  36
  37       /**
  38        * Checks if the queue is empty and returns the result.
  39        */
  40       public function get empty():Boolean { return (q.length <= 0); }
  41
  42       /**
  43        * Returns the data of the first queue element without removing it.
  44        * @return   Data of the first queue element.
  45        */
  46       public function spy():* {return (empty) ? null : q[0];}
  47    }
  48 }