240 lines
26 KiB
HTML
240 lines
26 KiB
HTML
<!DOCTYPE html>
|
|
<html lang="zh" dir="ltr" class="client-nojs" xmlns="http://www.w3.org/1999/xhtml" xml:lang="zh">
|
|
<head><meta http-equiv="x-ua-compatible" content="ie=edge">
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::insert</title>
|
|
<link rel="stylesheet" href="ext.css" />
|
|
<link rel="stylesheet" href="site_modules.css" />
|
|
</head>
|
|
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_container_unordered_map_insert skin-cppreference2 action-view cpp-navbar">
|
|
<div id="cpp-content-base">
|
|
<div id="content"><a id="top"></a>
|
|
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::unordered_map<Key,T,Hash,KeyEqual,Allocator>::</span>insert</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-container.html">container</a>‎ | <a href="cpp-container-unordered_map.html">unordered map</a></span></div>
|
|
<div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr" xml:lang="zh">
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><a href="cpp-utility-pair.html"><span class="kw1096">std::<span class="me2">pair</span></span></a><span class="sy1"><</span>iterator,<span class="kw4">bool</span><span class="sy1">></span> insert<span class="br0">(</span> <span class="kw4">const</span> value_type<span class="sy3">&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><a href="cpp-utility-pair.html"><span class="kw1096">std::<span class="me2">pair</span></span></a><span class="sy1"><</span>iterator,<span class="kw4">bool</span><span class="sy1">></span> insert<span class="br0">(</span> value_type<span class="sy3">&&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(1)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> P <span class="sy1">></span><br />
|
|
<a href="cpp-utility-pair.html"><span class="kw1096">std::<span class="me2">pair</span></span></a><span class="sy1"><</span>iterator,<span class="kw4">bool</span><span class="sy1">></span> insert<span class="br0">(</span> P<span class="sy3">&&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(2)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">iterator insert<span class="br0">(</span> const_iterator hint, <span class="kw4">const</span> value_type<span class="sy3">&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">iterator insert<span class="br0">(</span> const_iterator hint, value_type<span class="sy3">&&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(3)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> P <span class="sy1">></span><br />
|
|
iterator insert<span class="br0">(</span> const_iterator hint, P<span class="sy3">&&</span> value <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(4)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> InputIt <span class="sy1">></span><br />
|
|
<span class="kw4">void</span> insert<span class="br0">(</span> InputIt first, InputIt last <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(5)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx11">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw4">void</span> insert<span class="br0">(</span> <a href="cpp-utility-initializer_list.html"><span class="kw960">std::<span class="me2">initializer_list</span></span></a><span class="sy1"><</span>value_type<span class="sy1">></span> ilist <span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(6)</td>
|
|
<td><span class="t-mark-rev t-since-cxx11">(C++11 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">insert_return_type insert<span class="br0">(</span>node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(7)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp">iterator insert<span class="br0">(</span>const_iterator hint, node_type<span class="sy3">&&</span> nh<span class="br0">)</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td>(8)</td>
|
|
<td><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>若容器尚未含有带等价关键的元素，则插入元素到容器中。</p>
|
|
<div class="t-li1"><span class="t-li">1-2)</span> 插入 <code>value</code> 。重载 <span class="t-v">(2)</span> 等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">emplace<span class="br0">(</span><a href="cpp-utility-forward.html"><span class="kw1117">std::<span class="me2">forward</span></span></a><span class="sy1"><</span>P<span class="sy1">></span><span class="br0">(</span>value<span class="br0">)</span><span class="br0">)</span></span></span> ，且仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-types-is_constructible.html"><span class="kw520">std::<span class="me2">is_constructible</span></span></a><span class="sy1"><</span>value_type, P<span class="sy3">&&</span><span class="sy1">></span><span class="sy4">::</span><span class="me2">value</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> 才参与重载决议。</div>
|
|
<div class="t-li1"><span class="t-li">3-4)</span> 插入 <code>value</code> ，以 <code>hint</code> 为应当开始搜索的位置的非强制建议。重载 <span class="t-v">(4)</span> 等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">emplace_hint<span class="br0">(</span>hint, <a href="cpp-utility-forward.html"><span class="kw1117">std::<span class="me2">forward</span></span></a><span class="sy1"><</span>P<span class="sy1">></span><span class="br0">(</span>value<span class="br0">)</span><span class="br0">)</span></span></span> ，且仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-types-is_constructible.html"><span class="kw520">std::<span class="me2">is_constructible</span></span></a><span class="sy1"><</span>value_type, P<span class="sy3">&&</span><span class="sy1">></span><span class="sy4">::</span><span class="me2">value</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> 才参与重载决议。</div>
|
|
<div class="t-li1"><span class="t-li">5)</span> 插入来自范围 <code>[first, last)</code> 的元素。若范围中的多个元素拥有比较等价的关键，则插入哪个元素是未指定的（待决的 <a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2844">LWG2844</a> ）。</div>
|
|
<div class="t-li1"><span class="t-li">6)</span> 插入来自 initializer_list <code>ilist</code> 的元素。若范围中的多个元素拥有比较等价的关键，则插入哪个元素是未指定的（待决的 <a rel="nofollow" class="external text" href="https://cplusplus.github.io/LWG/issue2844">LWG2844</a> ）。</div>
|
|
<div class="t-li1"><span class="t-li">7)</span> 若 <code>nh</code> 是空的<a href="cpp-container-node_handle.html">结点把柄</a>，则不做任何事。否则插入 <code>nh</code> 所占有的元素到容器，若容器尚未含有拥有等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">nh.<span class="me1">key</span><span class="br0">(</span><span class="br0">)</span></span></span> 的关键的元素。若 <code>nh</code> 非空且 <span class="t-c"><span class="mw-geshi cpp source-cpp">get_allocator<span class="br0">(</span><span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> nh.<span class="me1">get_allocator</span><span class="br0">(</span><span class="br0">)</span></span></span> 则行为未定义。</div>
|
|
<div class="t-li1"><span class="t-li">8)</span> 若 <code>nh</code> 是空的<a href="cpp-container-node_handle.html">结点把柄</a>，则不做任何事并返回尾迭代器。否则，插入 <code>nh</code> 所占有的元素到容器，若容器尚未含有拥有等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">nh.<span class="me1">key</span><span class="br0">(</span><span class="br0">)</span></span></span> 的关键的元素，并返回指向拥有等于 <span class="t-c"><span class="mw-geshi cpp source-cpp">nh.<span class="me1">key</span><span class="br0">(</span><span class="br0">)</span></span></span> 的关键的元素的迭代器（无关乎插入成功还是失败）。若插入成功，则从 <code>nh</code> 移动，否则它保持该元素的所有权。元素被插入到尽可能接近 <code>hint</code> 的位置。若 <code>nh</code> 非空且 <span class="t-c"><span class="mw-geshi cpp source-cpp">get_allocator<span class="br0">(</span><span class="br0">)</span> <span class="sy3">!</span><span class="sy1">=</span> nh.<span class="me1">get_allocator</span><span class="br0">(</span><span class="br0">)</span></span></span> 则行为未定义。</div>
|
|
<p>若因插入发生重哈希，则所有迭代器都被非法化。否则迭代器不受影响。引用不受影响。重哈希仅若新元素数量大于 <span class="t-c"><span class="mw-geshi cpp source-cpp">max_load_factor<span class="br0">(</span><span class="br0">)</span><span class="sy2">*</span>bucket_count<span class="br0">(</span><span class="br0">)</span></span></span> 才发生。<span class="t-rev-inl t-since-cxx17"><span>若插入成功，则在结点把柄保有元素时获得的指向该元素的指针和引用被非法化，而在提取前获得的指向元素的指针和引用变得合法。</span> <span><span class="t-mark-rev t-since-cxx17">(C++17 起)</span></span></span></p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>hint</td>
|
|
<td>-</td>
|
|
<td>迭代器，用作插入内容位置的建议</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>value</td>
|
|
<td>-</td>
|
|
<td>要插入的元素值</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>要插入的元素范围</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>ilist</td>
|
|
<td>-</td>
|
|
<td>插入值来源的 initializer_list</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>nh</td>
|
|
<td>-</td>
|
|
<td>兼容的<a href="cpp-container-node_handle.html">结点把柄</a></td>
|
|
</tr>
|
|
<tr class="t-par-hitem">
|
|
<td colspan="3">类型要求</td>
|
|
</tr>
|
|
<tr class="t-par-req">
|
|
<td colspan="3">-
|
|
<div class="spacer"></div>
|
|
<code>InputIt</code> 必须满足<a href="cpp-named_req-InputIterator.html"><span style="font-style:italic">老式输入迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span></a> 的要求。</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<div class="t-li1"><span class="t-li">1-2)</span> 返回由指向被插入元素（或阻止插入的元素）的迭代器和指代插入是否发生的 <span class="t-c"><span class="mw-geshi cpp source-cpp"><span class="kw4">bool</span></span></span> 组成的 pair 。</div>
|
|
<div class="t-li1"><span class="t-li">3-4)</span> 返回指向被插入元素，或阻止插入的元素的迭代器。</div>
|
|
<div class="t-li1"><span class="t-li">5-6)</span> （无）</div>
|
|
<div class="t-li1"><span class="t-li">7)</span> 返回 <code>insert_return_type</code> ，其成员初始化如下：若 <code>nh</code> 为空，则 <code>inserted</code> 为 <code>false</code> ， <code>position</code> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">end<span class="br0">(</span><span class="br0">)</span></span></span> ，而 <code>node</code> 为空。否则发生插入， <code>inserted</code> 为 <code>true</code> ， <code>position</code> 指向被插入元素，而 <code>node</code> 为空。若插入失败，则 <code>inserted</code> 为 <code>false</code> ， <code>node</code> 拥有 <code>nh</code> 的先前值，而 <code>position</code> 指向拥有等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">nh.<span class="me1">key</span><span class="br0">(</span><span class="br0">)</span></span></span> 的关键的元素。</div>
|
|
<div class="t-li1"><span class="t-li">8)</span> 若 <code>nh</code> 为空则为尾迭代器，若插入发生则为指向被插入元素的迭代器，而若插入失败则为指向拥有等价于 <span class="t-c"><span class="mw-geshi cpp source-cpp">nh.<span class="me1">key</span><span class="br0">(</span><span class="br0">)</span></span></span> 的关键的元素的迭代器。</div>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<div class="t-li1"><span class="t-li">1-4)</span> 若任何操作抛出异常，则插入无效果。</div>
|
|
<table class="metadata plainlinks ambox mbox-small-left ambox-notice" style="">
|
|
<tr>
|
|
<td class="mbox-empty-cell"></td>
|
|
<td class="mbox-text" style="">本节未完成<br />
|
|
原因：情况 5-6</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
|
|
<div class="t-li1"><span class="t-li">1-4)</span> 平均情况： <code>O(1)</code> ，最坏情况 <code>O(size())</code></div>
|
|
<div class="t-li1"><span class="t-li">5-6)</span> 平均情况： <code>O(N)</code> ，其中 N 是要插入的元素数。最坏情况： <code>O(N*size()+N)</code></div>
|
|
<div class="t-li1"><span class="t-li">7-8)</span> 平均情况： <code>O(1)</code> ，最坏情况 <code>O(size())</code></div>
|
|
<h3><span class="mw-headline" id=".E6.B3.A8.E6.84.8F">注意</span></h3>
|
|
<p>有提示插入 <span class="t-v">(3,4)</span> 不返回 bool ，这是为了与顺序容器上的定位插入，如 <span class="t-lc"><a href="cpp-container-vector-insert.html">std::vector::insert</a></span> 签名兼容。这使得可以创建泛型插入器，例如 <span class="t-lc"><a href="cpp-iterator-inserter.html">std::inserter</a></span> 。检查有提示插入是否成功的一种方式是比较插入前后的 <a href="cpp-container-unordered_map-size.html">size()</a> 。</p>
|
|
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
|
|
<div class="t-example">
|
|
<div class="t-example-live-link"></div>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="cpp source-cpp">
|
|
<pre class="de1"><span class="co2">#include <string></span>
|
|
<span class="co2">#include <iostream></span>
|
|
<span class="co2">#include <unordered_map></span>
|
|
|
|
<span class="kw4">int</span> main <span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-container-unordered_map.html"><span class="kw1293">std::<span class="me2">unordered_map</span></span></a><span class="sy1"><</span><span class="kw4">int</span>, <a href="cpp-string-basic_string.html"><span class="kw1230">std::<span class="me2">string</span></span></a><span class="sy1">></span> dict <span class="sy1">=</span> <span class="br0">{</span><span class="br0">{</span><span class="nu0">1</span>, <span class="st0">"one"</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">2</span>, <span class="st0">"two"</span><span class="br0">}</span><span class="br0">}</span><span class="sy4">;</span>
|
|
dict.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span><span class="nu0">3</span>, <span class="st0">"three"</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
dict.<span class="me1">insert</span><span class="br0">(</span><a href="cpp-utility-pair-make_pair.html"><span class="kw1097">std::<span class="me2">make_pair</span></span></a><span class="br0">(</span><span class="nu0">4</span>, <span class="st0">"four"</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
dict.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span><span class="br0">{</span><span class="nu0">4</span>, <span class="st0">"another four"</span><span class="br0">}</span>, <span class="br0">{</span><span class="nu0">5</span>, <span class="st0">"five"</span><span class="br0">}</span><span class="br0">}</span><span class="br0">)</span><span class="sy4">;</span>
|
|
|
|
<span class="kw4">bool</span> ok <span class="sy1">=</span> dict.<span class="me1">insert</span><span class="br0">(</span><span class="br0">{</span><span class="nu0">1</span>, <span class="st0">"another one"</span><span class="br0">}</span><span class="br0">)</span>.<span class="me1">second</span><span class="sy4">;</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"inserting 1 -> <span class="es1">\"</span>another one<span class="es1">\"</span> "</span>
|
|
<span class="sy1"><<</span> <span class="br0">(</span>ok <span class="sy4">?</span> <span class="st0">"succeeded"</span> <span class="sy4">:</span> <span class="st0">"failed"</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"contents:<span class="es1">\n</span>"</span><span class="sy4">;</span>
|
|
<span class="kw1">for</span><span class="br0">(</span><span class="kw4">auto</span><span class="sy3">&</span> p<span class="sy4">:</span> dict<span class="br0">)</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">" "</span> <span class="sy1"><<</span> p.<span class="me1">first</span> <span class="sy1"><<</span> <span class="st0">" => "</span> <span class="sy1"><<</span> p.<span class="me1">second</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="br0">}</span></pre></div>
|
|
</div>
|
|
<p>可能的输出：</p>
|
|
<div dir="ltr" class="mw-geshi" style="text-align: left;">
|
|
<div class="text source-text">
|
|
<pre class="de1">inserting 1 -> "another one" failed
|
|
contents:
|
|
5 => five
|
|
1 => one
|
|
2 => two
|
|
3 => three
|
|
4 => four</pre></div>
|
|
</div>
|
|
</div>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
|
|
<table class="t-dsc-begin">
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_map-emplace.html"><span class="t-lines"><span>emplace</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>原位构造元素<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_map-emplace_hint.html"><span class="t-lines"><span>emplace_hint</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>使用提示原位构造元素<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
<tr class="t-dsc">
|
|
<td>
|
|
<div class="t-dsc-member-div">
|
|
<div><a href="cpp-container-unordered_map-insert_or_assign.html"><span class="t-lines"><span>insert_or_assign</span></span></a></div>
|
|
<div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx17">(C++17)</span></span></span></div>
|
|
</div>
|
|
</td>
|
|
<td>插入元素，或若键已存在则赋值给当前元素<br />
|
|
<span class="t-mark">(公开成员函数)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|