source: trunk/src/emx/include/Attic/cpp/gen/DLDeque.hP@ 18

// This may look like C code, but it is really -*- C++ -*-
/* 
Copyright (C) 1988 Free Software Foundation
    written by Doug Lea ([email protected])

This file is part of the GNU C++ Library.  This library is free
software; you can redistribute it and/or modify it under the terms of
the GNU Library General Public License as published by the Free
Software Foundation; either version 2 of the License, or (at your
option) any later version.  This library is distributed in the hope
that it will be useful, but WITHOUT ANY WARRANTY; without even the
implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE.  See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General Public
License along with this library; if not, write to the Free Software
Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/


#ifndef _<T>DLDeque_h
#ifdef __GNUG__
#pragma interface
#endif
#define _<T>DLDeque_h

#include "<T>.DLList.h"
#include "<T>.Deque.h"

class <T>DLDeque : public <T>Deque
{
  <T>DLList    p;

public:
               <T>DLDeque();
               <T>DLDeque(const <T>DLDeque& d);
  inline              ~<T>DLDeque();

  void          operator = (const <T>DLDeque&);

  inline void          push(<T&> item); // insert at front
  inline void          enq(<T&> item);  // insert at rear

  inline <T>&          front();
  inline <T>&          rear();

  inline <T>           deq();
  inline void          del_front();
  inline void          del_rear();               

  inline void          clear();
  inline int           empty();
  inline int           full();
  inline int           length();
               
  inline int           OK();
};


inline <T>DLDeque::<T>DLDeque() : p() {}
inline <T>DLDeque::<T>DLDeque(const <T>DLDeque& d) : p(d.p) {}

inline <T>DLDeque::~<T>DLDeque() {}

inline void <T>DLDeque::push(<T&>item)
{
  p.prepend(item);
}

inline void <T>DLDeque::enq(<T&>item)
{
  p.append(item);
}

inline <T> <T>DLDeque::deq()
{
  return p.remove_front();
}

inline <T>& <T>DLDeque::front()
{
  return p.front();
}

inline <T>& <T>DLDeque::rear()
{
  return p.rear();
}

inline void <T>DLDeque::del_front()
{
  p.del_front();
}

inline void <T>DLDeque::del_rear()
{
  p.del_rear();
}

inline void <T>DLDeque::operator =(const <T>DLDeque& s)
{
  p.operator = (s.p);
}


inline int <T>DLDeque::empty()
{
  return p.empty();
}

inline int <T>DLDeque::full()
{
  return 0;
}

inline int <T>DLDeque::length()
{
  return p.length();
}

inline int <T>DLDeque::OK()
{
  return p.OK();
}

inline void <T>DLDeque::clear()
{
  p.clear();
}

#endif