mirror of
git://gcc.gnu.org/git/gcc.git
synced 2024-12-26 02:49:03 +08:00
9d6a24bd51
2001-12-06 Phil Edwards <pme@gcc.gnu.org> * include/bits/std_bitset.h: Use GLIBCPP in multiple-inclusion guard. * include/bits/stl_algo.h: Likewise. * include/bits/stl_algobase.h: Likewise. * include/bits/stl_bvector.h: Likewise. * include/bits/stl_deque.h: Likewise. * include/bits/stl_function.h: Likewise. * include/bits/stl_iterator.h: Likewise. * include/bits/stl_iterator_base_funcs.h: Likewise. * include/bits/stl_iterator_base_types.h: Likewise. * include/bits/stl_list.h: Likewise. * include/bits/stl_multimap.h: Likewise. * include/bits/stl_multiset.h: Likewise. * include/bits/stl_pair.h: Likewise. * include/bits/stl_queue.h: Likewise. * include/bits/stl_set.h: Likewise. * include/bits/stl_stack.h: Likewise. * include/bits/stl_tempbuf.h: Likewise. * include/bits/stl_tree.h: Likewise. * include/bits/stl_vector.h: Likewise. * include/bits/stl_alloc.h: Use our own multiple inclusion guards. Doxygenate more comments. Correct historical artifacts in comments. (alloc, single_alloc): Uglify non-standard names. (__default_alloc_template::_NFREELISTS): Calculate from other parameters. (__default_alloc_template::_S_free_list): Remove SunPro workaround. (__default_alloc_template::_Lock): Mark as "unused". * include/backward/alloc.h: Update. * include/bits/stl_bvector.h: Likewise. * include/ext/ropeimpl.h: Likewise. * include/ext/stl_hashtable.h: Likewise. From-SVN: r47729
266 lines
10 KiB
C++
266 lines
10 KiB
C++
// Multimap implementation -*- C++ -*-
|
|
|
|
// Copyright (C) 2001 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
|
|
// terms of the GNU General Public License as published by the
|
|
// Free Software Foundation; either version 2, or (at your option)
|
|
// any later version.
|
|
|
|
// This library is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License along
|
|
// with this library; see the file COPYING. If not, write to the Free
|
|
// Software Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
|
|
// USA.
|
|
|
|
// As a special exception, you may use this file as part of a free software
|
|
// library without restriction. Specifically, if other files instantiate
|
|
// templates or use macros or inline functions from this file, or you compile
|
|
// this file and link it with other files to produce an executable, this
|
|
// file does not by itself cause the resulting executable to be covered by
|
|
// the GNU General Public License. This exception does not however
|
|
// invalidate any other reasons why the executable file might be covered by
|
|
// the GNU General Public License.
|
|
|
|
/*
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/** @file stl_multimap.h
|
|
* This is an internal header file, included by other library headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __GLIBCPP_INTERNAL_MULTIMAP_H
|
|
#define __GLIBCPP_INTERNAL_MULTIMAP_H
|
|
|
|
#include <bits/concept_check.h>
|
|
|
|
namespace std
|
|
{
|
|
|
|
// Forward declaration of operators < and ==, needed for friend declaration.
|
|
|
|
template <class _Key, class _Tp,
|
|
class _Compare = less<_Key>,
|
|
class _Alloc = allocator<pair<const _Key, _Tp> > >
|
|
class multimap;
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y);
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
class multimap
|
|
{
|
|
// concept requirements
|
|
__glibcpp_class_requires(_Tp, _SGIAssignableConcept)
|
|
__glibcpp_class_requires4(_Compare, bool, _Key, _Key, _BinaryFunctionConcept);
|
|
|
|
public:
|
|
|
|
// typedefs:
|
|
|
|
typedef _Key key_type;
|
|
typedef _Tp data_type;
|
|
typedef _Tp mapped_type;
|
|
typedef pair<const _Key, _Tp> value_type;
|
|
typedef _Compare key_compare;
|
|
|
|
class value_compare : public binary_function<value_type, value_type, bool> {
|
|
friend class multimap<_Key,_Tp,_Compare,_Alloc>;
|
|
protected:
|
|
_Compare comp;
|
|
value_compare(_Compare __c) : comp(__c) {}
|
|
public:
|
|
bool operator()(const value_type& __x, const value_type& __y) const {
|
|
return comp(__x.first, __y.first);
|
|
}
|
|
};
|
|
|
|
private:
|
|
typedef _Rb_tree<key_type, value_type,
|
|
_Select1st<value_type>, key_compare, _Alloc> _Rep_type;
|
|
_Rep_type _M_t; // red-black tree representing multimap
|
|
public:
|
|
typedef typename _Rep_type::pointer pointer;
|
|
typedef typename _Rep_type::const_pointer const_pointer;
|
|
typedef typename _Rep_type::reference reference;
|
|
typedef typename _Rep_type::const_reference const_reference;
|
|
typedef typename _Rep_type::iterator iterator;
|
|
typedef typename _Rep_type::const_iterator const_iterator;
|
|
typedef typename _Rep_type::reverse_iterator reverse_iterator;
|
|
typedef typename _Rep_type::const_reverse_iterator const_reverse_iterator;
|
|
typedef typename _Rep_type::size_type size_type;
|
|
typedef typename _Rep_type::difference_type difference_type;
|
|
typedef typename _Rep_type::allocator_type allocator_type;
|
|
|
|
// allocation/deallocation
|
|
|
|
multimap() : _M_t(_Compare(), allocator_type()) { }
|
|
explicit multimap(const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) { }
|
|
|
|
template <class _InputIterator>
|
|
multimap(_InputIterator __first, _InputIterator __last)
|
|
: _M_t(_Compare(), allocator_type())
|
|
{ _M_t.insert_equal(__first, __last); }
|
|
|
|
template <class _InputIterator>
|
|
multimap(_InputIterator __first, _InputIterator __last,
|
|
const _Compare& __comp,
|
|
const allocator_type& __a = allocator_type())
|
|
: _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); }
|
|
multimap(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) : _M_t(__x._M_t) { }
|
|
|
|
multimap<_Key,_Tp,_Compare,_Alloc>&
|
|
operator=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x) {
|
|
_M_t = __x._M_t;
|
|
return *this;
|
|
}
|
|
|
|
// accessors:
|
|
|
|
key_compare key_comp() const { return _M_t.key_comp(); }
|
|
value_compare value_comp() const { return value_compare(_M_t.key_comp()); }
|
|
allocator_type get_allocator() const { return _M_t.get_allocator(); }
|
|
|
|
iterator begin() { return _M_t.begin(); }
|
|
const_iterator begin() const { return _M_t.begin(); }
|
|
iterator end() { return _M_t.end(); }
|
|
const_iterator end() const { return _M_t.end(); }
|
|
reverse_iterator rbegin() { return _M_t.rbegin(); }
|
|
const_reverse_iterator rbegin() const { return _M_t.rbegin(); }
|
|
reverse_iterator rend() { return _M_t.rend(); }
|
|
const_reverse_iterator rend() const { return _M_t.rend(); }
|
|
bool empty() const { return _M_t.empty(); }
|
|
size_type size() const { return _M_t.size(); }
|
|
size_type max_size() const { return _M_t.max_size(); }
|
|
void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x) { _M_t.swap(__x._M_t); }
|
|
|
|
// insert/erase
|
|
|
|
iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); }
|
|
iterator insert(iterator __position, const value_type& __x) {
|
|
return _M_t.insert_equal(__position, __x);
|
|
}
|
|
template <class _InputIterator>
|
|
void insert(_InputIterator __first, _InputIterator __last) {
|
|
_M_t.insert_equal(__first, __last);
|
|
}
|
|
void erase(iterator __position) { _M_t.erase(__position); }
|
|
size_type erase(const key_type& __x) { return _M_t.erase(__x); }
|
|
void erase(iterator __first, iterator __last)
|
|
{ _M_t.erase(__first, __last); }
|
|
void clear() { _M_t.clear(); }
|
|
|
|
// multimap operations:
|
|
|
|
iterator find(const key_type& __x) { return _M_t.find(__x); }
|
|
const_iterator find(const key_type& __x) const { return _M_t.find(__x); }
|
|
size_type count(const key_type& __x) const { return _M_t.count(__x); }
|
|
iterator lower_bound(const key_type& __x) {return _M_t.lower_bound(__x); }
|
|
const_iterator lower_bound(const key_type& __x) const {
|
|
return _M_t.lower_bound(__x);
|
|
}
|
|
iterator upper_bound(const key_type& __x) {return _M_t.upper_bound(__x); }
|
|
const_iterator upper_bound(const key_type& __x) const {
|
|
return _M_t.upper_bound(__x);
|
|
}
|
|
pair<iterator,iterator> equal_range(const key_type& __x) {
|
|
return _M_t.equal_range(__x);
|
|
}
|
|
pair<const_iterator,const_iterator> equal_range(const key_type& __x) const {
|
|
return _M_t.equal_range(__x);
|
|
}
|
|
|
|
template <class _K1, class _T1, class _C1, class _A1>
|
|
friend bool operator== (const multimap<_K1, _T1, _C1, _A1>&,
|
|
const multimap<_K1, _T1, _C1, _A1>&);
|
|
template <class _K1, class _T1, class _C1, class _A1>
|
|
friend bool operator< (const multimap<_K1, _T1, _C1, _A1>&,
|
|
const multimap<_K1, _T1, _C1, _A1>&);
|
|
};
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator==(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return __x._M_t == __y._M_t;
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator<(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return __x._M_t < __y._M_t;
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator!=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return !(__x == __y);
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator>(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return __y < __x;
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator<=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return !(__y < __x);
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline bool operator>=(const multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
const multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
return !(__x < __y);
|
|
}
|
|
|
|
template <class _Key, class _Tp, class _Compare, class _Alloc>
|
|
inline void swap(multimap<_Key,_Tp,_Compare,_Alloc>& __x,
|
|
multimap<_Key,_Tp,_Compare,_Alloc>& __y) {
|
|
__x.swap(__y);
|
|
}
|
|
|
|
} // namespace std
|
|
|
|
#endif /* __GLIBCPP_INTERNAL_MULTIMAP_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|