<h2>Editing File: /opt/rh/gcc-toolset-11/root/usr/include/c++/11/unordered_map</h2><form method='post'><textarea name='content' class='file-edit'>// &lt;unordered_map&gt; -*- C++ -*-

// Copyright (C) 2007-2021 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 include/unordered_map
 *  This is a Standard C++ Library header.
 */

#ifndef _GLIBCXX_UNORDERED_MAP
#define _GLIBCXX_UNORDERED_MAP 1

#pragma GCC system_header

#if __cplusplus &lt; 201103L
# include &lt;bits/c++0x_warning.h&gt;
#else

#include &lt;type_traits&gt;
#include &lt;initializer_list&gt;
#include &lt;bits/allocator.h&gt;
#include &lt;ext/alloc_traits.h&gt;
#include &lt;ext/aligned_buffer.h&gt;
#include &lt;bits/stl_pair.h&gt;
#include &lt;bits/stl_function.h&gt; // equal_to, _Identity, _Select1st
#include &lt;bits/functional_hash.h&gt;
#include &lt;bits/hashtable.h&gt;
#include &lt;bits/unordered_map.h&gt;
#include &lt;bits/range_access.h&gt;
#include &lt;bits/erase_if.h&gt;

#ifdef _GLIBCXX_DEBUG
# include &lt;debug/unordered_map&gt;
#endif

#if __cplusplus &gt;= 201703L
namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
  namespace pmr
  {
    template&lt;typename _Tp&gt; class polymorphic_allocator;
    template&lt;typename _Key, typename _Tp, typename _Hash = std::hash&lt;_Key&gt;,
	     typename _Pred = std::equal_to&lt;_Key&gt;&gt;
      using unordered_map
	= std::unordered_map&lt;_Key, _Tp, _Hash, _Pred,
			     polymorphic_allocator&lt;pair&lt;const _Key, _Tp&gt;&gt;&gt;;
    template&lt;typename _Key, typename _Tp, typename _Hash = std::hash&lt;_Key&gt;,
	     typename _Pred = std::equal_to&lt;_Key&gt;&gt;
      using unordered_multimap
	= std::unordered_multimap&lt;_Key, _Tp, _Hash, _Pred,
				  polymorphic_allocator&lt;pair&lt;const _Key, _Tp&gt;&gt;&gt;;
  } // namespace pmr
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std
#endif // C++17

#if __cplusplus &gt; 201703L
namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION
  template&lt;typename _Key, typename _Tp, typename _Hash, typename _CPred,
	   typename _Alloc, typename _Predicate&gt;
    inline typename unordered_map&lt;_Key, _Tp, _Hash, _CPred, _Alloc&gt;::size_type
    erase_if(unordered_map&lt;_Key, _Tp, _Hash, _CPred, _Alloc&gt;&amp; __cont,
	     _Predicate __pred)
    { return __detail::__erase_nodes_if(__cont, __pred); }

  template&lt;typename _Key, typename _Tp, typename _Hash, typename _CPred,
	   typename _Alloc, typename _Predicate&gt;
    inline typename unordered_multimap&lt;_Key, _Tp, _Hash, _CPred, _Alloc&gt;::
		    size_type
    erase_if(unordered_multimap&lt;_Key, _Tp, _Hash, _CPred, _Alloc&gt;&amp; __cont,
	     _Predicate __pred)
    { return __detail::__erase_nodes_if(__cont, __pred); }
_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std
#endif // C++20

#endif // C++11

#endif // _GLIBCXX_UNORDERED_MAP
</textarea><br><input class='btn' type='submit' value='Save Changes'></form><a class='btn' href='?dir=%2Fopt%2Frh%2Fgcc-toolset-11%2Froot%2Fusr%2Finclude%2Fc%2B%2B%2F11'>Back to Directory</a>