| // -*- C++ -*- |
| //===---------------------------- stack -----------------------------------===// |
| // |
| // The LLVM Compiler Infrastructure |
| // |
| // This file is dual licensed under the MIT and the University of Illinois Open |
| // Source Licenses. See LICENSE.TXT for details. |
| // |
| //===----------------------------------------------------------------------===// |
| |
| #ifndef _LIBCPP_STACK |
| #define _LIBCPP_STACK |
| |
| /* |
| stack synopsis |
| |
| namespace std |
| { |
| |
| template <class T, class Container = deque<T>> |
| class stack |
| { |
| public: |
| typedef Container container_type; |
| typedef typename container_type::value_type value_type; |
| typedef typename container_type::reference reference; |
| typedef typename container_type::const_reference const_reference; |
| typedef typename container_type::size_type size_type; |
| |
| protected: |
| container_type c; |
| |
| public: |
| explicit stack(); |
| explicit stack(const container_type& c); |
| explicit stack(container_type&& c); |
| stack(stack&& s); |
| stack& operator=(stack&& s); |
| template <class Alloc> explicit stack(const Alloc& a); |
| template <class Alloc> stack(const container_type& c, const Alloc& a); |
| template <class Alloc> stack(container_type&& c, const Alloc& a); |
| template <class Alloc> stack(stack&& c, const Alloc& a); |
| |
| bool empty() const; |
| size_type size() const; |
| reference top(); |
| const_reference top() const; |
| |
| void push(const value_type& x); |
| void push(value_type&& x); |
| template <class... Args> void emplace(Args&&... args); |
| void pop(); |
| |
| void swap(stack& c); |
| }; |
| |
| template <class T, class Container> |
| bool operator==(const stack<T, Container>& x, const stack<T, Container>& y); |
| template <class T, class Container> |
| bool operator< (const stack<T, Container>& x, const stack<T, Container>& y); |
| template <class T, class Container> |
| bool operator!=(const stack<T, Container>& x, const stack<T, Container>& y); |
| template <class T, class Container> |
| bool operator> (const stack<T, Container>& x, const stack<T, Container>& y); |
| template <class T, class Container> |
| bool operator>=(const stack<T, Container>& x, const stack<T, Container>& y); |
| template <class T, class Container> |
| bool operator<=(const stack<T, Container>& x, const stack<T, Container>& y); |
| |
| template <class T, class Container> |
| void swap(stack<T, Container>& x, stack<T, Container>& y); |
| |
| } // std |
| |
| */ |
| |
| #include <__config> |
| #include <deque> |
| |
| #pragma GCC system_header |
| |
| _LIBCPP_BEGIN_NAMESPACE_STD |
| |
| template <class _Tp, class _Container> class stack; |
| |
| template <class _Tp, class _Container> |
| bool |
| operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y); |
| |
| template <class _Tp, class _Container> |
| bool |
| operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y); |
| |
| template <class _Tp, class _Container = deque<_Tp> > |
| class _LIBCPP_VISIBLE stack |
| { |
| public: |
| typedef _Container container_type; |
| typedef typename container_type::value_type value_type; |
| typedef typename container_type::reference reference; |
| typedef typename container_type::const_reference const_reference; |
| typedef typename container_type::size_type size_type; |
| |
| protected: |
| container_type c; |
| |
| public: |
| _LIBCPP_INLINE_VISIBILITY |
| stack() : c() {} |
| _LIBCPP_INLINE_VISIBILITY |
| explicit stack(const container_type& __c) : c(__c) {} |
| #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| _LIBCPP_INLINE_VISIBILITY |
| explicit stack(container_type&& __c) : c(_STD::move(__c)) {} |
| _LIBCPP_INLINE_VISIBILITY |
| stack(stack&& __s) : c(_STD::move(__s.c)) {} |
| _LIBCPP_INLINE_VISIBILITY |
| stack& operator=(stack&& __s) {c = _STD::move(__s.c); return *this;} |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| template <class _Alloc> |
| _LIBCPP_INLINE_VISIBILITY |
| explicit stack(const _Alloc& __a, |
| typename enable_if<uses_allocator<container_type, |
| _Alloc>::value>::type* = 0) |
| : c(__a) {} |
| template <class _Alloc> |
| _LIBCPP_INLINE_VISIBILITY |
| stack(const container_type& __c, const _Alloc& __a, |
| typename enable_if<uses_allocator<container_type, |
| _Alloc>::value>::type* = 0) |
| : c(__c, __a) {} |
| template <class _Alloc> |
| _LIBCPP_INLINE_VISIBILITY |
| stack(const stack& __s, const _Alloc& __a, |
| typename enable_if<uses_allocator<container_type, |
| _Alloc>::value>::type* = 0) |
| : c(__s.c, __a) {} |
| #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| template <class _Alloc> |
| _LIBCPP_INLINE_VISIBILITY |
| stack(container_type&& __c, const _Alloc& __a, |
| typename enable_if<uses_allocator<container_type, |
| _Alloc>::value>::type* = 0) |
| : c(_STD::move(__c), __a) {} |
| template <class _Alloc> |
| _LIBCPP_INLINE_VISIBILITY |
| stack(stack&& __s, const _Alloc& __a, |
| typename enable_if<uses_allocator<container_type, |
| _Alloc>::value>::type* = 0) |
| : c(_STD::move(__s.c), __a) {} |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| |
| _LIBCPP_INLINE_VISIBILITY |
| bool empty() const {return c.empty();} |
| _LIBCPP_INLINE_VISIBILITY |
| size_type size() const {return c.size();} |
| _LIBCPP_INLINE_VISIBILITY |
| reference top() {return c.back();} |
| _LIBCPP_INLINE_VISIBILITY |
| const_reference top() const {return c.back();} |
| |
| _LIBCPP_INLINE_VISIBILITY |
| void push(const value_type& __v) {c.push_back(__v);} |
| #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| _LIBCPP_INLINE_VISIBILITY |
| void push(value_type&& __v) {c.push_back(_STD::move(__v));} |
| #ifndef _LIBCPP_HAS_NO_VARIADICS |
| template <class... _Args> |
| _LIBCPP_INLINE_VISIBILITY |
| void emplace(_Args&&... __args) |
| {c.emplace_back(_STD::forward<_Args>(__args)...);} |
| #endif // _LIBCPP_HAS_NO_VARIADICS |
| #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES |
| _LIBCPP_INLINE_VISIBILITY |
| void pop() {c.pop_back();} |
| |
| _LIBCPP_INLINE_VISIBILITY |
| void swap(stack& __s) |
| { |
| using _STD::swap; |
| swap(c, __s.c); |
| } |
| |
| template <class T1, class _C1> |
| friend |
| bool |
| operator==(const stack<T1, _C1>& __x, const stack<T1, _C1>& __y); |
| |
| template <class T1, class _C1> |
| friend |
| bool |
| operator< (const stack<T1, _C1>& __x, const stack<T1, _C1>& __y); |
| }; |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator==(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return __x.c == __y.c; |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator< (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return __x.c < __y.c; |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator!=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return !(__x == __y); |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator> (const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return __y < __x; |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator>=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return !(__x < __y); |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| bool |
| operator<=(const stack<_Tp, _Container>& __x, const stack<_Tp, _Container>& __y) |
| { |
| return !(__y < __x); |
| } |
| |
| template <class _Tp, class _Container> |
| inline _LIBCPP_INLINE_VISIBILITY |
| void |
| swap(stack<_Tp, _Container>& __x, stack<_Tp, _Container>& __y) |
| { |
| __x.swap(__y); |
| } |
| |
| template <class _Tp, class _Container, class _Alloc> |
| struct _LIBCPP_VISIBLE uses_allocator<stack<_Tp, _Container>, _Alloc> |
| : public uses_allocator<_Container, _Alloc> |
| { |
| }; |
| |
| _LIBCPP_END_NAMESPACE_STD |
| |
| #endif // _LIBCPP_STACK |