Sophie

Sophie

distrib > Mageia > 7 > armv7hl > media > core-updates > by-pkgid > bfb47da7e0322bcb0e23e4b1838d9db9 > files > 4061

libstdc++-docs-8.4.0-1.mga7.noarch.rpm

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: Member List</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
  $(document).ready(initResizable);
/* @license-end */</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">libstdc++
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a07995.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt; Member List</div>  </div>
</div><!--header-->
<div class="contents">

<p>This is the complete list of members for <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>, including all inherited members.</p>
<table class="directory">
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#aab5213cbfd6797faef226b949240b8ec">allocator_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a1e8a71d9534d9f9cf27de31a025a3053">begin</a>() noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a1fd8297776af120bf58bb6252562fc35">begin</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a72025b859653a260f7e14bac43feae79">begin</a>(size_type __n)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#aabce46436201e63f88dbebc168f9d84a">begin</a>(size_type __n) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>bucket</b>(const key_type &amp;__key) const (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a0c57013bd56a6fc373659c4e5807a64d">bucket_count</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>bucket_size</b>(size_type __n) const (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ae1c99977950ad720b2b10f6daf6c31ab">cbegin</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ad4f2132ee625dc5b3a48d28a495d552f">cbegin</a>(size_type __n) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#acc5c6d3a39a12f7d21e8886534eaa591">cend</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#aeabc377e8c2f5b367388ee5e4e0aff99">cend</a>(size_type __n) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a96159c845937ab5729b5ed41a7ef6071">clear</a>() noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ac98a77485a1a68eaadb6a7c8b5d4b141">const_iterator</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ab04f4d4643b5de9638d2f5aaa31d94e5">const_local_iterator</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ac2aca480ec930cab8cee31638ec6aa0c">const_pointer</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a580c722f453604f50c163788a75fd6c3">const_reference</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a323e46db071ea6d46dca69efbbc4d075">count</a>(const key_type &amp;__x) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ab91e542e87512944adfb13fcff51d7c8">difference_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a4d00357a4ca15a9cdffa4aef992859c8">emplace</a>(_Args &amp;&amp;... __args)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#af7f415a309a77497c41538b60d358fed">emplace_hint</a>(const_iterator __pos, _Args &amp;&amp;... __args)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ada14f82918a4a9fcfaf3c4ce218d1e70">empty</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a708a8efab9b1b9d8f1e41ca3ae2caaa5">end</a>() noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a0921ff9d001238f2f5b92f025378a37d">end</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a4209ed9ce2c4549ded624445fa59416f">end</a>(size_type __n)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#aa7cd9ddc32c88838cfcd1f2cc53ae5ab">end</a>(size_type __n) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a55b2bb934fcc4f41eaa67280c73ff1d5">equal_range</a>(const key_type &amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a6c608c4a4f2041d5045df49143124cfa">equal_range</a>(const key_type &amp;__x) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a671564fa7d5dd0e04b651e78861c89ba">erase</a>(const_iterator __position)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a08eec5ee5f497c48d356443110934fdd">erase</a>(iterator __position)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a09397dfd53f29fdbc8809d37ab11b142">erase</a>(const key_type &amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#aa38e97c00a7b10fb37726206ebc57800">erase</a>(const_iterator __first, const_iterator __last)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a9f64e8fbc46b2fec76e96499ac91c8b6">find</a>(const key_type &amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a3a54562ef76d4966a496b86691fdfb12">find</a>(const key_type &amp;__x) const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#afb20a72b3b3284f980ec948c79e3b59d">get_allocator</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a208a268d709e23f97d5763d2f24de4f2">hash_function</a>() const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a8a087ced0dd9a5d8e57c101627b67fb6">hasher</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a79303f819716015a95be11962dda3e53">insert</a>(const value_type &amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a73f5c66280686af351a204b1d98774b6">insert</a>(value_type &amp;&amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ade6cdef7282f352738f0a2bde236cf06">insert</a>(_Pair &amp;&amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#aeb4625ec1e0a22af00ccb220e4c7c7b2">insert</a>(const_iterator __hint, const value_type &amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#af90dcd39d44bdeffe788e78ca829d639">insert</a>(const_iterator __hint, value_type &amp;&amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#af7389296b49f59cc5a612fd769daaeeb">insert</a>(const_iterator __hint, _Pair &amp;&amp;__x)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a46f035c31a44c4051965af7868d40e77">insert</a>(_InputIterator __first, _InputIterator __last)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#acb1935806673ced5dae48aa64d8cabc3">insert</a>(initializer_list&lt; value_type &gt; __l)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a0fffce26090303390cc7fce06b5f6615">iterator</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a32226343bc7c4b8b0b14914fd3d105cb">key_eq</a>() const</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#afabc6af09a31459a08760bcec32a0b6d">key_equal</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ae371392b325c1cdecb9bfdb891ee9fb0">key_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a02888ba9dce21c5e16ba09734ebdb642">load_factor</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a8cb5d0ca110f847b3fceed2d07472710">local_iterator</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a3e1544ab885cd443cf557eb35db830e8">mapped_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a193e48c36ac0f5888911cf991428a287">max_bucket_count</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a72250fbcb87cc6ea4998eb8f00465650">max_load_factor</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#afea08a0d2315df4b6da1318c74be7114">max_load_factor</a>(float __z)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#accd0a24f61c8161dbd0fe216ead19142">max_size</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a04b3ff006b08f143403c12e743ced9b6">operator=</a>(const unordered_multimap &amp;)=default</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ac9f4a7b990b045b2709562eb6b7f9328">operator=</a>(unordered_multimap &amp;&amp;)=default</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a1dd84e27aa97a782f79e757eadcd5461">operator=</a>(initializer_list&lt; value_type &gt; __l)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>operator==</b> (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">friend</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#aa9c05aec6bb3f18770d191869543334a">pointer</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a08487e5381fd61795c61cfa0fed8e48f">reference</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ac9032d22474fc3c5ec4d0b74362b5f4e">rehash</a>(size_type __n)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a9167538c4058279e45627d0a68f3d030">reserve</a>(size_type __n)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#af02efb64c18107a5c4f13a1983cfa5a3">size</a>() const noexcept</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ab9e187c541bf3fe290dd21b514abd024">size_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ac8d3f27e1315796ddcc9b55378f90ce7">swap</a>(unordered_multimap &amp;__x) noexcept(noexcept(_M_h.swap(__x._M_h)))</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a722b99e1c15c3f0538bb6e2a2df15c32">unordered_multimap</a>()=default</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a4afc31e2217e4e10c6c821d38d9fa668">unordered_multimap</a>(size_type __n, const hasher &amp;__hf=hasher(), const key_equal &amp;__eql=key_equal(), const allocator_type &amp;__a=allocator_type())</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#a94fbf8cd5ee67d47203f4a01bb2d6568">unordered_multimap</a>(_InputIterator __first, _InputIterator __last, size_type __n=0, const hasher &amp;__hf=hasher(), const key_equal &amp;__eql=key_equal(), const allocator_type &amp;__a=allocator_type())</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#af3d147e18b9233f333c7cd4921fc4aa7">unordered_multimap</a>(const unordered_multimap &amp;)=default</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#ab70b33e6e61485413fcb3bd22ac6d4ee">unordered_multimap</a>(unordered_multimap &amp;&amp;)=default</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#ab7ecc0576cd505fe517ffbbae066d3d6">unordered_multimap</a>(const allocator_type &amp;__a)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span><span class="mlabel">explicit</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>unordered_multimap</b>(const unordered_multimap &amp;__ummap, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unordered_multimap</b>(unordered_multimap &amp;&amp;__ummap, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr><td class="entry"><a class="el" href="a07995.html#aa11b69676f9f379ea2274cd722fae38d">unordered_multimap</a>(initializer_list&lt; value_type &gt; __l, size_type __n=0, const hasher &amp;__hf=hasher(), const key_equal &amp;__eql=key_equal(), const allocator_type &amp;__a=allocator_type())</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unordered_multimap</b>(size_type __n, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>unordered_multimap</b>(size_type __n, const hasher &amp;__hf, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unordered_multimap</b>(_InputIterator __first, _InputIterator __last, size_type __n, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>unordered_multimap</b>(_InputIterator __first, _InputIterator __last, size_type __n, const hasher &amp;__hf, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0" class="even"><td class="entry"><b>unordered_multimap</b>(initializer_list&lt; value_type &gt; __l, size_type __n, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr bgcolor="#f0f0f0"><td class="entry"><b>unordered_multimap</b>(initializer_list&lt; value_type &gt; __l, size_type __n, const hasher &amp;__hf, const allocator_type &amp;__a) (defined in <a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a>)</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"><span class="mlabel">inline</span></td></tr>
  <tr class="even"><td class="entry"><a class="el" href="a07995.html#a4baa45433c393ecfab2c784b8de381e8">value_type</a> typedef</td><td class="entry"><a class="el" href="a07995.html">std::unordered_multimap&lt; _Key, _Tp, _Hash, _Pred, _Alloc &gt;</a></td><td class="entry"></td></tr>
</table></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="footer">Generated by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
  </ul>
</div>
</body>
</html>