mirror of git://gcc.gnu.org/git/gcc.git
				
				
				
			
		
			
				
	
	
		
			133 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			C++
		
	
	
	
			
		
		
	
	
			133 lines
		
	
	
		
			3.8 KiB
		
	
	
	
		
			C++
		
	
	
	
| /*
 | |
|  *
 | |
|  * 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.
 | |
|  *
 | |
|  *
 | |
|  * Copyright (c) 1996,1997
 | |
|  * Silicon Graphics Computer Systems, Inc.
 | |
|  *
 | |
|  * 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.  Silicon Graphics makes no
 | |
|  * representations about the suitability of this software for any
 | |
|  * purpose.  It is provided "as is" without express or implied warranty.
 | |
|  */
 | |
| 
 | |
| /* NOTE: This is an internal header file, included by other STL headers.
 | |
|  *   You should not attempt to use it directly.
 | |
|  */
 | |
| 
 | |
| #ifndef __SGI_STL_INTERNAL_STACK_H
 | |
| #define __SGI_STL_INTERNAL_STACK_H
 | |
| 
 | |
| #include <bits/sequence_concepts.h>
 | |
| 
 | |
| namespace std
 | |
| {
 | |
| 
 | |
| // Forward declarations of operators == and <, needed for friend declaration.
 | |
| 
 | |
| template <class _Tp, 
 | |
|           class _Sequence = deque<_Tp> >
 | |
| class stack;
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y);
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y);
 | |
| 
 | |
| 
 | |
| template <class _Tp, class _Sequence>
 | |
| class stack {
 | |
| 
 | |
|   // requirements:
 | |
| 
 | |
|   __STL_CLASS_REQUIRES(_Tp, _Assignable);
 | |
|   __STL_CLASS_REQUIRES(_Sequence, _BackInsertionSequence);
 | |
|   typedef typename _Sequence::value_type _Sequence_value_type;
 | |
|   __STL_CLASS_REQUIRES_SAME_TYPE(_Tp, _Sequence_value_type);
 | |
| 
 | |
| 
 | |
|   template <class _Tp1, class _Seq1>
 | |
|   friend bool operator== (const stack<_Tp1, _Seq1>&,
 | |
|                           const stack<_Tp1, _Seq1>&);
 | |
|   template <class _Tp1, class _Seq1>
 | |
|   friend bool operator< (const stack<_Tp1, _Seq1>&,
 | |
|                          const stack<_Tp1, _Seq1>&);
 | |
| 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:
 | |
|   _Sequence c;
 | |
| public:
 | |
|   stack() : c() {}
 | |
|   explicit stack(const _Sequence& __s) : c(__s) {}
 | |
| 
 | |
|   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(); }
 | |
| };
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return __x.c == __y.c;
 | |
| }
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return __x.c < __y.c;
 | |
| }
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator!=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return !(__x == __y);
 | |
| }
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator>(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return __y < __x;
 | |
| }
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator<=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return !(__y < __x);
 | |
| }
 | |
| 
 | |
| template <class _Tp, class _Seq>
 | |
| bool operator>=(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y)
 | |
| {
 | |
|   return !(__x < __y);
 | |
| }
 | |
| 
 | |
| } // namespace std
 | |
| 
 | |
| #endif /* __SGI_STL_INTERNAL_STACK_H */
 | |
| 
 | |
| // Local Variables:
 | |
| // mode:C++
 | |
| // End:
 |