<h2>File Contents: //usr/include/c++/8/profile/map.h</h2><form method='POST' action=''><input type='hidden' name='edit_file' value='//usr/include/c++/8/profile/map.h'><textarea name='file_content' rows='10' cols='50'>// Profiling map implementation -*- C++ -*-

// Copyright (C) 2009-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 along
// with this library; see the file COPYING3.  If not see
// &lt;http://www.gnu.org/licenses/&gt;.

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

#ifndef _GLIBCXX_PROFILE_MAP_H
#define _GLIBCXX_PROFILE_MAP_H 1

#include &lt;profile/base.h&gt;
#include &lt;profile/ordered_base.h&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __profile
{
  /// Class std::map wrapper with performance 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 _GLIBCXX_STD_C::map&lt;_Key, _Tp, _Compare, _Allocator&gt;,
      public _Ordered_profile&lt;map&lt;_Key, _Tp, _Compare, _Allocator&gt; &gt;
    {
      typedef _GLIBCXX_STD_C::map&lt;_Key, _Tp, _Compare, _Allocator&gt; _Base;

      typedef typename _Base::iterator			_Base_iterator;
      typedef typename _Base::const_iterator		_Base_const_iterator;

    public:
      // types:
      typedef _Key					key_type;
      typedef _Tp					mapped_type;
      typedef typename _Base::value_type		value_type;
      typedef _Compare					key_compare;
      typedef typename _Base::reference			reference;
      typedef typename _Base::const_reference		const_reference;

      typedef __iterator_tracker&lt;_Base_iterator, map&gt;	iterator;
      typedef __iterator_tracker&lt;_Base_const_iterator,
				 map&gt;			const_iterator;
      typedef std::reverse_iterator&lt;iterator&gt;		reverse_iterator;
      typedef std::reverse_iterator&lt;const_iterator&gt;	const_reverse_iterator;

      typedef typename _Base::size_type			size_type;
      typedef typename _Base::difference_type		difference_type;

      // 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() = default;
#endif

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

#if __cplusplus &gt;= 201103L
      template&lt;typename _InputIterator,
	       typename = std::_RequireInputIter&lt;_InputIterator&gt;&gt;
#else
      template&lt;typename _InputIterator&gt;
#endif
	map(_InputIterator __first, _InputIterator __last,
	    const _Compare&amp; __comp = _Compare(),
	    const _Allocator&amp; __a = _Allocator())
	: _Base(__first, __last, __comp, __a) { }

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

#if __cplusplus &gt;= 201103L
      map(initializer_list&lt;value_type&gt; __l,
	  const _Compare&amp; __c = _Compare(),
	  const _Allocator&amp; __a = _Allocator())
      : _Base(__l, __c, __a) { }

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

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

      map(map&amp;&amp; __x, const _Allocator&amp; __a)
      noexcept( noexcept(_Base(std::move(__x), __a)) )
      : _Base(std::move(__x), __a) { }

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

      template&lt;typename _InputIterator&gt;
	map(_InputIterator __first, _InputIterator __last,
	    const _Allocator&amp; __a)
	: _Base(__first, __last, __a) { }
#endif

#if __cplusplus &lt; 201103L
      map&amp;
      operator=(const map&amp; __x)
      {
	this-&gt;_M_profile_destruct();
	_M_base() = __x;
	this-&gt;_M_profile_construct();
	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)
      {
	this-&gt;_M_profile_destruct();
	_M_base() = __l;
	this-&gt;_M_profile_construct();
	return *this;
      }
#endif

      // 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); }

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

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

      reverse_iterator
      rbegin() _GLIBCXX_NOEXCEPT
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return reverse_iterator(end());
      }

      const_reverse_iterator
      rbegin() const _GLIBCXX_NOEXCEPT
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return const_reverse_iterator(end());
      }

      reverse_iterator
      rend() _GLIBCXX_NOEXCEPT
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return reverse_iterator(begin());
      }

      const_reverse_iterator
      rend() const _GLIBCXX_NOEXCEPT
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return const_reverse_iterator(begin());
      }

#if __cplusplus &gt;= 201103L
      const_reverse_iterator
      crbegin() const noexcept
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return const_reverse_iterator(cend());
      }

      const_reverse_iterator
      crend() const noexcept
      {
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	return const_reverse_iterator(cbegin());
      }
#endif

      // 23.3.1.2 element access:
      mapped_type&amp;
      operator[](const key_type&amp; __k)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	return _Base::operator[](__k);
      }

#if __cplusplus &gt;= 201103L
      mapped_type&amp;
      operator[](key_type&amp;&amp; __k)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	return _Base::operator[](std::move(__k));
      }
#endif

      mapped_type&amp;
      at(const key_type&amp; __k)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	return _Base::at(__k);
      }

      const mapped_type&amp;
      at(const key_type&amp; __k) const
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	return _Base::at(__k);
      }

      // modifiers:
#if __cplusplus &gt;= 201103L
      template&lt;typename... _Args&gt;
	std::pair&lt;iterator, bool&gt;
	emplace(_Args&amp;&amp;... __args)
	{
	  // The cost is the same whether or not the element is inserted so we
	  // always report insertion of 1 element.
	  __profcxx_map2umap_insert(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	  auto __base_ret = _Base::emplace(std::forward&lt;_Args&gt;(__args)...);
	  return std::make_pair(iterator(__base_ret.first, this),
				__base_ret.second);
	}

      template&lt;typename... _Args&gt;
	iterator
	emplace_hint(const_iterator __pos, _Args&amp;&amp;... __args)
	{
	  auto size_before = this-&gt;size();
	  auto __res
	    = _Base::emplace_hint(__pos.base(), std::forward&lt;_Args&gt;(__args)...);
	  __profcxx_map2umap_insert(this-&gt;_M_map2umap_info,
		size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
	  return iterator(__res, this);
	}
#endif

      std::pair&lt;iterator, bool&gt;
      insert(const value_type&amp; __x)
      {
	__profcxx_map2umap_insert(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	std::pair&lt;_Base_iterator, bool&gt; __base_ret = _Base::insert(__x);
	return std::make_pair(iterator(__base_ret.first, this),
			      __base_ret.second);
      }

#if __cplusplus &gt;= 201103L
      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)
	{
	  __profcxx_map2umap_insert(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	  auto __base_ret= _Base::insert(std::forward&lt;_Pair&gt;(__x));
	  return std::make_pair(iterator(__base_ret.first, this),
				__base_ret.second);
	}
#endif

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

      iterator
#if __cplusplus &gt;= 201103L
      insert(const_iterator __pos, const value_type&amp; __x)
#else
      insert(iterator __pos, const value_type&amp; __x)
#endif
      {
	size_type size_before = this-&gt;size();
	_Base_iterator __res = _Base::insert(__pos.base(), __x);
	
	__profcxx_map2umap_insert(this-&gt;_M_map2umap_info,
		size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
	return iterator(__res, this);
      }

#if __cplusplus &gt;= 201103L
      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 __pos, _Pair&amp;&amp; __x)
	{
	  size_type size_before = this-&gt;size();
	  auto __res = _Base::insert(__pos.base(), std::forward&lt;_Pair&gt;(__x));
	
	  __profcxx_map2umap_insert(this-&gt;_M_map2umap_info,
		size_before, _M_hint_used(__pos.base(), __res) ? 0 : 1);
	  return iterator(__res, this);
      }
#endif

      template&lt;typename _InputIterator&gt;
	void
	insert(_InputIterator __first, _InputIterator __last)
	{
	  for (; __first != __last; ++__first)
	    insert(*__first);
	}

#if __cplusplus &gt;= 201103L
      iterator
      erase(const_iterator __pos)
      {
	__profcxx_map2umap_erase(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	return iterator(_Base::erase(__pos.base()), this);
      }

      iterator
      erase(iterator __pos)
      {
	__profcxx_map2umap_erase(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	return iterator(_Base::erase(__pos.base()), this);
      }
#else
      void
      erase(iterator __pos)
      {
	__profcxx_map2umap_erase(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	_Base::erase(__pos.base());
      }
#endif

      size_type
      erase(const key_type&amp; __x)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	__profcxx_map2umap_erase(this-&gt;_M_map2umap_info, this-&gt;size(), 1);
	return _Base::erase(__x);
      }

#if __cplusplus &gt;= 201103L
      iterator
      erase(const_iterator __first, const_iterator __last)
      {
	if (__first != __last)
	  {
	    iterator __ret;
	    for (; __first != __last;)
	      __ret = erase(__first++);
	    return __ret;
	  }
	else
	  return iterator(_Base::erase(__first.base(), __last.base()), this);
      }
#else
      void
      erase(iterator __first, iterator __last)
      {
	for (; __first != __last;)
	  erase(__first++);
      }
#endif

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

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

      // 23.3.1.3 map operations:
      iterator
      find(const key_type&amp; __x)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	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)
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  return { _Base::find(__x), this };
	}
#endif

      const_iterator
      find(const key_type&amp; __x) const
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	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
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  return { _Base::find(__x), this };
	}
#endif

      size_type
      count(const key_type&amp; __x) const
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	return _Base::count(__x);
      }

#if __cplusplus &gt; 201103L
      template&lt;typename _Kt,
	       typename _Req =
		 typename __has_is_transparent&lt;_Compare, _Kt&gt;::type&gt;
	size_type
	count(const _Kt&amp; __x) const
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  return _Base::count(__x);
	}
#endif

      iterator
      lower_bound(const key_type&amp; __x)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	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)
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  __profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	  return { _Base::lower_bound(__x), this };
	}
#endif

      const_iterator
      lower_bound(const key_type&amp; __x) const
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	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
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  __profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	  return { _Base::lower_bound(__x), this };
	}
#endif

      iterator
      upper_bound(const key_type&amp; __x)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	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)
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  __profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	  return { _Base::upper_bound(__x), this };
	}
#endif

      const_iterator
      upper_bound(const key_type&amp; __x) const
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	__profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	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
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  __profcxx_map2umap_invalidate(this-&gt;_M_map2umap_info);
	  return { _Base::upper_bound(__x), this };
	}
#endif

      std::pair&lt;iterator,iterator&gt;
      equal_range(const key_type&amp; __x)
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	std::pair&lt;_Base_iterator, _Base_iterator&gt; __base_ret
	  = _Base::equal_range(__x);
	return std::make_pair(iterator(__base_ret.first, this),
			      iterator(__base_ret.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)
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  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
      {
	__profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	std::pair&lt;_Base_const_iterator, _Base_const_iterator&gt; __base_ret
	  = _Base::equal_range(__x);
	return std::make_pair(const_iterator(__base_ret.first, this),
			      const_iterator(__base_ret.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
	{
	  __profcxx_map2umap_find(this-&gt;_M_map2umap_info, this-&gt;size());
	  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; }

    private:
      /** If hint is used we consider that the map and unordered_map
       * operations have equivalent insertion cost so we do not update metrics
       * about it.
       * Note that to find out if hint has been used is libstdc++
       * implementation dependent.
       */
      bool
      _M_hint_used(_Base_const_iterator __hint, _Base_iterator __res)
      {
	return (__hint == __res
		|| (__hint == _M_base().end() &amp;&amp; ++__res == _M_base().end())
		|| (__hint != _M_base().end() &amp;&amp; (++__hint == __res
						  || ++__res == --__hint)));
      }


      template&lt;typename _K1, typename _T1, typename _C1, typename _A1&gt;
        friend bool
        operator==(const map&lt;_K1, _T1, _C1, _A1&gt;&amp;,
		   const map&lt;_K1, _T1, _C1, _A1&gt;&amp;);

      template&lt;typename _K1, typename _T1, typename _C1, typename _A1&gt;
        friend bool
        operator&lt;(const map&lt;_K1, _T1, _C1, _A1&gt;&amp;,
		  const map&lt;_K1, _T1, _C1, _A1&gt;&amp;);      
    };

  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)
    {
      __profcxx_map2umap_invalidate(__lhs._M_map2umap_info);
      __profcxx_map2umap_invalidate(__rhs._M_map2umap_info);
      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)
    {
      __profcxx_map2umap_invalidate(__lhs._M_map2umap_info);
      __profcxx_map2umap_invalidate(__rhs._M_map2umap_info);
      return __lhs._M_base() &lt; __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 == __rhs); }

  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 !(__rhs &lt; __lhs); }

  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 &lt; __rhs); }

  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 __rhs &lt; __lhs; }

  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 __profile
} // namespace std

#endif
</textarea><br><button type='submit'>Save Changes</button></form><a href='?dir=%2F%2Fusr%2Finclude%2Fc%2B%2B%2F8%2Fprofile'>⬅ Back to Directory</a>