mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-27 22:05:31 +08:00
bb84e66919
* Makefile.in (install): Some of HEADERS come from the stl dir now. * algorithm, deque, functional, iterator, list, map, memory, numeric, queue, set, stack, utility, vector: Now in stl dir. stl/: * algo.h, algobase.h, alloc.h, bvector.h, defalloc.h, deque.h, function.h, hash_map.h, hash_set.h, hashtable.h, heap.h, iterator.h, list.h, map.h, multimap.h, multiset.h, pair.h, pthread_alloc.h, rope.h, ropeimpl.h, set.h, slist.h, stack.h, stl_config.h, tempbuf.h, tree.h, type_traits.h, vector.h: Update to October 27 SGI snapshot. * algorithm, deque, functional, hash_map, hash_set, iterator, list, map, memory, numeric, pthread_alloc, queue, rope, set, slist, stack, stl_algo.h, stl_algobase.h, stl_alloc.h, stl_bvector.h, stl_construct.h, stl_deque.h, stl_function.h, stl_hash_fun.h, stl_hash_map.h, stl_hash_set.h, stl_hashtable.h, stl_heap.h, stl_iterator.h, stl_list.h, stl_map.h, stl_multimap.h, stl_multiset.h, stl_numeric.h, stl_pair.h, stl_queue.h, stl_raw_storage_iter.h, stl_relops.h, stl_rope.h, stl_set.h, stl_slist.h, stl_stack.h, stl_tempbuf.h, stl_tree.h, stl_uninitialized.h, stl_vector.h, utility, vector: New files in October 27 SGI snapshot. From-SVN: r16277
135 lines
4.3 KiB
C++
135 lines
4.3 KiB
C++
/*
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __SGI_STL_INTERNAL_QUEUE_H
|
|
#define __SGI_STL_INTERNAL_QUEUE_H
|
|
|
|
__STL_BEGIN_NAMESPACE
|
|
|
|
#ifndef __STL_LIMITED_DEFAULT_TEMPLATES
|
|
template <class T, class Sequence = deque<T> >
|
|
#else
|
|
template <class T, class Sequence>
|
|
#endif
|
|
class queue {
|
|
friend bool operator== __STL_NULL_TMPL_ARGS (const queue& x, const queue& y);
|
|
friend bool operator< __STL_NULL_TMPL_ARGS (const queue& x, const queue& y);
|
|
public:
|
|
typedef typename Sequence::value_type value_type;
|
|
typedef typename Sequence::size_type size_type;
|
|
typedef typename Sequence::reference reference;
|
|
typedef typename Sequence::const_reference const_reference;
|
|
protected:
|
|
Sequence c;
|
|
public:
|
|
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 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(); }
|
|
};
|
|
|
|
template <class T, class Sequence>
|
|
bool operator==(const queue<T, Sequence>& x, const queue<T, Sequence>& y) {
|
|
return x.c == y.c;
|
|
}
|
|
|
|
template <class T, class Sequence>
|
|
bool operator<(const queue<T, Sequence>& x, const queue<T, Sequence>& y) {
|
|
return x.c < y.c;
|
|
}
|
|
|
|
#ifndef __STL_LIMITED_DEFAULT_TEMPLATES
|
|
template <class T, class Sequence = vector<T>,
|
|
class Compare = less<typename Sequence::value_type> >
|
|
#else
|
|
template <class T, class Sequence, class Compare>
|
|
#endif
|
|
class priority_queue {
|
|
public:
|
|
typedef typename Sequence::value_type value_type;
|
|
typedef typename Sequence::size_type size_type;
|
|
typedef typename Sequence::reference reference;
|
|
typedef typename Sequence::const_reference const_reference;
|
|
protected:
|
|
Sequence c;
|
|
Compare comp;
|
|
public:
|
|
priority_queue() : c() {}
|
|
explicit priority_queue(const Compare& x) : c(), comp(x) {}
|
|
|
|
#ifdef __STL_MEMBER_TEMPLATES
|
|
template <class InputIterator>
|
|
priority_queue(InputIterator first, InputIterator last, const Compare& x)
|
|
: c(first, last), comp(x) { make_heap(c.begin(), c.end(), comp); }
|
|
template <class InputIterator>
|
|
priority_queue(InputIterator first, InputIterator last)
|
|
: c(first, last) { make_heap(c.begin(), c.end(), comp); }
|
|
#else /* __STL_MEMBER_TEMPLATES */
|
|
priority_queue(const value_type* first, const value_type* last,
|
|
const Compare& x) : c(first, last), comp(x) {
|
|
make_heap(c.begin(), c.end(), comp);
|
|
}
|
|
priority_queue(const value_type* first, const value_type* last)
|
|
: c(first, last) { make_heap(c.begin(), c.end(), comp); }
|
|
#endif /* __STL_MEMBER_TEMPLATES */
|
|
|
|
bool empty() const { return c.empty(); }
|
|
size_type size() const { return c.size(); }
|
|
const_reference top() const { return c.front(); }
|
|
void push(const value_type& x) {
|
|
__STL_TRY {
|
|
c.push_back(x);
|
|
push_heap(c.begin(), c.end(), comp);
|
|
}
|
|
__STL_UNWIND(c.clear());
|
|
}
|
|
void pop() {
|
|
__STL_TRY {
|
|
pop_heap(c.begin(), c.end(), comp);
|
|
c.pop_back();
|
|
}
|
|
__STL_UNWIND(c.clear());
|
|
}
|
|
};
|
|
|
|
// no equality is provided
|
|
|
|
__STL_END_NAMESPACE
|
|
|
|
#endif /* __SGI_STL_INTERNAL_QUEUE_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|