hash_map

symbian上STL模板库的实现

// Hashing map implementation -*- C++ -*-

// Copyright (C) 2001, 2002 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) 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.
 *
 */

/** @file ext/hash_map
 *  This file is a GNU extension to the Standard C++ Library (possibly
 *  containing extensions from the HP/SGI STL subset).  You should only
 *  include this header if you are using GCC 3 or later.
 */

#ifndef _HASH_MAP
#define _HASH_MAP 1

#include <ext/hashtable.h>
#include <bits/concept_check.h>

namespace __gnu_cxx
{
    using std::equal_to;
    using std::allocator;
    using std::pair;
    using std::_Select1st;

    // Forward declaration of equality operator; needed for friend
    // declaration.
    template<class _Key, class _Tp, class _HashFcn  = hash<_Key>,
        class _EqualKey = equal_to<_Key>, class _Alloc =  allocator<_Tp> >
            class hash_map;

    template<class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc>
        inline bool operator==(const hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc>&,
                const hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc>&);
    /**
     *  This is an SGI extension.
     *  @ingroup SGIextensions
     *  @doctodo
     */
    template <class _Key, class _Tp, class _HashFcn, class _EqualKey,
             class _Alloc>
                 class hash_map
                 {
                     private:
                         typedef hashtable<pair<const _Key,_Tp>,_Key,_HashFcn,
                                 _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(); }

                     public:
                         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) {}

                         template <class _InputIterator>
                             hash_map(_InputIterator __f, _InputIterator __l)
                             : _M_ht(100, hasher(), key_equal(), allocator_type())
                             { _M_ht.insert_unique(__f, __l); }
                         template <class _InputIterator>
                             hash_map(_InputIterator __f, _InputIterator __l, size_type __n)
                             : _M_ht(__n, hasher(), key_equal(), allocator_type())
                             { _M_ht.insert_unique(__f, __l); }
                         template <class _InputIterator>
                             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); }
                         template <class _InputIterator>
                             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); }

                     public:
                         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); }

                         template <class _K1, class _T1, class _HF, class _EqK, class _Al>
                             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(); }

                     public:
                         pair<iterator,bool> insert(const value_type& __obj)
                         { return _M_ht.insert_unique(__obj); }
                         template <class _InputIterator>
                             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); }
                 };

    template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
        inline bool
        operator==(const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
                const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)
        {
            return __hm1._M_ht == __hm2._M_ht;
        }

    template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
        inline bool
        operator!=(const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
                const hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2) {
            return !(__hm1 == __hm2);
        }

    template <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc>
        inline void
        swap(hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm1,
                hash_map<_Key,_Tp,_HashFcn,_EqlKey,_Alloc>& __hm2)
        {
            __hm1.swap(__hm2);