mirror of
git://gcc.gnu.org/git/gcc.git
synced 2025-01-11 16:45:27 +08:00
69b3331e2a
2007-12-03 Paolo Carlini <pcarlini@suse.de> * include/debug/unordered_map (operator==(const unordered_map&, const unordered_map&), operator!=(const unordered_map&, const unordered_map&), operator==(const unordered_multimap&, const unordered_multimap&), operator!=(const unordered_multimap&, const unordered_multimap&)): Remove. (unordered_map<>::unordered_map(unordered_map&&), operator=(unordered_map&&), clear, _M_invalidate_all, unordered_multimap<>::unordered_multimap(unordered_multimap&&), operator=(unordered_map&&), clear, _M_invalidate_all, swap(unordered_map<>&&, unordered_map<>&), swap(unordered_map<>&, unordered_map<>&&), swap(unordered_multimap<>&&, unordered_multimap<>&), swap(unordered_multimap<>&, unordered_multimap<>&&)): Add. * include/debug/unordered_set (operator==(const unordered_set&, const unordered_set&), operator!=(const unordered_set&, const unordered_set&), operator==(const unordered_multiset&, const unordered_multiset&), operator!=(const unordered_multiset&, const unordered_multiset&)): Remove. (unordered_set<>::unordered_set(unordered_set&&), operator=(unordered_set&&), clear, _M_invalidate_all, unordered_multiset<>::unordered_multiset(unordered_multiset&&), operator=(unordered_set&&), clear, _M_invalidate_all, swap(unordered_set<>&&, unordered_set<>&), swap(unordered_set<>&, unordered_set<>&&), swap(unordered_multiset<>&&, unordered_multiset<>&), swap(unordered_multiset<>&, unordered_multiset<>&&)): Add. * include/debug/safe_association.h (_Safe_association<>:: _Safe_association(_Safe_association&&)): Add. (_Safe_association<>::clear, _M_invalidate_all): Remove. From-SVN: r130581
250 lines
7.8 KiB
C++
250 lines
7.8 KiB
C++
// Debugging unordered_set/unordered_multiset implementation -*- C++ -*-
|
|
|
|
// Copyright (C) 2003, 2004, 2005, 2006, 2007
|
|
// 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.
|
|
|
|
/** @file debug/unordered_set
|
|
* This file is a GNU debug extension to the Standard C++ Library.
|
|
*/
|
|
|
|
#ifndef _GLIBCXX_DEBUG_UNORDERED_SET
|
|
#define _GLIBCXX_DEBUG_UNORDERED_SET 1
|
|
|
|
#ifdef __GXX_EXPERIMENTAL_CXX0X__
|
|
# include <unordered_set>
|
|
#else
|
|
# include <c++0x_warning.h>
|
|
#endif
|
|
|
|
#include <debug/safe_association.h>
|
|
#include <debug/safe_iterator.h>
|
|
|
|
#define _GLIBCXX_BASE unordered_set<_Value, _Hash, _Pred, _Alloc>
|
|
#define _GLIBCXX_STD_BASE _GLIBCXX_STD_D::_GLIBCXX_BASE
|
|
|
|
namespace std
|
|
{
|
|
namespace __debug
|
|
{
|
|
template<typename _Value,
|
|
typename _Hash = std::hash<_Value>,
|
|
typename _Pred = std::equal_to<_Value>,
|
|
typename _Alloc = std::allocator<_Value> >
|
|
class unordered_set
|
|
: public __gnu_debug::_Safe_association<_GLIBCXX_STD_BASE>,
|
|
public __gnu_debug::_Safe_sequence<_GLIBCXX_BASE>
|
|
{
|
|
typedef typename _GLIBCXX_STD_BASE _Base;
|
|
typedef __gnu_debug::_Safe_association<_Base> _Safe_assoc;
|
|
typedef __gnu_debug::_Safe_sequence<unordered_set> _Safe_base;
|
|
|
|
public:
|
|
typedef typename _Safe_assoc::size_type size_type;
|
|
typedef typename _Safe_assoc::hasher hasher;
|
|
typedef typename _Safe_assoc::key_equal key_equal;
|
|
typedef typename _Safe_assoc::allocator_type allocator_type;
|
|
|
|
explicit
|
|
unordered_set(size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Safe_assoc(__n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
template<typename _InputIterator>
|
|
unordered_set(_InputIterator __f, _InputIterator __l,
|
|
size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Safe_assoc(__f, __l, __n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
unordered_set(const _Safe_assoc& __x)
|
|
: _Safe_assoc(__x), _Safe_base() { }
|
|
|
|
unordered_set(unordered_set&& __x)
|
|
: _Safe_assoc(std::forward<_Safe_assoc>(__x)), _Safe_base() { }
|
|
|
|
unordered_set&
|
|
operator=(unordered_set&& __x)
|
|
{
|
|
// NB: DR 675.
|
|
clear();
|
|
swap(__x);
|
|
return *this;
|
|
}
|
|
|
|
void
|
|
swap(unordered_set&& __x)
|
|
{
|
|
_Safe_assoc::swap(__x);
|
|
_Safe_base::_M_swap(__x);
|
|
}
|
|
|
|
void
|
|
clear()
|
|
{
|
|
_Base::clear();
|
|
this->_M_invalidate_all();
|
|
}
|
|
|
|
private:
|
|
void
|
|
_M_invalidate_all()
|
|
{
|
|
typedef typename _Base::const_iterator _Base_const_iterator;
|
|
typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
|
|
this->_M_invalidate_if(_Not_equal(this->_M_base().end()));
|
|
}
|
|
};
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_set<_Value, _Hash, _Pred, _Alloc>&& __x,
|
|
unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_set<_Value, _Hash, _Pred, _Alloc>&& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
#undef _GLIBCXX_BASE
|
|
#undef _GLIBCXX_STD_BASE
|
|
#define _GLIBCXX_STD_BASE _GLIBCXX_STD_D::_GLIBCXX_BASE
|
|
#define _GLIBCXX_BASE unordered_multiset<_Value, _Hash, _Pred, _Alloc>
|
|
|
|
template<typename _Value,
|
|
typename _Hash = std::hash<_Value>,
|
|
typename _Pred = std::equal_to<_Value>,
|
|
typename _Alloc = std::allocator<_Value> >
|
|
class unordered_multiset
|
|
: public __gnu_debug::_Safe_association<_GLIBCXX_STD_BASE>,
|
|
public __gnu_debug::_Safe_sequence<_GLIBCXX_BASE>
|
|
{
|
|
typedef typename _GLIBCXX_STD_BASE _Base;
|
|
typedef __gnu_debug::_Safe_association<_Base> _Safe_assoc;
|
|
typedef __gnu_debug::_Safe_sequence<unordered_multiset> _Safe_base;
|
|
|
|
public:
|
|
typedef typename _Safe_assoc::size_type size_type;
|
|
typedef typename _Safe_assoc::hasher hasher;
|
|
typedef typename _Safe_assoc::key_equal key_equal;
|
|
typedef typename _Safe_assoc::allocator_type allocator_type;
|
|
|
|
explicit
|
|
unordered_multiset(size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Safe_assoc(__n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
template<typename _InputIterator>
|
|
unordered_multiset(_InputIterator __f, _InputIterator __l,
|
|
size_type __n = 10,
|
|
const hasher& __hf = hasher(),
|
|
const key_equal& __eql = key_equal(),
|
|
const allocator_type& __a = allocator_type())
|
|
: _Safe_assoc(__f, __l, __n, __hf, __eql, __a)
|
|
{ }
|
|
|
|
unordered_multiset(const _Safe_assoc& __x)
|
|
: _Safe_assoc(__x), _Safe_base() { }
|
|
|
|
unordered_multiset(unordered_multiset&& __x)
|
|
: _Safe_assoc(std::forward<_Safe_assoc>(__x)), _Safe_base() { }
|
|
|
|
unordered_multiset&
|
|
operator=(unordered_multiset&& __x)
|
|
{
|
|
// NB: DR 675.
|
|
clear();
|
|
swap(__x);
|
|
return *this;
|
|
}
|
|
|
|
void
|
|
swap(unordered_multiset&& __x)
|
|
{
|
|
_Safe_assoc::swap(__x);
|
|
_Safe_base::_M_swap(__x);
|
|
}
|
|
|
|
void
|
|
clear()
|
|
{
|
|
_Base::clear();
|
|
this->_M_invalidate_all();
|
|
}
|
|
|
|
private:
|
|
void
|
|
_M_invalidate_all()
|
|
{
|
|
typedef typename _Base::const_iterator _Base_const_iterator;
|
|
typedef __gnu_debug::_Not_equal_to<_Base_const_iterator> _Not_equal;
|
|
this->_M_invalidate_if(_Not_equal(this->_M_base().end()));
|
|
}
|
|
};
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __x,
|
|
unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
template<typename _Value, typename _Hash, typename _Pred, typename _Alloc>
|
|
inline void
|
|
swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,
|
|
unordered_multiset<_Value, _Hash, _Pred, _Alloc>&& __y)
|
|
{ __x.swap(__y); }
|
|
|
|
} // namespace __debug
|
|
} // namespace std
|
|
|
|
#undef _GLIBCXX_BASE
|
|
#undef _GLIBCXX_STD_BASE
|
|
|
|
#endif
|