<h2>Editing File: /usr/include/c++/8/debug/map.h</h2><form method='post'><textarea name='content' class='file-edit'>// Debugging map implementation -*- C++ -*-

// Copyright (C) 2003-2018 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
// &lt;http://www.gnu.org/licenses/&gt;.

/** @file debug/map.h
 *  This file is a GNU debug extension to the Standard C++ Library.
 */

#ifndef _GLIBCXX_DEBUG_MAP_H
#define _GLIBCXX_DEBUG_MAP_H 1

#include &lt;debug/safe_sequence.h&gt;
#include &lt;debug/safe_container.h&gt;
#include &lt;debug/safe_iterator.h&gt;
#include &lt;utility&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __debug
{
  /// Class std::map with safety/checking/debug instrumentation.
  template&lt;typename _Key, typename _Tp, typename _Compare = std::less&lt;_Key&gt;,
	   typename _Allocator = std::allocator&lt;std::pair&lt;const _Key, _Tp&gt; &gt; &gt;
    class map
    : public __gnu_debug::_Safe_container&lt;
	map&lt;_Key, _Tp, _Compare, _Allocator&gt;, _Allocator,
	__gnu_debug::_Safe_node_sequence&gt;,
      public _GLIBCXX_STD_C::map&lt;_Key, _Tp, _Compare, _Allocator&gt;
    {
      typedef _GLIBCXX_STD_C::map&lt;
	_Key, _Tp, _Compare, _Allocator&gt;			_Base;
      typedef __gnu_debug::_Safe_container&lt;
	map, _Allocator, __gnu_debug::_Safe_node_sequence&gt;	_Safe;

      typedef typename _Base::const_iterator	_Base_const_iterator;
      typedef typename _Base::iterator		_Base_iterator;
      typedef __gnu_debug::_Equal_to&lt;_Base_const_iterator&gt; _Equal;

    public:
      // types:
      typedef _Key					key_type;
      typedef _Tp					mapped_type;
      typedef std::pair&lt;const _Key, _Tp&gt;		value_type;
      typedef _Compare					key_compare;
      typedef _Allocator				allocator_type;
      typedef typename _Base::reference			reference;
      typedef typename _Base::const_reference		const_reference;

      typedef __gnu_debug::_Safe_iterator&lt;_Base_iterator, map&gt;
							iterator;
      typedef __gnu_debug::_Safe_iterator&lt;_Base_const_iterator, map&gt;
							const_iterator;

      typedef typename _Base::size_type			size_type;
      typedef typename _Base::difference_type		difference_type;
      typedef typename _Base::pointer			pointer;
      typedef typename _Base::const_pointer		const_pointer;
      typedef std::reverse_iterator&lt;iterator&gt;		reverse_iterator;
      typedef std::reverse_iterator&lt;const_iterator&gt;	const_reverse_iterator;

      // 23.3.1.1 construct/copy/destroy:

#if __cplusplus &lt; 201103L
      map() : _Base() { }

      map(const map&amp; __x)
      : _Base(__x) { }

      ~map() { }
#else
      map() = default;
      map(const map&amp;) = default;
      map(map&amp;&amp;) = default;

      map(initializer_list&lt;value_type&gt; __l,
	  const _Compare&amp; __c = _Compare(),
	  const allocator_type&amp; __a = allocator_type())
      : _Base(__l, __c, __a) { }

      explicit
      map(const allocator_type&amp; __a)
      : _Base(__a) { }

      map(const map&amp; __m, const allocator_type&amp; __a)
      : _Base(__m, __a) { }

      map(map&amp;&amp; __m, const allocator_type&amp; __a)
      noexcept( noexcept(_Base(std::move(__m._M_base()), __a)) )
      : _Safe(std::move(__m._M_safe()), __a),
	_Base(std::move(__m._M_base()), __a) { }

      map(initializer_list&lt;value_type&gt; __l, const allocator_type&amp; __a)
      : _Base(__l, __a) { }

      template&lt;typename _InputIterator&gt;
	map(_InputIterator __first, _InputIterator __last,
	    const allocator_type&amp; __a)
	: _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
								     __last)),
		__gnu_debug::__base(__last), __a)
	{ }

      ~map() = default;
#endif

      map(const _Base&amp; __x)
      : _Base(__x) { }

      explicit map(const _Compare&amp; __comp,
		   const _Allocator&amp; __a = _Allocator())
      : _Base(__comp, __a) { }

      template&lt;typename _InputIterator&gt;
	map(_InputIterator __first, _InputIterator __last,
	    const _Compare&amp; __comp = _Compare(),
	    const _Allocator&amp; __a = _Allocator())
	: _Base(__gnu_debug::__base(__gnu_debug::__check_valid_range(__first,
								     __last)),
		__gnu_debug::__base(__last),
		__comp, __a) { }

#if __cplusplus &lt; 201103L
      map&amp;
      operator=(const map&amp; __x)
      {
	this-&gt;_M_safe() = __x;
	_M_base() = __x;
	return *this;
      }
#else
      map&amp;
      operator=(const map&amp;) = default;

      map&amp;
      operator=(map&amp;&amp;) = default;

      map&amp;
      operator=(initializer_list&lt;value_type&gt; __l)
      {
	_M_base() = __l;
	this-&gt;_M_invalidate_all();
	return *this;
      }
#endif

      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 133. map missing get_allocator()
      using _Base::get_allocator;

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

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

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

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

      reverse_iterator
      rbegin() _GLIBCXX_NOEXCEPT
      { return reverse_iterator(end()); }

      const_reverse_iterator
      rbegin() const _GLIBCXX_NOEXCEPT
      { return const_reverse_iterator(end()); }

      reverse_iterator
      rend() _GLIBCXX_NOEXCEPT
      { return reverse_iterator(begin()); }

      const_reverse_iterator
      rend() const _GLIBCXX_NOEXCEPT
      { return const_reverse_iterator(begin()); }

#if __cplusplus &gt;= 201103L
      const_iterator
      cbegin() const noexcept
      { return const_iterator(_Base::begin(), this); }

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

      const_reverse_iterator
      crbegin() const noexcept
      { return const_reverse_iterator(end()); }

      const_reverse_iterator
      crend() const noexcept
      { return const_reverse_iterator(begin()); }
#endif

      // capacity:
      using _Base::empty;
      using _Base::size;
      using _Base::max_size;

      // 23.3.1.2 element access:
      using _Base::operator[];

      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // DR 464. Suggestion for new member functions in standard containers.
      using _Base::at;

      // modifiers:
#if __cplusplus &gt;= 201103L
      template&lt;typename... _Args&gt;
	std::pair&lt;iterator, bool&gt;
	emplace(_Args&amp;&amp;... __args)
	{
	  auto __res = _Base::emplace(std::forward&lt;_Args&gt;(__args)...);
	  return std::pair&lt;iterator, bool&gt;(iterator(__res.first, this),
					   __res.second);
	}

      template&lt;typename... _Args&gt;
	iterator
	emplace_hint(const_iterator __pos, _Args&amp;&amp;... __args)
	{
	  __glibcxx_check_insert(__pos);
	  return iterator(_Base::emplace_hint(__pos.base(),
					      std::forward&lt;_Args&gt;(__args)...),
			  this);
	}
#endif

      std::pair&lt;iterator, bool&gt;
      insert(const value_type&amp; __x)
      {
	std::pair&lt;_Base_iterator, bool&gt; __res = _Base::insert(__x);
	return std::pair&lt;iterator, bool&gt;(iterator(__res.first, this),
					 __res.second);
      }

#if __cplusplus &gt;= 201103L
      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 2354. Unnecessary copying when inserting into maps with braced-init
      std::pair&lt;iterator, bool&gt;
      insert(value_type&amp;&amp; __x)
      {
	auto __res = _Base::insert(std::move(__x));
	return { iterator(__res.first, this), __res.second };
      }

      template&lt;typename _Pair, typename = typename
	       std::enable_if&lt;std::is_constructible&lt;value_type,
						    _Pair&amp;&amp;&gt;::value&gt;::type&gt;
	std::pair&lt;iterator, bool&gt;
	insert(_Pair&amp;&amp; __x)
	{
	  std::pair&lt;_Base_iterator, bool&gt; __res
	    = _Base::insert(std::forward&lt;_Pair&gt;(__x));
	  return std::pair&lt;iterator, bool&gt;(iterator(__res.first, this),
					   __res.second);
	}
#endif

#if __cplusplus &gt;= 201103L
      void
      insert(std::initializer_list&lt;value_type&gt; __list)
      { _Base::insert(__list); }
#endif

      iterator
#if __cplusplus &gt;= 201103L
      insert(const_iterator __position, const value_type&amp; __x)
#else
      insert(iterator __position, const value_type&amp; __x)
#endif
      {
	__glibcxx_check_insert(__position);
	return iterator(_Base::insert(__position.base(), __x), this);
      }

#if __cplusplus &gt;= 201103L
      // _GLIBCXX_RESOLVE_LIB_DEFECTS
      // 2354. Unnecessary copying when inserting into maps with braced-init
      iterator
      insert(const_iterator __position, value_type&amp;&amp; __x)
      {
	__glibcxx_check_insert(__position);
	return { _Base::insert(__position.base(), std::move(__x)), this };
      }

      template&lt;typename _Pair, typename = typename
	       std::enable_if&lt;std::is_constructible&lt;value_type,
						    _Pair&amp;&amp;&gt;::value&gt;::type&gt;
	iterator
	insert(const_iterator __position, _Pair&amp;&amp; __x)
	{
	  __glibcxx_check_insert(__position);
	  return iterator(_Base::insert(__position.base(),
					std::forward&lt;_Pair&gt;(__x)), this);
	}
#endif

      template&lt;typename _InputIterator&gt;
	void
	insert(_InputIterator __first, _InputIterator __last)
	{
	  typename __gnu_debug::_Distance_traits&lt;_InputIterator&gt;::__type __dist;
	  __glibcxx_check_valid_range2(__first, __last, __dist);

	  if (__dist.second &gt;= __gnu_debug::__dp_sign)
	    _Base::insert(__gnu_debug::__unsafe(__first),
			  __gnu_debug::__unsafe(__last));
	  else
	    _Base::insert(__first, __last);
	}


#if __cplusplus &gt; 201402L
      template &lt;typename... _Args&gt;
        pair&lt;iterator, bool&gt;
        try_emplace(const key_type&amp; __k, _Args&amp;&amp;... __args)
        {
	  auto __res = _Base::try_emplace(__k,
					  std::forward&lt;_Args&gt;(__args)...);
	  return { iterator(__res.first, this), __res.second };
	}

      template &lt;typename... _Args&gt;
        pair&lt;iterator, bool&gt;
        try_emplace(key_type&amp;&amp; __k, _Args&amp;&amp;... __args)
        {
	  auto __res = _Base::try_emplace(std::move(__k),
					  std::forward&lt;_Args&gt;(__args)...);
	  return { iterator(__res.first, this), __res.second };
	}

      template &lt;typename... _Args&gt;
        iterator
        try_emplace(const_iterator __hint, const key_type&amp; __k,
                    _Args&amp;&amp;... __args)
        {
	  __glibcxx_check_insert(__hint);
	  return iterator(_Base::try_emplace(__hint.base(), __k,
					     std::forward&lt;_Args&gt;(__args)...),
			  this);
	}

      template &lt;typename... _Args&gt;
        iterator
        try_emplace(const_iterator __hint, key_type&amp;&amp; __k, _Args&amp;&amp;... __args)
        {
	  __glibcxx_check_insert(__hint);
	  return iterator(_Base::try_emplace(__hint.base(), std::move(__k),
					     std::forward&lt;_Args&gt;(__args)...),
			  this);
	}

      template &lt;typename _Obj&gt;
        std::pair&lt;iterator, bool&gt;
        insert_or_assign(const key_type&amp; __k, _Obj&amp;&amp; __obj)
	{
	  auto __res = _Base::insert_or_assign(__k,
					       std::forward&lt;_Obj&gt;(__obj));
	  return { iterator(__res.first, this), __res.second };
	}

      template &lt;typename _Obj&gt;
        std::pair&lt;iterator, bool&gt;
        insert_or_assign(key_type&amp;&amp; __k, _Obj&amp;&amp; __obj)
	{
	  auto __res = _Base::insert_or_assign(std::move(__k),
					       std::forward&lt;_Obj&gt;(__obj));
	  return { iterator(__res.first, this), __res.second };
	}

      template &lt;typename _Obj&gt;
        iterator
        insert_or_assign(const_iterator __hint,
                         const key_type&amp; __k, _Obj&amp;&amp; __obj)
	{
	  __glibcxx_check_insert(__hint);
	  return iterator(_Base::insert_or_assign(__hint.base(), __k,
						  std::forward&lt;_Obj&gt;(__obj)),
			  this);
	}

      template &lt;typename _Obj&gt;
        iterator
        insert_or_assign(const_iterator __hint, key_type&amp;&amp; __k, _Obj&amp;&amp; __obj)
        {
	  __glibcxx_check_insert(__hint);
	  return iterator(_Base::insert_or_assign(__hint.base(),
						  std::move(__k),
						  std::forward&lt;_Obj&gt;(__obj)),
			  this);
	}
#endif // C++17

#if __cplusplus &gt; 201402L
      using node_type = typename _Base::node_type;
      using insert_return_type = _Node_insert_return&lt;iterator, node_type&gt;;

      node_type
      extract(const_iterator __position)
      {
	__glibcxx_check_erase(__position);
	this-&gt;_M_invalidate_if(_Equal(__position.base()));
	return _Base::extract(__position.base());
      }

      node_type
      extract(const key_type&amp; __key)
      {
	const auto __position = find(__key);
	if (__position != end())
	  return extract(__position);
	return {};
      }

      insert_return_type
      insert(node_type&amp;&amp; __nh)
      {
	auto __ret = _Base::insert(std::move(__nh));
	iterator __pos = iterator(__ret.position, this);
	return { __pos, __ret.inserted, std::move(__ret.node) };
      }

      iterator
      insert(const_iterator __hint, node_type&amp;&amp; __nh)
      {
	__glibcxx_check_insert(__hint);
	return iterator(_Base::insert(__hint.base(), std::move(__nh)), this);
      }

      using _Base::merge;
#endif // C++17

#if __cplusplus &gt;= 201103L
      iterator
      erase(const_iterator __position)
      {
	__glibcxx_check_erase(__position);
	this-&gt;_M_invalidate_if(_Equal(__position.base()));
	return iterator(_Base::erase(__position.base()), this);
      }

      iterator
      erase(iterator __position)
      { return erase(const_iterator(__position)); }
#else
      void
      erase(iterator __position)
      {
	__glibcxx_check_erase(__position);
	this-&gt;_M_invalidate_if(_Equal(__position.base()));
	_Base::erase(__position.base());
      }
#endif

      size_type
      erase(const key_type&amp; __x)
      {
	_Base_iterator __victim = _Base::find(__x);
	if (__victim == _Base::end())
	  return 0;
	else
	  {
	    this-&gt;_M_invalidate_if(_Equal(__victim));
	    _Base::erase(__victim);
	    return 1;
	  }
      }

#if __cplusplus &gt;= 201103L
      iterator
      erase(const_iterator __first, const_iterator __last)
      {
	// _GLIBCXX_RESOLVE_LIB_DEFECTS
	// 151. can't currently clear() empty container
	__glibcxx_check_erase_range(__first, __last);
	for (_Base_const_iterator __victim = __first.base();
	     __victim != __last.base(); ++__victim)
	  {
	    _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
				  _M_message(__gnu_debug::__msg_valid_range)
				  ._M_iterator(__first, &quot;first&quot;)
				  ._M_iterator(__last, &quot;last&quot;));
	    this-&gt;_M_invalidate_if(_Equal(__victim));
	  }
	return iterator(_Base::erase(__first.base(), __last.base()), this);
      }
#else
      void
      erase(iterator __first, iterator __last)
      {
	// _GLIBCXX_RESOLVE_LIB_DEFECTS
	// 151. can't currently clear() empty container
	__glibcxx_check_erase_range(__first, __last);
	for (_Base_iterator __victim = __first.base();
	     __victim != __last.base(); ++__victim)
	  {
	    _GLIBCXX_DEBUG_VERIFY(__victim != _Base::end(),
				  _M_message(__gnu_debug::__msg_valid_range)
				  ._M_iterator(__first, &quot;first&quot;)
				  ._M_iterator(__last, &quot;last&quot;));
	    this-&gt;_M_invalidate_if(_Equal(__victim));
	  }
	_Base::erase(__first.base(), __last.base());
      }
#endif

      void
      swap(map&amp; __x)
      _GLIBCXX_NOEXCEPT_IF( noexcept(declval&lt;_Base&amp;&gt;().swap(__x)) )
      {
	_Safe::_M_swap(__x);
	_Base::swap(__x);
      }

      void
      clear() _GLIBCXX_NOEXCEPT
      {
	this-&gt;_M_invalidate_all();
	_Base::clear();
      }

      // observers:
      using _Base::key_comp;
      using _Base::value_comp;

      // 23.3.1.3 map operations:
      iterator
      find(const key_type&amp; __x)
      { return iterator(_Base::find(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	iterator
	find(const _Kt&amp; __x)
	{ return { _Base::find(__x), this }; }
#endif

      const_iterator
      find(const key_type&amp; __x) const
      { return const_iterator(_Base::find(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	const_iterator
	find(const _Kt&amp; __x) const
	{ return { _Base::find(__x), this }; }
#endif

      using _Base::count;

      iterator
      lower_bound(const key_type&amp; __x)
      { return iterator(_Base::lower_bound(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	iterator
	lower_bound(const _Kt&amp; __x)
	{ return { _Base::lower_bound(__x), this }; }
#endif

      const_iterator
      lower_bound(const key_type&amp; __x) const
      { return const_iterator(_Base::lower_bound(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	const_iterator
	lower_bound(const _Kt&amp; __x) const
	{ return { _Base::lower_bound(__x), this }; }
#endif

      iterator
      upper_bound(const key_type&amp; __x)
      { return iterator(_Base::upper_bound(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	iterator
	upper_bound(const _Kt&amp; __x)
	{ return { _Base::upper_bound(__x), this }; }
#endif

      const_iterator
      upper_bound(const key_type&amp; __x) const
      { return const_iterator(_Base::upper_bound(__x), this); }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	const_iterator
	upper_bound(const _Kt&amp; __x) const
	{ return { _Base::upper_bound(__x), this }; }
#endif

      std::pair&lt;iterator,iterator&gt;
      equal_range(const key_type&amp; __x)
      {
	std::pair&lt;_Base_iterator, _Base_iterator&gt; __res =
	_Base::equal_range(__x);
	return std::make_pair(iterator(__res.first, this),
			      iterator(__res.second, this));
      }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	std::pair&lt;iterator, iterator&gt;
	equal_range(const _Kt&amp; __x)
	{
	  auto __res = _Base::equal_range(__x);
	  return { { __res.first, this }, { __res.second, this } };
	}
#endif

      std::pair&lt;const_iterator,const_iterator&gt;
      equal_range(const key_type&amp; __x) const
      {
	std::pair&lt;_Base_const_iterator, _Base_const_iterator&gt; __res =
	_Base::equal_range(__x);
	return std::make_pair(const_iterator(__res.first, this),
			      const_iterator(__res.second, this));
      }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	std::pair&lt;const_iterator, const_iterator&gt;
	equal_range(const _Kt&amp; __x) const
	{
	  auto __res = _Base::equal_range(__x);
	  return { { __res.first, this }, { __res.second, this } };
	}
#endif

      _Base&amp;
      _M_base() _GLIBCXX_NOEXCEPT	{ return *this; }

      const _Base&amp;
      _M_base() const _GLIBCXX_NOEXCEPT	{ return *this; }
    };

#if __cpp_deduction_guides &gt;= 201606

 template&lt;typename _InputIterator,
	  typename _Compare = less&lt;__iter_key_t&lt;_InputIterator&gt;&gt;,
	  typename _Allocator = allocator&lt;__iter_to_alloc_t&lt;_InputIterator&gt;&gt;,
	  typename = _RequireInputIter&lt;_InputIterator&gt;,
	  typename = _RequireAllocator&lt;_Allocator&gt;&gt;
  map(_InputIterator, _InputIterator,
      _Compare = _Compare(), _Allocator = _Allocator())
  -&gt; map&lt;__iter_key_t&lt;_InputIterator&gt;, __iter_val_t&lt;_InputIterator&gt;,
	 _Compare, _Allocator&gt;;

 template&lt;typename _Key, typename _Tp, typename _Compare = less&lt;_Key&gt;,
	  typename _Allocator = allocator&lt;pair&lt;const _Key, _Tp&gt;&gt;,
	  typename = _RequireAllocator&lt;_Allocator&gt;&gt;
   map(initializer_list&lt;pair&lt;_Key, _Tp&gt;&gt;,
       _Compare = _Compare(), _Allocator = _Allocator())
   -&gt; map&lt;_Key, _Tp, _Compare, _Allocator&gt;;

 template &lt;typename _InputIterator, typename _Allocator,
	   typename = _RequireInputIter&lt;_InputIterator&gt;,
	   typename = _RequireAllocator&lt;_Allocator&gt;&gt;
   map(_InputIterator, _InputIterator, _Allocator)
   -&gt; map&lt;__iter_key_t&lt;_InputIterator&gt;, __iter_val_t&lt;_InputIterator&gt;,
	  less&lt;__iter_key_t&lt;_InputIterator&gt;&gt;, _Allocator&gt;;

 template&lt;typename _Key, typename _Tp, typename _Allocator,
	  typename = _RequireAllocator&lt;_Allocator&gt;&gt;
   map(initializer_list&lt;pair&lt;_Key, _Tp&gt;&gt;, _Allocator)
   -&gt; map&lt;_Key, _Tp, less&lt;_Key&gt;, _Allocator&gt;;

#endif

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator==(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	       const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() == __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator!=(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	       const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() != __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator&lt;(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	      const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() &lt; __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator&lt;=(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	       const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() &lt;= __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator&gt;=(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	       const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() &gt;= __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline bool
    operator&gt;(const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	      const map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    { return __lhs._M_base() &gt; __rhs._M_base(); }

  template&lt;typename _Key, typename _Tp,
	   typename _Compare, typename _Allocator&gt;
    inline void
    swap(map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __lhs,
	 map&lt;_Key, _Tp, _Compare, _Allocator&gt;&amp; __rhs)
    _GLIBCXX_NOEXCEPT_IF(noexcept(__lhs.swap(__rhs)))
    { __lhs.swap(__rhs); }

} // namespace __debug
} // namespace std

#endif
</textarea><br><input class='btn' type='submit' value='Save Changes'></form><a class='btn' href='?dir=%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fdebug'>Back to Directory</a>