/*

 *

 * Copyright (c) 1994

 * Hewlett-Packard Company

 *

 * Copyright (c) 1996,1997

 * Silicon Graphics Computer Systems, Inc.

 *

 * Copyright (c) 1997

 * Moscow Center for SPARC Technology

 *

 * Copyright (c) 1999

 * Boris Fomitchev

 *

 * This material is provided "as is", with absolutely no warranty expressed

 * or implied. Any use is at your own risk.

 *

 * Permission to use or copy this software for any purpose is hereby granted

 * without fee, provided the above notices are retained on all copies.

 * Permission to modify the code and to distribute modified code is granted,

 * provided the above notices are retained, and a notice that the code was

 * modified is included with the above copyright notice.

 *

 */

#ifndef _STLP_STACK

#  define _STLP_STACK

#ifndef _STLP_OUTERMOST_HEADER_ID

#  define _STLP_OUTERMOST_HEADER_ID 0x60

#  include <stl/_prolog.h>

#endif

#include <deque>

_STLP_BEGIN_NAMESPACE

#  if !defined ( _STLP_LIMITED_DEFAULT_TEMPLATES )

template <class _Tp, class _Sequence = deque<_Tp> >

#  elif defined ( _STLP_MINIMUM_DEFAULT_TEMPLATE_PARAMS )

#    define _STLP_STACK_ARGS _Tp

template <class _Tp>

#  else

template <class _Tp, class _Sequence>

#  endif

class stack

{

#  ifdef _STLP_STACK_ARGS

  typedef deque<_Tp> _Sequence;

  typedef stack<_Tp> _Self;

#  else

  typedef stack<_Tp, _Sequence> _Self;

#  endif

public:

  typedef typename _Sequence::value_type      value_type;

  typedef typename _Sequence::size_type       size_type;

  typedef          _Sequence                  container_type;

  typedef typename _Sequence::reference       reference;

  typedef typename _Sequence::const_reference const_reference;

protected:

  //c is a Standard name (23.2.3.3), do no make it STLport naming convention compliant.

  _Sequence c;

public:

  stack() : c() {}

  explicit stack(const _Sequence& __s) : c(__s) {}

#  if !defined (_STLP_NO_MOVE_SEMANTIC)

  stack(__move_source<_Self> src) :

      c(src.get().c)

    { }

#  endif

  bool empty() const { return c.empty(); }

  size_type size() const { return c.size(); }

  reference top() { return c.back(); }

  const_reference top() const { return c.back(); }

  void push(const value_type& __x) { c.push_back(__x); }

  void pop() { c.pop_back(); }

  const _Sequence& _Get_s() const { return c; }

#  if defined (_STLP_USE_PARTIAL_SPEC_WORKAROUND) && !defined (_STLP_FUNCTION_TMPL_PARTIAL_ORDER)

  void _M_swap_workaround(_Self& __x) {

    _Sequence __tmp = c;

    c = __x.c;

    __x.c = __tmp;

  }

#  endif

};

#  ifndef _STLP_STACK_ARGS

#    define _STLP_STACK_ARGS _Tp, _Sequence

#    define _STLP_STACK_HEADER_ARGS class _Tp, class _Sequence

#  else

#    define _STLP_STACK_HEADER_ARGS class _Tp

#  endif

template < _STLP_STACK_HEADER_ARGS >

inline bool _STLP_CALL  operator==(const stack< _STLP_STACK_ARGS >& __x,

                                   const stack< _STLP_STACK_ARGS >& __y)

{ return __x._Get_s() == __y._Get_s(); }

template < _STLP_STACK_HEADER_ARGS >

inline bool _STLP_CALL  operator<(const stack< _STLP_STACK_ARGS >& __x,

                                  const stack< _STLP_STACK_ARGS >& __y)

{ return __x._Get_s() < __y._Get_s(); }

_STLP_RELOPS_OPERATORS(template < _STLP_STACK_HEADER_ARGS >, stack< _STLP_STACK_ARGS >)

#  undef _STLP_STACK_ARGS

#  undef _STLP_STACK_HEADER_ARGS

#  if defined (_STLP_CLASS_PARTIAL_SPECIALIZATION) && !defined (_STLP_NO_MOVE_SEMANTIC)

template <class _Tp, class _Sequence>

struct __has_trivial_move<stack<_Tp, _Sequence> > :

  public integral_constant<bool, __has_trivial_move<_Sequence>::value>

{ };

template <class _Tp, class _Sequence>

struct __has_move_constructor<stack<_Tp, _Sequence> > :

    public integral_constant<bool, __has_move_constructor<_Sequence>::value>

{ };

#  endif /* _STLP_CLASS_PARTIAL_SPECIALIZATION */

_STLP_END_NAMESPACE

#if (_STLP_OUTERMOST_HEADER_ID == 0x60)

#  include <stl/_epilog.h>

#  undef _STLP_OUTERMOST_HEADER_ID

#endif

#endif /* _STLP_STACK */

// Local Variables:

// mode:C++

// End: