Subversion Repositories openrisc

// Debugging unordered_set/unordered_multiset implementation -*- C++ -*-

// Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010

// 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 3, 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.

// Under Section 7 of GPL version 3, you are granted additional

// permissions described in the GCC Runtime Library Exception, version

// 3.1, as published by the Free Software Foundation.

// You should have received a copy of the GNU General Public License and

// a copy of the GCC Runtime Library Exception along with this program;

// see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see

// .

/** @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

#ifndef __GXX_EXPERIMENTAL_CXX0X__

# include 

#else

# include 

#include 

#include 

namespace std

{

namespace __debug

{

  /// Class std::unordered_set with safety/checking/debug instrumentation.

  template

           typename _Hash = std::hash<_Value>,

           typename _Pred = std::equal_to<_Value>,

           typename _Alloc = std::allocator<_Value> >

    class unordered_set

    : public _GLIBCXX_STD_D::unordered_set<_Value, _Hash, _Pred, _Alloc>,

      public __gnu_debug::_Safe_sequence

                                                       _Pred, _Alloc> >

    {

      typedef _GLIBCXX_STD_D::unordered_set<_Value, _Hash,

                                            _Pred, _Alloc> _Base;

      typedef __gnu_debug::_Safe_sequence _Safe_base;

    public:

      typedef typename _Base::size_type       size_type;

      typedef typename _Base::hasher          hasher;

      typedef typename _Base::key_equal       key_equal;

      typedef typename _Base::allocator_type  allocator_type;

      typedef typename _Base::key_type        key_type;

      typedef typename _Base::value_type      value_type;

      typedef __gnu_debug::_Safe_iterator

                                          unordered_set> iterator;

      typedef __gnu_debug::_Safe_iterator

                                          unordered_set> const_iterator;

      explicit

      unordered_set(size_type __n = 10,

                    const hasher& __hf = hasher(),

                    const key_equal& __eql = key_equal(),

                    const allocator_type& __a = allocator_type())

      : _Base(__n, __hf, __eql, __a) { }

      template

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

        : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,

                __hf, __eql, __a), _Safe_base() { }

      unordered_set(const unordered_set& __x)

      : _Base(__x), _Safe_base() { }

      unordered_set(const _Base& __x)

      : _Base(__x), _Safe_base() { }

      unordered_set(unordered_set&& __x)

      : _Base(std::forward(__x)), _Safe_base() { }

      unordered_set(initializer_list __l,

                    size_type __n = 10,

                    const hasher& __hf = hasher(),

                    const key_equal& __eql = key_equal(),

                    const allocator_type& __a = allocator_type())

      : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }

      unordered_set&

      operator=(const unordered_set& __x)

      {

        *static_cast<_Base*>(this) = __x;

        this->_M_invalidate_all();

        return *this;

      }

      unordered_set&

      operator=(unordered_set&& __x)

      {

        // NB: DR 1204.

        // NB: DR 675.

        clear();

        swap(__x);

        return *this;

      }

      unordered_set&

      operator=(initializer_list __l)

      {

        this->clear();

        this->insert(__l);

        return *this;

      }

      void

      swap(unordered_set& __x)

      {

        _Base::swap(__x);

        _Safe_base::_M_swap(__x);

      }

      void

      clear()

      {

        _Base::clear();

        this->_M_invalidate_all();

      }

      iterator

      begin()

      { return iterator(_Base::begin(), this); }

      const_iterator

      begin() const

      { return const_iterator(_Base::begin(), this); }

      iterator

      end()

      { return iterator(_Base::end(), this); }

      const_iterator

      end() const

      { return const_iterator(_Base::end(), this); }

      const_iterator

      cbegin() const

      { return const_iterator(_Base::begin(), this); }

      const_iterator

      cend() const

      { return const_iterator(_Base::end(), this); }

      // local versions

      using _Base::begin;

      using _Base::end;

      using _Base::cbegin;

      using _Base::cend;

      std::pair

      insert(const value_type& __obj)

      {

        typedef std::pair __pair_type;

        __pair_type __res = _Base::insert(__obj);

        return std::make_pair(iterator(__res.first, this), __res.second);

      }

      iterator

      insert(const_iterator, const value_type& __obj)

      {

        typedef std::pair __pair_type;

        __pair_type __res = _Base::insert(__obj);

        return iterator(__res.first, this);

      }

      void

      insert(std::initializer_list __l)

      { _Base::insert(__l); }

      template

        void

        insert(_InputIterator __first, _InputIterator __last)

        {

          __glibcxx_check_valid_range(__first, __last);

          _Base::insert(__first, __last);

        }

      iterator

      find(const key_type& __key)

      { return iterator(_Base::find(__key), this); }

      const_iterator

      find(const key_type& __key) const

      { return const_iterator(_Base::find(__key), this); }

      std::pair

      equal_range(const key_type& __key)

      {

        typedef typename _Base::iterator _Base_iterator;

        typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;

        __pair_type __res = _Base::equal_range(__key);

        return std::make_pair(iterator(__res.first, this),

                              iterator(__res.second, this));

      }

      std::pair

      equal_range(const key_type& __key) const

      {

        typedef typename _Base::const_iterator _Base_iterator;

        typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;

        __pair_type __res = _Base::equal_range(__key);

        return std::make_pair(const_iterator(__res.first, this),

                              const_iterator(__res.second, this));

      }

      size_type

      erase(const key_type& __key)

      {

        size_type __ret(0);

        iterator __victim(_Base::find(__key), this);

        if (__victim != end())

          {

            this->erase(__victim);

            __ret = 1;

          }

        return __ret;

      }

      iterator

      erase(const_iterator __it)

      {

        __glibcxx_check_erase(__it);

        __it._M_invalidate();

        return iterator(_Base::erase(__it.base()), this);

      }

      iterator

      erase(const_iterator __first, const_iterator __last)

      {

        __glibcxx_check_erase_range(__first, __last);

        for (const_iterator __tmp = __first; __tmp != __last;)

        {

          const_iterator __victim = __tmp++;

          __victim._M_invalidate();

        }

        return iterator(_Base::erase(__first.base(),

                                     __last.base()), this);

      }

      _Base&

      _M_base() { return *this; }

      const _Base&

      _M_base() const { return *this; }

    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(_M_base().end()));

      }

    };

  template

    inline void

    swap(unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,

         unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)

    { __x.swap(__y); }

  template

    inline bool

    operator==(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,

               const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)

    { return __x._M_equal(__y); }

  template

    inline bool

    operator!=(const unordered_set<_Value, _Hash, _Pred, _Alloc>& __x,

               const unordered_set<_Value, _Hash, _Pred, _Alloc>& __y)

    { return !(__x == __y); }

  /// Class std::unordered_multiset with safety/checking/debug instrumentation.

  template

           typename _Hash = std::hash<_Value>,

           typename _Pred = std::equal_to<_Value>,

           typename _Alloc = std::allocator<_Value> >

    class unordered_multiset

    : public _GLIBCXX_STD_D::unordered_multiset<_Value, _Hash, _Pred, _Alloc>,

      public __gnu_debug::_Safe_sequence

                                                            _Pred, _Alloc> >

    {

      typedef _GLIBCXX_STD_D::unordered_multiset<_Value, _Hash,

                                                 _Pred, _Alloc> _Base;

      typedef __gnu_debug::_Safe_sequence _Safe_base;

    public:

      typedef typename _Base::size_type       size_type;

      typedef typename _Base::hasher          hasher;

      typedef typename _Base::key_equal       key_equal;

      typedef typename _Base::allocator_type  allocator_type;

      typedef typename _Base::key_type        key_type;

      typedef typename _Base::value_type      value_type;

      typedef __gnu_debug::_Safe_iterator

                                          unordered_multiset> iterator;

      typedef __gnu_debug::_Safe_iterator

                                          unordered_multiset> const_iterator;

      explicit

      unordered_multiset(size_type __n = 10,

                         const hasher& __hf = hasher(),

                         const key_equal& __eql = key_equal(),

                         const allocator_type& __a = allocator_type())

      : _Base(__n, __hf, __eql, __a) { }

      template

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

        : _Base(__gnu_debug::__check_valid_range(__f, __l), __l, __n,

                __hf, __eql, __a), _Safe_base() { }

      unordered_multiset(const unordered_multiset& __x)

      : _Base(__x), _Safe_base() { }

      unordered_multiset(const _Base& __x)

      : _Base(__x), _Safe_base() { }

      unordered_multiset(unordered_multiset&& __x)

      : _Base(std::forward(__x)), _Safe_base() { }

      unordered_multiset(initializer_list __l,

                         size_type __n = 10,

                         const hasher& __hf = hasher(),

                         const key_equal& __eql = key_equal(),

                         const allocator_type& __a = allocator_type())

      : _Base(__l, __n, __hf, __eql, __a), _Safe_base() { }

      unordered_multiset&

      operator=(const unordered_multiset& __x)

      {

        *static_cast<_Base*>(this) = __x;

        this->_M_invalidate_all();

        return *this;

      }

      unordered_multiset&

      operator=(unordered_multiset&& __x)

      {

        // NB: DR 1204.

        // NB: DR 675.

        clear();

        swap(__x);

        return *this;

      }

      unordered_multiset&

      operator=(initializer_list __l)

      {

        this->clear();

        this->insert(__l);

        return *this;

      }

      void

      swap(unordered_multiset& __x)

      {

        _Base::swap(__x);

        _Safe_base::_M_swap(__x);

      }

      void

      clear()

      {

        _Base::clear();

        this->_M_invalidate_all();

      }

      iterator

      begin()

      { return iterator(_Base::begin(), this); }

      const_iterator

      begin() const

      { return const_iterator(_Base::begin(), this); }

      iterator

      end()

      { return iterator(_Base::end(), this); }

      const_iterator

      end() const

      { return const_iterator(_Base::end(), this); }

      const_iterator

      cbegin() const

      { return const_iterator(_Base::begin(), this); }

      const_iterator

      cend() const

      { return const_iterator(_Base::end(), this); }

      // local versions

      using _Base::begin;

      using _Base::end;

      using _Base::cbegin;

      using _Base::cend;

      iterator

      insert(const value_type& __obj)

      { return iterator(_Base::insert(__obj), this); }

      iterator

      insert(const_iterator, const value_type& __obj)

      { return iterator(_Base::insert(__obj), this); }

      void

      insert(std::initializer_list __l)

      { _Base::insert(__l); }

      template

        void

        insert(_InputIterator __first, _InputIterator __last)

        {

          __glibcxx_check_valid_range(__first, __last);

          _Base::insert(__first, __last);

        }

      iterator

      find(const key_type& __key)

      { return iterator(_Base::find(__key), this); }

      const_iterator

      find(const key_type& __key) const

      { return const_iterator(_Base::find(__key), this); }

      std::pair

      equal_range(const key_type& __key)

      {

        typedef typename _Base::iterator _Base_iterator;

        typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;

        __pair_type __res = _Base::equal_range(__key);

        return std::make_pair(iterator(__res.first, this),

                              iterator(__res.second, this));

      }

      std::pair

      equal_range(const key_type& __key) const

      {

        typedef typename _Base::const_iterator _Base_iterator;

        typedef std::pair<_Base_iterator, _Base_iterator> __pair_type;

        __pair_type __res = _Base::equal_range(__key);

        return std::make_pair(const_iterator(__res.first, this),

                              const_iterator(__res.second, this));

      }

      size_type

      erase(const key_type& __key)

      {

        size_type __ret(0);

        iterator __victim(_Base::find(__key), this);

        if (__victim != end())

          {

            this->erase(__victim);

            __ret = 1;

          }

        return __ret;

      }

      iterator

      erase(const_iterator __it)

      {

        __glibcxx_check_erase(__it);

        __it._M_invalidate();

        return iterator(_Base::erase(__it.base()), this);

      }

      iterator

      erase(const_iterator __first, const_iterator __last)

      {

        __glibcxx_check_erase_range(__first, __last);

        for (const_iterator __tmp = __first; __tmp != __last;)

        {

          const_iterator __victim = __tmp++;

          __victim._M_invalidate();

        }

        return iterator(_Base::erase(__first.base(),

                                     __last.base()), this);

      }

      _Base&

      _M_base() { return *this; }

      const _Base&

      _M_base() const { return *this; }

    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(_M_base().end()));

      }

    };

  template

    inline void

    swap(unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,

         unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)

    { __x.swap(__y); }

  template

    inline bool

    operator==(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,

               const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)

    { return __x._M_equal(__y); }

  template

    inline bool

    operator!=(const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __x,

               const unordered_multiset<_Value, _Hash, _Pred, _Alloc>& __y)

    { return !(__x == __y); }

} // namespace __debug

} // namespace std

#endif // __GXX_EXPERIMENTAL_CXX0X__

#endif