2001-06-27 19:09:53 +02:00
|
|
|
// Hashing map implementation -*- C++ -*-
|
|
|
|
|
2009-04-09 17:00:19 +02:00
|
|
|
// Copyright (C) 2001, 2002, 2004, 2005, 2006, 2009 Free Software Foundation, Inc.
|
2001-06-27 19:09:53 +02:00
|
|
|
//
|
|
|
|
// 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
|
2009-04-09 17:00:19 +02:00
|
|
|
// Free Software Foundation; either version 3, or (at your option)
|
2001-06-27 19:09:53 +02:00
|
|
|
// 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.
|
|
|
|
|
2009-04-09 17:00:19 +02:00
|
|
|
// Under Section 7 of GPL version 3, you are granted additional
|
|
|
|
// permissions described in the GCC Runtime Library Exception, version
|
|
|
|
// 3.1, as published by the Free Software Foundation.
|
2001-06-27 19:09:53 +02:00
|
|
|
|
2009-04-09 17:00:19 +02:00
|
|
|
// You should have received a copy of the GNU General Public License and
|
|
|
|
// a copy of the GCC Runtime Library Exception along with this program;
|
|
|
|
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
|
|
|
|
// <http://www.gnu.org/licenses/>.
|
2001-06-27 19:09:53 +02:00
|
|
|
|
2000-10-05 13:27:02 +02:00
|
|
|
/*
|
|
|
|
* Copyright (c) 1996
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2007-10-18 17:22:58 +02:00
|
|
|
/** @file backward/hash_map
|
Makefile.am (doxygen, [...]): Tweak targets.
2002-01-28 Phil Edwards <pme@gcc.gnu.org>
* Makefile.am (doxygen, doxygen-maint, doxygen-man): Tweak targets.
* Makefile.in: Regenerate.
* docs/doxygen/run_doxygen: Update, mostly for man pages.
* docs/doxygen/Intro.3: Update.
* docs/doxygen/TODO: Update.
* docs/doxygen/doxygroups.cc: Add namespace hook for __gnu_cxx.
* docs/doxygen/mainpage.doxy: Update.
* docs/doxygen/user.cfg.in: Update for header rename. Also
regenerate comments and variables with 1.2.12.
* docs/doxygen/maint.cfg.in: Remove file.
* include/bits/stl_relops.h: Doxygenate.
* include/bits/stl_tempbuf.h (std::_Temporary_buffer): Likewise.
* include/c_std/std_cassert.h, include/c_std/std_cctype.h,
include/c_std/std_cerrno.h, include/c_std/std_cfloat.h,
include/c_std/std_ciso646.h, include/c_std/std_climits.h,
include/c_std/std_clocale.h, include/c_std/std_cmath.h,
include/c_std/std_csetjmp.h, include/c_std/std_csignal.h,
include/c_std/std_cstdarg.h, include/c_std/std_cstddef.h,
include/c_std/std_cstdio.h, include/c_std/std_cstdlib.h,
include/c_std/std_cstring.h, include/c_std/std_ctime.h,
include/c_std/std_cwchar.h, include/c_std/std_cwctype.h,
include/ext/algorithm, include/ext/functional, include/ext/hash_map,
include/ext/hash_set, include/ext/iterator, include/ext/memory,
include/ext/numeric, include/ext/rb_tree, include/ext/rope,
include/ext/ropeimpl.h, include/ext/slist, include/ext/stl_hash_fun.h,
include/ext/stl_hashtable.h, include/ext/stl_rope.h,
include/std/std_algorithm.h, include/std/std_bitset.h,
include/std/std_complex.h, include/std/std_deque.h,
include/std/std_fstream.h, include/std/std_functional.h,
include/std/std_iomanip.h, include/std/std_ios.h,
include/std/std_iosfwd.h, include/std/std_iostream.h,
include/std/std_istream.h, include/std/std_iterator.h,
include/std/std_limits.h, include/std/std_list.h,
include/std/std_locale.h, include/std/std_map.h,
include/std/std_memory.h, include/std/std_numeric.h,
include/std/std_ostream.h, include/std/std_queue.h,
include/std/std_set.h, include/std/std_sstream.h,
include/std/std_stack.h, include/std/std_stdexcept.h,
include/std/std_streambuf.h, include/std/std_string.h,
include/std/std_utility.h, include/std/std_valarray.h,
include/std/std_vector.h: Add/correct @file doxygen hook.
* include/ext/memory: Doxygenate most of rest of file.
* libsupc++/exception: Doxygen output formatting.
* libsupc++/new: Say which header it is.
* testsuite/lib/libstdc++-v3-dg.exp: Fix spacing.
* docs/html/19_diagnostics/howto.html: Describe concept-checks switch.
* docs/html/23_containers/howto.html: Describe O(n) list::size().
* docs/html/27_io/howto.html: Also link to Langer and Kreft text.
From-SVN: r49300
2002-01-28 23:13:12 +01:00
|
|
|
* This file is a GNU extension to the Standard C++ Library (possibly
|
2004-11-24 05:11:23 +01:00
|
|
|
* containing extensions from the HP/SGI STL subset).
|
2000-10-05 13:27:02 +02:00
|
|
|
*/
|
|
|
|
|
algorithm, [...]: Remove trailing whitespace.
* include/ext/algorithm, include/ext/debug_allocator.h,
include/ext/enc_filebuf.h, include/ext/functional,
include/ext/hash_fun.h, include/ext/hash_map, include/ext/hash_set,
include/ext/hashtable.h, include/ext/iterator,
include/ext/malloc_allocator.h, include/ext/memory,
include/ext/mt_allocator.h, include/ext/numeric,
include/ext/pod_char_traits.h, include/ext/pool_allocator.h,
include/ext/rb_tree, include/ext/rope, include/ext/ropeimpl.h,
include/ext/slist, include/ext/stdio_filebuf.h,
include/ext/stdio_sync_filebuf.h: Remove trailing whitespace.
From-SVN: r74464
2003-12-09 05:31:53 +01:00
|
|
|
#ifndef _HASH_MAP
|
2003-06-06 17:50:28 +02:00
|
|
|
#define _HASH_MAP 1
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2007-10-18 17:22:58 +02:00
|
|
|
#include "backward_warning.h"
|
2006-02-22 01:57:24 +01:00
|
|
|
#include <bits/c++config.h>
|
2007-10-18 17:22:58 +02:00
|
|
|
#include <backward/hashtable.h>
|
2001-04-03 02:26:58 +02:00
|
|
|
#include <bits/concept_check.h>
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2007-10-18 17:22:58 +02:00
|
|
|
_GLIBCXX_BEGIN_NAMESPACE(__gnu_cxx)
|
2005-12-19 01:56:05 +01:00
|
|
|
|
2003-06-06 17:50:28 +02:00
|
|
|
using std::equal_to;
|
|
|
|
using std::allocator;
|
|
|
|
using std::pair;
|
|
|
|
using std::_Select1st;
|
|
|
|
|
2004-06-14 21:40:45 +02:00
|
|
|
/**
|
|
|
|
* This is an SGI extension.
|
|
|
|
* @ingroup SGIextensions
|
|
|
|
* @doctodo
|
|
|
|
*/
|
2006-09-21 19:54:50 +02:00
|
|
|
template<class _Key, class _Tp, class _HashFn = hash<_Key>,
|
|
|
|
class _EqualKey = equal_to<_Key>, class _Alloc = allocator<_Tp> >
|
2004-06-14 21:40:45 +02:00
|
|
|
class hash_map
|
|
|
|
{
|
|
|
|
private:
|
2006-02-22 01:57:24 +01:00
|
|
|
typedef hashtable<pair<const _Key, _Tp>,_Key, _HashFn,
|
2004-06-14 21:40:45 +02:00
|
|
|
_Select1st<pair<const _Key, _Tp> >,
|
|
|
|
_EqualKey, _Alloc> _Ht;
|
|
|
|
|
|
|
|
_Ht _M_ht;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename _Ht::key_type key_type;
|
|
|
|
typedef _Tp data_type;
|
|
|
|
typedef _Tp mapped_type;
|
|
|
|
typedef typename _Ht::value_type value_type;
|
|
|
|
typedef typename _Ht::hasher hasher;
|
|
|
|
typedef typename _Ht::key_equal key_equal;
|
|
|
|
|
|
|
|
typedef typename _Ht::size_type size_type;
|
|
|
|
typedef typename _Ht::difference_type difference_type;
|
|
|
|
typedef typename _Ht::pointer pointer;
|
|
|
|
typedef typename _Ht::const_pointer const_pointer;
|
|
|
|
typedef typename _Ht::reference reference;
|
|
|
|
typedef typename _Ht::const_reference const_reference;
|
|
|
|
|
|
|
|
typedef typename _Ht::iterator iterator;
|
|
|
|
typedef typename _Ht::const_iterator const_iterator;
|
|
|
|
|
|
|
|
typedef typename _Ht::allocator_type allocator_type;
|
|
|
|
|
|
|
|
hasher
|
|
|
|
hash_funct() const
|
|
|
|
{ return _M_ht.hash_funct(); }
|
|
|
|
|
|
|
|
key_equal
|
|
|
|
key_eq() const
|
|
|
|
{ return _M_ht.key_eq(); }
|
|
|
|
|
|
|
|
allocator_type
|
|
|
|
get_allocator() const
|
|
|
|
{ return _M_ht.get_allocator(); }
|
|
|
|
|
|
|
|
hash_map()
|
|
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
explicit
|
|
|
|
hash_map(size_type __n)
|
|
|
|
: _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
hash_map(size_type __n, const hasher& __hf)
|
|
|
|
: _M_ht(__n, __hf, key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
hash_map(size_type __n, const hasher& __hf, const key_equal& __eql,
|
|
|
|
const allocator_type& __a = allocator_type())
|
|
|
|
: _M_ht(__n, __hf, __eql, __a) {}
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_map(_InputIterator __f, _InputIterator __l)
|
|
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
|
|
|
|
: _M_ht(__n, hasher(), key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
|
|
|
|
const hasher& __hf)
|
|
|
|
: _M_ht(__n, __hf, key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_map(_InputIterator __f, _InputIterator __l, size_type __n,
|
|
|
|
const hasher& __hf, const key_equal& __eql,
|
|
|
|
const allocator_type& __a = allocator_type())
|
|
|
|
: _M_ht(__n, __hf, __eql, __a)
|
|
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
size() const
|
|
|
|
{ return _M_ht.size(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
max_size() const
|
|
|
|
{ return _M_ht.max_size(); }
|
|
|
|
|
|
|
|
bool
|
|
|
|
empty() const
|
|
|
|
{ return _M_ht.empty(); }
|
|
|
|
|
|
|
|
void
|
|
|
|
swap(hash_map& __hs)
|
|
|
|
{ _M_ht.swap(__hs._M_ht); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _K1, class _T1, class _HF, class _EqK, class _Al>
|
2004-06-14 21:40:45 +02:00
|
|
|
friend bool
|
|
|
|
operator== (const hash_map<_K1, _T1, _HF, _EqK, _Al>&,
|
|
|
|
const hash_map<_K1, _T1, _HF, _EqK, _Al>&);
|
|
|
|
|
|
|
|
iterator
|
|
|
|
begin()
|
|
|
|
{ return _M_ht.begin(); }
|
|
|
|
|
|
|
|
iterator
|
|
|
|
end()
|
|
|
|
{ return _M_ht.end(); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
begin() const
|
|
|
|
{ return _M_ht.begin(); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
end() const
|
|
|
|
{ return _M_ht.end(); }
|
|
|
|
|
|
|
|
pair<iterator, bool>
|
|
|
|
insert(const value_type& __obj)
|
|
|
|
{ return _M_ht.insert_unique(__obj); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
void
|
|
|
|
insert(_InputIterator __f, _InputIterator __l)
|
|
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
|
|
|
|
|
|
pair<iterator, bool>
|
|
|
|
insert_noresize(const value_type& __obj)
|
|
|
|
{ return _M_ht.insert_unique_noresize(__obj); }
|
|
|
|
|
|
|
|
iterator
|
|
|
|
find(const key_type& __key)
|
|
|
|
{ return _M_ht.find(__key); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
find(const key_type& __key) const
|
|
|
|
{ return _M_ht.find(__key); }
|
|
|
|
|
|
|
|
_Tp&
|
|
|
|
operator[](const key_type& __key)
|
|
|
|
{ return _M_ht.find_or_insert(value_type(__key, _Tp())).second; }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
count(const key_type& __key) const
|
|
|
|
{ return _M_ht.count(__key); }
|
|
|
|
|
|
|
|
pair<iterator, iterator>
|
|
|
|
equal_range(const key_type& __key)
|
|
|
|
{ return _M_ht.equal_range(__key); }
|
|
|
|
|
|
|
|
pair<const_iterator, const_iterator>
|
|
|
|
equal_range(const key_type& __key) const
|
|
|
|
{ return _M_ht.equal_range(__key); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
erase(const key_type& __key)
|
|
|
|
{return _M_ht.erase(__key); }
|
|
|
|
|
|
|
|
void
|
|
|
|
erase(iterator __it)
|
|
|
|
{ _M_ht.erase(__it); }
|
|
|
|
|
|
|
|
void
|
|
|
|
erase(iterator __f, iterator __l)
|
|
|
|
{ _M_ht.erase(__f, __l); }
|
|
|
|
|
|
|
|
void
|
|
|
|
clear()
|
|
|
|
{ _M_ht.clear(); }
|
|
|
|
|
|
|
|
void
|
|
|
|
resize(size_type __hint)
|
|
|
|
{ _M_ht.resize(__hint); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
bucket_count() const
|
|
|
|
{ return _M_ht.bucket_count(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
max_bucket_count() const
|
|
|
|
{ return _M_ht.max_bucket_count(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
elems_in_bucket(size_type __n) const
|
|
|
|
{ return _M_ht.elems_in_bucket(__n); }
|
|
|
|
};
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline bool
|
2006-02-22 01:57:24 +01:00
|
|
|
operator==(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
|
|
|
|
const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
|
2004-06-14 21:40:45 +02:00
|
|
|
{ return __hm1._M_ht == __hm2._M_ht; }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline bool
|
2006-02-22 01:57:24 +01:00
|
|
|
operator!=(const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
|
|
|
|
const hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
|
2004-06-14 21:40:45 +02:00
|
|
|
{ return !(__hm1 == __hm2); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline void
|
2006-02-22 01:57:24 +01:00
|
|
|
swap(hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
|
|
|
|
hash_map<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
|
2004-06-14 21:40:45 +02:00
|
|
|
{ __hm1.swap(__hm2); }
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* This is an SGI extension.
|
|
|
|
* @ingroup SGIextensions
|
|
|
|
* @doctodo
|
|
|
|
*/
|
2006-09-21 19:54:50 +02:00
|
|
|
template<class _Key, class _Tp,
|
|
|
|
class _HashFn = hash<_Key>,
|
|
|
|
class _EqualKey = equal_to<_Key>,
|
|
|
|
class _Alloc = allocator<_Tp> >
|
2004-06-14 21:40:45 +02:00
|
|
|
class hash_multimap
|
|
|
|
{
|
|
|
|
// concept requirements
|
|
|
|
__glibcxx_class_requires(_Key, _SGIAssignableConcept)
|
|
|
|
__glibcxx_class_requires(_Tp, _SGIAssignableConcept)
|
2006-02-22 01:57:24 +01:00
|
|
|
__glibcxx_class_requires3(_HashFn, size_t, _Key, _UnaryFunctionConcept)
|
2004-06-14 21:40:45 +02:00
|
|
|
__glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept)
|
|
|
|
|
|
|
|
private:
|
2006-02-22 01:57:24 +01:00
|
|
|
typedef hashtable<pair<const _Key, _Tp>, _Key, _HashFn,
|
2004-06-14 21:40:45 +02:00
|
|
|
_Select1st<pair<const _Key, _Tp> >, _EqualKey, _Alloc>
|
2000-10-05 13:27:02 +02:00
|
|
|
_Ht;
|
|
|
|
|
2004-06-14 21:40:45 +02:00
|
|
|
_Ht _M_ht;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef typename _Ht::key_type key_type;
|
|
|
|
typedef _Tp data_type;
|
|
|
|
typedef _Tp mapped_type;
|
|
|
|
typedef typename _Ht::value_type value_type;
|
|
|
|
typedef typename _Ht::hasher hasher;
|
|
|
|
typedef typename _Ht::key_equal key_equal;
|
|
|
|
|
|
|
|
typedef typename _Ht::size_type size_type;
|
|
|
|
typedef typename _Ht::difference_type difference_type;
|
|
|
|
typedef typename _Ht::pointer pointer;
|
|
|
|
typedef typename _Ht::const_pointer const_pointer;
|
|
|
|
typedef typename _Ht::reference reference;
|
|
|
|
typedef typename _Ht::const_reference const_reference;
|
|
|
|
|
|
|
|
typedef typename _Ht::iterator iterator;
|
|
|
|
typedef typename _Ht::const_iterator const_iterator;
|
|
|
|
|
|
|
|
typedef typename _Ht::allocator_type allocator_type;
|
|
|
|
|
|
|
|
hasher
|
|
|
|
hash_funct() const
|
|
|
|
{ return _M_ht.hash_funct(); }
|
|
|
|
|
|
|
|
key_equal
|
|
|
|
key_eq() const
|
|
|
|
{ return _M_ht.key_eq(); }
|
|
|
|
|
|
|
|
allocator_type
|
|
|
|
get_allocator() const
|
|
|
|
{ return _M_ht.get_allocator(); }
|
|
|
|
|
|
|
|
hash_multimap()
|
|
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
explicit
|
|
|
|
hash_multimap(size_type __n)
|
|
|
|
: _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
hash_multimap(size_type __n, const hasher& __hf)
|
|
|
|
: _M_ht(__n, __hf, key_equal(), allocator_type()) {}
|
|
|
|
|
|
|
|
hash_multimap(size_type __n, const hasher& __hf, const key_equal& __eql,
|
|
|
|
const allocator_type& __a = allocator_type())
|
|
|
|
: _M_ht(__n, __hf, __eql, __a) {}
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_multimap(_InputIterator __f, _InputIterator __l)
|
|
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_equal(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n)
|
|
|
|
: _M_ht(__n, hasher(), key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_equal(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,
|
|
|
|
const hasher& __hf)
|
|
|
|
: _M_ht(__n, __hf, key_equal(), allocator_type())
|
|
|
|
{ _M_ht.insert_equal(__f, __l); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n,
|
|
|
|
const hasher& __hf, const key_equal& __eql,
|
|
|
|
const allocator_type& __a = allocator_type())
|
|
|
|
: _M_ht(__n, __hf, __eql, __a)
|
|
|
|
{ _M_ht.insert_equal(__f, __l); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
size() const
|
|
|
|
{ return _M_ht.size(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
max_size() const
|
|
|
|
{ return _M_ht.max_size(); }
|
|
|
|
|
|
|
|
bool
|
|
|
|
empty() const
|
|
|
|
{ return _M_ht.empty(); }
|
|
|
|
|
|
|
|
void
|
|
|
|
swap(hash_multimap& __hs)
|
|
|
|
{ _M_ht.swap(__hs._M_ht); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _K1, class _T1, class _HF, class _EqK, class _Al>
|
2004-06-14 21:40:45 +02:00
|
|
|
friend bool
|
|
|
|
operator==(const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&,
|
|
|
|
const hash_multimap<_K1, _T1, _HF, _EqK, _Al>&);
|
|
|
|
|
|
|
|
iterator
|
|
|
|
begin()
|
|
|
|
{ return _M_ht.begin(); }
|
|
|
|
|
|
|
|
iterator
|
|
|
|
end()
|
|
|
|
{ return _M_ht.end(); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
begin() const
|
|
|
|
{ return _M_ht.begin(); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
end() const
|
|
|
|
{ return _M_ht.end(); }
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2004-06-14 21:40:45 +02:00
|
|
|
iterator
|
|
|
|
insert(const value_type& __obj)
|
|
|
|
{ return _M_ht.insert_equal(__obj); }
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _InputIterator>
|
2004-06-14 21:40:45 +02:00
|
|
|
void
|
|
|
|
insert(_InputIterator __f, _InputIterator __l)
|
|
|
|
{ _M_ht.insert_equal(__f,__l); }
|
|
|
|
|
|
|
|
iterator
|
|
|
|
insert_noresize(const value_type& __obj)
|
|
|
|
{ return _M_ht.insert_equal_noresize(__obj); }
|
|
|
|
|
|
|
|
iterator
|
|
|
|
find(const key_type& __key)
|
|
|
|
{ return _M_ht.find(__key); }
|
|
|
|
|
|
|
|
const_iterator
|
|
|
|
find(const key_type& __key) const
|
|
|
|
{ return _M_ht.find(__key); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
count(const key_type& __key) const
|
|
|
|
{ return _M_ht.count(__key); }
|
|
|
|
|
|
|
|
pair<iterator, iterator>
|
|
|
|
equal_range(const key_type& __key)
|
|
|
|
{ return _M_ht.equal_range(__key); }
|
|
|
|
|
|
|
|
pair<const_iterator, const_iterator>
|
|
|
|
equal_range(const key_type& __key) const
|
|
|
|
{ return _M_ht.equal_range(__key); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
erase(const key_type& __key)
|
|
|
|
{ return _M_ht.erase(__key); }
|
|
|
|
|
|
|
|
void
|
|
|
|
erase(iterator __it)
|
|
|
|
{ _M_ht.erase(__it); }
|
|
|
|
|
|
|
|
void
|
|
|
|
erase(iterator __f, iterator __l)
|
|
|
|
{ _M_ht.erase(__f, __l); }
|
|
|
|
|
|
|
|
void
|
|
|
|
clear()
|
|
|
|
{ _M_ht.clear(); }
|
|
|
|
|
|
|
|
void
|
|
|
|
resize(size_type __hint)
|
|
|
|
{ _M_ht.resize(__hint); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
bucket_count() const
|
|
|
|
{ return _M_ht.bucket_count(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
max_bucket_count() const
|
|
|
|
{ return _M_ht.max_bucket_count(); }
|
|
|
|
|
|
|
|
size_type
|
|
|
|
elems_in_bucket(size_type __n) const
|
|
|
|
{ return _M_ht.elems_in_bucket(__n); }
|
2005-12-19 01:56:05 +01:00
|
|
|
};
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline bool
|
|
|
|
operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,
|
|
|
|
const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)
|
|
|
|
{ return __hm1._M_ht == __hm2._M_ht; }
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HF, class _EqKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline bool
|
|
|
|
operator!=(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,
|
|
|
|
const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)
|
|
|
|
{ return !(__hm1 == __hm2); }
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqlKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
inline void
|
2006-02-22 01:57:24 +01:00
|
|
|
swap(hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm1,
|
|
|
|
hash_multimap<_Key, _Tp, _HashFn, _EqlKey, _Alloc>& __hm2)
|
2004-06-14 21:40:45 +02:00
|
|
|
{ __hm1.swap(__hm2); }
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2007-10-18 17:22:58 +02:00
|
|
|
_GLIBCXX_END_NAMESPACE
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2005-12-19 01:56:05 +01:00
|
|
|
_GLIBCXX_BEGIN_NAMESPACE(std)
|
2000-10-05 13:27:02 +02:00
|
|
|
|
2005-12-19 01:56:05 +01:00
|
|
|
// Specialization of insert_iterator so that it will work for hash_map
|
|
|
|
// and hash_multimap.
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc>
|
|
|
|
class insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn,
|
2004-06-14 21:40:45 +02:00
|
|
|
_EqKey, _Alloc> >
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
typedef __gnu_cxx::hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc>
|
|
|
|
_Container;
|
|
|
|
_Container* container;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef _Container container_type;
|
|
|
|
typedef output_iterator_tag iterator_category;
|
|
|
|
typedef void value_type;
|
|
|
|
typedef void difference_type;
|
|
|
|
typedef void pointer;
|
|
|
|
typedef void reference;
|
|
|
|
|
|
|
|
insert_iterator(_Container& __x)
|
|
|
|
: container(&__x) {}
|
|
|
|
|
|
|
|
insert_iterator(_Container& __x, typename _Container::iterator)
|
|
|
|
: container(&__x) {}
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator=(const typename _Container::value_type& __value)
|
|
|
|
{
|
|
|
|
container->insert(__value);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator*()
|
|
|
|
{ return *this; }
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator++() { return *this; }
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator++(int)
|
|
|
|
{ return *this; }
|
|
|
|
};
|
|
|
|
|
2006-02-22 01:57:24 +01:00
|
|
|
template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc>
|
2004-06-14 21:40:45 +02:00
|
|
|
class insert_iterator<__gnu_cxx::hash_multimap<_Key, _Tp, _HashFn,
|
|
|
|
_EqKey, _Alloc> >
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
typedef __gnu_cxx::hash_multimap<_Key, _Tp, _HashFn, _EqKey, _Alloc>
|
|
|
|
_Container;
|
|
|
|
_Container* container;
|
|
|
|
typename _Container::iterator iter;
|
|
|
|
|
|
|
|
public:
|
|
|
|
typedef _Container container_type;
|
|
|
|
typedef output_iterator_tag iterator_category;
|
|
|
|
typedef void value_type;
|
|
|
|
typedef void difference_type;
|
|
|
|
typedef void pointer;
|
|
|
|
typedef void reference;
|
|
|
|
|
|
|
|
insert_iterator(_Container& __x)
|
|
|
|
: container(&__x) {}
|
|
|
|
|
|
|
|
insert_iterator(_Container& __x, typename _Container::iterator)
|
|
|
|
: container(&__x) {}
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator=(const typename _Container::value_type& __value)
|
|
|
|
{
|
|
|
|
container->insert(__value);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator*()
|
|
|
|
{ return *this; }
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator++()
|
|
|
|
{ return *this; }
|
|
|
|
|
|
|
|
insert_iterator<_Container>&
|
|
|
|
operator++(int)
|
|
|
|
{ return *this; }
|
|
|
|
};
|
2005-12-19 01:56:05 +01:00
|
|
|
|
|
|
|
_GLIBCXX_END_NAMESPACE
|
2005-05-27 17:01:45 +02:00
|
|
|
|
2003-06-06 17:50:28 +02:00
|
|
|
#endif
|