// -*- C++ -*-
#ifndef __STD_QUEUE__
#define __STD_QUEUE__

/***************************************************************************
 *
 * queue - declarations for the Standard Library queue classes
 *
 ***************************************************************************
 *    
 *  Copyright 2000 Compaq Computer Corporation
 *
 *  COMPAQ Registered in U.S. Patent and Trademark Office.
 *
 *  Confidential computer software. Valid license from Compaq required for
 *  possession, use or copying. Consistent with FAR 12.211 and 12.212,
 *  Commercial Computer Software, Computer Software Documentation, and
 *  Technical Data for Commercial Items are licensed to the U.S. Government
 *  under vendor's standard commercial license.
 *
 ****************************************************************************
 *
 * Copyright (c) 1994
 * Hewlett-Packard Company
 *
 * Permission to use, copy, modify, distribute and sell this software
 * and its documentation for any purpose is hereby granted without fee,
 * provided that the above copyright notice appear in all copies and
 * that both that copyright notice and this permission notice appear
 * in supporting documentation.  Hewlett-Packard Company makes no
 * representations about the suitability of this software for any
 * purpose.  It is provided "as is" without express or implied warranty.
 *
 *
 ***************************************************************************
 *
 * (c) Copyright 1994, 1998 Rogue Wave Software, Inc.
 * ALL RIGHTS RESERVED
 *
 * The software and information contained herein are proprietary to, and
 * comprise valuable trade secrets of, Rogue Wave Software, Inc., which
 * intends to preserve as trade secrets such software and information.
 * This software is furnished pursuant to a written license agreement and
 * may be used, copied, transmitted, and stored only in accordance with
 * the terms of such license and with the inclusion of the above copyright
 * notice.  This software and information or any other copies thereof may
 * not be provided or otherwise made available to any other person.
 *
 * Notwithstanding any other lease or license that may pertain to, or
 * accompany the delivery of, this computer software and information, the
 * rights of the Government regarding its use, reproduction and disclosure
 * are as set forth in Section 52.227-19 of the FARS Computer
 * Software-Restricted Rights clause.
 * 
 * Use, duplication, or disclosure by the Government is subject to
 * restrictions as set forth in subparagraph (c)(1)(ii) of the Rights in
 * Technical Data and Computer Software clause at DFARS 252.227-7013.
 * Contractor/Manufacturer is Rogue Wave Software, Inc.,
 * P.O. Box 2328, Corvallis, Oregon 97339.
 *
 * This computer software and information is distributed with "restricted
 * rights."  Use, duplication or disclosure is subject to restrictions as
 * set forth in NASA FAR SUP 18-52.227-79 (April 1985) "Commercial
 * Computer Software-Restricted Rights (April 1985)."  If the Clause at
 * 18-52.227-74 "Rights in Data General" is specified in the contract,
 * then the "Alternate III" clause applies.
 *
 **************************************************************************/

#include <stdcomp>

#include <algorithm>
#include <functional>
#include <deque>
#include <vector>


#if defined(__DECCXX)
#   ifdef __PRAGMA_ENVIRONMENT
#      pragma __environment __save
#      pragma __environment __cxx_header_defaults
#   endif
#endif

#if defined(__VMS) && defined(__DECCXX) && !defined(__DECFIXCXXL1158)
#pragma __extern_prefix __save
#pragma __extern_prefix "CXXL$" 
#endif


#ifndef _RWSTD_NO_NAMESPACE
namespace std {
#endif

  template <class T, class Container _RWSTD_COMPLEX_DEFAULT(deque<T>) > 
  class queue;

#ifdef _RWSTD_NO_UNDEFINED_FRIEND
  template <class T, class Container>
  inline bool operator== (const queue<T,Container>& x, 
                          const queue<T,Container>& y);

  template <class T, class Container>
  inline bool operator< (const queue<T,Container>& x, 
                         const queue<T,Container>& y);
#endif

  template <class T, class Container>
  class queue
  {
#if defined(__DECCXX) && !defined(__DECFIXCXXL978)
    friend bool operator== <T, Container> (const queue<T,Container>& x,
#else
    friend bool operator== (const queue<T,Container>& x,
#endif
                            const queue<T,Container>& y);
#if defined(__DECCXX) && !defined(__DECFIXCXXL978)
    friend bool operator< <T, Container>  (const queue<T,Container>& x,
#else
    friend bool operator<  (const queue<T,Container>& x,
#endif
                            const queue<T,Container>& y);
  public:

    typedef _TYPENAME Container::value_type         value_type;
    typedef _TYPENAME Container::size_type          size_type;
    typedef _TYPENAME Container::reference          reference;
    typedef _TYPENAME Container::const_reference    const_reference;
    typedef Container                               container_type;

  protected:

    Container c;

  public:
    _EXPLICIT queue(const Container& co _RWSTD_DEFAULT_ARG(Container())) 
    : c(co)
    { ; }

#ifdef _RWSTD_NO_DEFAULT_TEMPLATE_ARGS
    queue(void) : c(Container())
    { ; }
#endif

    bool                  empty () const              { return c.empty(); }
    size_type             size  () const              { return c.size();  }
    reference             front ()                    { return c.front(); }
    const_reference       front () const              { return c.front(); }
    reference             back  ()                    { return c.back();  }
    const_reference       back  () const              { return c.back();  }
    void                  push  (const value_type& x) { c.push_back(x);   }
    void                  pop   ()                    { c.pop_front();    }

  };

  template <class T, class Container>
  inline bool operator== (const queue<T,Container>& x, 
                          const queue<T,Container>& y)
  {
    return x.c == y.c;
  }

  template <class T, class Container>
  inline bool operator< (const queue<T,Container>& x, 
                         const queue<T,Container>& y)
  {
    return x.c < y.c;
  }

  template <class T, class Container>
  inline bool operator!= (const queue<T,Container>& x, 
                          const queue<T,Container>& y)
  {
    return !(x == y);
  }

  template <class T, class Container>
  inline bool operator> (const queue<T,Container>& x, 
                         const queue<T,Container>& y)
  {
    return y < x;
  }

  template <class T, class Container>
  inline bool operator>= (const queue<T,Container>& x, 
                          const queue<T,Container>& y)
  {
    return !(x < y);
  }

  template <class T, class Container>
  inline bool operator<= (const queue<T,Container>& x, 
                          const queue<T,Container>& y)
  {
    return !(y <  x);
  }

#ifndef _RWSTD_NO_COMPLEX_DEFAULT_TEMPLATES
  template<class T, class Container = vector<T>,
  class Compare = less<_TYPENAME Container::value_type> >
#else
  template <class T, class Container, class Compare> 
#endif
  class priority_queue
  {
  public:

    typedef _TYPENAME Container::value_type         value_type;
    typedef _TYPENAME Container::size_type          size_type;
#if defined(__DECCXX) && !defined(__DECFIXCXXL1632)
    typedef _TYPENAME Container::reference          reference;
#endif
    typedef _TYPENAME Container::const_reference    const_reference;
    typedef Container                               container_type;

  protected:

    Container c;
    Compare   comp;

  public:

    _EXPLICIT priority_queue (const Compare& x _RWSTD_DEFAULT_ARG(Compare()),
                              const Container& co _RWSTD_DEFAULT_ARG(Container())) 
      : c(co), comp(x) 
    { ; }

#ifdef _RWSTD_NO_DEFAULT_TEMPLATE_ARGS
    priority_queue (void)
      : c(Container()), comp(Compare()) 
    { ; }

    _EXPLICIT priority_queue (const Compare& x _RWSTD_DEFAULT_ARG(Compare()))
      : c(Container()), comp(x) 
    { ; }
#endif

#ifndef _RWSTD_NO_MEMBER_TEMPLATES
    template <class InputIterator>
    priority_queue (InputIterator first, InputIterator last, 
#if defined(__DECCXX) && !defined(__DECFIXCXXL942)
                    const Compare& x = Compare(), const Container& y = Container())
      : c(y), comp(x) 
#else
                    const Compare& x = Compare())
      : c(first,last), comp(x) 
#endif
    {
#if defined(__DECCXX) && !defined(__DECFIXCXXL942)
	c.insert(c.end(), first, last);
#endif
      make_heap(c.begin(), c.end(), comp);
    }
#else
    priority_queue (_TYPENAME Container::const_iterator first,
                    _TYPENAME Container::const_iterator last,
                    const Compare& x _RWSTD_DEFAULT_ARG(Compare()))

      : c(first, last, Container::allocator_type()), comp(x)
    {
      make_heap(c.begin(), c.end(), comp);
    }
#ifdef _RWSTD_NO_DEFAULT_TEMPLATE_ARGS
    priority_queue (_TYPENAME Container::const_iterator first,
                    _TYPENAME Container::const_iterator last,
                    const Compare& x _RWSTD_DEFAULT_ARG(Compare()))
      : c(first, last, Container::allocator_type()), comp(x)
    {
      make_heap(c.begin(), c.end(), comp);
    }

    priority_queue (_TYPENAME Container::const_iterator first,
                    _TYPENAME Container::const_iterator last)
      : c(first, last, Container::allocator_type()), comp(Compare())
    {
      make_heap(c.begin(), c.end(), comp);
    }
#endif
#endif
    
    bool                  empty () const { return c.empty(); }
    size_type             size  () const { return c.size();  }
    const_reference       top   () const { return c.front(); }

    void push (const value_type& x)
    { 
      c.push_back(x); push_heap(c.begin(), c.end(), comp);
    }
    void pop ()
    {
      pop_heap(c.begin(), c.end(), comp); c.pop_back(); 
    }
  };

#ifndef _RWSTD_NO_NAMESPACE
}
#endif

#if defined(__VMS) && defined(__DECCXX) && !defined(__DECFIXCXXL1158)
#   pragma __extern_prefix __restore
#endif

#if defined(__DECCXX)
#   ifdef __PRAGMA_ENVIRONMENT
#      pragma __environment __restore
#   endif
#endif

#endif /* __STD_QUEUE__ */
