ffe94f8380
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
436 lines
16 KiB
C++
436 lines
16 KiB
C++
// Hashing set 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_set
|
|
* 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 __SGI_STL_INTERNAL_HASH_SET_H
|
|
#define __SGI_STL_INTERNAL_HASH_SET_H
|
|
|
|
#include <ext/stl_hashtable.h>
|
|
#include <bits/concept_check.h>
|
|
|
|
namespace __gnu_cxx
|
|
{
|
|
using std::equal_to;
|
|
using std::allocator;
|
|
using std::pair;
|
|
using std::_Identity;
|
|
|
|
// Forward declaration of equality operator; needed for friend declaration.
|
|
|
|
template <class _Value,
|
|
class _HashFcn = hash<_Value>,
|
|
class _EqualKey = equal_to<_Value>,
|
|
class _Alloc = allocator<_Value> >
|
|
class hash_set;
|
|
|
|
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
|
|
inline bool
|
|
operator==(const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs1,
|
|
const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs2);
|
|
|
|
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
|
|
class hash_set
|
|
{
|
|
// concept requirements
|
|
__glibcpp_class_requires(_Value, _SGIAssignableConcept)
|
|
__glibcpp_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept);
|
|
__glibcpp_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 _Ht::const_pointer pointer;
|
|
typedef typename _Ht::const_pointer const_pointer;
|
|
typedef typename _Ht::const_reference reference;
|
|
typedef typename _Ht::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_set()
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type()) {}
|
|
explicit hash_set(size_type __n)
|
|
: _M_ht(__n, hasher(), key_equal(), allocator_type()) {}
|
|
hash_set(size_type __n, const hasher& __hf)
|
|
: _M_ht(__n, __hf, key_equal(), allocator_type()) {}
|
|
hash_set(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_set(_InputIterator __f, _InputIterator __l)
|
|
: _M_ht(100, hasher(), key_equal(), allocator_type())
|
|
{ _M_ht.insert_unique(__f, __l); }
|
|
template <class _InputIterator>
|
|
hash_set(_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_set(_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_set(_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_set& __hs) { _M_ht.swap(__hs._M_ht); }
|
|
|
|
template <class _Val, class _HF, class _EqK, class _Al>
|
|
friend bool operator== (const hash_set<_Val, _HF, _EqK, _Al>&,
|
|
const hash_set<_Val, _HF, _EqK, _Al>&);
|
|
|
|
iterator begin() const { return _M_ht.begin(); }
|
|
iterator end() const { return _M_ht.end(); }
|
|
|
|
public:
|
|
pair<iterator, bool> insert(const value_type& __obj)
|
|
{
|
|
pair<typename _Ht::iterator, bool> __p = _M_ht.insert_unique(__obj);
|
|
return pair<iterator,bool>(__p.first, __p.second);
|
|
}
|
|
template <class _InputIterator>
|
|
void insert(_InputIterator __f, _InputIterator __l)
|
|
{ _M_ht.insert_unique(__f,__l); }
|
|
pair<iterator, bool> insert_noresize(const value_type& __obj)
|
|
{
|
|
pair<typename _Ht::iterator, bool> __p =
|
|
_M_ht.insert_unique_noresize(__obj);
|
|
return pair<iterator, bool>(__p.first, __p.second);
|
|
}
|
|
|
|
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 _Value, class _HashFcn, class _EqualKey, class _Alloc>
|
|
inline bool
|
|
operator==(const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs1,
|
|
const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs2)
|
|
{
|
|
return __hs1._M_ht == __hs2._M_ht;
|
|
}
|
|
|
|
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
|
|
inline bool
|
|
operator!=(const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs1,
|
|
const hash_set<_Value,_HashFcn,_EqualKey,_Alloc>& __hs2) {
|
|
return !(__hs1 == __hs2);
|
|
}
|
|
|
|
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);
|
|
|
|
|
|
template <class _Value, class _HashFcn, class _EqualKey, class _Alloc>
|
|
class hash_multiset
|
|
{
|
|
// concept requirements
|
|
__glibcpp_class_requires(_Value, _SGIAssignableConcept)
|
|
__glibcpp_class_requires3(_HashFcn, size_t, _Value, _UnaryFunctionConcept);
|
|
__glibcpp_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 _Ht::const_pointer pointer;
|
|
typedef typename _Ht::const_pointer const_pointer;
|
|
typedef typename _Ht::const_reference reference;
|
|
typedef typename _Ht::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 /* __SGI_STL_INTERNAL_HASH_SET_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|