<h2>File Contents: //usr/include/c++/8/experimental/unordered_set</h2><form method='POST' action=''><input type='hidden' name='edit_file' value='//usr/include/c++/8/experimental/unordered_set'><textarea name='file_content' rows='10' cols='50'>// &lt;experimental/unordered_set&gt; -*- C++ -*-

// Copyright (C) 2015-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 experimental/unordered_set
 *  This is a TS C++ Library header.
 */

#ifndef _GLIBCXX_EXPERIMENTAL_UNORDERED_SET
#define _GLIBCXX_EXPERIMENTAL_UNORDERED_SET 1

#pragma GCC system_header

#if __cplusplus &gt;= 201402L

#include &lt;unordered_set&gt;
#include &lt;experimental/bits/erase_if.h&gt;
#include &lt;experimental/memory_resource&gt;

namespace std _GLIBCXX_VISIBILITY(default)
{
_GLIBCXX_BEGIN_NAMESPACE_VERSION

namespace experimental
{
inline namespace fundamentals_v2
{
  template&lt;typename _Key, typename _Hash, typename _CPred, typename _Alloc,
	   typename _Predicate&gt;
    inline void
    erase_if(unordered_set&lt;_Key, _Hash, _CPred, _Alloc&gt;&amp; __cont,
	     _Predicate __pred)
    { __detail::__erase_nodes_if(__cont, __pred); }

  template&lt;typename _Key, typename _Hash, typename _CPred, typename _Alloc,
	   typename _Predicate&gt;
    inline void
    erase_if(unordered_multiset&lt;_Key, _Hash, _CPred, _Alloc&gt;&amp; __cont,
	     _Predicate __pred)
    { __detail::__erase_nodes_if(__cont, __pred); }

  namespace pmr {
    template&lt;typename _Key, typename _Hash = hash&lt;_Key&gt;,
	     typename _Pred = equal_to&lt;_Key&gt;&gt;
      using unordered_set
      = std::unordered_set&lt;_Key, _Hash, _Pred, polymorphic_allocator&lt;_Key&gt;&gt;;

    template&lt;typename _Key, typename _Hash = hash&lt;_Key&gt;,
	     typename _Pred = equal_to&lt;_Key&gt;&gt;
      using unordered_multiset
      = std::unordered_multiset&lt;_Key, _Hash, _Pred,
				polymorphic_allocator&lt;_Key&gt;&gt;;
  } // namespace pmr

} // namespace fundamentals_v2
} // namespace experimental

_GLIBCXX_END_NAMESPACE_VERSION
} // namespace std

#endif // C++14

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