| /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying |
| file Copyright.txt or https://cmake.org/licensing#kwsys for details. */ |
| /* |
| * 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. |
| * |
| */ |
| #ifndef @KWSYS_NAMESPACE@_hash_map_hxx |
| #define @KWSYS_NAMESPACE@_hash_map_hxx |
| |
| #include <@KWSYS_NAMESPACE@/hashtable.hxx> |
| |
| #include <@KWSYS_NAMESPACE@/hash_fun.hxx> |
| |
| #include <functional> // equal_to |
| |
| #if defined(_MSC_VER) |
| #pragma warning(push) |
| #pragma warning(disable : 4284) |
| #pragma warning(disable : 4786) |
| #endif |
| |
| #if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32) |
| #pragma set woff 1174 |
| #pragma set woff 1375 |
| #endif |
| |
| namespace @KWSYS_NAMESPACE@ { |
| |
| // select1st is an extension: it is not part of the standard. |
| template <class T1, class T2> |
| struct hash_select1st : public std::unary_function<std::pair<T1, T2>, T1> |
| { |
| const T1& operator()(const std::pair<T1, T2>& __x) const |
| { |
| return __x.first; |
| } |
| }; |
| |
| // Forward declaration of equality operator; needed for friend declaration. |
| |
| template <class _Key, class _Tp, class _HashFcn = hash<_Key>, |
| class _EqualKey = std::equal_to<_Key>, |
| class _Alloc = std::allocator<char> > |
| class hash_map; |
| |
| template <class _Key, class _Tp, class _HashFn, class _EqKey, class _Alloc> |
| bool operator==(const hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc>&, |
| const hash_map<_Key, _Tp, _HashFn, _EqKey, _Alloc>&); |
| |
| template <class _Key, class _Tp, class _HashFcn, class _EqualKey, class _Alloc> |
| class hash_map |
| { |
| private: |
| typedef hashtable<std::pair<const _Key, _Tp>, _Key, _HashFcn, |
| hash_select1st<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); } |
| |
| friend bool operator==<>(const hash_map&, const hash_map&); |
| |
| 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: |
| std::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); |
| } |
| std::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); } |
| |
| std::pair<iterator, iterator> equal_range(const key_type& __key) |
| { |
| return _M_ht.equal_range(__key); |
| } |
| std::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> |
| 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); |
| } |
| |
| // Forward declaration of equality operator; needed for friend declaration. |
| |
| template <class _Key, class _Tp, class _HashFcn = hash<_Key>, |
| class _EqualKey = std::equal_to<_Key>, |
| class _Alloc = std::allocator<char> > |
| class hash_multimap; |
| |
| template <class _Key, class _Tp, class _HF, class _EqKey, class _Alloc> |
| bool operator==(const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm1, |
| const hash_multimap<_Key, _Tp, _HF, _EqKey, _Alloc>& __hm2); |
| |
| template <class _Key, class _Tp, class _HashFcn, class _EqualKey, class _Alloc> |
| class hash_multimap |
| { |
| private: |
| typedef hashtable<std::pair<const _Key, _Tp>, _Key, _HashFcn, |
| hash_select1st<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_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 <class _InputIterator> |
| hash_multimap(_InputIterator __f, _InputIterator __l) |
| : _M_ht(100, hasher(), key_equal(), allocator_type()) |
| { |
| _M_ht.insert_equal(__f, __l); |
| } |
| template <class _InputIterator> |
| hash_multimap(_InputIterator __f, _InputIterator __l, size_type __n) |
| : _M_ht(__n, hasher(), key_equal(), allocator_type()) |
| { |
| _M_ht.insert_equal(__f, __l); |
| } |
| template <class _InputIterator> |
| 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 <class _InputIterator> |
| 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); } |
| |
| friend bool operator==<>(const hash_multimap&, const hash_multimap&); |
| |
| 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 <class _InputIterator> |
| 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); } |
| |
| std::pair<iterator, iterator> equal_range(const key_type& __key) |
| { |
| return _M_ht.equal_range(__key); |
| } |
| std::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(); } |
| |
| 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 <class _Key, class _Tp, class _HF, class _EqKey, class _Alloc> |
| 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 <class _Key, class _Tp, class _HF, class _EqKey, class _Alloc> |
| 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 <class _Key, class _Tp, class _HashFcn, class _EqlKey, class _Alloc> |
| inline void swap(hash_multimap<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm1, |
| hash_multimap<_Key, _Tp, _HashFcn, _EqlKey, _Alloc>& __hm2) |
| { |
| __hm1.swap(__hm2); |
| } |
| |
| } // namespace @KWSYS_NAMESPACE@ |
| |
| #if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32) |
| #pragma reset woff 1174 |
| #pragma reset woff 1375 |
| #endif |
| |
| #if defined(_MSC_VER) |
| #pragma warning(pop) |
| #endif |
| |
| #endif |