OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

stl_queue.h: Trivial formatting fixes.

Browse Source 
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
This commit is contained in:
Paolo Carlini 2006-08-03 21:11:13 +00:00 committed by Paolo Carlini
parent 0be79f24f8
commit d508327cc8
3 changed files with 31 additions and 26 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
libstdc++-v3/ChangeLog
View File

@ -1,3 +1,8 @@
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>
* docs/html/ext/tr1.html: Update.

43
libstdc++-v3/include/bits/stl_queue.h
View File

@ -1,6 +1,6 @@
// Queue implementation -*- C++ -*-
// Copyright (C) 2001, 2002, 2003, 2004, 2005
// 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
@ -73,11 +73,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
template<typename _Tp, typename _Seq>
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>
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.
@ -246,10 +246,9 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* linear in the size of the sequences, and queues are considered equivalent
* if their sequences compare equal.
*/
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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; }
/**
@ -265,36 +264,33 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* std::lexicographical_compare() is usually used to make the
* determination.
*/
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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; }
/// Based on operator==
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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 == __y); }
/// Based on operator<
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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; }
/// Based on operator<
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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); }
/// Based on operator<
template<typename _Tp, typename _Sequence>
template<typename _Tp, typename _Seq>
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 < __y); }
/**
@ -343,7 +339,8 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
__glibcxx_class_requires(_Sequence, _SequenceConcept)
__glibcxx_class_requires(_Sequence, _RandomAccessContainerConcept)
__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:
typedef typename _Sequence::value_type value_type;
@ -397,11 +394,13 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
* Returns true if the %queue is empty.
*/
bool
empty() const { return c.empty(); }
empty() const
{ return c.empty(); }
/** Returns the number of elements in the %queue. */
size_type
size() const { return c.size(); }
size() const
{ return c.size(); }
/**
* Returns a read-only (constant) reference to the data at the first

9
libstdc++-v3/include/bits/stl_stack.h
View File

@ -1,6 +1,7 @@
// 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
// software; you can redistribute it and/or modify it under the
@ -73,11 +74,11 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
template<typename _Tp, typename _Seq>
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>
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.
@ -141,7 +142,7 @@ _GLIBCXX_BEGIN_NAMESPACE(std)
*/
explicit
stack(const _Sequence& __c = _Sequence())
: c(__c) {}
: c(__c) { }
/**
* Returns true if the %stack is empty.