2001-06-27 19:09:53 +02:00
|
|
|
// Stack implementation -*- C++ -*-
|
|
|
|
|
2011-01-17 18:35:55 +01:00
|
|
|
// Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009,
|
2012-05-03 00:25:28 +02:00
|
|
|
// 2010, 2011, 2012
|
2006-08-03 23:11:13 +02:00
|
|
|
// Free Software Foundation, Inc.
|
2001-06-27 19:09:53 +02:00
|
|
|
//
|
|
|
|
// This file is part of the GNU ISO C++ Library. This library is free
|
|
|
|
// software; you can redistribute it and/or modify it under the
|
|
|
|
// terms of the GNU General Public License as published by the
|
2009-04-09 17:00:19 +02:00
|
|
|
// Free Software Foundation; either version 3, or (at your option)
|
2001-06-27 19:09:53 +02:00
|
|
|
// 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 General Public License for more details.
|
|
|
|
|
2009-04-09 17:00:19 +02:00
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
|
|
|
// permissions described in the GCC Runtime Library Exception, version
|
|
|
|
// 3.1, as published by the Free Software Foundation.
|
2001-06-27 19:09:53 +02:00
|
|
|
|
2009-04-09 17:00:19 +02:00
|
|
|
// You should have received a copy of the GNU General Public License and
|
|
|
|
// a copy of the GCC Runtime Library Exception along with this program;
|
|
|
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
|
|
// <http://www.gnu.org/licenses/>.
|
2001-06-27 19:09:53 +02:00
|
|
|
|
2000-10-05 13:27:02 +02:00
|
|
|
/*
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
2010-12-19 10:21:16 +01:00
|
|
|
/** @file bits/stl_stack.h
|
c_io_stdio.h: Correct grammar in comments.
2001-11-02 Phil Edwards <pme@gcc.gnu.org>
* config/io/c_io_stdio.h: Correct grammar in comments.
* docs/doxygen/Intro.3: Expand "top-level" man page.
* docs/doxygen/doxygroups.cc: New module definitions (comments).
* docs/doxygen/mainpage.doxy: Tweaks.
* docs/doxygen/run_doxygen: Update Doxygen version, massage man pages.
Add @file hooks so that headers are considered to be documented.
* include/bits/basic_ios.h, include/bits/basic_file.h,
include/bits/basic_string.h, include/bits/boost_concept_check.h,
include/bits/char_traits.h, include/bits/codecvt.h,
include/bits/concept_check.h, include/bits/cpp_type_traits.h,
include/bits/fpos.h, include/bits/gslice.h, include/bits/gslice_array.h,
include/bits/indirect_array.h, include/bits/ios_base.h,
include/bits/locale_facets.h, include/bits/localefwd.h,
include/bits/mask_array.h, include/bits/pthread_allocimpl.h,
include/bits/slice.h, include/bits/slice_array.h,
include/bits/std_algorithm.h, include/bits/std_bitset.h,
include/bits/std_complex.h, include/bits/std_deque.h,
include/bits/std_fstream.h, include/bits/std_functional.h,
include/bits/std_iomanip.h, include/bits/std_ios.h,
include/bits/std_iosfwd.h, include/bits/std_iostream.h,
include/bits/std_istream.h, include/bits/std_iterator.h,
include/bits/std_limits.h, include/bits/std_list.h,
include/bits/std_locale.h, include/bits/std_map.h,
include/bits/std_memory.h, include/bits/std_numeric.h,
include/bits/std_ostream.h, include/bits/std_queue.h,
include/bits/std_set.h, include/bits/std_sstream.h,
include/bits/std_stack.h, include/bits/std_streambuf.h,
include/bits/std_string.h, include/bits/std_utility.h,
include/bits/std_valarray.h, include/bits/std_vector.h,
include/bits/stl_algo.h, include/bits/stl_alloc.h,
include/bits/stl_bvector.h, include/bits/stl_construct.h,
include/bits/stl_deque.h, include/bits/stl_heap.h,
include/bits/stl_iterator.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_iterator_base_types.h, include/bits/stl_list.h,
include/bits/stl_map.h, include/bits/stl_multimap.h,
include/bits/stl_multiset.h, include/bits/stl_numeric.h,
include/bits/stl_pair.h, include/bits/stl_pthread_alloc.h,
include/bits/stl_queue.h, include/bits/stl_raw_storage_iter.h,
include/bits/stl_relops.h, include/bits/stl_set.h,
include/bits/stl_stack.h, include/bits/stl_tempbuf.h,
include/bits/stl_threads.h, include/bits/stl_tree.h,
include/bits/stl_uninitialized.h, include/bits/stl_vector.h,
include/bits/stream_iterator.h, include/bits/streambuf_iterator.h,
include/bits/stringfwd.h, include/bits/type_traits.h,
include/bits/valarray_array.h, include/bits/valarray_meta.h:
Add hooks, tweak comments only.
* include/bits/stl_algobase.h (swap, min, iter_swap): Also
document these functions.
* include/bits/stl_function.h: Tweak link comments.
From-SVN: r46717
2001-11-02 18:38:11 +01:00
|
|
|
* This is an internal header file, included by other library headers.
|
2010-12-19 10:21:16 +01:00
|
|
|
* Do not attempt to use it directly. @headername{stack}
|
2000-10-05 13:27:02 +02:00
|
|
|
*/
|
|
|
|
|
2007-06-18 19:22:53 +02:00
|
|
|
#ifndef _STL_STACK_H
|
|
|
|
#define _STL_STACK_H 1
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2001-04-03 02:26:58 +02:00
|
|
|
#include <bits/concept_check.h>
|
2003-11-11 21:09:16 +01:00
|
|
|
#include <debug/debug.h>
|
2000-10-05 13:27:02 +02:00
|
|
|
|
PR libstdc++/36104 part four
2011-01-30 Benjamin Kosnik <bkoz@redhat.com>
PR libstdc++/36104 part four
* include/bits/c++config (_GLIBCXX_STD): Remove.
(_GLIBCXX_STD_D, _GLIBCXX_PR): Now _GLIBCXX_STD_C.
(_GLIBCXX_P): Now _GLIBCXX_STD_A.
(_GLIBCXX_NAMESPACE_DEBUG, _GLIBCXX_NAMESPACE_PARALLEL,
_GLIBCXX_NAMESPACE_PROFILE, _GLIBCXX_NAMESPACE_VERSION): Remove.
(_GLIBCXX_INLINE_DEBUG, _GLIBCXX_INLINE_PARALLEL,
_GLIBCXX_INLINE_PROFILE): Remove.
(_GLIBCXX_BEGIN_NAMESPACE(X)): Remove.
(_GLIBCXX_END_NAMESPACE): Remove.
(_GLIBCXX_BEGIN_NESTED_NAMESPACE(X, Y)): Remove.
(_GLIBCXX_END_NESTED_NAMESPACE): Remove.
(_GLIBCXX_BEGIN_NAMESPACE_ALGO): Add.
(_GLIBCXX_END_NAMESPACE_ALGO): Add.
(_GLIBCXX_BEGIN_NAMESPACE_CONTAINER): Add.
(_GLIBCXX_END_NAMESPACE_CONTAINER): Add.
(_GLIBCXX_BEGIN_NAMESPACE_VERSION): Add.
(_GLIBCXX_END_NAMESPACE_VERSION): Add.
(_GLIBCXX_BEGIN_LDBL_NAMESPACE): To _GLIBCXX_BEGIN_NAMESPACE_LDBL.
(_GLIBCXX_END_LDBL_NAMESPACE): To _GLIBCXX_END_NAMESPACE_LDBL.
(_GLIBCXX_VISIBILITY_ATTR): Revert to _GLIBCXX_VISIBILITY.
* include/*: Use new macros for namespace scope.
* config/*: Same.
* src/*: Same.
* src/Makefile.am (sources): Remove debug_list.cc, add
compatibility-debug_list-2.cc.
(parallel_sources): Remove parallel_list.cc, add
compatibility-parallel_list-2.cc.
(compatibility-parallel_list-2.[o,lo]): New rule.
* src/Makefile.in: Regenerate.
* src/debug_list.cc: Remove.
* src/parallel_list.cc: Remove.
* src/compatibility-list-2.cc: New.
* src/compatibility-debug_list-2.cc: New.
* src/compatibility-parallel_list-2.cc: New.
* doc/doxygen/user.cfg.in: Adjust macros.
* testsuite/20_util/auto_ptr/assign_neg.cc: Adjust line numbers, macros.
* testsuite/20_util/declval/requirements/1_neg.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg1.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg2.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg3.cc: Same.
* testsuite/20_util/forward/c_neg.cc: Same.
* testsuite/20_util/forward/f_neg.cc: Same.
* testsuite/20_util/make_signed/requirements/typedefs_neg.cc: Same.
* testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc: Same.
* testsuite/20_util/ratio/cons/cons_overflow_neg.cc: Same.
* testsuite/20_util/ratio/operations/ops_overflow_neg.cc: Same.
* testsuite/20_util/shared_ptr/cons/43820_neg.cc: Same.
* testsuite/20_util/weak_ptr/comparison/cmp_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/insert_neg.cc: Same.
* testsuite/23_containers/forward_list/capacity/1.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
assign_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
insert_neg.cc: Same.
* testsuite/23_containers/list/capacity/29134.cc: Same.
* testsuite/23_containers/list/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/insert_neg.cc: Same.
* testsuite/23_containers/vector/bool/capacity/29134.cc: Same.
* testsuite/23_containers/vector/bool/modifiers/insert/31370.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/insert_neg.cc: Same.
* testsuite/25_algorithms/sort/35588.cc: Same.
* testsuite/27_io/ios_base/cons/assign_neg.cc: Same.
* testsuite/27_io/ios_base/cons/copy_neg.cc: Same.
* testsuite/ext/profile/mutex_extensions_neg.cc: Same.
* testsuite/ext/profile/profiler_algos.cc: Same.
* testsuite/ext/type_traits/add_unsigned_floating_neg.cc: Same.
* testsuite/ext/type_traits/add_unsigned_integer_neg.cc: Same.
* testsuite/ext/type_traits/remove_unsigned_floating_neg.cc: Same.
* testsuite/ext/type_traits/remove_unsigned_integer_neg.cc: Same.
* testsuite/tr1/2_general_utilities/shared_ptr/cons/43820_neg.cc: Same.
From-SVN: r169421
2011-01-30 23:39:36 +01:00
|
|
|
namespace std _GLIBCXX_VISIBILITY(default)
|
|
|
|
{
|
|
|
|
_GLIBCXX_BEGIN_NAMESPACE_VERSION
|
2005-12-19 01:56:05 +01:00
|
|
|
|
2002-06-22 05:03:56 +02:00
|
|
|
/**
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* @brief A standard container giving FILO behavior.
|
|
|
|
*
|
2009-02-19 09:15:15 +01:00
|
|
|
* @ingroup sequences
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
*
|
2012-05-03 00:25:28 +02:00
|
|
|
* @tparam _Tp Type of element.
|
|
|
|
* @tparam _Sequence Type of underlying sequence, defaults to deque<_Tp>.
|
|
|
|
*
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* Meets many of the requirements of a
|
|
|
|
* <a href="tables.html#65">container</a>,
|
|
|
|
* but does not define anything to do with iterators. Very few of the
|
|
|
|
* other standard container interfaces are defined.
|
|
|
|
*
|
2003-11-11 21:09:16 +01:00
|
|
|
* This is not a true container, but an @e adaptor. It holds
|
|
|
|
* another container, and provides a wrapper interface to that
|
|
|
|
* container. The wrapper is what enforces strict
|
|
|
|
* first-in-last-out %stack behavior.
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
*
|
|
|
|
* The second template parameter defines the type of the underlying
|
2003-11-11 21:09:16 +01:00
|
|
|
* sequence/container. It defaults to std::deque, but it can be
|
|
|
|
* any type that supports @c back, @c push_back, and @c pop_front,
|
|
|
|
* such as std::list, std::vector, or an appropriate user-defined
|
|
|
|
* type.
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
*
|
2010-02-04 19:20:34 +01:00
|
|
|
* Members not found in @a normal containers are @c container_type,
|
2003-11-11 21:09:16 +01:00
|
|
|
* which is a typedef for the second Sequence parameter, and @c
|
|
|
|
* push, @c pop, and @c top, which are standard %stack/FILO
|
|
|
|
* operations.
|
2002-06-22 05:03:56 +02:00
|
|
|
*/
|
2006-09-21 19:54:50 +02:00
|
|
|
template<typename _Tp, typename _Sequence = deque<_Tp> >
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
class stack
|
2003-11-11 21:09:16 +01:00
|
|
|
{
|
|
|
|
// concept requirements
|
|
|
|
typedef typename _Sequence::value_type _Sequence_value_type;
|
|
|
|
__glibcxx_class_requires(_Tp, _SGIAssignableConcept)
|
|
|
|
__glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
|
|
|
|
__glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2004-02-06 22:32:48 +01:00
|
|
|
template<typename _Tp1, typename _Seq1>
|
2004-02-08 05:46:42 +01:00
|
|
|
friend bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator==(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
|
2003-11-11 21:09:16 +01:00
|
|
|
|
|
|
|
template<typename _Tp1, typename _Seq1>
|
2004-02-08 05:46:42 +01:00
|
|
|
friend bool
|
2003-11-11 21:09:16 +01:00
|
|
|
operator<(const stack<_Tp1, _Seq1>&, const stack<_Tp1, _Seq1>&);
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
public:
|
|
|
|
typedef typename _Sequence::value_type value_type;
|
|
|
|
typedef typename _Sequence::reference reference;
|
|
|
|
typedef typename _Sequence::const_reference const_reference;
|
|
|
|
typedef typename _Sequence::size_type size_type;
|
|
|
|
typedef _Sequence container_type;
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
protected:
|
|
|
|
// See queue::c for notes on this name.
|
|
|
|
_Sequence c;
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
public:
|
|
|
|
// XXX removed old def ctor, added def arg to this one to match 14882
|
|
|
|
/**
|
|
|
|
* @brief Default constructor creates no elements.
|
|
|
|
*/
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#ifndef __GXX_EXPERIMENTAL_CXX0X__
|
2003-11-11 21:09:16 +01:00
|
|
|
explicit
|
2004-02-06 22:32:48 +01:00
|
|
|
stack(const _Sequence& __c = _Sequence())
|
2006-08-03 23:11:13 +02:00
|
|
|
: c(__c) { }
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#else
|
|
|
|
explicit
|
|
|
|
stack(const _Sequence& __c)
|
|
|
|
: c(__c) { }
|
|
|
|
|
|
|
|
explicit
|
|
|
|
stack(_Sequence&& __c = _Sequence())
|
|
|
|
: c(std::move(__c)) { }
|
|
|
|
#endif
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/**
|
|
|
|
* Returns true if the %stack is empty.
|
|
|
|
*/
|
|
|
|
bool
|
2004-02-06 22:32:48 +01:00
|
|
|
empty() const
|
|
|
|
{ return c.empty(); }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/** Returns the number of elements in the %stack. */
|
|
|
|
size_type
|
2004-02-06 22:32:48 +01:00
|
|
|
size() const
|
|
|
|
{ return c.size(); }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/**
|
|
|
|
* Returns a read/write reference to the data at the first
|
|
|
|
* element of the %stack.
|
|
|
|
*/
|
|
|
|
reference
|
2004-02-08 05:46:42 +01:00
|
|
|
top()
|
|
|
|
{
|
2003-11-11 21:09:16 +01:00
|
|
|
__glibcxx_requires_nonempty();
|
2004-02-08 05:46:42 +01:00
|
|
|
return c.back();
|
2003-11-11 21:09:16 +01:00
|
|
|
}
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/**
|
|
|
|
* Returns a read-only (constant) reference to the data at the first
|
|
|
|
* element of the %stack.
|
|
|
|
*/
|
|
|
|
const_reference
|
2004-02-08 05:46:42 +01:00
|
|
|
top() const
|
2003-11-11 21:09:16 +01:00
|
|
|
{
|
|
|
|
__glibcxx_requires_nonempty();
|
2004-02-08 05:46:42 +01:00
|
|
|
return c.back();
|
2003-11-11 21:09:16 +01:00
|
|
|
}
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/**
|
|
|
|
* @brief Add data to the top of the %stack.
|
2011-08-07 09:27:06 +02:00
|
|
|
* @param __x Data to be added.
|
2003-11-11 21:09:16 +01:00
|
|
|
*
|
|
|
|
* This is a typical %stack operation. The function creates an
|
|
|
|
* element at the top of the %stack and assigns the given data
|
|
|
|
* to it. The time complexity of the operation depends on the
|
|
|
|
* underlying sequence.
|
|
|
|
*/
|
|
|
|
void
|
2004-02-06 22:32:48 +01:00
|
|
|
push(const value_type& __x)
|
|
|
|
{ c.push_back(__x); }
|
stl_deque.h (deque<>::push_back(_Args&&...), [...]): Remove.
2008-06-13 Paolo Carlini <paolo.carlini@oracle.com>
* include/bits/stl_deque.h (deque<>::push_back(_Args&&...),
deque<>::push_front(_Args&&...)): Remove.
(deque<>::push_back(value_type&&),
deque<>::push_front(value_type&&)): Add.
(deque<>::push_back(const value_type&),
deque<>::push_front(const value_type&)): Add back.
(deque<>::emplace_back(_Args&&...),
deque<>::emplace_front(_Args&&...)): Declare...
* include/bits/deque.tcc: ... and define.
* include/bits/stl_list.h (list<>::push_back(_Args&&...),
list<>::push_front(_Args&&...)): Remove.
(list<>::push_back(value_type&&), list<>::push_front(value_type&&),
list<>::emplace_back(_Args&&...), list<>::emplace_front(_Args&&...)):
Add.
(list<>::push_back(const value_type&),
list<>::push_front(const value_type&)): Add back.
* include/bits/stl_vector.h (vector<>::push_back(_Args&&...)): Remove.
(vector<>::push_back(value_type&&)): Add.
(vector<>::push_back(const value_type&)): Add back.
(vector<>::emplace_back(_Args&&...)): Declare...
* include/bits/vector.tcc: ... and define.
* include/bits/stl_queue.h (queue<>::push(_Args&&...),
priority_queue<>::push(_Args&&...)): Remove.
(queue<>::push(value_type&&), queue<>::emplace(_Args&&...),
priority_queue<>::push(value_type&&),
priority_queue<>::emplace(_Args&&...)): Add.
(queue<>::push(const value_type&),
priority_queue<>::push(const value_type&)): Add back.
* include/bits/stl_stack.h (stack<>::push(_Args&&...)): Remove.
(stack<>::push(value_type&&), stack<>::emplace(_Args&&...)): Add.
(stack<>::push(const value_type&)): Add back.
* include/debug/deque (deque<>::push_back(_Args&&...),
deque<>::push_front(_Args&&...)): Remove.
(deque<>::push_back(value_type&&), deque<>::push_front(value_type&&),
deque<>::emplace_back(_Args&&...), deque<>::emplace_front(_Args&&...)):
Add.
(deque<>::push_back(const value_type&),
deque<>::push_front(const value_type&)): Add back.
* include/debug/list (list<>::push_back(_Args&&...),
list<>::push_front(_Args&&...)): Remove.
(list<>::push_back(value_type&&), list<>::push_front(value_type&&),
list<>::emplace_back(_Args&&...), list<>::emplace_front(_Args&&...)):
Add.
(list<>::push_back(const value_type&),
list<>::push_front(const value_type&)): Add back.
* include/debug/vector (vector<>::push_back(_Args&&...)): Remove.
(vector<>::push_back(value_type&&),
vector<>::emplace_back(_Args&&...)): Add.
(vector<>::push_back(const value_type&)): Add back.
* testsuite/23_containers/deque/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/deque/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/deque/requirements/dr438/
constructor_1_neg.cc: Likewise.
* testsuite/23_containers/deque/requirements/dr438/
constructor_2_neg.cc: Likewise.
* testsuite/23_containers/list/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/list/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/list/requirements/dr438/constructor_1_neg.cc:
Likewise.
* testsuite/23_containers/list/requirements/dr438/constructor_2_neg.cc:
Likewise.
* testsuite/23_containers/vector/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/vector/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/vector/requirements/dr438/
constructor_1_neg.cc: Likewise.
* testsuite/23_containers/vector/requirements/dr438/
constructor_2_neg.cc: Likewise.
From-SVN: r136750
2008-06-13 14:03:13 +02:00
|
|
|
|
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
|
|
|
void
|
|
|
|
push(value_type&& __x)
|
|
|
|
{ c.push_back(std::move(__x)); }
|
|
|
|
|
2007-11-01 02:40:56 +01:00
|
|
|
template<typename... _Args>
|
|
|
|
void
|
stl_deque.h (deque<>::push_back(_Args&&...), [...]): Remove.
2008-06-13 Paolo Carlini <paolo.carlini@oracle.com>
* include/bits/stl_deque.h (deque<>::push_back(_Args&&...),
deque<>::push_front(_Args&&...)): Remove.
(deque<>::push_back(value_type&&),
deque<>::push_front(value_type&&)): Add.
(deque<>::push_back(const value_type&),
deque<>::push_front(const value_type&)): Add back.
(deque<>::emplace_back(_Args&&...),
deque<>::emplace_front(_Args&&...)): Declare...
* include/bits/deque.tcc: ... and define.
* include/bits/stl_list.h (list<>::push_back(_Args&&...),
list<>::push_front(_Args&&...)): Remove.
(list<>::push_back(value_type&&), list<>::push_front(value_type&&),
list<>::emplace_back(_Args&&...), list<>::emplace_front(_Args&&...)):
Add.
(list<>::push_back(const value_type&),
list<>::push_front(const value_type&)): Add back.
* include/bits/stl_vector.h (vector<>::push_back(_Args&&...)): Remove.
(vector<>::push_back(value_type&&)): Add.
(vector<>::push_back(const value_type&)): Add back.
(vector<>::emplace_back(_Args&&...)): Declare...
* include/bits/vector.tcc: ... and define.
* include/bits/stl_queue.h (queue<>::push(_Args&&...),
priority_queue<>::push(_Args&&...)): Remove.
(queue<>::push(value_type&&), queue<>::emplace(_Args&&...),
priority_queue<>::push(value_type&&),
priority_queue<>::emplace(_Args&&...)): Add.
(queue<>::push(const value_type&),
priority_queue<>::push(const value_type&)): Add back.
* include/bits/stl_stack.h (stack<>::push(_Args&&...)): Remove.
(stack<>::push(value_type&&), stack<>::emplace(_Args&&...)): Add.
(stack<>::push(const value_type&)): Add back.
* include/debug/deque (deque<>::push_back(_Args&&...),
deque<>::push_front(_Args&&...)): Remove.
(deque<>::push_back(value_type&&), deque<>::push_front(value_type&&),
deque<>::emplace_back(_Args&&...), deque<>::emplace_front(_Args&&...)):
Add.
(deque<>::push_back(const value_type&),
deque<>::push_front(const value_type&)): Add back.
* include/debug/list (list<>::push_back(_Args&&...),
list<>::push_front(_Args&&...)): Remove.
(list<>::push_back(value_type&&), list<>::push_front(value_type&&),
list<>::emplace_back(_Args&&...), list<>::emplace_front(_Args&&...)):
Add.
(list<>::push_back(const value_type&),
list<>::push_front(const value_type&)): Add back.
* include/debug/vector (vector<>::push_back(_Args&&...)): Remove.
(vector<>::push_back(value_type&&),
vector<>::emplace_back(_Args&&...)): Add.
(vector<>::push_back(const value_type&)): Add back.
* testsuite/23_containers/deque/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/deque/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/deque/requirements/dr438/
constructor_1_neg.cc: Likewise.
* testsuite/23_containers/deque/requirements/dr438/
constructor_2_neg.cc: Likewise.
* testsuite/23_containers/list/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/list/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/list/requirements/dr438/constructor_1_neg.cc:
Likewise.
* testsuite/23_containers/list/requirements/dr438/constructor_2_neg.cc:
Likewise.
* testsuite/23_containers/vector/requirements/dr438/assign_neg.cc:
Adjust dg-error line numbers.
* testsuite/23_containers/vector/requirements/dr438/insert_neg.cc:
Likewise.
* testsuite/23_containers/vector/requirements/dr438/
constructor_1_neg.cc: Likewise.
* testsuite/23_containers/vector/requirements/dr438/
constructor_2_neg.cc: Likewise.
From-SVN: r136750
2008-06-13 14:03:13 +02:00
|
|
|
emplace(_Args&&... __args)
|
|
|
|
{ c.emplace_back(std::forward<_Args>(__args)...); }
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#endif
|
|
|
|
|
2003-11-11 21:09:16 +01:00
|
|
|
/**
|
|
|
|
* @brief Removes first element.
|
|
|
|
*
|
|
|
|
* This is a typical %stack operation. It shrinks the %stack
|
|
|
|
* by one. The time complexity of the operation depends on the
|
|
|
|
* underlying sequence.
|
|
|
|
*
|
|
|
|
* Note that no data is returned, and if the first element's
|
|
|
|
* data is needed, it should be retrieved before pop() is
|
|
|
|
* called.
|
|
|
|
*/
|
|
|
|
void
|
2004-02-08 05:46:42 +01:00
|
|
|
pop()
|
2003-11-11 21:09:16 +01:00
|
|
|
{
|
|
|
|
__glibcxx_requires_nonempty();
|
2004-02-08 05:46:42 +01:00
|
|
|
c.pop_back();
|
2003-11-11 21:09:16 +01:00
|
|
|
}
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
|
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
|
|
|
void
|
2009-05-19 00:15:56 +02:00
|
|
|
swap(stack& __s)
|
2011-05-26 02:36:35 +02:00
|
|
|
noexcept(noexcept(swap(c, __s.c)))
|
2011-01-17 18:35:55 +01:00
|
|
|
{
|
|
|
|
using std::swap;
|
|
|
|
swap(c, __s.c);
|
|
|
|
}
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#endif
|
2003-11-11 21:09:16 +01:00
|
|
|
};
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2002-06-22 05:03:56 +02:00
|
|
|
/**
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* @brief Stack equality comparison.
|
2011-08-07 09:27:06 +02:00
|
|
|
* @param __x A %stack.
|
|
|
|
* @param __y A %stack of the same type as @a __x.
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* @return True iff the size and elements of the stacks are equal.
|
2002-06-22 05:03:56 +02:00
|
|
|
*
|
2003-11-11 21:09:16 +01:00
|
|
|
* This is an equivalence relation. Complexity and semantics
|
|
|
|
* depend on the underlying sequence type, but the expected rules
|
|
|
|
* are: this relation is linear in the size of the sequences, and
|
|
|
|
* stacks are considered equivalent if their sequences compare
|
|
|
|
* equal.
|
2002-06-22 05:03:56 +02:00
|
|
|
*/
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return __x.c == __y.c; }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
2002-06-22 05:03:56 +02:00
|
|
|
/**
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* @brief Stack ordering relation.
|
2011-08-07 09:27:06 +02:00
|
|
|
* @param __x A %stack.
|
|
|
|
* @param __y A %stack of the same type as @a x.
|
|
|
|
* @return True iff @a x is lexicographically less than @a __y.
|
2002-06-22 05:03:56 +02:00
|
|
|
*
|
2003-11-11 21:09:16 +01:00
|
|
|
* This is an total ordering relation. Complexity and semantics
|
|
|
|
* depend on the underlying sequence type, but the expected rules
|
|
|
|
* are: this relation is linear in the size of the sequences, the
|
|
|
|
* elements must be comparable with @c <, and
|
|
|
|
* std::lexicographical_compare() is usually used to make the
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
* determination.
|
2002-06-22 05:03:56 +02:00
|
|
|
*/
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return __x.c < __y.c; }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
/// Based on operator==
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator!=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return !(__x == __y); }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
/// Based on operator<
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator>(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return __y < __x; }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
/// Based on operator<
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator<=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return !(__y < __x); }
|
2004-02-08 05:46:42 +01:00
|
|
|
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
/// Based on operator<
|
2003-11-11 21:09:16 +01:00
|
|
|
template<typename _Tp, typename _Seq>
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
inline bool
|
2004-02-06 22:32:48 +01:00
|
|
|
operator>=(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y)
|
deque.tcc, [...]: Re-indent contents of namespace std, re-wrap comment lines as necessary.
2002-08-09 Phil Edwards <pme@gcc.gnu.org>
* include/bits/deque.tcc, include/bits/list.tcc,
include/bits/stl_deque.h, include/bits/stl_iterator_base_funcs.h,
include/bits/stl_list.h, include/bits/stl_map.h,
include/bits/stl_multimap.h, include/bits/stl_queue.h,
include/bits/stl_stack.h, include/bits/stl_vector.h,
include/bits/vector.tcc: Re-indent contents of namespace std,
re-wrap comment lines as necessary.
From-SVN: r56165
2002-08-09 18:51:15 +02:00
|
|
|
{ return !(__x < __y); }
|
2005-12-19 01:56:05 +01:00
|
|
|
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
|
|
|
template<typename _Tp, typename _Seq>
|
|
|
|
inline void
|
|
|
|
swap(stack<_Tp, _Seq>& __x, stack<_Tp, _Seq>& __y)
|
2011-05-26 02:36:35 +02:00
|
|
|
noexcept(noexcept(__x.swap(__y)))
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
{ __x.swap(__y); }
|
2010-09-27 19:27:43 +02:00
|
|
|
|
|
|
|
template<typename _Tp, typename _Seq, typename _Alloc>
|
|
|
|
struct uses_allocator<stack<_Tp, _Seq>, _Alloc>
|
|
|
|
: public uses_allocator<_Seq, _Alloc>::type { };
|
stl_queue.h (queue<>::queue(_Sequence&&), [...]): Add.
2007-10-16 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h (queue<>::queue(_Sequence&&),
queue<>::queue(queue&&), queue<>::operator=(queue&&),
queue<>::push(value_type&&), queue<>::swap(queue&&),
swap(queue<>&, queue<>&), swap(queue<>&&, queue<>&),
swap(queue<>&, queue<>&&), priority_queue<>::
priority_queue(const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(_InputIterator, _InputIterator,
const _Compare&, _Sequence&&),
priority_queue<>::priority_queue(priority_queue&&),
priority_queue<>::operator=(priority_queue&&),
priority_queue<>::push(value_type&&),
priority_queue<>::swap(priority_queue&&),
swap(priority_queue<>&, priority_queue<>&),
swap(priority_queue<>&&, priority_queue<>&),
swap(priority_queue<>&, priority_queue<>&&)): Add.
* include/bits/stl_stack.h (stack<>::stack(_Sequence&&),
stack<>::push(value_type&&), stack<>::swap(stack&&),
swap(stack<>&, stack<>&), swap(stack<>&&, stack<>&),
swap(stack<>&, stack<>&&)): Add.
* testsuite/23_containers/queue/moveable.cc: New.
* testsuite/23_containers/priority_queue/moveable.cc: Likewise.
From-SVN: r129390
2007-10-16 23:54:41 +02:00
|
|
|
#endif
|
|
|
|
|
PR libstdc++/36104 part four
2011-01-30 Benjamin Kosnik <bkoz@redhat.com>
PR libstdc++/36104 part four
* include/bits/c++config (_GLIBCXX_STD): Remove.
(_GLIBCXX_STD_D, _GLIBCXX_PR): Now _GLIBCXX_STD_C.
(_GLIBCXX_P): Now _GLIBCXX_STD_A.
(_GLIBCXX_NAMESPACE_DEBUG, _GLIBCXX_NAMESPACE_PARALLEL,
_GLIBCXX_NAMESPACE_PROFILE, _GLIBCXX_NAMESPACE_VERSION): Remove.
(_GLIBCXX_INLINE_DEBUG, _GLIBCXX_INLINE_PARALLEL,
_GLIBCXX_INLINE_PROFILE): Remove.
(_GLIBCXX_BEGIN_NAMESPACE(X)): Remove.
(_GLIBCXX_END_NAMESPACE): Remove.
(_GLIBCXX_BEGIN_NESTED_NAMESPACE(X, Y)): Remove.
(_GLIBCXX_END_NESTED_NAMESPACE): Remove.
(_GLIBCXX_BEGIN_NAMESPACE_ALGO): Add.
(_GLIBCXX_END_NAMESPACE_ALGO): Add.
(_GLIBCXX_BEGIN_NAMESPACE_CONTAINER): Add.
(_GLIBCXX_END_NAMESPACE_CONTAINER): Add.
(_GLIBCXX_BEGIN_NAMESPACE_VERSION): Add.
(_GLIBCXX_END_NAMESPACE_VERSION): Add.
(_GLIBCXX_BEGIN_LDBL_NAMESPACE): To _GLIBCXX_BEGIN_NAMESPACE_LDBL.
(_GLIBCXX_END_LDBL_NAMESPACE): To _GLIBCXX_END_NAMESPACE_LDBL.
(_GLIBCXX_VISIBILITY_ATTR): Revert to _GLIBCXX_VISIBILITY.
* include/*: Use new macros for namespace scope.
* config/*: Same.
* src/*: Same.
* src/Makefile.am (sources): Remove debug_list.cc, add
compatibility-debug_list-2.cc.
(parallel_sources): Remove parallel_list.cc, add
compatibility-parallel_list-2.cc.
(compatibility-parallel_list-2.[o,lo]): New rule.
* src/Makefile.in: Regenerate.
* src/debug_list.cc: Remove.
* src/parallel_list.cc: Remove.
* src/compatibility-list-2.cc: New.
* src/compatibility-debug_list-2.cc: New.
* src/compatibility-parallel_list-2.cc: New.
* doc/doxygen/user.cfg.in: Adjust macros.
* testsuite/20_util/auto_ptr/assign_neg.cc: Adjust line numbers, macros.
* testsuite/20_util/declval/requirements/1_neg.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg1.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg2.cc: Same.
* testsuite/20_util/duration/requirements/typedefs_neg3.cc: Same.
* testsuite/20_util/forward/c_neg.cc: Same.
* testsuite/20_util/forward/f_neg.cc: Same.
* testsuite/20_util/make_signed/requirements/typedefs_neg.cc: Same.
* testsuite/20_util/make_unsigned/requirements/typedefs_neg.cc: Same.
* testsuite/20_util/ratio/cons/cons_overflow_neg.cc: Same.
* testsuite/20_util/ratio/operations/ops_overflow_neg.cc: Same.
* testsuite/20_util/shared_ptr/cons/43820_neg.cc: Same.
* testsuite/20_util/weak_ptr/comparison/cmp_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/deque/requirements/dr438/insert_neg.cc: Same.
* testsuite/23_containers/forward_list/capacity/1.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
assign_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/forward_list/requirements/dr438/
insert_neg.cc: Same.
* testsuite/23_containers/list/capacity/29134.cc: Same.
* testsuite/23_containers/list/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/list/requirements/dr438/insert_neg.cc: Same.
* testsuite/23_containers/vector/bool/capacity/29134.cc: Same.
* testsuite/23_containers/vector/bool/modifiers/insert/31370.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/assign_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/
constructor_1_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/
constructor_2_neg.cc: Same.
* testsuite/23_containers/vector/requirements/dr438/insert_neg.cc: Same.
* testsuite/25_algorithms/sort/35588.cc: Same.
* testsuite/27_io/ios_base/cons/assign_neg.cc: Same.
* testsuite/27_io/ios_base/cons/copy_neg.cc: Same.
* testsuite/ext/profile/mutex_extensions_neg.cc: Same.
* testsuite/ext/profile/profiler_algos.cc: Same.
* testsuite/ext/type_traits/add_unsigned_floating_neg.cc: Same.
* testsuite/ext/type_traits/add_unsigned_integer_neg.cc: Same.
* testsuite/ext/type_traits/remove_unsigned_floating_neg.cc: Same.
* testsuite/ext/type_traits/remove_unsigned_integer_neg.cc: Same.
* testsuite/tr1/2_general_utilities/shared_ptr/cons/43820_neg.cc: Same.
From-SVN: r169421
2011-01-30 23:39:36 +01:00
|
|
|
_GLIBCXX_END_NAMESPACE_VERSION
|
|
|
|
} // namespace
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2007-06-18 19:22:53 +02:00
|
|
|
#endif /* _STL_STACK_H */
|