Click above to get retro games delivered to your door ever month!

          Class Deque

     Class Deque (pronounced  "deck") implements a double-ended queue.
     Objects  can be inserted and removed at both  the  left  and  the
     right  ends.  You  can use the member  functions  peekLeft()  and
     peekRight() to examine the objects  currently at the left and the
     right  ends.  The  same caveats apply to  the  object  references
     returned  from these functions as to the  returns  of  peek()  in
     class  Queue  and top() in class Stack.  That  is,  you  must  be
     careful  not to destroy the object  referenced  by  the  returned
     value.  See  the  section  entitled  "Object  Ownership"  at  the
     beginning of the chapter for a discussion of this restriction.

     Derived from: Container

     Public member functions:
        isA
        nameOf
        hashValue
        peekLeft
        peekRight
        getLeft
        getRight
        putLeft
        putRight
        initIterator
        printOn              Inherited from Container.
        isEqual              Inherited from Container.
        isEmpty              Inherited from Container.
        forEach              Inherited from Container.
        firstThat            Inherited from Container.
        lastThat             Inherited from Container.
        printHeader          Inherited from Container.
        printSeparator       Inherited from Container.
        printTrailer         Inherited from Container.
        getItemsInContainer  Inherited from Container.
        isSortable           Inherited from Object.
        isAssociation        Inherited from Object.
        operator new         Inherited from Object.