Subversion Repositories scarts

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

// Copyright (C) 2001, 2002, 2004, 2005 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, 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301,

// 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).

 */

#ifndef _HASH_MAP

#define _HASH_MAP 1

#include 

#include 

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 _EqualKey = equal_to<_Key>, class _Alloc = allocator<_Tp> >

    class hash_map;

  template

    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 _Alloc>

    class hash_map

    {

    private:

      typedef hashtable,_Key, _HashFcn,

                        _Select1st >,

                        _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 

        hash_map(_InputIterator __f, _InputIterator __l)

        : _M_ht(100, hasher(), key_equal(), allocator_type())

        { _M_ht.insert_unique(__f, __l); }

      template 

        hash_map(_InputIterator __f, _InputIterator __l, size_type __n)

        : _M_ht(__n, hasher(), key_equal(), allocator_type())

        { _M_ht.insert_unique(__f, __l); }

      template 

        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 

        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 

        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

      insert(const value_type& __obj)

      { return _M_ht.insert_unique(__obj); }

      template 

        void

        insert(_InputIterator __f, _InputIterator __l)

        { _M_ht.insert_unique(__f, __l); }

      pair

      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

      equal_range(const key_type& __key)

      { return _M_ht.equal_range(__key); }

      pair

      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 

    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 

    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 

    inline void

    swap(hash_map<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm1,

         hash_map<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm2)

    { __hm1.swap(__hm2); }

  // Forward declaration of equality operator; needed for friend declaration.

  template 

            class _HashFcn  = hash<_Key>,

            class _EqualKey = equal_to<_Key>,

            class _Alloc =  allocator<_Tp> >

    class hash_multimap;

  template 

    inline bool

    operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,

               const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2);

  /**

   *  This is an SGI extension.

   *  @ingroup SGIextensions

   *  @doctodo

   */

  template 

            class _Alloc>

    class hash_multimap

    {

      // concept requirements

      __glibcxx_class_requires(_Key, _SGIAssignableConcept)

      __glibcxx_class_requires(_Tp, _SGIAssignableConcept)

      __glibcxx_class_requires3(_HashFcn, size_t, _Key, _UnaryFunctionConcept)

      __glibcxx_class_requires3(_EqualKey, _Key, _Key, _BinaryPredicateConcept)

    private:

      typedef hashtable, _Key, _HashFcn,

                        _Select1st >, _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_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) {}

      template 

        hash_multimap(_InputIterator __f, _InputIterator __l)

        : _M_ht(100, hasher(), key_equal(), allocator_type())

        { _M_ht.insert_equal(__f, __l); }

      template 

        hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n)

        : _M_ht(__n, hasher(), key_equal(), allocator_type())

        { _M_ht.insert_equal(__f, __l); }

      template 

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

      template 

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

    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_multimap& __hs)

      { _M_ht.swap(__hs._M_ht); }

      template 

        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(); }

public:

      iterator

      insert(const value_type& __obj)

      { return _M_ht.insert_equal(__obj); }

      template 

        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

      equal_range(const key_type& __key)

      { return _M_ht.equal_range(__key); }

      pair

      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(); }

    public:

      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 

    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; }

  template 

    inline bool

    operator!=(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1,

               const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2)

    { return !(__hm1 == __hm2); }

  template 

    inline void

    swap(hash_multimap<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm1,

         hash_multimap<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm2)

    { __hm1.swap(__hm2); }

} // namespace __gnu_cxx

namespace std

{

// Specialization of insert_iterator so that it will work for hash_map

// and hash_multimap.

  template 

    class insert_iterator<__gnu_cxx::hash_map<_Key, _Tp, _HashFn,

                                              _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; }

    };

  template 

    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; }

    };

} // namespace std

#ifdef _GLIBCXX_DEBUG

# include 

#endif

#endif