doc/html/boost/unordered_set.html

   1 <html>
   2 <head>
   3 <meta http-equiv="Content-Type" content="text/html; charset=US-ASCII">
   4 <title>Class template unordered_set</title>
   5 <link rel="stylesheet" href="../../../doc/src/boostbook.css" type="text/css">
   6 <meta name="generator" content="DocBook XSL Stylesheets V1.78.1">
   7 <link rel="home" href="../index.html" title="The Boost C++ Libraries BoostBook Documentation Subset">
   8 <link rel="up" href="../unordered/reference.html#header.boost.unordered_set_hpp" title="Header &lt;boost/unordered_set.hpp&gt;">
   9 <link rel="prev" href="../unordered/reference.html" title="Reference">
  10 <link rel="next" href="unordered_multiset.html" title="Class template unordered_multiset">
  11 </head>
  12 <body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF">
  13 <table cellpadding="2" width="100%"><tr>
  14 <td valign="top"><img alt="Boost C++ Libraries" width="277" height="86" src="../../../boost.png"></td>
  15 <td align="center"><a href="../../../index.html">Home</a></td>
  16 <td align="center"><a href="../../../libs/libraries.htm">Libraries</a></td>
  17 <td align="center"><a href="http://www.boost.org/users/people.html">People</a></td>
  18 <td align="center"><a href="http://www.boost.org/users/faq.html">FAQ</a></td>
  19 <td align="center"><a href="../../../more/index.htm">More</a></td>
  20 </tr></table>
  21 <hr>
  22 <div class="spirit-nav">
  23 <a accesskey="p" href="../unordered/reference.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../unordered/reference.html#header.boost.unordered_set_hpp"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_multiset.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>
  24 </div>
  25 <div class="refentry">
  26 <a name="boost.unordered_set"></a><div class="titlepage"></div>
  27 <div class="refnamediv">
  28 <h2><span class="refentrytitle">Class template unordered_set</span></h2>
  29 <p>boost::unordered_set &#8212;
  30             An unordered associative container that stores unique values.
  31           </p>
  32 </div>
  33 <h2 xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv-title">Synopsis</h2>
  34 <div xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" class="refsynopsisdiv"><pre class="synopsis"><span class="comment">// In header: &lt;<a class="link" href="../unordered/reference.html#header.boost.unordered_set_hpp" title="Header &lt;boost/unordered_set.hpp&gt;">boost/unordered_set.hpp</a>&gt;
  35
  36 </span><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash <span class="special">=</span> <span class="identifier">boost</span><span class="special">::</span><span class="identifier">hash</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">&gt;</span><span class="special">,</span>
  37          <span class="keyword">typename</span> Pred <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">equal_to</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">&gt;</span><span class="special">,</span>
  38          <span class="keyword">typename</span> Alloc <span class="special">=</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">allocator</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">&gt;</span> <span class="special">&gt;</span>
  39 <span class="keyword">class</span> <a class="link" href="unordered_set.html" title="Class template unordered_set">unordered_set</a> <span class="special">{</span>
  40 <span class="keyword">public</span><span class="special">:</span>
  41   <span class="comment">// <a class="link" href="unordered_set.html#boost.unordered_settypes">types</a></span>
  42   <span class="keyword">typedef</span> <span class="identifier">Value</span>                                  <a name="boost.unordered_set.key_type"></a><span class="identifier">key_type</span><span class="special">;</span>
  43   <span class="keyword">typedef</span> <span class="identifier">Value</span>                                  <a name="boost.unordered_set.value_type"></a><span class="identifier">value_type</span><span class="special">;</span>
  44   <span class="keyword">typedef</span> <span class="identifier">Hash</span>                                   <a name="boost.unordered_set.hasher"></a><span class="identifier">hasher</span><span class="special">;</span>
  45   <span class="keyword">typedef</span> <span class="identifier">Pred</span>                                   <a name="boost.unordered_set.key_equal"></a><span class="identifier">key_equal</span><span class="special">;</span>
  46   <span class="keyword">typedef</span> <span class="identifier">Alloc</span>                                  <a name="boost.unordered_set.allocator_type"></a><span class="identifier">allocator_type</span><span class="special">;</span>
  47   <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">allocator_type</span><span class="special">::</span><span class="identifier">pointer</span>       <a class="link" href="unordered_set.html#boost.unordered_set.pointer"><span class="identifier">pointer</span></a><span class="special">;</span>
  48   <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">allocator_type</span><span class="special">::</span><span class="identifier">const_pointer</span> <a class="link" href="unordered_set.html#boost.unordered_set.const_pointer"><span class="identifier">const_pointer</span></a><span class="special">;</span>
  49   <span class="keyword">typedef</span> <span class="identifier">value_type</span><span class="special">&amp;</span>                            <a name="boost.unordered_set.reference"></a><span class="identifier">reference</span><span class="special">;</span>             <span class="comment">// lvalue of value_type.</span>
  50   <span class="keyword">typedef</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span>                      <a name="boost.unordered_set.const_reference"></a><span class="identifier">const_reference</span><span class="special">;</span>       <span class="comment">// const lvalue of value_type.</span>
  51   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.size_type"><span class="identifier">size_type</span></a><span class="special">;</span>
  52   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.difference_type"><span class="identifier">difference_type</span></a><span class="special">;</span>
  53   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.iterator"><span class="identifier">iterator</span></a><span class="special">;</span>
  54   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.const_iterator"><span class="identifier">const_iterator</span></a><span class="special">;</span>
  55   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.local_iterator"><span class="identifier">local_iterator</span></a><span class="special">;</span>
  56   <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span>                 <a class="link" href="unordered_set.html#boost.unordered_set.const_local_iterator"><span class="identifier">const_local_iterator</span></a><span class="special">;</span>
  57
  58   <span class="comment">// <a class="link" href="unordered_set.html#boost.unordered_setconstruct-copy-destruct">construct/copy/destruct</a></span>
  59   <span class="keyword">explicit</span> <a class="link" href="unordered_set.html#idp302733248-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">size_type</span> <span class="special">=</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span><span class="special">,</span>
  60                          <span class="identifier">hasher</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">hasher</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
  61                          <span class="identifier">key_equal</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">key_equal</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
  62                          <span class="identifier">allocator_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
  63   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
  64     <a class="link" href="unordered_set.html#idp216313968-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">,</span>
  65                   <span class="identifier">size_type</span> <span class="special">=</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span><span class="special">,</span>
  66                   <span class="identifier">hasher</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">hasher</span><span class="special">(</span><span class="special">)</span><span class="special">,</span> <span class="identifier">key_equal</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">key_equal</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
  67                   <span class="identifier">allocator_type</span> <span class="keyword">const</span><span class="special">&amp;</span> <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span>
  68   <a class="link" href="unordered_set.html#idp216328208-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  69   <a class="link" href="unordered_set.html#idp216332688-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">unordered_set</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  70   <span class="keyword">explicit</span> <a class="link" href="unordered_set.html#idp216338784-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">Allocator</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  71   <a class="link" href="unordered_set.html#idp104483536-bb"><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span> <span class="identifier">Allocator</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  72   <a class="link" href="unordered_set.html#idp104488096-bb"><span class="special">~</span><span class="identifier">unordered_set</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
  73   <span class="identifier">unordered_set</span><span class="special">&amp;</span> <a class="link" href="unordered_set.html#idp104489408-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  74   <span class="identifier">unordered_set</span><span class="special">&amp;</span> <a class="link" href="unordered_set.html#idp104495088-bb"><span class="keyword">operator</span><span class="special">=</span></a><span class="special">(</span><span class="identifier">unordered_set</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  75   <span class="identifier">allocator_type</span> <a class="link" href="unordered_set.html#idp104501936-bb"><span class="identifier">get_allocator</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  76
  77   <span class="comment">// <a class="link" href="unordered_set.html#idp104503376-bb">size and capacity</a></span>
  78   <span class="keyword">bool</span> <a class="link" href="unordered_set.html#idp104503936-bb"><span class="identifier">empty</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  79   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp104506560-bb"><span class="identifier">size</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  80   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp104509792-bb"><span class="identifier">max_size</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  81
  82   <span class="comment">// <a class="link" href="unordered_set.html#idp104512384-bb">iterators</a></span>
  83   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp104513504-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
  84   <span class="identifier">const_iterator</span> <a class="link" href="unordered_set.html#idp104514080-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  85   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp313561568-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
  86   <span class="identifier">const_iterator</span> <a class="link" href="unordered_set.html#idp313562464-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  87   <span class="identifier">const_iterator</span> <a class="link" href="unordered_set.html#idp313564208-bb"><span class="identifier">cbegin</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  88   <span class="identifier">const_iterator</span> <a class="link" href="unordered_set.html#idp313566240-bb"><span class="identifier">cend</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
  89
  90   <span class="comment">// <a class="link" href="unordered_set.html#idp313568368-bb">modifiers</a></span>
  91   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a class="link" href="unordered_set.html#idp313568928-bb"><span class="identifier">emplace</span></a><span class="special">(</span><span class="identifier">Args</span><span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
  92   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp313583536-bb"><span class="identifier">emplace_hint</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">Args</span><span class="special">&amp;&amp;</span><span class="special">...</span><span class="special">)</span><span class="special">;</span>
  93   <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a class="link" href="unordered_set.html#idp214105296-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  94   <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a class="link" href="unordered_set.html#idp214114896-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">value_type</span><span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  95   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp214124496-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
  96   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp312746320-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">value_type</span><span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span>
  97   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span> <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp312757584-bb"><span class="identifier">insert</span></a><span class="special">(</span><span class="identifier">InputIterator</span><span class="special">,</span> <span class="identifier">InputIterator</span><span class="special">)</span><span class="special">;</span>
  98   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp312768688-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
  99   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312209600-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 100   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp312215920-bb"><span class="identifier">erase</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
 101   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp312224896-bb"><span class="identifier">quick_erase</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
 102   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp312232560-bb"><span class="identifier">erase_return_void</span></a><span class="special">(</span><span class="identifier">const_iterator</span><span class="special">)</span><span class="special">;</span>
 103   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp312240224-bb"><span class="identifier">clear</span></a><span class="special">(</span><span class="special">)</span><span class="special">;</span>
 104   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp304200752-bb"><span class="identifier">swap</span></a><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 105
 106   <span class="comment">// <a class="link" href="unordered_set.html#idp304208256-bb">observers</a></span>
 107   <span class="identifier">hasher</span> <a class="link" href="unordered_set.html#idp304208816-bb"><span class="identifier">hash_function</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 108   <span class="identifier">key_equal</span> <a class="link" href="unordered_set.html#idp304210672-bb"><span class="identifier">key_eq</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 109
 110   <span class="comment">// <a class="link" href="unordered_set.html#idp304212688-bb">lookup</a></span>
 111   <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp304213808-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 112   <span class="identifier">const_iterator</span> <a class="link" href="unordered_set.html#idp304215872-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 113   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> CompatibleKey<span class="special">,</span> <span class="keyword">typename</span> CompatibleHash<span class="special">,</span>
 114            <span class="keyword">typename</span> CompatiblePredicate<span class="special">&gt;</span>
 115     <span class="identifier">iterator</span> <a class="link" href="unordered_set.html#idp304218208-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">CompatibleKey</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span> <span class="identifier">CompatibleHash</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span>
 116                   <span class="identifier">CompatiblePredicate</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 117   <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> CompatibleKey<span class="special">,</span> <span class="keyword">typename</span> CompatibleHash<span class="special">,</span>
 118            <span class="keyword">typename</span> CompatiblePredicate<span class="special">&gt;</span>
 119     <span class="identifier">const_iterator</span>
 120     <a class="link" href="unordered_set.html#idp304224752-bb"><span class="identifier">find</span></a><span class="special">(</span><span class="identifier">CompatibleKey</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span> <span class="identifier">CompatibleHash</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span>
 121          <span class="identifier">CompatiblePredicate</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 122   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312883504-bb"><span class="identifier">count</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 123   <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">&gt;</span> <a class="link" href="unordered_set.html#idp312887984-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 124   <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">&gt;</span> <a class="link" href="unordered_set.html#idp312890064-bb"><span class="identifier">equal_range</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 125
 126   <span class="comment">// <a class="link" href="unordered_set.html#idp312895712-bb">bucket interface</a></span>
 127   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312896272-bb"><span class="identifier">bucket_count</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 128   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312898608-bb"><span class="identifier">max_bucket_count</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 129   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312900912-bb"><span class="identifier">bucket_size</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 130   <span class="identifier">size_type</span> <a class="link" href="unordered_set.html#idp312906352-bb"><span class="identifier">bucket</span></a><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 131   <span class="identifier">local_iterator</span> <a class="link" href="unordered_set.html#idp312912032-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
 132   <span class="identifier">const_local_iterator</span> <a class="link" href="unordered_set.html#idp312914096-bb"><span class="identifier">begin</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 133   <span class="identifier">local_iterator</span> <a class="link" href="unordered_set.html#idp304577184-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
 134   <span class="identifier">const_local_iterator</span> <a class="link" href="unordered_set.html#idp304579248-bb"><span class="identifier">end</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 135   <span class="identifier">const_local_iterator</span> <a class="link" href="unordered_set.html#idp304584688-bb"><span class="identifier">cbegin</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 136   <span class="identifier">const_local_iterator</span> <a class="link" href="unordered_set.html#idp304590240-bb"><span class="identifier">cend</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
 137
 138   <span class="comment">// <a class="link" href="unordered_set.html#idp304595792-bb">hash policy</a></span>
 139   <span class="keyword">float</span> <a class="link" href="unordered_set.html#idp304596352-bb"><span class="identifier">load_factor</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 140   <span class="keyword">float</span> <a class="link" href="unordered_set.html#idp304598656-bb"><span class="identifier">max_load_factor</span></a><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
 141   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp304600960-bb"><span class="identifier">max_load_factor</span></a><span class="special">(</span><span class="keyword">float</span><span class="special">)</span><span class="special">;</span>
 142   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp304604608-bb"><span class="identifier">rehash</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
 143   <span class="keyword">void</span> <a class="link" href="unordered_set.html#idp304609776-bb"><span class="identifier">reserve</span></a><span class="special">(</span><span class="identifier">size_type</span><span class="special">)</span><span class="special">;</span>
 144 <span class="special">}</span><span class="special">;</span>
 145
 146 <span class="comment">// <a class="link" href="unordered_set.html#idp304614272-bb">Equality Comparisons</a></span>
 147 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
 148   <span class="keyword">bool</span> <a class="link" href="unordered_set.html#boost.unordered_set.operator==_idp304614832"><span class="keyword">operator</span><span class="special">==</span></a><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span>
 149                   <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 150 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
 151   <span class="keyword">bool</span> <a class="link" href="unordered_set.html#boost.unordered_set.operator!=_idp304626304"><span class="keyword">operator</span><span class="special">!=</span></a><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">,</span>
 152                   <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span>
 153
 154 <span class="comment">// <a class="link" href="unordered_set.html#idp312243552-bb">swap</a></span>
 155 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
 156   <span class="keyword">void</span> <a class="link" href="unordered_set.html#boost.unordered_set.swap_idp312244112"><span class="identifier">swap</span></a><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span><span class="special">&amp;</span><span class="special">,</span>
 157             <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span></pre></div>
 158 <div class="refsect1">
 159 <a name="idp517421760"></a><h2>Description</h2>
 160 <p><span class="bold"><strong>Template Parameters</strong></span>
 161               </p>
 162 <div class="informaltable"><table class="table">
 163 <colgroup>
 164 <col>
 165 <col>
 166 </colgroup>
 167 <tbody>
 168 <tr>
 169 <td><span class="emphasis"><em>Value</em></span></td>
 170 <td>
 171 <code class="computeroutput">Value</code> must be <code class="computeroutput">Erasable</code> from the container
 172                         (i.e. <code class="computeroutput">allocator_traits</code> can <code class="computeroutput">destroy</code> it).
 173                       </td>
 174 </tr>
 175 <tr>
 176 <td><span class="emphasis"><em>Hash</em></span></td>
 177 <td>A unary function object type that acts a hash function for a <code class="computeroutput">Value</code>. It takes a single argument of type <code class="computeroutput">Value</code> and returns a value of type std::size_t.</td>
 178 </tr>
 179 <tr>
 180 <td><span class="emphasis"><em>Pred</em></span></td>
 181 <td>A binary function object that implements an equivalence relation on values of type <code class="computeroutput">Value</code>.
 182                         A binary function object that induces an equivalence relation on values of type <code class="computeroutput">Value</code>.
 183                         It takes two arguments of type <code class="computeroutput">Value</code> and returns a value of type bool.</td>
 184 </tr>
 185 <tr>
 186 <td><span class="emphasis"><em>Alloc</em></span></td>
 187 <td>An allocator whose value type is the same as the container's value type.</td>
 188 </tr>
 189 </tbody>
 190 </table></div>
 191 <p>The elements are organized into buckets. Keys with the same hash code are stored in the same bucket.</p>
 192 <p>The number of buckets can be automatically increased by a call to insert, or as the result of calling rehash.</p>
 193 <div class="refsect2">
 194 <a name="idp517436640"></a><h3>
 195 <a name="boost.unordered_settypes"></a><code class="computeroutput">unordered_set</code>
 196         public
 197        types</h3>
 198 <div class="orderedlist"><ol class="orderedlist" type="1">
 199 <li class="listitem">
 200 <p>
 201 <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">allocator_type</span><span class="special">::</span><span class="identifier">pointer</span> <a name="boost.unordered_set.pointer"></a><span class="identifier">pointer</span><span class="special">;</span></p>
 202 <p>
 203                 <code class="computeroutput">value_type*</code> if
 204                 <code class="computeroutput">allocator_type::pointer</code> is not defined.
 205               </p>
 206 </li>
 207 <li class="listitem">
 208 <p>
 209 <span class="keyword">typedef</span> <span class="keyword">typename</span> <span class="identifier">allocator_type</span><span class="special">::</span><span class="identifier">const_pointer</span> <a name="boost.unordered_set.const_pointer"></a><span class="identifier">const_pointer</span><span class="special">;</span></p>
 210 <p>
 211                 <code class="computeroutput">boost::pointer_to_other&lt;pointer, value_type&gt;::type</code>
 212                 if <code class="computeroutput">allocator_type::const_pointer</code> is not defined.
 213               </p>
 214 </li>
 215 <li class="listitem">
 216 <p>
 217 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.size_type"></a><span class="identifier">size_type</span><span class="special">;</span></p>
 218 <p>An unsigned integral type.</p>
 219 <p>size_type can represent any non-negative value of difference_type.</p>
 220 </li>
 221 <li class="listitem">
 222 <p>
 223 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.difference_type"></a><span class="identifier">difference_type</span><span class="special">;</span></p>
 224 <p>A signed integral type.</p>
 225 <p>Is identical to the difference type of iterator and const_iterator.</p>
 226 </li>
 227 <li class="listitem">
 228 <p>
 229 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.iterator"></a><span class="identifier">iterator</span><span class="special">;</span></p>
 230 <p>A constant iterator whose value type is value_type. </p>
 231 <p>The iterator category is at least a forward iterator.</p>
 232 <p>Convertible to const_iterator.</p>
 233 </li>
 234 <li class="listitem">
 235 <p>
 236 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.const_iterator"></a><span class="identifier">const_iterator</span><span class="special">;</span></p>
 237 <p>A constant iterator whose value type is value_type. </p>
 238 <p>The iterator category is at least a forward iterator.</p>
 239 </li>
 240 <li class="listitem">
 241 <p>
 242 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.local_iterator"></a><span class="identifier">local_iterator</span><span class="special">;</span></p>
 243 <p>An iterator with the same value type, difference type and pointer and reference type as iterator.</p>
 244 <p>A local_iterator object can be used to iterate through a single bucket.</p>
 245 </li>
 246 <li class="listitem">
 247 <p>
 248 <span class="keyword">typedef</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span> <a name="boost.unordered_set.const_local_iterator"></a><span class="identifier">const_local_iterator</span><span class="special">;</span></p>
 249 <p>A constant iterator with the same value type, difference type and pointer and reference type as const_iterator.</p>
 250 <p>A const_local_iterator object can be used to iterate through a single bucket.</p>
 251 </li>
 252 </ol></div>
 253 </div>
 254 <div class="refsect2">
 255 <a name="idp517488048"></a><h3>
 256 <a name="boost.unordered_setconstruct-copy-destruct"></a><code class="computeroutput">unordered_set</code>
 257         public
 258        construct/copy/destruct</h3>
 259 <div class="orderedlist"><ol class="orderedlist" type="1">
 260 <li class="listitem">
 261 <pre class="literallayout"><span class="keyword">explicit</span> <a name="idp302733248-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">size_type</span> n <span class="special">=</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span><span class="special">,</span>
 262                        <span class="identifier">hasher</span> <span class="keyword">const</span><span class="special">&amp;</span> hf <span class="special">=</span> <span class="identifier">hasher</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
 263                        <span class="identifier">key_equal</span> <span class="keyword">const</span><span class="special">&amp;</span> eq <span class="special">=</span> <span class="identifier">key_equal</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
 264                        <span class="identifier">allocator_type</span> <span class="keyword">const</span><span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 265 <p>Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocator and a maximum load factor of 1.0.</p>
 266 <div class="variablelist"><table border="0" class="variablelist compact">
 267 <colgroup>
 268 <col align="left" valign="top">
 269 <col>
 270 </colgroup>
 271 <tbody>
 272 <tr>
 273 <td><p><span class="term">Postconditions:</span></p></td>
 274 <td><code class="computeroutput"><a class="link" href="unordered_set.html#idp104506560-bb">size</a>() == 0</code></td>
 275 </tr>
 276 <tr>
 277 <td><p><span class="term">Requires:</span></p></td>
 278 <td><p>If the defaults are used, <code class="computeroutput">hasher</code>, <code class="computeroutput">key_equal</code> and
 279                 <code class="computeroutput">allocator_type</code> need to be <code class="computeroutput">DefaultConstructible</code>.
 280               </p></td>
 281 </tr>
 282 </tbody>
 283 </table></div>
 284 </li>
 285 <li class="listitem">
 286 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
 287   <a name="idp216313968-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">InputIterator</span> f<span class="special">,</span> <span class="identifier">InputIterator</span> l<span class="special">,</span>
 288                 <span class="identifier">size_type</span> n <span class="special">=</span> <span class="emphasis"><em><span class="identifier">implementation</span><span class="special">-</span><span class="identifier">defined</span></em></span><span class="special">,</span>
 289                 <span class="identifier">hasher</span> <span class="keyword">const</span><span class="special">&amp;</span> hf <span class="special">=</span> <span class="identifier">hasher</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
 290                 <span class="identifier">key_equal</span> <span class="keyword">const</span><span class="special">&amp;</span> eq <span class="special">=</span> <span class="identifier">key_equal</span><span class="special">(</span><span class="special">)</span><span class="special">,</span>
 291                 <span class="identifier">allocator_type</span> <span class="keyword">const</span><span class="special">&amp;</span> a <span class="special">=</span> <span class="identifier">allocator_type</span><span class="special">(</span><span class="special">)</span><span class="special">)</span><span class="special">;</span></pre>
 292 <p>Constructs an empty container with at least n buckets, using hf as the hash function, eq as the key equality predicate, a as the allocator and a maximum load factor of 1.0 and inserts the elements from [f, l) into it.</p>
 293 <div class="variablelist"><table border="0" class="variablelist compact">
 294 <colgroup>
 295 <col align="left" valign="top">
 296 <col>
 297 </colgroup>
 298 <tbody><tr>
 299 <td><p><span class="term">Requires:</span></p></td>
 300 <td><p>If the defaults are used, <code class="computeroutput">hasher</code>, <code class="computeroutput">key_equal</code> and
 301                 <code class="computeroutput">allocator_type</code> need to be <code class="computeroutput">DefaultConstructible</code>.
 302               </p></td>
 303 </tr></tbody>
 304 </table></div>
 305 </li>
 306 <li class="listitem">
 307 <pre class="literallayout"><a name="idp216328208-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span></pre>
 308 <p>The copy constructor. Copies the contained elements, hash function, predicate, maximum load factor and allocator.</p>
 309 <p>If <code class="computeroutput">Allocator::select_on_container_copy_construction</code>
 310               exists and has the right signature, the allocator will be
 311               constructed from its result.</p>
 312 <div class="variablelist"><table border="0" class="variablelist compact">
 313 <colgroup>
 314 <col align="left" valign="top">
 315 <col>
 316 </colgroup>
 317 <tbody><tr>
 318 <td><p><span class="term">Requires:</span></p></td>
 319 <td><p><code class="computeroutput">value_type</code> is copy constructible</p></td>
 320 </tr></tbody>
 321 </table></div>
 322 </li>
 323 <li class="listitem">
 324 <pre class="literallayout"><a name="idp216332688-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">unordered_set</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span></pre>
 325 <p>The move constructor.</p>
 326 <div class="variablelist"><table border="0" class="variablelist compact">
 327 <colgroup>
 328 <col align="left" valign="top">
 329 <col>
 330 </colgroup>
 331 <tbody>
 332 <tr>
 333 <td><p><span class="term">Notes:</span></p></td>
 334 <td><p>This is implemented using Boost.Move.</p></td>
 335 </tr>
 336 <tr>
 337 <td><p><span class="term">Requires:</span></p></td>
 338 <td>
 339 <p>
 340                 <code class="computeroutput">value_type</code> is move constructible.
 341               </p>
 342 <p>
 343                 On compilers without rvalue reference support the
 344                 emulation does not support moving without calling
 345                 <code class="computeroutput">boost::move</code> if <code class="computeroutput">value_type</code> is
 346                 not copyable. So, for example, you can't return the
 347                 container from a function.
 348               </p>
 349 </td>
 350 </tr>
 351 </tbody>
 352 </table></div>
 353 </li>
 354 <li class="listitem">
 355 <pre class="literallayout"><span class="keyword">explicit</span> <a name="idp216338784-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">Allocator</span> <span class="keyword">const</span><span class="special">&amp;</span> a<span class="special">)</span><span class="special">;</span></pre>
 356 <p>Constructs an empty container, using allocator <code class="computeroutput">a</code>.</p>
 357 </li>
 358 <li class="listitem">
 359 <pre class="literallayout"><a name="idp104483536-bb"></a><span class="identifier">unordered_set</span><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span> x<span class="special">,</span> <span class="identifier">Allocator</span> <span class="keyword">const</span><span class="special">&amp;</span> a<span class="special">)</span><span class="special">;</span></pre>
 360 <p>Constructs an container, copying <code class="computeroutput">x</code>'s contained elements, hash function, predicate, maximum load factor, but using allocator <code class="computeroutput">a</code>.</p>
 361 </li>
 362 <li class="listitem">
 363 <pre class="literallayout"><a name="idp104488096-bb"></a><span class="special">~</span><span class="identifier">unordered_set</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 364 <div class="variablelist"><table border="0" class="variablelist compact">
 365 <colgroup>
 366 <col align="left" valign="top">
 367 <col>
 368 </colgroup>
 369 <tbody><tr>
 370 <td><p><span class="term">Notes:</span></p></td>
 371 <td><p>The destructor is applied to every element, and all memory is deallocated</p></td>
 372 </tr></tbody>
 373 </table></div>
 374 </li>
 375 </ol></div>
 376 </div>
 377 <pre class="literallayout"><span class="identifier">unordered_set</span><span class="special">&amp;</span> <a name="idp104489408-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="identifier">unordered_set</span> <span class="keyword">const</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span></pre>
 378 <p>The assignment operator. Copies the contained elements, hash function, predicate and maximum load factor but not the allocator.</p>
 379 <p>If <code class="computeroutput">Alloc::propagate_on_container_copy_assignment</code>
 380               exists and <code class="computeroutput">Alloc::propagate_on_container_copy_assignment::value
 381               </code> is true, the allocator is overwritten, if not the
 382               copied elements are created using the existing
 383               allocator.</p>
 384 <div class="variablelist"><table border="0" class="variablelist compact">
 385 <colgroup>
 386 <col align="left" valign="top">
 387 <col>
 388 </colgroup>
 389 <tbody><tr>
 390 <td><p><span class="term">Requires:</span></p></td>
 391 <td><p><code class="computeroutput">value_type</code> is copy constructible</p></td>
 392 </tr></tbody>
 393 </table></div>
 394 <pre class="literallayout"><span class="identifier">unordered_set</span><span class="special">&amp;</span> <a name="idp104495088-bb"></a><span class="keyword">operator</span><span class="special">=</span><span class="special">(</span><span class="identifier">unordered_set</span> <span class="special">&amp;&amp;</span><span class="special">)</span><span class="special">;</span></pre>
 395 <p>The move assignment operator.</p>
 396 <p>If <code class="computeroutput">Alloc::propagate_on_container_move_assignment</code>
 397               exists and <code class="computeroutput">Alloc::propagate_on_container_move_assignment::value
 398               </code> is true, the allocator is overwritten, if not the
 399               moved elements are created using the existing
 400               allocator.</p>
 401 <div class="variablelist"><table border="0" class="variablelist compact">
 402 <colgroup>
 403 <col align="left" valign="top">
 404 <col>
 405 </colgroup>
 406 <tbody>
 407 <tr>
 408 <td><p><span class="term">Notes:</span></p></td>
 409 <td><p>
 410                 On compilers without rvalue references, this is emulated using
 411                 Boost.Move. Note that on some compilers the copy assignment
 412                 operator may be used in some circumstances.
 413               </p></td>
 414 </tr>
 415 <tr>
 416 <td><p><span class="term">Requires:</span></p></td>
 417 <td><p>
 418                 <code class="computeroutput">value_type</code> is move constructible.
 419               </p></td>
 420 </tr>
 421 </tbody>
 422 </table></div>
 423 <pre class="literallayout"><span class="identifier">allocator_type</span> <a name="idp104501936-bb"></a><span class="identifier">get_allocator</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 424 <div class="refsect2">
 425 <a name="idp517619792"></a><h3>
 426 <a name="idp104503376-bb"></a><code class="computeroutput">unordered_set</code> size and capacity</h3>
 427 <div class="orderedlist"><ol class="orderedlist" type="1">
 428 <li class="listitem">
 429 <pre class="literallayout"><span class="keyword">bool</span> <a name="idp104503936-bb"></a><span class="identifier">empty</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 430 <div class="variablelist"><table border="0" class="variablelist compact">
 431 <colgroup>
 432 <col align="left" valign="top">
 433 <col>
 434 </colgroup>
 435 <tbody><tr>
 436 <td><p><span class="term">Returns:</span></p></td>
 437 <td><code class="computeroutput"><a class="link" href="unordered_set.html#idp104506560-bb">size</a>() == 0</code></td>
 438 </tr></tbody>
 439 </table></div>
 440 </li>
 441 <li class="listitem">
 442 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp104506560-bb"></a><span class="identifier">size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 443 <div class="variablelist"><table border="0" class="variablelist compact">
 444 <colgroup>
 445 <col align="left" valign="top">
 446 <col>
 447 </colgroup>
 448 <tbody><tr>
 449 <td><p><span class="term">Returns:</span></p></td>
 450 <td><code class="computeroutput">std::distance(<a class="link" href="unordered_set.html#idp104512944-bb">begin</a>(), <a class="link" href="unordered_set.html#idp313561008-bb">end</a>())</code></td>
 451 </tr></tbody>
 452 </table></div>
 453 </li>
 454 <li class="listitem">
 455 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp104509792-bb"></a><span class="identifier">max_size</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 456 <div class="variablelist"><table border="0" class="variablelist compact">
 457 <colgroup>
 458 <col align="left" valign="top">
 459 <col>
 460 </colgroup>
 461 <tbody><tr>
 462 <td><p><span class="term">Returns:</span></p></td>
 463 <td>
 464 <code class="computeroutput"><a class="link" href="unordered_set.html#idp104506560-bb">size</a>()</code> of the largest possible container.
 465               </td>
 466 </tr></tbody>
 467 </table></div>
 468 </li>
 469 </ol></div>
 470 </div>
 471 <div class="refsect2">
 472 <a name="idp517645392"></a><h3>
 473 <a name="idp104512384-bb"></a><code class="computeroutput">unordered_set</code> iterators</h3>
 474 <div class="orderedlist"><ol class="orderedlist" type="1">
 475 <li class="listitem">
 476 <pre class="literallayout"><a name="idp104512944-bb"></a><span class="identifier">iterator</span> <a name="idp104513504-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
 477 <span class="identifier">const_iterator</span> <a name="idp104514080-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 478 <div class="variablelist"><table border="0" class="variablelist compact">
 479 <colgroup>
 480 <col align="left" valign="top">
 481 <col>
 482 </colgroup>
 483 <tbody><tr>
 484 <td><p><span class="term">Returns:</span></p></td>
 485 <td>An iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container.
 486               </td>
 487 </tr></tbody>
 488 </table></div>
 489 </li>
 490 <li class="listitem">
 491 <pre class="literallayout"><a name="idp313561008-bb"></a><span class="identifier">iterator</span> <a name="idp313561568-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span><span class="special">;</span>
 492 <span class="identifier">const_iterator</span> <a name="idp313562464-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 493 <div class="variablelist"><table border="0" class="variablelist compact">
 494 <colgroup>
 495 <col align="left" valign="top">
 496 <col>
 497 </colgroup>
 498 <tbody><tr>
 499 <td><p><span class="term">Returns:</span></p></td>
 500 <td>An iterator which refers to the past-the-end value for the container.
 501               </td>
 502 </tr></tbody>
 503 </table></div>
 504 </li>
 505 <li class="listitem">
 506 <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp313564208-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 507 <div class="variablelist"><table border="0" class="variablelist compact">
 508 <colgroup>
 509 <col align="left" valign="top">
 510 <col>
 511 </colgroup>
 512 <tbody><tr>
 513 <td><p><span class="term">Returns:</span></p></td>
 514 <td>A constant iterator referring to the first element of the container, or if the container is empty the past-the-end value for the container.
 515               </td>
 516 </tr></tbody>
 517 </table></div>
 518 </li>
 519 <li class="listitem">
 520 <pre class="literallayout"><span class="identifier">const_iterator</span> <a name="idp313566240-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 521 <div class="variablelist"><table border="0" class="variablelist compact">
 522 <colgroup>
 523 <col align="left" valign="top">
 524 <col>
 525 </colgroup>
 526 <tbody><tr>
 527 <td><p><span class="term">Returns:</span></p></td>
 528 <td>A constant iterator which refers to the past-the-end value for the container.
 529               </td>
 530 </tr></tbody>
 531 </table></div>
 532 </li>
 533 </ol></div>
 534 </div>
 535 <div class="refsect2">
 536 <a name="idp517681136"></a><h3>
 537 <a name="idp313568368-bb"></a><code class="computeroutput">unordered_set</code> modifiers</h3>
 538 <div class="orderedlist"><ol class="orderedlist" type="1">
 539 <li class="listitem">
 540 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span><span class="special">...</span> Args<span class="special">&gt;</span> <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a name="idp313568928-bb"></a><span class="identifier">emplace</span><span class="special">(</span><span class="identifier">Args</span><span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 541 <p>Inserts an object, constructed with the arguments <code class="computeroutput">args</code>, in the container if and only if there is no element in the container with an equivalent value.</p>
 542 <div class="variablelist"><table border="0" class="variablelist compact">
 543 <colgroup>
 544 <col align="left" valign="top">
 545 <col>
 546 </colgroup>
 547 <tbody>
 548 <tr>
 549 <td><p><span class="term">Requires:</span></p></td>
 550 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">EmplaceConstructible</code> into
 551                   <code class="computeroutput">X</code> from <code class="computeroutput">args</code>.
 552                 </p></td>
 553 </tr>
 554 <tr>
 555 <td><p><span class="term">Returns:</span></p></td>
 556 <td>
 557 <p>The bool component of the return type is true if an insert took place.</p>
 558 <p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p>
 559 </td>
 560 </tr>
 561 <tr>
 562 <td><p><span class="term">Throws:</span></p></td>
 563 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 564 </tr>
 565 <tr>
 566 <td><p><span class="term">Notes:</span></p></td>
 567 <td>
 568 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 569 <p>Pointers and references to elements are never invalidated.</p>
 570 <p>If the compiler doesn't support variadic template arguments or rvalue
 571                       references, this is emulated for up to 10 arguments, with no support
 572                       for rvalue references or move semantics.</p>
 573 <p>Since existing <code class="computeroutput">std::pair</code> implementations don't support
 574                       <code class="computeroutput">std::piecewise_construct</code> this emulates it,
 575                       but using <code class="computeroutput">boost::unordered::piecewise_construct</code>.</p>
 576 </td>
 577 </tr>
 578 </tbody>
 579 </table></div>
 580 </li>
 581 <li class="listitem">
 582 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span><span class="special">...</span> Args<span class="special">&gt;</span>
 583   <span class="identifier">iterator</span> <a name="idp313583536-bb"></a><span class="identifier">emplace_hint</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">Args</span><span class="special">&amp;&amp;</span><span class="special">...</span> args<span class="special">)</span><span class="special">;</span></pre>
 584 <p>Inserts an object, constructed with the arguments <code class="computeroutput">args</code>, in the container if and only if there is no element in the container with an equivalent value.</p>
 585 <p><code class="computeroutput">hint</code> is a suggestion to where the element should be inserted.</p>
 586 <div class="variablelist"><table border="0" class="variablelist compact">
 587 <colgroup>
 588 <col align="left" valign="top">
 589 <col>
 590 </colgroup>
 591 <tbody>
 592 <tr>
 593 <td><p><span class="term">Requires:</span></p></td>
 594 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">EmplaceConstructible</code> into
 595                   <code class="computeroutput">X</code> from <code class="computeroutput">args</code>.
 596                 </p></td>
 597 </tr>
 598 <tr>
 599 <td><p><span class="term">Returns:</span></p></td>
 600 <td><p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p></td>
 601 </tr>
 602 <tr>
 603 <td><p><span class="term">Throws:</span></p></td>
 604 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 605 </tr>
 606 <tr>
 607 <td><p><span class="term">Notes:</span></p></td>
 608 <td>
 609 <p>The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value. </p>
 610 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 611 <p>Pointers and references to elements are never invalidated.</p>
 612 <p>If the compiler doesn't support variadic template arguments or rvalue
 613                       references, this is emulated for up to 10 arguments, with no support
 614                       for rvalue references or move semantics.</p>
 615 <p>Since existing <code class="computeroutput">std::pair</code> implementations don't support
 616                       <code class="computeroutput">std::piecewise_construct</code> this emulates it,
 617                       but using <code class="computeroutput">boost::unordered::piecewise_construct</code>.</p>
 618 </td>
 619 </tr>
 620 </tbody>
 621 </table></div>
 622 </li>
 623 <li class="listitem">
 624 <pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a name="idp214105296-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span> obj<span class="special">)</span><span class="special">;</span></pre>
 625 <p>Inserts <code class="computeroutput">obj</code> in the container if and only if there is no element in the container with an equivalent value.</p>
 626 <div class="variablelist"><table border="0" class="variablelist compact">
 627 <colgroup>
 628 <col align="left" valign="top">
 629 <col>
 630 </colgroup>
 631 <tbody>
 632 <tr>
 633 <td><p><span class="term">Requires:</span></p></td>
 634 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">CopyInsertable</code>.</p></td>
 635 </tr>
 636 <tr>
 637 <td><p><span class="term">Returns:</span></p></td>
 638 <td>
 639 <p>The bool component of the return type is true if an insert took place.</p>
 640 <p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p>
 641 </td>
 642 </tr>
 643 <tr>
 644 <td><p><span class="term">Throws:</span></p></td>
 645 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 646 </tr>
 647 <tr>
 648 <td><p><span class="term">Notes:</span></p></td>
 649 <td>
 650 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 651 <p>Pointers and references to elements are never invalidated.</p>
 652 </td>
 653 </tr>
 654 </tbody>
 655 </table></div>
 656 </li>
 657 <li class="listitem">
 658 <pre class="literallayout"><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="keyword">bool</span><span class="special">&gt;</span> <a name="idp214114896-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">value_type</span><span class="special">&amp;&amp;</span> obj<span class="special">)</span><span class="special">;</span></pre>
 659 <p>Inserts <code class="computeroutput">obj</code> in the container if and only if there is no element in the container with an equivalent value.</p>
 660 <div class="variablelist"><table border="0" class="variablelist compact">
 661 <colgroup>
 662 <col align="left" valign="top">
 663 <col>
 664 </colgroup>
 665 <tbody>
 666 <tr>
 667 <td><p><span class="term">Requires:</span></p></td>
 668 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">MoveInsertable</code>.</p></td>
 669 </tr>
 670 <tr>
 671 <td><p><span class="term">Returns:</span></p></td>
 672 <td>
 673 <p>The bool component of the return type is true if an insert took place.</p>
 674 <p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p>
 675 </td>
 676 </tr>
 677 <tr>
 678 <td><p><span class="term">Throws:</span></p></td>
 679 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 680 </tr>
 681 <tr>
 682 <td><p><span class="term">Notes:</span></p></td>
 683 <td>
 684 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 685 <p>Pointers and references to elements are never invalidated.</p>
 686 </td>
 687 </tr>
 688 </tbody>
 689 </table></div>
 690 </li>
 691 <li class="listitem">
 692 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp214124496-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">value_type</span> <span class="keyword">const</span><span class="special">&amp;</span> obj<span class="special">)</span><span class="special">;</span></pre>
 693 <p>Inserts <code class="computeroutput">obj</code> in the container if and only if there is no element in the container with an equivalent value.</p>
 694 <p>hint is a suggestion to where the element should be inserted.</p>
 695 <div class="variablelist"><table border="0" class="variablelist compact">
 696 <colgroup>
 697 <col align="left" valign="top">
 698 <col>
 699 </colgroup>
 700 <tbody>
 701 <tr>
 702 <td><p><span class="term">Requires:</span></p></td>
 703 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">CopyInsertable</code>.</p></td>
 704 </tr>
 705 <tr>
 706 <td><p><span class="term">Returns:</span></p></td>
 707 <td><p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p></td>
 708 </tr>
 709 <tr>
 710 <td><p><span class="term">Throws:</span></p></td>
 711 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 712 </tr>
 713 <tr>
 714 <td><p><span class="term">Notes:</span></p></td>
 715 <td>
 716 <p>The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value. </p>
 717 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 718 <p>Pointers and references to elements are never invalidated.</p>
 719 </td>
 720 </tr>
 721 </tbody>
 722 </table></div>
 723 </li>
 724 <li class="listitem">
 725 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp312746320-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">const_iterator</span> hint<span class="special">,</span> <span class="identifier">value_type</span><span class="special">&amp;&amp;</span> obj<span class="special">)</span><span class="special">;</span></pre>
 726 <p>Inserts <code class="computeroutput">obj</code> in the container if and only if there is no element in the container with an equivalent value.</p>
 727 <p>hint is a suggestion to where the element should be inserted.</p>
 728 <div class="variablelist"><table border="0" class="variablelist compact">
 729 <colgroup>
 730 <col align="left" valign="top">
 731 <col>
 732 </colgroup>
 733 <tbody>
 734 <tr>
 735 <td><p><span class="term">Requires:</span></p></td>
 736 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">MoveInsertable</code>.</p></td>
 737 </tr>
 738 <tr>
 739 <td><p><span class="term">Returns:</span></p></td>
 740 <td><p>If an insert took place, then the iterator points to the newly inserted element. Otherwise, it points to the element with equivalent value.</p></td>
 741 </tr>
 742 <tr>
 743 <td><p><span class="term">Throws:</span></p></td>
 744 <td><p>If an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 745 </tr>
 746 <tr>
 747 <td><p><span class="term">Notes:</span></p></td>
 748 <td>
 749 <p>The standard is fairly vague on the meaning of the hint. But the only practical way to use it, and the only way that Boost.Unordered supports is to point to an existing element with the same value. </p>
 750 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 751 <p>Pointers and references to elements are never invalidated.</p>
 752 </td>
 753 </tr>
 754 </tbody>
 755 </table></div>
 756 </li>
 757 <li class="listitem">
 758 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> InputIterator<span class="special">&gt;</span>
 759   <span class="keyword">void</span> <a name="idp312757584-bb"></a><span class="identifier">insert</span><span class="special">(</span><span class="identifier">InputIterator</span> first<span class="special">,</span> <span class="identifier">InputIterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 760 <p>Inserts a range of elements into the container. Elements are inserted if and only if there is no element in the container with an equivalent value.</p>
 761 <div class="variablelist"><table border="0" class="variablelist compact">
 762 <colgroup>
 763 <col align="left" valign="top">
 764 <col>
 765 </colgroup>
 766 <tbody>
 767 <tr>
 768 <td><p><span class="term">Requires:</span></p></td>
 769 <td><p><code class="computeroutput">value_type</code> is <code class="computeroutput">EmplaceConstructible</code> into
 770                   <code class="computeroutput">X</code> from <code class="computeroutput">*first</code>.</p></td>
 771 </tr>
 772 <tr>
 773 <td><p><span class="term">Throws:</span></p></td>
 774 <td><p>When inserting a single element, if an exception is thrown by an operation other than a call to <code class="computeroutput">hasher</code> the function has no effect.</p></td>
 775 </tr>
 776 <tr>
 777 <td><p><span class="term">Notes:</span></p></td>
 778 <td>
 779 <p>Can invalidate iterators, but only if the insert causes the load factor to be greater to or equal to the maximum load factor.</p>
 780 <p>Pointers and references to elements are never invalidated.</p>
 781 </td>
 782 </tr>
 783 </tbody>
 784 </table></div>
 785 </li>
 786 <li class="listitem">
 787 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp312768688-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 788 <p>Erase the element pointed to by <code class="computeroutput">position</code>.</p>
 789 <div class="variablelist"><table border="0" class="variablelist compact">
 790 <colgroup>
 791 <col align="left" valign="top">
 792 <col>
 793 </colgroup>
 794 <tbody>
 795 <tr>
 796 <td><p><span class="term">Returns:</span></p></td>
 797 <td><p>The iterator following <code class="computeroutput">position</code> before the erasure.</p></td>
 798 </tr>
 799 <tr>
 800 <td><p><span class="term">Throws:</span></p></td>
 801 <td><p>Only throws an exception if it is thrown by <code class="computeroutput">hasher</code> or <code class="computeroutput">key_equal</code>.</p></td>
 802 </tr>
 803 <tr>
 804 <td><p><span class="term">Notes:</span></p></td>
 805 <td><p>
 806                   In older versions this could be inefficient because it had to search
 807                   through several buckets to find the position of the returned iterator.
 808                   The data structure has been changed so that this is no longer the case,
 809                   and the alternative erase methods have been deprecated.
 810                 </p></td>
 811 </tr>
 812 </tbody>
 813 </table></div>
 814 </li>
 815 <li class="listitem">
 816 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312209600-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span><span class="special">;</span></pre>
 817 <p>Erase all elements with key equivalent to <code class="computeroutput">k</code>.</p>
 818 <div class="variablelist"><table border="0" class="variablelist compact">
 819 <colgroup>
 820 <col align="left" valign="top">
 821 <col>
 822 </colgroup>
 823 <tbody>
 824 <tr>
 825 <td><p><span class="term">Returns:</span></p></td>
 826 <td><p>The number of elements erased.</p></td>
 827 </tr>
 828 <tr>
 829 <td><p><span class="term">Throws:</span></p></td>
 830 <td><p>Only throws an exception if it is thrown by <code class="computeroutput">hasher</code> or <code class="computeroutput">key_equal</code>.</p></td>
 831 </tr>
 832 </tbody>
 833 </table></div>
 834 </li>
 835 <li class="listitem">
 836 <pre class="literallayout"><span class="identifier">iterator</span> <a name="idp312215920-bb"></a><span class="identifier">erase</span><span class="special">(</span><span class="identifier">const_iterator</span> first<span class="special">,</span> <span class="identifier">const_iterator</span> last<span class="special">)</span><span class="special">;</span></pre>
 837 <p>Erases the elements in the range from <code class="computeroutput">first</code> to <code class="computeroutput">last</code>.</p>
 838 <div class="variablelist"><table border="0" class="variablelist compact">
 839 <colgroup>
 840 <col align="left" valign="top">
 841 <col>
 842 </colgroup>
 843 <tbody>
 844 <tr>
 845 <td><p><span class="term">Returns:</span></p></td>
 846 <td><p>The iterator following the erased elements - i.e. <code class="computeroutput">last</code>.</p></td>
 847 </tr>
 848 <tr>
 849 <td><p><span class="term">Throws:</span></p></td>
 850 <td>
 851 <p>Only throws an exception if it is thrown by <code class="computeroutput">hasher</code> or <code class="computeroutput">key_equal</code>.</p>
 852 <p>In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.</p>
 853 </td>
 854 </tr>
 855 </tbody>
 856 </table></div>
 857 </li>
 858 <li class="listitem">
 859 <pre class="literallayout"><span class="keyword">void</span> <a name="idp312224896-bb"></a><span class="identifier">quick_erase</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 860 <p>Erase the element pointed to by <code class="computeroutput">position</code>.</p>
 861 <div class="variablelist"><table border="0" class="variablelist compact">
 862 <colgroup>
 863 <col align="left" valign="top">
 864 <col>
 865 </colgroup>
 866 <tbody>
 867 <tr>
 868 <td><p><span class="term">Throws:</span></p></td>
 869 <td>
 870 <p>Only throws an exception if it is thrown by <code class="computeroutput">hasher</code> or <code class="computeroutput">key_equal</code>.</p>
 871 <p>In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.</p>
 872 </td>
 873 </tr>
 874 <tr>
 875 <td><p><span class="term">Notes:</span></p></td>
 876 <td><p>
 877                   This method was implemented because returning an iterator to
 878                   the next element from <code class="computeroutput">erase</code> was expensive, but
 879                   the container has been redesigned so that is no longer the
 880                   case. So this method is now deprecated.
 881                 </p></td>
 882 </tr>
 883 </tbody>
 884 </table></div>
 885 </li>
 886 <li class="listitem">
 887 <pre class="literallayout"><span class="keyword">void</span> <a name="idp312232560-bb"></a><span class="identifier">erase_return_void</span><span class="special">(</span><span class="identifier">const_iterator</span> position<span class="special">)</span><span class="special">;</span></pre>
 888 <p>Erase the element pointed to by <code class="computeroutput">position</code>.</p>
 889 <div class="variablelist"><table border="0" class="variablelist compact">
 890 <colgroup>
 891 <col align="left" valign="top">
 892 <col>
 893 </colgroup>
 894 <tbody>
 895 <tr>
 896 <td><p><span class="term">Throws:</span></p></td>
 897 <td>
 898 <p>Only throws an exception if it is thrown by <code class="computeroutput">hasher</code> or <code class="computeroutput">key_equal</code>.</p>
 899 <p>In this implementation, this overload doesn't call either function object's methods so it is no throw, but this might not be true in other implementations.</p>
 900 </td>
 901 </tr>
 902 <tr>
 903 <td><p><span class="term">Notes:</span></p></td>
 904 <td><p>
 905                   This method was implemented because returning an iterator to
 906                   the next element from <code class="computeroutput">erase</code> was expensive, but
 907                   the container has been redesigned so that is no longer the
 908                   case. So this method is now deprecated.
 909                 </p></td>
 910 </tr>
 911 </tbody>
 912 </table></div>
 913 </li>
 914 <li class="listitem">
 915 <pre class="literallayout"><span class="keyword">void</span> <a name="idp312240224-bb"></a><span class="identifier">clear</span><span class="special">(</span><span class="special">)</span><span class="special">;</span></pre>
 916 <p>Erases all elements in the container.</p>
 917 <div class="variablelist"><table border="0" class="variablelist compact">
 918 <colgroup>
 919 <col align="left" valign="top">
 920 <col>
 921 </colgroup>
 922 <tbody>
 923 <tr>
 924 <td><p><span class="term">Postconditions:</span></p></td>
 925 <td><p><code class="computeroutput"><a class="link" href="unordered_set.html#idp104506560-bb">size</a>() == 0</code></p></td>
 926 </tr>
 927 <tr>
 928 <td><p><span class="term">Throws:</span></p></td>
 929 <td><p>Never throws an exception.</p></td>
 930 </tr>
 931 </tbody>
 932 </table></div>
 933 </li>
 934 <li class="listitem">
 935 <pre class="literallayout"><span class="keyword">void</span> <a name="idp304200752-bb"></a><span class="identifier">swap</span><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&amp;</span><span class="special">)</span><span class="special">;</span></pre>
 936 <p>Swaps the contents of the container with the parameter.</p>
 937 <p>If <code class="computeroutput">Allocator::propagate_on_container_swap</code> is declared and
 938                   <code class="computeroutput">Allocator::propagate_on_container_swap::value</code> is true then the
 939                   containers' allocators are swapped. Otherwise, swapping with unequal allocators
 940                   results in undefined behavior.</p>
 941 <div class="variablelist"><table border="0" class="variablelist compact">
 942 <colgroup>
 943 <col align="left" valign="top">
 944 <col>
 945 </colgroup>
 946 <tbody>
 947 <tr>
 948 <td><p><span class="term">Throws:</span></p></td>
 949 <td><p>Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code class="computeroutput">key_equal</code> or <code class="computeroutput">hasher</code>.</p></td>
 950 </tr>
 951 <tr>
 952 <td><p><span class="term">Notes:</span></p></td>
 953 <td><p>The exception specifications aren't quite the same as the C++11 standard, as
 954                   the equality predieate and hash function are swapped using their copy constructors.</p></td>
 955 </tr>
 956 </tbody>
 957 </table></div>
 958 </li>
 959 </ol></div>
 960 </div>
 961 <div class="refsect2">
 962 <a name="idp517893152"></a><h3>
 963 <a name="idp304208256-bb"></a><code class="computeroutput">unordered_set</code> observers</h3>
 964 <div class="orderedlist"><ol class="orderedlist" type="1">
 965 <li class="listitem">
 966 <pre class="literallayout"><span class="identifier">hasher</span> <a name="idp304208816-bb"></a><span class="identifier">hash_function</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 967 <div class="variablelist"><table border="0" class="variablelist compact">
 968 <colgroup>
 969 <col align="left" valign="top">
 970 <col>
 971 </colgroup>
 972 <tbody><tr>
 973 <td><p><span class="term">Returns:</span></p></td>
 974 <td>The container's hash function.
 975               </td>
 976 </tr></tbody>
 977 </table></div>
 978 </li>
 979 <li class="listitem">
 980 <pre class="literallayout"><span class="identifier">key_equal</span> <a name="idp304210672-bb"></a><span class="identifier">key_eq</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
 981 <div class="variablelist"><table border="0" class="variablelist compact">
 982 <colgroup>
 983 <col align="left" valign="top">
 984 <col>
 985 </colgroup>
 986 <tbody><tr>
 987 <td><p><span class="term">Returns:</span></p></td>
 988 <td>The container's key equality predicate.
 989               </td>
 990 </tr></tbody>
 991 </table></div>
 992 </li>
 993 </ol></div>
 994 </div>
 995 <div class="refsect2">
 996 <a name="idp517908112"></a><h3>
 997 <a name="idp304212688-bb"></a><code class="computeroutput">unordered_set</code> lookup</h3>
 998 <div class="orderedlist"><ol class="orderedlist" type="1">
 999 <li class="listitem">
1000 <pre class="literallayout"><a name="idp304213248-bb"></a><span class="identifier">iterator</span> <a name="idp304213808-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span><span class="special">;</span>
1001 <span class="identifier">const_iterator</span> <a name="idp304215872-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span>
1002 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> CompatibleKey<span class="special">,</span> <span class="keyword">typename</span> CompatibleHash<span class="special">,</span>
1003          <span class="keyword">typename</span> CompatiblePredicate<span class="special">&gt;</span>
1004   <span class="identifier">iterator</span> <a name="idp304218208-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">CompatibleKey</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">,</span> <span class="identifier">CompatibleHash</span> <span class="keyword">const</span><span class="special">&amp;</span> hash<span class="special">,</span>
1005                 <span class="identifier">CompatiblePredicate</span> <span class="keyword">const</span><span class="special">&amp;</span> eq<span class="special">)</span><span class="special">;</span>
1006 <span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> CompatibleKey<span class="special">,</span> <span class="keyword">typename</span> CompatibleHash<span class="special">,</span>
1007          <span class="keyword">typename</span> CompatiblePredicate<span class="special">&gt;</span>
1008   <span class="identifier">const_iterator</span>
1009   <a name="idp304224752-bb"></a><span class="identifier">find</span><span class="special">(</span><span class="identifier">CompatibleKey</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">,</span> <span class="identifier">CompatibleHash</span> <span class="keyword">const</span><span class="special">&amp;</span> hash<span class="special">,</span>
1010        <span class="identifier">CompatiblePredicate</span> <span class="keyword">const</span><span class="special">&amp;</span> eq<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1011 <div class="variablelist"><table border="0" class="variablelist compact">
1012 <colgroup>
1013 <col align="left" valign="top">
1014 <col>
1015 </colgroup>
1016 <tbody>
1017 <tr>
1018 <td><p><span class="term">Returns:</span></p></td>
1019 <td><p>An iterator pointing to an element with key equivalent to <code class="computeroutput">k</code>, or <code class="computeroutput">b.end()</code> if no such element exists.</p></td>
1020 </tr>
1021 <tr>
1022 <td><p><span class="term">Notes:</span></p></td>
1023 <td><p>
1024                 The templated overloads are a non-standard extensions which
1025                 allows you to use a compatible hash function and equality
1026                 predicate for a key of a different type in order to avoid
1027                 an expensive type cast. In general, its use is not encouraged.
1028               </p></td>
1029 </tr>
1030 </tbody>
1031 </table></div>
1032 </li>
1033 <li class="listitem">
1034 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312883504-bb"></a><span class="identifier">count</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1035 <div class="variablelist"><table border="0" class="variablelist compact">
1036 <colgroup>
1037 <col align="left" valign="top">
1038 <col>
1039 </colgroup>
1040 <tbody><tr>
1041 <td><p><span class="term">Returns:</span></p></td>
1042 <td><p>The number of elements with key equivalent to <code class="computeroutput">k</code>.</p></td>
1043 </tr></tbody>
1044 </table></div>
1045 </li>
1046 <li class="listitem">
1047 <pre class="literallayout"><a name="idp312887424-bb"></a><span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">iterator</span><span class="special">,</span> <span class="identifier">iterator</span><span class="special">&gt;</span> <a name="idp312887984-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span><span class="special">;</span>
1048 <span class="identifier">std</span><span class="special">::</span><span class="identifier">pair</span><span class="special">&lt;</span><span class="identifier">const_iterator</span><span class="special">,</span> <span class="identifier">const_iterator</span><span class="special">&gt;</span> <a name="idp312890064-bb"></a><span class="identifier">equal_range</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1049 <div class="variablelist"><table border="0" class="variablelist compact">
1050 <colgroup>
1051 <col align="left" valign="top">
1052 <col>
1053 </colgroup>
1054 <tbody><tr>
1055 <td><p><span class="term">Returns:</span></p></td>
1056 <td><p>A range containing all elements with key equivalent to <code class="computeroutput">k</code>.
1057                   If the container doesn't container any such elements, returns
1058                   <code class="computeroutput">std::make_pair(b.end(),b.end())</code>.
1059                   </p></td>
1060 </tr></tbody>
1061 </table></div>
1062 </li>
1063 </ol></div>
1064 </div>
1065 <div class="refsect2">
1066 <a name="idp517992576"></a><h3>
1067 <a name="idp312895712-bb"></a><code class="computeroutput">unordered_set</code> bucket interface</h3>
1068 <div class="orderedlist"><ol class="orderedlist" type="1">
1069 <li class="listitem">
1070 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312896272-bb"></a><span class="identifier">bucket_count</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1071 <div class="variablelist"><table border="0" class="variablelist compact">
1072 <colgroup>
1073 <col align="left" valign="top">
1074 <col>
1075 </colgroup>
1076 <tbody><tr>
1077 <td><p><span class="term">Returns:</span></p></td>
1078 <td><p>The number of buckets.</p></td>
1079 </tr></tbody>
1080 </table></div>
1081 </li>
1082 <li class="listitem">
1083 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312898608-bb"></a><span class="identifier">max_bucket_count</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1084 <div class="variablelist"><table border="0" class="variablelist compact">
1085 <colgroup>
1086 <col align="left" valign="top">
1087 <col>
1088 </colgroup>
1089 <tbody><tr>
1090 <td><p><span class="term">Returns:</span></p></td>
1091 <td><p>An upper bound on the number of buckets.</p></td>
1092 </tr></tbody>
1093 </table></div>
1094 </li>
1095 <li class="listitem">
1096 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312900912-bb"></a><span class="identifier">bucket_size</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1097 <div class="variablelist"><table border="0" class="variablelist compact">
1098 <colgroup>
1099 <col align="left" valign="top">
1100 <col>
1101 </colgroup>
1102 <tbody>
1103 <tr>
1104 <td><p><span class="term">Requires:</span></p></td>
1105 <td><p><code class="computeroutput">n &lt; <a class="link" href="unordered_set.html#idp312896272-bb">bucket_count</a>()</code></p></td>
1106 </tr>
1107 <tr>
1108 <td><p><span class="term">Returns:</span></p></td>
1109 <td><p>The number of elements in bucket <code class="computeroutput">n</code>.</p></td>
1110 </tr>
1111 </tbody>
1112 </table></div>
1113 </li>
1114 <li class="listitem">
1115 <pre class="literallayout"><span class="identifier">size_type</span> <a name="idp312906352-bb"></a><span class="identifier">bucket</span><span class="special">(</span><span class="identifier">key_type</span> <span class="keyword">const</span><span class="special">&amp;</span> k<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1116 <div class="variablelist"><table border="0" class="variablelist compact">
1117 <colgroup>
1118 <col align="left" valign="top">
1119 <col>
1120 </colgroup>
1121 <tbody>
1122 <tr>
1123 <td><p><span class="term">Returns:</span></p></td>
1124 <td><p>The index of the bucket which would contain an element with key <code class="computeroutput">k</code>.</p></td>
1125 </tr>
1126 <tr>
1127 <td><p><span class="term">Postconditions:</span></p></td>
1128 <td><p>The return value is less than <code class="computeroutput">bucket_count()</code></p></td>
1129 </tr>
1130 </tbody>
1131 </table></div>
1132 </li>
1133 <li class="listitem">
1134 <pre class="literallayout"><a name="idp312911472-bb"></a><span class="identifier">local_iterator</span> <a name="idp312912032-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span>
1135 <span class="identifier">const_local_iterator</span> <a name="idp312914096-bb"></a><span class="identifier">begin</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1136 <div class="variablelist"><table border="0" class="variablelist compact">
1137 <colgroup>
1138 <col align="left" valign="top">
1139 <col>
1140 </colgroup>
1141 <tbody>
1142 <tr>
1143 <td><p><span class="term">Requires:</span></p></td>
1144 <td><p><code class="computeroutput">n</code> shall be in the range <code class="computeroutput">[0, bucket_count())</code>.</p></td>
1145 </tr>
1146 <tr>
1147 <td><p><span class="term">Returns:</span></p></td>
1148 <td><p>A local iterator pointing the first element in the bucket with index <code class="computeroutput">n</code>.</p></td>
1149 </tr>
1150 </tbody>
1151 </table></div>
1152 </li>
1153 <li class="listitem">
1154 <pre class="literallayout"><a name="idp304576624-bb"></a><span class="identifier">local_iterator</span> <a name="idp304577184-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span>
1155 <span class="identifier">const_local_iterator</span> <a name="idp304579248-bb"></a><span class="identifier">end</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1156 <div class="variablelist"><table border="0" class="variablelist compact">
1157 <colgroup>
1158 <col align="left" valign="top">
1159 <col>
1160 </colgroup>
1161 <tbody>
1162 <tr>
1163 <td><p><span class="term">Requires:</span></p></td>
1164 <td><p><code class="computeroutput">n</code> shall be in the range <code class="computeroutput">[0, bucket_count())</code>.</p></td>
1165 </tr>
1166 <tr>
1167 <td><p><span class="term">Returns:</span></p></td>
1168 <td><p>A local iterator pointing the 'one past the end' element in the bucket with index <code class="computeroutput">n</code>.</p></td>
1169 </tr>
1170 </tbody>
1171 </table></div>
1172 </li>
1173 <li class="listitem">
1174 <pre class="literallayout"><span class="identifier">const_local_iterator</span> <a name="idp304584688-bb"></a><span class="identifier">cbegin</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1175 <div class="variablelist"><table border="0" class="variablelist compact">
1176 <colgroup>
1177 <col align="left" valign="top">
1178 <col>
1179 </colgroup>
1180 <tbody>
1181 <tr>
1182 <td><p><span class="term">Requires:</span></p></td>
1183 <td><p><code class="computeroutput">n</code> shall be in the range <code class="computeroutput">[0, bucket_count())</code>.</p></td>
1184 </tr>
1185 <tr>
1186 <td><p><span class="term">Returns:</span></p></td>
1187 <td><p>A constant local iterator pointing the first element in the bucket with index <code class="computeroutput">n</code>.</p></td>
1188 </tr>
1189 </tbody>
1190 </table></div>
1191 </li>
1192 <li class="listitem">
1193 <pre class="literallayout"><span class="identifier">const_local_iterator</span> <a name="idp304590240-bb"></a><span class="identifier">cend</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
1194 <div class="variablelist"><table border="0" class="variablelist compact">
1195 <colgroup>
1196 <col align="left" valign="top">
1197 <col>
1198 </colgroup>
1199 <tbody>
1200 <tr>
1201 <td><p><span class="term">Requires:</span></p></td>
1202 <td><p><code class="computeroutput">n</code> shall be in the range <code class="computeroutput">[0, bucket_count())</code>.</p></td>
1203 </tr>
1204 <tr>
1205 <td><p><span class="term">Returns:</span></p></td>
1206 <td><p>A constant local iterator pointing the 'one past the end' element in the bucket with index <code class="computeroutput">n</code>.</p></td>
1207 </tr>
1208 </tbody>
1209 </table></div>
1210 </li>
1211 </ol></div>
1212 </div>
1213 <div class="refsect2">
1214 <a name="idp518076032"></a><h3>
1215 <a name="idp304595792-bb"></a><code class="computeroutput">unordered_set</code> hash policy</h3>
1216 <div class="orderedlist"><ol class="orderedlist" type="1">
1217 <li class="listitem">
1218 <pre class="literallayout"><span class="keyword">float</span> <a name="idp304596352-bb"></a><span class="identifier">load_factor</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1219 <div class="variablelist"><table border="0" class="variablelist compact">
1220 <colgroup>
1221 <col align="left" valign="top">
1222 <col>
1223 </colgroup>
1224 <tbody><tr>
1225 <td><p><span class="term">Returns:</span></p></td>
1226 <td><p>The average number of elements per bucket.</p></td>
1227 </tr></tbody>
1228 </table></div>
1229 </li>
1230 <li class="listitem">
1231 <pre class="literallayout"><span class="keyword">float</span> <a name="idp304598656-bb"></a><span class="identifier">max_load_factor</span><span class="special">(</span><span class="special">)</span> <span class="keyword">const</span><span class="special">;</span></pre>
1232 <div class="variablelist"><table border="0" class="variablelist compact">
1233 <colgroup>
1234 <col align="left" valign="top">
1235 <col>
1236 </colgroup>
1237 <tbody><tr>
1238 <td><p><span class="term">Returns:</span></p></td>
1239 <td><p>Returns the current maximum load factor.</p></td>
1240 </tr></tbody>
1241 </table></div>
1242 </li>
1243 <li class="listitem">
1244 <pre class="literallayout"><span class="keyword">void</span> <a name="idp304600960-bb"></a><span class="identifier">max_load_factor</span><span class="special">(</span><span class="keyword">float</span> z<span class="special">)</span><span class="special">;</span></pre>
1245 <div class="variablelist"><table border="0" class="variablelist compact">
1246 <colgroup>
1247 <col align="left" valign="top">
1248 <col>
1249 </colgroup>
1250 <tbody><tr>
1251 <td><p><span class="term">Effects:</span></p></td>
1252 <td><p>Changes the container's maximum load factor, using <code class="computeroutput">z</code> as a hint.</p></td>
1253 </tr></tbody>
1254 </table></div>
1255 </li>
1256 <li class="listitem">
1257 <pre class="literallayout"><span class="keyword">void</span> <a name="idp304604608-bb"></a><span class="identifier">rehash</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
1258 <p>Changes the number of buckets so that there at least <code class="computeroutput">n</code> buckets, and so that the load factor is less than the maximum load factor.</p>
1259 <p>Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.</p>
1260 <div class="variablelist"><table border="0" class="variablelist compact">
1261 <colgroup>
1262 <col align="left" valign="top">
1263 <col>
1264 </colgroup>
1265 <tbody><tr>
1266 <td><p><span class="term">Throws:</span></p></td>
1267 <td><p>The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.</p></td>
1268 </tr></tbody>
1269 </table></div>
1270 </li>
1271 <li class="listitem">
1272 <pre class="literallayout"><span class="keyword">void</span> <a name="idp304609776-bb"></a><span class="identifier">reserve</span><span class="special">(</span><span class="identifier">size_type</span> n<span class="special">)</span><span class="special">;</span></pre>
1273 <p>Invalidates iterators, and changes the order of elements. Pointers and references to elements are not invalidated.</p>
1274 <div class="variablelist"><table border="0" class="variablelist compact">
1275 <colgroup>
1276 <col align="left" valign="top">
1277 <col>
1278 </colgroup>
1279 <tbody><tr>
1280 <td><p><span class="term">Throws:</span></p></td>
1281 <td><p>The function has no effect if an exception is thrown, unless it is thrown by the container's hash function or comparison function.</p></td>
1282 </tr></tbody>
1283 </table></div>
1284 </li>
1285 </ol></div>
1286 </div>
1287 <div class="refsect2">
1288 <a name="idp518113216"></a><h3>
1289 <a name="idp304614272-bb"></a><code class="computeroutput">unordered_set</code> Equality Comparisons</h3>
1290 <div class="orderedlist"><ol class="orderedlist" type="1">
1291 <li class="listitem">
1292 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
1293   <span class="keyword">bool</span> <a name="boost.unordered_set.operator==_idp304614832"></a><span class="keyword">operator</span><span class="special">==</span><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> x<span class="special">,</span>
1294                   <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> y<span class="special">)</span><span class="special">;</span></pre>
1295 <p>Return <code class="computeroutput">true</code> if <code class="computeroutput">x.size() ==
1296                 y.size</code> and for every element in <code class="computeroutput">x</code>,
1297                 there is an element in <code class="computeroutput">y</code> with the same
1298                 for the same key, with an equal value (using
1299                 <code class="computeroutput">operator==</code> to compare the value types).
1300                 </p>
1301 <div class="variablelist"><table border="0" class="variablelist compact">
1302 <colgroup>
1303 <col align="left" valign="top">
1304 <col>
1305 </colgroup>
1306 <tbody><tr>
1307 <td><p><span class="term">Notes:</span></p></td>
1308 <td>
1309 <p>The behavior of this function was changed to match
1310                   the C++11 standard in Boost 1.48.</p>
1311 <p>Behavior is undefined if the two containers don't have
1312                     equivalent equality predicates.</p>
1313 </td>
1314 </tr></tbody>
1315 </table></div>
1316 </li>
1317 <li class="listitem">
1318 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
1319   <span class="keyword">bool</span> <a name="boost.unordered_set.operator!=_idp304626304"></a><span class="keyword">operator</span><span class="special">!=</span><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> x<span class="special">,</span>
1320                   <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span> <span class="keyword">const</span><span class="special">&amp;</span> y<span class="special">)</span><span class="special">;</span></pre>
1321 <p>Return <code class="computeroutput">false</code> if <code class="computeroutput">x.size() ==
1322                 y.size</code> and for every element in <code class="computeroutput">x</code>,
1323                 there is an element in <code class="computeroutput">y</code> with the same
1324                 for the same key, with an equal value (using
1325                 <code class="computeroutput">operator==</code> to compare the value types).
1326                 </p>
1327 <div class="variablelist"><table border="0" class="variablelist compact">
1328 <colgroup>
1329 <col align="left" valign="top">
1330 <col>
1331 </colgroup>
1332 <tbody><tr>
1333 <td><p><span class="term">Notes:</span></p></td>
1334 <td>
1335 <p>The behavior of this function was changed to match
1336                   the C++11 standard in Boost 1.48.</p>
1337 <p>Behavior is undefined if the two containers don't have
1338                     equivalent equality predicates.</p>
1339 </td>
1340 </tr></tbody>
1341 </table></div>
1342 </li>
1343 </ol></div>
1344 </div>
1345 <div class="refsect2">
1346 <a name="idp518180496"></a><h3>
1347 <a name="idp312243552-bb"></a><code class="computeroutput">unordered_set</code> swap</h3>
1348 <div class="orderedlist"><ol class="orderedlist" type="1"><li class="listitem">
1349 <pre class="literallayout"><span class="keyword">template</span><span class="special">&lt;</span><span class="keyword">typename</span> Value<span class="special">,</span> <span class="keyword">typename</span> Hash<span class="special">,</span> <span class="keyword">typename</span> Pred<span class="special">,</span> <span class="keyword">typename</span> Alloc<span class="special">&gt;</span>
1350   <span class="keyword">void</span> <a name="boost.unordered_set.swap_idp312244112"></a><span class="identifier">swap</span><span class="special">(</span><span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span><span class="special">&amp;</span> x<span class="special">,</span>
1351             <span class="identifier">unordered_set</span><span class="special">&lt;</span><span class="identifier">Value</span><span class="special">,</span> <span class="identifier">Hash</span><span class="special">,</span> <span class="identifier">Pred</span><span class="special">,</span> <span class="identifier">Alloc</span><span class="special">&gt;</span><span class="special">&amp;</span> y<span class="special">)</span><span class="special">;</span></pre>
1352 <p>Swaps the contents of <code class="computeroutput">x</code> and <code class="computeroutput">y</code>.</p>
1353 <p>If <code class="computeroutput">Allocator::propagate_on_container_swap</code> is declared and
1354                   <code class="computeroutput">Allocator::propagate_on_container_swap::value</code> is true then the
1355                   containers' allocators are swapped. Otherwise, swapping with unequal allocators
1356                   results in undefined behavior.</p>
1357 <div class="variablelist"><table border="0" class="variablelist compact">
1358 <colgroup>
1359 <col align="left" valign="top">
1360 <col>
1361 </colgroup>
1362 <tbody>
1363 <tr>
1364 <td><p><span class="term">Effects:</span></p></td>
1365 <td><p><code class="computeroutput">x.swap(y)</code></p></td>
1366 </tr>
1367 <tr>
1368 <td><p><span class="term">Throws:</span></p></td>
1369 <td><p>Doesn't throw an exception unless it is thrown by the copy constructor or copy assignment operator of <code class="computeroutput">key_equal</code> or <code class="computeroutput">hasher</code>.</p></td>
1370 </tr>
1371 <tr>
1372 <td><p><span class="term">Notes:</span></p></td>
1373 <td><p>The exception specifications aren't quite the same as the C++11 standard, as
1374                   the equality predieate and hash function are swapped using their copy constructors.</p></td>
1375 </tr>
1376 </tbody>
1377 </table></div>
1378 </li></ol></div>
1379 </div>
1380 </div>
1381 </div>
1382 <table xmlns:rev="http://www.cs.rpi.edu/~gregod/boost/tools/doc/revision" width="100%"><tr>
1383 <td align="left"></td>
1384 <td align="right"><div class="copyright-footer">Copyright &#169; 2003, 2004 Jeremy B. Maitin-Shepard<br>Copyright &#169; 2005-2008 Daniel
1385       James<p>
1386         Distributed under the Boost Software License, Version 1.0. (See accompanying
1387         file LICENSE_1_0.txt or copy at <a href="http://www.boost.org/LICENSE_1_0.txt" target="_top">http://www.boost.org/LICENSE_1_0.txt</a>)
1388       </p>
1389 </div></td>
1390 </tr></table>
1391 <hr>
1392 <div class="spirit-nav">
1393 <a accesskey="p" href="../unordered/reference.html"><img src="../../../doc/src/images/prev.png" alt="Prev"></a><a accesskey="u" href="../unordered/reference.html#header.boost.unordered_set_hpp"><img src="../../../doc/src/images/up.png" alt="Up"></a><a accesskey="h" href="../index.html"><img src="../../../doc/src/images/home.png" alt="Home"></a><a accesskey="n" href="unordered_multiset.html"><img src="../../../doc/src/images/next.png" alt="Next"></a>
1394 </div>
1395 </body>
1396 </html>