ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ

📁 ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ PHP v8.0.30

Path:root/home/aljabrcp/public_html/

Name	Size	Perm	Actions
📁 .render-cache	-	0755	🗑️ 🏷️
📁 .tmb	-	0777	🗑️ 🏷️
📁 .well-known	-	0755	🗑️ 🏷️
📁 e4b5c3	-	0755	🗑️ 🏷️
📁 well-known	-	0755	🗑️ 🏷️
📁 wp-admin	-	0755	🗑️ 🏷️
📁 wp-content	-	0755	🗑️ 🏷️
📁 wp-includes	-	0755	🗑️ 🏷️
📄 .072335799904244.php	0.73 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .303133550574645.php	0.73 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .771565434277360.php	0.72 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .ftpquota	0.02 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .htaccess	0.06 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .htaccess_old	2.38 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .maintenance	0.03 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 .render-orig.php	0.4 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 admin.php	1073.33 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ajyycson.php	18.36 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 bjspsdnw.php	18.36 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 btxouxnz.php	18.36 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 byobdpit.php	161.75 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 dot.php	6.83 KB	0444	🗑️ 🏷️ ⬇️ ✏️
📄 dtypulkn.php	18.48 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 error_log	1.77 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 fdkvhqgp.php	18.36 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 features.php	9.84 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 fiouvmwk.php	18.51 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 gkliwelb.php	19.47 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 hhxpypnm.php	18.48 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ichqcdtz.php	18.48 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 iggrnuqs.php	1073.33 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ijigqafs.php	215.7 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ilkifkhe.php	18.48 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 index.php	0.08 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 japeqpqk.php	18.55 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 kxkjgars.php	14.76 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 legcmbtx.php	161.75 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 license.txt	19.44 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 lufix.php	53.27 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 mdlyonrh.php	161.75 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 memkgrwi.php	18.55 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 min.php	6.83 KB	0444	🗑️ 🏷️ ⬇️ ✏️
📄 mlqeheok.php	35.6 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 mmkegijm.php	18.5 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 mqbfmtzr.php	14.76 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 nkuxvifp.php	18.56 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ocngdtip.php	18.55 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ops.php	31 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 options.php	1.29 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 php.ini	0.1 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 pjqgidra.php	19.54 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 qpggioxw.php	14.76 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 readme.html	7.23 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 robots.txt	0.35 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 rpudqgij.php	15.4 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 tvuydrna.php	18.36 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 uymbqzzs.php	215.7 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 vxbezeuh.php	15.4 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 vxeskmxs.php	19.54 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-activate.php	7.2 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-blog-header.php	0.34 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-comments-post.php	2.27 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config-sample.php	3.26 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php	3.31 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.bak	3.31 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.before-debug	3.31 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.before-debug.2026-06-26-151429	3.31 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.before-debug.2026-06-26-151542	3.26 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.broken.2026-06-26-152109	3.27 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.broken.2026-06-26-152153	3.27 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-config.php.broken.2026-06-26-152623	3.27 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-cron.php	5.49 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-links-opml.php	2.43 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-load.php	3.84 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-mail.php	8.52 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-server.php	162 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-settings.php	31.88 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-signup.php	33.81 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wp-trackback.php	5.09 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 wpxml.php	12.37 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 xmlrpc.php	3.13 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 xyn.php	5.65 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 ydrqjvyq.php	18.51 KB	0777	🗑️ 🏷️ ⬇️ ✏️
📄 zwmxmsbj.php	215.7 KB	0777	🗑️ 🏷️ ⬇️ ✏️

Edit: unordered_map

// Profiling unordered_map/unordered_multimap 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
// <http://www.gnu.org/licenses/>.

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

#ifndef _GLIBCXX_PROFILE_UNORDERED_MAP
#define _GLIBCXX_PROFILE_UNORDERED_MAP 1

#if __cplusplus < 201103L
# include <bits/c++0x_warning.h>
#else
# include <unordered_map>

#include <profile/base.h>
#include <profile/unordered_base.h>

#define _GLIBCXX_BASE unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>
#define _GLIBCXX_STD_BASE _GLIBCXX_STD_C::_GLIBCXX_BASE

namespace std _GLIBCXX_VISIBILITY(default)
{
namespace __profile
{
  /// Class std::unordered_map wrapper with performance instrumentation.
  template<typename _Key, typename _Tp,
	   typename _Hash = std::hash<_Key>,
	   typename _Pred = std::equal_to<_Key>,
	   typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
    class unordered_map
    : public _GLIBCXX_STD_BASE,
      public _Unordered_profile<unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>,
				true>
    {
      typedef typename _GLIBCXX_STD_BASE _Base;

_Base&
      _M_base() noexcept	{ return *this; }

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

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 typename _Base::difference_type	difference_type;
      typedef typename _Base::reference		reference;
      typedef typename _Base::const_reference	const_reference;
      typedef typename _Base::mapped_type	mapped_type;

typedef typename _Base::iterator		iterator;
      typedef typename _Base::const_iterator	const_iterator;

unordered_map() = default;

explicit
      unordered_map(size_type __n,
		    const hasher& __hf = hasher(),
		    const key_equal& __eql = key_equal(),
		    const allocator_type& __a = allocator_type())
      : _Base(__n, __hf, __eql, __a) { }

template<typename _InputIterator>
	unordered_map(_InputIterator __f, _InputIterator __l,
		      size_type __n = 0,
		      const hasher& __hf = hasher(),
		      const key_equal& __eql = key_equal(),
		      const allocator_type& __a = allocator_type())
	: _Base(__f, __l, __n, __hf, __eql, __a) { }

unordered_map(const unordered_map&) = default;

unordered_map(const _Base& __x)
      : _Base(__x) { }

unordered_map(unordered_map&&) = default;

explicit
      unordered_map(const allocator_type& __a)
      : _Base(__a) { }

unordered_map(const unordered_map& __umap,
		    const allocator_type& __a)
      : _Base(__umap, __a) { }

unordered_map(unordered_map&& __umap,
		    const allocator_type& __a)
      : _Base(std::move(__umap._M_base()), __a) { }

unordered_map(initializer_list<value_type> __l,
		    size_type __n = 0,
		    const hasher& __hf = hasher(),
		    const key_equal& __eql = key_equal(),
		    const allocator_type& __a = allocator_type())
      : _Base(__l, __n, __hf, __eql, __a) { }

unordered_map(size_type __n, const allocator_type& __a)
      : unordered_map(__n, hasher(), key_equal(), __a)
      { }

unordered_map(size_type __n, const hasher& __hf,
		    const allocator_type& __a)
      : unordered_map(__n, __hf, key_equal(), __a)
      { }

template<typename _InputIterator>
	unordered_map(_InputIterator __first, _InputIterator __last,
		      size_type __n,
		      const allocator_type& __a)
	  : unordered_map(__first, __last, __n, hasher(), key_equal(), __a)
	{ }

template<typename _InputIterator>
	unordered_map(_InputIterator __first, _InputIterator __last,
		      size_type __n, const hasher& __hf,
		      const allocator_type& __a)
	  : unordered_map(__first, __last, __n, __hf, key_equal(), __a)
	{ }

unordered_map(initializer_list<value_type> __l,
		    size_type __n,
		    const allocator_type& __a)
	: unordered_map(__l, __n, hasher(), key_equal(), __a)
      { }

unordered_map(initializer_list<value_type> __l,
		    size_type __n, const hasher& __hf,
		    const allocator_type& __a)
	: unordered_map(__l, __n, __hf, key_equal(), __a)
      { }

unordered_map&
      operator=(const unordered_map&) = default;

unordered_map&
      operator=(unordered_map&&) = default;

unordered_map&
      operator=(initializer_list<value_type> __l)
      {
	this->_M_profile_destruct();
	_M_base() = __l;
	this->_M_profile_construct();
	return *this;
      }

void
      clear() noexcept
      {
	this->_M_profile_destruct();
	_Base::clear();
	this->_M_profile_construct();
      }

template<typename... _Args>
	std::pair<iterator, bool>
	emplace(_Args&&... __args)
	{
	  size_type __old_size = _Base::bucket_count();
	  std::pair<iterator, bool> __res
	    = _Base::emplace(std::forward<_Args>(__args)...);
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

template<typename... _Args>
	iterator
	emplace_hint(const_iterator __it, _Args&&... __args)
	{
	  size_type __old_size = _Base::bucket_count();
	  iterator __res
	    = _Base::emplace_hint(__it, std::forward<_Args>(__args)...);
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

void
      insert(std::initializer_list<value_type> __l)
      {
	size_type __old_size = _Base::bucket_count();
	_Base::insert(__l);
	this->_M_profile_resize(__old_size);
      }

std::pair<iterator, bool>
      insert(const value_type& __obj)
      {
	size_type __old_size = _Base::bucket_count();
	std::pair<iterator, bool> __res = _Base::insert(__obj);
	this->_M_profile_resize(__old_size);
	return __res;
      }

iterator
      insert(const_iterator __iter, const value_type& __v)
      {
	size_type __old_size = _Base::bucket_count();
	iterator __res = _Base::insert(__iter, __v);
	this->_M_profile_resize(__old_size);
	return __res;
      }

template<typename _Pair, typename = typename
	       std::enable_if<std::is_constructible<value_type,
						    _Pair&&>::value>::type>
	std::pair<iterator, bool>
	insert(_Pair&& __obj)
	{
	  size_type __old_size = _Base::bucket_count();
	  std::pair<iterator, bool> __res
	    = _Base::insert(std::forward<_Pair>(__obj));
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

template<typename _Pair, typename = typename
	       std::enable_if<std::is_constructible<value_type,
						    _Pair&&>::value>::type>
	iterator
	insert(const_iterator __iter, _Pair&& __v)
	{
	  size_type __old_size = _Base::bucket_count();
	  iterator __res = _Base::insert(__iter, std::forward<_Pair>(__v));
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

template<typename _InputIter>
	void
	insert(_InputIter __first, _InputIter __last)
	{
	  size_type __old_size = _Base::bucket_count();
	  _Base::insert(__first, __last);
	  this->_M_profile_resize(__old_size);
	}

// operator[]
      mapped_type&
      operator[](const _Key& __k)
      {
	size_type __old_size = _Base::bucket_count();
	mapped_type& __res = _M_base()[__k];
	this->_M_profile_resize(__old_size);
	return __res;
      }

mapped_type&
      operator[](_Key&& __k)
      {
	size_type __old_size = _Base::bucket_count();
	mapped_type& __res = _M_base()[std::move(__k)];
	this->_M_profile_resize(__old_size);
	return __res;
      }

void
      swap(unordered_map& __x)
      noexcept( noexcept(__x._M_base().swap(__x)) )
      {
	_Base::swap(__x._M_base());
	this->_M_swap(__x);
      }

void rehash(size_type __n)
      {
	size_type __old_size = _Base::bucket_count();
	_Base::rehash(__n);
	this->_M_profile_resize(__old_size);
      }
  };

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline void
    swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	 unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    noexcept(noexcept(__x.swap(__y)))
    { __x.swap(__y); }

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline bool
    operator==(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	       const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    { return static_cast<const _GLIBCXX_STD_BASE&>(__x) == __y; }

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline bool
    operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	       const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    { return !(__x == __y); }

#undef _GLIBCXX_BASE
#undef _GLIBCXX_STD_BASE
#define _GLIBCXX_BASE unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>
#define _GLIBCXX_STD_BASE _GLIBCXX_STD_C::_GLIBCXX_BASE

/// Class std::unordered_multimap wrapper with performance instrumentation.
  template<typename _Key, typename _Tp,
	   typename _Hash = std::hash<_Key>,
	   typename _Pred = std::equal_to<_Key>,
	   typename _Alloc = std::allocator<std::pair<const _Key, _Tp> > >
    class unordered_multimap
    : public _GLIBCXX_STD_BASE,
      public _Unordered_profile<unordered_multimap<_Key, _Tp,
						   _Hash, _Pred, _Alloc>,
				false>
    {
      typedef typename _GLIBCXX_STD_BASE _Base;

_Base&
      _M_base() noexcept	{ return *this; }

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

typedef typename _Base::iterator		iterator;
      typedef typename _Base::const_iterator	const_iterator;

unordered_multimap() = default;

explicit
      unordered_multimap(size_type __n,
			 const hasher& __hf = hasher(),
			 const key_equal& __eql = key_equal(),
			 const allocator_type& __a = allocator_type())
      : _Base(__n, __hf, __eql, __a) { }

template<typename _InputIterator>
	unordered_multimap(_InputIterator __f, _InputIterator __l,
			   size_type __n = 0,
			   const hasher& __hf = hasher(),
			   const key_equal& __eql = key_equal(),
			   const allocator_type& __a = allocator_type())
	: _Base(__f, __l, __n, __hf, __eql, __a) { }

unordered_multimap(const unordered_multimap&) = default;

unordered_multimap(const _Base& __x)
      : _Base(__x) { }

unordered_multimap(unordered_multimap&&) = default;

explicit
      unordered_multimap(const allocator_type& __a)
      : _Base(__a) { }

unordered_multimap(const unordered_multimap& __ummap,
			 const allocator_type& __a)
      : _Base(__ummap._M_base(), __a) { }

unordered_multimap(unordered_multimap&& __ummap,
			 const allocator_type& __a)
      : _Base(std::move(__ummap._M_base()), __a) { }

unordered_multimap(initializer_list<value_type> __l,
			 size_type __n = 0,
			 const hasher& __hf = hasher(),
			 const key_equal& __eql = key_equal(),
			 const allocator_type& __a = allocator_type())
      : _Base(__l, __n, __hf, __eql, __a) { }

unordered_multimap(size_type __n, const allocator_type& __a)
      : unordered_multimap(__n, hasher(), key_equal(), __a)
      { }

unordered_multimap(size_type __n, const hasher& __hf,
			 const allocator_type& __a)
      : unordered_multimap(__n, __hf, key_equal(), __a)
      { }

template<typename _InputIterator>
	unordered_multimap(_InputIterator __first, _InputIterator __last,
			   size_type __n,
			   const allocator_type& __a)
	  : unordered_multimap(__first, __last, __n, hasher(), key_equal(), __a)
	{ }

template<typename _InputIterator>
	unordered_multimap(_InputIterator __first, _InputIterator __last,
			   size_type __n, const hasher& __hf,
			   const allocator_type& __a)
	  : unordered_multimap(__first, __last, __n, __hf, key_equal(), __a)
	{ }

unordered_multimap(initializer_list<value_type> __l,
			 size_type __n,
			 const allocator_type& __a)
	: unordered_multimap(__l, __n, hasher(), key_equal(), __a)
      { }

unordered_multimap(initializer_list<value_type> __l,
			 size_type __n, const hasher& __hf,
			 const allocator_type& __a)
	: unordered_multimap(__l, __n, __hf, key_equal(), __a)
      { }

unordered_multimap&
      operator=(const unordered_multimap&) = default;

unordered_multimap&
      operator=(unordered_multimap&&) = default;

unordered_multimap&
      operator=(initializer_list<value_type> __l)
      {
	this->_M_profile_destruct();
	_M_base() = __l;
	this->_M_profile_construct();
	return *this;
      }

void
      clear() noexcept
      {
	this->_M_profile_destruct();
	_Base::clear();
	this->_M_profile_construct();
      }

template<typename... _Args>
	iterator
	emplace(_Args&&... __args)
	{
	  size_type __old_size = _Base::bucket_count();
	  iterator __res
	    = _Base::emplace(std::forward<_Args>(__args)...);
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

void
      insert(std::initializer_list<value_type> __l)
      {
	size_type __old_size = _Base::bucket_count();
	_Base::insert(__l);
	this->_M_profile_resize(__old_size);
      }

iterator
      insert(const value_type& __obj)
      {
	size_type __old_size = _Base::bucket_count();
	iterator __res = _Base::insert(__obj);
	this->_M_profile_resize(__old_size);
	return __res;
      }

template<typename _Pair, typename = typename
	       std::enable_if<std::is_constructible<value_type,
						    _Pair&&>::value>::type>
	iterator
	insert(_Pair&& __obj)
	{
	  size_type __old_size = _Base::bucket_count();
	  iterator __res = _Base::insert(std::forward<_Pair>(__obj));
	  this->_M_profile_resize(__old_size);
	  return __res;
	}

void
      swap(unordered_multimap& __x)
      noexcept( noexcept(__x._M_base().swap(__x)) )
      {
	_Base::swap(__x._M_base());
	this->_M_swap(__x);
      }

void
      rehash(size_type __n)
      {
	size_type __old_size = _Base::bucket_count();
	_Base::rehash(__n);
	this->_M_profile_resize(__old_size);
      }
  };

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline void
    swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	 unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    noexcept(noexcept(__x.swap(__y)))
    { __x.swap(__y); }

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline bool
    operator==(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    { return static_cast<const _GLIBCXX_STD_BASE&>(__x) == __y; }

template<typename _Key, typename _Tp, typename _Hash,
	   typename _Pred, typename _Alloc>
    inline bool
    operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x,
	       const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y)
    { return !(__x == __y); }

} // namespace __profile
} // namespace std

#undef _GLIBCXX_BASE
#undef _GLIBCXX_STD_BASE

#endif // C++11

#endif

📁 ＳＫＹＳＨＥＬＬ ＭＡＮＡＧＥＲ PHP v8.0.30

Edit: unordered_map

📁 ＳＫＹＳＨＥＬＬＭＡＮＡＧＥＲ PHP v8.0.30