protected:
_Predicate _M_pred;
public:
- explicit unary_negate(const _Predicate& __x) : _M_pred(__x) {}
+ explicit
+ unary_negate(const _Predicate& __x) : _M_pred(__x) {}
bool
operator()(const typename _Predicate::argument_type& __x) const
protected:
_Predicate _M_pred;
public:
- explicit binary_negate(const _Predicate& __x)
+ explicit
+ binary_negate(const _Predicate& __x)
: _M_pred(__x) { }
bool
public:
pointer_to_unary_function() {}
- explicit pointer_to_unary_function(_Result (*__x)(_Arg))
+ explicit
+ pointer_to_unary_function(_Result (*__x)(_Arg))
: _M_ptr(__x) {}
_Result
public:
pointer_to_binary_function() {}
- explicit pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
+ explicit
+ pointer_to_binary_function(_Result (*__x)(_Arg1, _Arg2))
: _M_ptr(__x) {}
_Result
class mem_fun_t : public unary_function<_Tp*, _Ret>
{
public:
- explicit mem_fun_t(_Ret (_Tp::*__pf)())
+ explicit
+ mem_fun_t(_Ret (_Tp::*__pf)())
: _M_f(__pf) {}
_Ret
class const_mem_fun_t : public unary_function<const _Tp*, _Ret>
{
public:
- explicit const_mem_fun_t(_Ret (_Tp::*__pf)() const)
+ explicit
+ const_mem_fun_t(_Ret (_Tp::*__pf)() const)
: _M_f(__pf) {}
_Ret
class mem_fun_ref_t : public unary_function<_Tp, _Ret>
{
public:
- explicit mem_fun_ref_t(_Ret (_Tp::*__pf)())
+ explicit
+ mem_fun_ref_t(_Ret (_Tp::*__pf)())
: _M_f(__pf) {}
_Ret
class const_mem_fun_ref_t : public unary_function<_Tp, _Ret>
{
public:
- explicit const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
+ explicit
+ const_mem_fun_ref_t(_Ret (_Tp::*__pf)() const)
: _M_f(__pf) {}
_Ret
class mem_fun1_t : public binary_function<_Tp*, _Arg, _Ret>
{
public:
- explicit mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
+ explicit
+ mem_fun1_t(_Ret (_Tp::*__pf)(_Arg))
: _M_f(__pf) {}
_Ret
class const_mem_fun1_t : public binary_function<const _Tp*, _Arg, _Ret>
{
public:
- explicit const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
+ explicit
+ const_mem_fun1_t(_Ret (_Tp::*__pf)(_Arg) const)
: _M_f(__pf) {}
_Ret
class mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
{
public:
- explicit mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
+ explicit
+ mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg))
: _M_f(__pf) {}
_Ret
class const_mem_fun1_ref_t : public binary_function<_Tp, _Arg, _Ret>
{
public:
- explicit const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
+ explicit
+ const_mem_fun1_ref_t(_Ret (_Tp::*__pf)(_Arg) const)
: _M_f(__pf) {}
_Ret
class mem_fun_t<void, _Tp> : public unary_function<_Tp*, void>
{
public:
- explicit mem_fun_t(void (_Tp::*__pf)())
+ explicit
+ mem_fun_t(void (_Tp::*__pf)())
: _M_f(__pf) {}
void
class const_mem_fun_t<void, _Tp> : public unary_function<const _Tp*, void>
{
public:
- explicit const_mem_fun_t(void (_Tp::*__pf)() const)
+ explicit
+ const_mem_fun_t(void (_Tp::*__pf)() const)
: _M_f(__pf) {}
void
class mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
{
public:
- explicit mem_fun_ref_t(void (_Tp::*__pf)())
+ explicit
+ mem_fun_ref_t(void (_Tp::*__pf)())
: _M_f(__pf) {}
void
class const_mem_fun_ref_t<void, _Tp> : public unary_function<_Tp, void>
{
public:
- explicit const_mem_fun_ref_t(void (_Tp::*__pf)() const)
+ explicit
+ const_mem_fun_ref_t(void (_Tp::*__pf)() const)
: _M_f(__pf) {}
void
class mem_fun1_t<void, _Tp, _Arg> : public binary_function<_Tp*, _Arg, void>
{
public:
- explicit mem_fun1_t(void (_Tp::*__pf)(_Arg))
+ explicit
+ mem_fun1_t(void (_Tp::*__pf)(_Arg))
: _M_f(__pf) {}
void
: public binary_function<const _Tp*, _Arg, void>
{
public:
- explicit const_mem_fun1_t(void (_Tp::*__pf)(_Arg) const)
- : _M_f(__pf) {}
+ explicit
+ const_mem_fun1_t(void (_Tp::*__pf)(_Arg) const)
+ : _M_f(__pf) {}
void
operator()(const _Tp* __p, _Arg __x) const
: public binary_function<_Tp, _Arg, void>
{
public:
- explicit mem_fun1_ref_t(void (_Tp::*__pf)(_Arg))
+ explicit
+ mem_fun1_ref_t(void (_Tp::*__pf)(_Arg))
: _M_f(__pf) {}
void
: public binary_function<_Tp, _Arg, void>
{
public:
- explicit const_mem_fun1_ref_t(void (_Tp::*__pf)(_Arg) const)
+ explicit
+ const_mem_fun1_ref_t(void (_Tp::*__pf)(_Arg) const)
: _M_f(__pf) {}
void
// Queue implementation -*- C++ -*-
-// Copyright (C) 2001, 2002, 2003 Free Software Foundation, Inc.
+// Copyright (C) 2001, 2002, 2003, 2004 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
__glibcxx_class_requires(_Sequence, _BackInsertionSequenceConcept)
__glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
- template<typename _Tp1, typename _Seq1>
- friend bool
- operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
+ template<typename _Tp1, typename _Seq1>
+ friend bool
+ operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
template<typename _Tp1, typename _Seq1>
friend bool
* 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/write reference to the data at the first
* underlying sequence.
*/
void
- push(const value_type& __x) { c.push_back(__x); }
+ push(const value_type& __x)
+ { c.push_back(__x); }
/**
* @brief Removes first element.
operator>=(const queue<_Tp,_Sequence>& __x,
const queue<_Tp,_Sequence>& __y)
{ return !(__x < __y); }
-
-
+
/**
* @brief A standard container automatically sorting its contents.
*
* the elements for you. (How could it know to do so?)
*/
template<typename _Tp, typename _Sequence = vector<_Tp>,
- typename _Compare = less<typename _Sequence::value_type> >
+ typename _Compare = less<typename _Sequence::value_type> >
class priority_queue
{
// concept requirements
__glibcxx_class_requires2(_Tp, _Sequence_value_type, _SameTypeConcept)
__glibcxx_class_requires4(_Compare, bool, _Tp,_Tp,_BinaryFunctionConcept)
- public:
+ public:
typedef typename _Sequence::value_type value_type;
typedef typename _Sequence::reference reference;
typedef typename _Sequence::const_reference const_reference;