hash_set

symbian上STL模板库的实现

    template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>
        inline void
        swap(hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,
                hash_set<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2)
        {
            __hs1.swap(__hs2);
        }


    template <class _Value,
             class _HashFcn  = hash<_Value>,
             class _EqualKey = equal_to<_Value>,
             class _Alloc =  allocator<_Value> >
                 class hash_multiset;

    template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>
        inline bool
        operator==(const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,
                const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2);


    /**
     *  This is an SGI extension.
     *  @ingroup SGIextensions
     *  @doctodo
     */
    template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
        class hash_multiset
        {
            // concept requirements
            __glibcxx_class_requires(_Value, _SGIAssignableConcept)
                __glibcxx_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept)
                __glibcxx_class_requires3(_EqualKey, _Value, _Value, _BinaryPredicateConcept)

            private:
                typedef hashtable<_Value, _Value, _HashFcn, _Identity<_Value>,
                        _EqualKey, _Alloc> _Ht;
                _Ht _M_ht;

            public:
                typedef typename _Ht::key_type key_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 _Alloc::pointer pointer;
                typedef typename _Alloc::const_pointer const_pointer;
                typedef typename _Alloc::reference reference;
                typedef typename _Alloc::const_reference const_reference;

                typedef typename _Ht::const_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_multiset()
                    : _M_ht(100, hasher(), key_equal(), allocator_type()) {}
                explicit hash_multiset(size_type __n)
                    : _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
                hash_multiset(size_type __n, const hasher& __hf)
                    : _M_ht(__n, __hf, key_equal(), allocator_type()) {}
                hash_multiset(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_multiset(_InputIterator __f, _InputIterator __l)
                    : _M_ht(100, hasher(), key_equal(), allocator_type())
                    { _M_ht.insert_equal(__f, __l); }
                template <class _InputIterator>
                    hash_multiset(_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_multiset(_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_multiset(_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_multiset& hs) { _M_ht.swap(hs._M_ht); }

                template <class _Val, class _HF, class _EqK, class _Al>
                    friend bool operator== (const hash_multiset<_Val, _HF, _EqK, _Al>&,
                            const hash_multiset<_Val, _HF, _EqK, _Al>&);

                iterator begin() const { return _M_ht.begin(); }
                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) 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) 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 _Val, class _HashFcn, class _EqualKey, class _Alloc>
        inline bool
        operator==(const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,
                const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2)
        {
            return __hs1._M_ht == __hs2._M_ht;
        }

    template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>
        inline bool
        operator!=(const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,
                const hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) {
            return !(__hs1 == __hs2);
        }

    template <class _Val, class _HashFcn, class _EqualKey, class _Alloc>
        inline void
        swap(hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs1,
                hash_multiset<_Val,_HashFcn,_EqualKey,_Alloc>& __hs2) {
            __hs1.swap(__hs2);
        }

} // namespace __gnu_cxx

namespace std
{
    // Specialization of insert_iterator so that it will work for hash_set
    // and hash_multiset.

    template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
        class insert_iterator<__gnu_cxx::hash_set<_Value, _HashFcn, _EqualKey, _Alloc> > {
            protected:
                typedef __gnu_cxx::hash_set<_Value, _HashFcn, _EqualKey, _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 _Value, class _HashFcn, class _EqualKey, class _Alloc>
        class insert_iterator<__gnu_cxx::hash_multiset<_Value, _HashFcn, _EqualKey, _Alloc> > {
            protected:
                typedef __gnu_cxx::hash_multiset<_Value, _HashFcn, _EqualKey, _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

#endif