FM / pending

/usr/include/boost/pending

Name	Size	Mode	Actions
detail/	-	0755	rm
bucket_sorter.hpp	4729	0644	edit dl rm
container_traits.hpp	21723	0644	edit dl rm
disjoint_sets.hpp	6515	0644	edit dl rm
fenced_priority_queue.hpp	5188	0644	edit dl rm
fibonacci_heap.hpp	7722	0644	edit dl rm
indirect_cmp.hpp	2557	0644	edit dl rm
integer_log2.hpp	237	0644	edit dl rm
is_heap.hpp	1755	0644	edit dl rm
iterator_adaptors.hpp	230	0644	edit dl rm
iterator_tests.hpp	7421	0644	edit dl rm
mutable_heap.hpp	1993	0644	edit dl rm
mutable_queue.hpp	4234	0644	edit dl rm
property.hpp	13936	0644	edit dl rm
property_serialize.hpp	2898	0644	edit dl rm
queue.hpp	3156	0644	edit dl rm
relaxed_heap.hpp	20678	0644	edit dl rm
stringtok.hpp	3501	0644	edit dl rm

Edit: /usr/include/boost/pending/queue.hpp (3156B)

//  (C) Copyright Jeremy Siek 2004
//  Distributed under the Boost Software License, Version 1.0. (See
//  accompanying file LICENSE_1_0.txt or copy at
//  http://www.boost.org/LICENSE_1_0.txt)

#ifndef BOOST_QUEUE_HPP
#define BOOST_QUEUE_HPP

#include <deque>
#include <algorithm>

namespace boost
{

template < class _Tp, class _Sequence = std::deque< _Tp > > class queue;

template < class _Tp, class _Seq >
inline bool operator==(const queue< _Tp, _Seq >&, const queue< _Tp, _Seq >&);

template < class _Tp, class _Seq >
inline bool operator<(const queue< _Tp, _Seq >&, const queue< _Tp, _Seq >&);

template < class _Tp, class _Sequence > class queue
{

#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
    template < class _Tp1, class _Seq1 >
    friend bool operator==(
        const queue< _Tp1, _Seq1 >&, const queue< _Tp1, _Seq1 >&);
    template < class _Tp1, class _Seq1 >
    friend bool operator<(
        const queue< _Tp1, _Seq1 >&, const queue< _Tp1, _Seq1 >&);
#endif
public:
    typedef typename _Sequence::value_type value_type;
    typedef typename _Sequence::size_type size_type;
    typedef _Sequence container_type;

typedef typename _Sequence::reference reference;
    typedef typename _Sequence::const_reference const_reference;
#ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS
protected:
#endif
    _Sequence c;

public:
    queue() : c() {}
    explicit queue(const _Sequence& __c) : c(__c) {}

bool empty() const { return c.empty(); }
    size_type size() const { return c.size(); }
    reference front() { return c.front(); }
    const_reference front() const { return c.front(); }
    reference top() { return c.front(); }
    const_reference top() const { return c.front(); }
    reference back() { return c.back(); }
    const_reference back() const { return c.back(); }
    void push(const value_type& __x) { c.push_back(__x); }
    void pop() { c.pop_front(); }

void swap(queue& other)
    {
        using std::swap;
        swap(c, other.c);
    }
};

template < class _Tp, class _Sequence >
bool operator==(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return __x.c == __y.c;
}

template < class _Tp, class _Sequence >
bool operator<(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return __x.c < __y.c;
}

template < class _Tp, class _Sequence >
bool operator!=(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return !(__x == __y);
}

template < class _Tp, class _Sequence >
bool operator>(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return __y < __x;
}

template < class _Tp, class _Sequence >
bool operator<=(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return !(__y < __x);
}

template < class _Tp, class _Sequence >
bool operator>=(
    const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y)
{
    return !(__x < __y);
}

template < class _Tp, class _Sequence >
inline void swap(queue< _Tp, _Sequence >& __x, queue< _Tp, _Sequence >& __y)
{
    __x.swap(__y);
}

} /* namespace boost */

#endif /* BOOST_QUEUE_HPP */

// (C) Copyright Jeremy Siek 2004 // Distributed under the Boost Software License, Version 1.0. (See // accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) #ifndef BOOST_QUEUE_HPP #define BOOST_QUEUE_HPP #include #include namespace boost { template < class _Tp, class _Sequence = std::deque< _Tp > > class queue; template < class _Tp, class _Seq > inline bool operator==(const queue< _Tp, _Seq >&, const queue< _Tp, _Seq >&); template < class _Tp, class _Seq > inline bool operator<(const queue< _Tp, _Seq >&, const queue< _Tp, _Seq >&); template < class _Tp, class _Sequence > class queue { #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS template < class _Tp1, class _Seq1 > friend bool operator==( const queue< _Tp1, _Seq1 >&, const queue< _Tp1, _Seq1 >&); template < class _Tp1, class _Seq1 > friend bool operator<( const queue< _Tp1, _Seq1 >&, const queue< _Tp1, _Seq1 >&); #endif public: typedef typename _Sequence::value_type value_type; typedef typename _Sequence::size_type size_type; typedef _Sequence container_type; typedef typename _Sequence::reference reference; typedef typename _Sequence::const_reference const_reference; #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS protected: #endif _Sequence c; public: queue() : c() {} explicit queue(const _Sequence& __c) : c(__c) {} bool empty() const { return c.empty(); } size_type size() const { return c.size(); } reference front() { return c.front(); } const_reference front() const { return c.front(); } reference top() { return c.front(); } const_reference top() const { return c.front(); } reference back() { return c.back(); } const_reference back() const { return c.back(); } void push(const value_type& __x) { c.push_back(__x); } void pop() { c.pop_front(); } void swap(queue& other) { using std::swap; swap(c, other.c); } }; template < class _Tp, class _Sequence > bool operator==( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return __x.c == __y.c; } template < class _Tp, class _Sequence > bool operator<( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return __x.c < __y.c; } template < class _Tp, class _Sequence > bool operator!=( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return !(__x == __y); } template < class _Tp, class _Sequence > bool operator>( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return __y < __x; } template < class _Tp, class _Sequence > bool operator<=( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return !(__y < __x); } template < class _Tp, class _Sequence > bool operator>=( const queue< _Tp, _Sequence >& __x, const queue< _Tp, _Sequence >& __y) { return !(__x < __y); } template < class _Tp, class _Sequence > inline void swap(queue< _Tp, _Sequence >& __x, queue< _Tp, _Sequence >& __y) { __x.swap(__y); } } /* namespace boost */ #endif /* BOOST_QUEUE_HPP */