Commit d508327c by Paolo Carlini Committed by Paolo Carlini

stl_queue.h: Trivial formatting fixes.

2006-08-03  Paolo Carlini  <pcarlini@suse.de>

	* include/bits/stl_queue.h: Trivial formatting fixes.
	* include/bits/stl_stack.h: Likewise.

From-SVN: r115911
parent 0be79f24
2006-08-03 Paolo Carlini <pcarlini@suse.de>
* include/bits/stl_queue.h: Trivial formatting fixes.
* include/bits/stl_stack.h: Likewise.
2006-08-01 Ed Smith-Rowland <3dw4rd@verizon.net> 2006-08-01 Ed Smith-Rowland <3dw4rd@verizon.net>
* docs/html/ext/tr1.html: Update. * docs/html/ext/tr1.html: Update.
......
// Queue implementation -*- C++ -*- // Queue implementation -*- C++ -*-
// Copyright (C) 2001, 2002, 2003, 2004, 2005 // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006
// Free Software Foundation, Inc. // Free Software Foundation, Inc.
// //
// This file is part of the GNU ISO C++ Library. This library is free // This file is part of the GNU ISO C++ Library. This library is free
...@@ -73,11 +73,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -73,11 +73,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline bool inline bool
operator==(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&); operator==(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline bool inline bool
operator<(const queue<_Tp,_Seq>&, const queue<_Tp,_Seq>&); operator<(const queue<_Tp, _Seq>&, const queue<_Tp, _Seq>&);
/** /**
* @brief A standard container giving FIFO behavior. * @brief A standard container giving FIFO behavior.
...@@ -246,10 +246,9 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -246,10 +246,9 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* linear in the size of the sequences, and queues are considered equivalent * linear in the size of the sequences, and queues are considered equivalent
* if their sequences compare equal. * if their sequences compare equal.
*/ */
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator==(const queue<_Tp,_Sequence>& __x, operator==(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
const queue<_Tp,_Sequence>& __y)
{ return __x.c == __y.c; } { return __x.c == __y.c; }
/** /**
...@@ -265,36 +264,33 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -265,36 +264,33 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* std::lexicographical_compare() is usually used to make the * std::lexicographical_compare() is usually used to make the
* determination. * determination.
*/ */
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator<(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y) operator<(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
{ return __x.c < __y.c; } { return __x.c < __y.c; }
/// Based on operator== /// Based on operator==
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator!=(const queue<_Tp,_Sequence>& __x, operator!=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
const queue<_Tp,_Sequence>& __y)
{ return !(__x == __y); } { return !(__x == __y); }
/// Based on operator< /// Based on operator<
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator>(const queue<_Tp,_Sequence>& __x, const queue<_Tp,_Sequence>& __y) operator>(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
{ return __y < __x; } { return __y < __x; }
/// Based on operator< /// Based on operator<
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator<=(const queue<_Tp,_Sequence>& __x, operator<=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
const queue<_Tp,_Sequence>& __y)
{ return !(__y < __x); } { return !(__y < __x); }
/// Based on operator< /// Based on operator<
template<typename _Tp, typename _Sequence> template<typename _Tp, typename _Seq>
inline bool inline bool
operator>=(const queue<_Tp,_Sequence>& __x, operator>=(const queue<_Tp, _Seq>& __x, const queue<_Tp, _Seq>& __y)
const queue<_Tp,_Sequence>& __y)
{ return !(__x < __y); } { return !(__x < __y); }
/** /**
...@@ -343,7 +339,8 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -343,7 +339,8 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
__glibcxx_class_requires(_Sequence, _SequenceConcept) __glibcxx_class_requires(_Sequence, _SequenceConcept)
__glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept) __glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept)
__glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept) __glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
__glibcxx_class_requires4(_Compare, bool, _Tp,_Tp,_BinaryFunctionConcept) __glibcxx_class_requires4(_Compare, bool, _Tp, _Tp,
_BinaryFunctionConcept)
public: public:
typedef typename _Sequence::value_type value_type; typedef typename _Sequence::value_type value_type;
...@@ -397,11 +394,13 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -397,11 +394,13 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* Returns true if the %queue is empty. * Returns true if the %queue is empty.
*/ */
bool bool
empty() const { return c.empty(); } empty() const
{ return c.empty(); }
/** Returns the number of elements in the %queue. */ /** Returns the number of elements in the %queue. */
size_type size_type
size() const { return c.size(); } size() const
{ return c.size(); }
/** /**
* Returns a read-only (constant) reference to the data at the first * Returns a read-only (constant) reference to the data at the first
......
// Stack implementation -*- C++ -*- // Stack implementation -*- C++ -*-
// Copyright (C) 2001, 2002, 2004, 2005 Free Software Foundation, Inc. // Copyright (C) 2001, 2002, 2003, 2004, 2005, 2006
// Free Software Foundation, Inc.
// //
// This file is part of the GNU ISO C++ Library. This library is free // 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 // software; you can redistribute it and/or modify it under the
...@@ -73,11 +74,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -73,11 +74,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline bool inline bool
operator==(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y); operator==(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y);
template<typename _Tp, typename _Seq> template<typename _Tp, typename _Seq>
inline bool inline bool
operator<(const stack<_Tp,_Seq>& __x, const stack<_Tp,_Seq>& __y); operator<(const stack<_Tp, _Seq>& __x, const stack<_Tp, _Seq>& __y);
/** /**
* @brief A standard container giving FILO behavior. * @brief A standard container giving FILO behavior.
...@@ -141,7 +142,7 @@ _GLIBCXX_BEGIN_NAMESPACE(std) ...@@ -141,7 +142,7 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
*/ */
explicit explicit
stack(const _Sequence& __c = _Sequence()) stack(const _Sequence& __c = _Sequence())
: c(__c) {} : c(__c) { }
/** /**
* Returns true if the %stack is empty. * Returns true if the %stack is empty.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment