⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 insert.html

📁 从www.CppReference.com打包的C++参考手册
💻 HTML
字号:
<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"><html><head>  <meta name="generator" content=  "HTML Tidy for Linux/x86 (vers 1 September 2005), see www.w3.org">  <title>insert</title>  <link href="../cppreference.css" rel="stylesheet" type="text/css"></head><body><table>  <tr>  <td>  <div class="body-content">  <div class="header-box">    <a href="../index.html">cppreference.com</a> &gt; <a href=    "index.html">C++ Sets</a> &gt; <a href="insert.html">insert</a>  </div>  <div class="name-format">    insert  </div>  <div class="syntax-name-format">    Syntax:  </div>  <pre class="syntax-box">  #include &lt;set&gt;  iterator insert( iterator i, const <a href="../containers.html">TYPE</a>&amp; val );  void insert( <a href="../iterators.html">input_iterator</a> start, <a href="../iterators.html">input_iterator</a> end );  pair&lt;iterator,bool&gt; insert( const <a href="../containers.html">TYPE</a>&amp; val );</pre>  <p>The function insert() either:</p>  <ul>    <li>inserts <em>val</em> after the element at <em>pos</em> (where    <em>pos</em> is really just a suggestion as to where <em>val</em>    should go, since sets and maps are ordered), and returns an    iterator to that element.</li>    <li>inserts a range of elements from <em>start</em> to    <em>end</em>.</li>    <li>inserts <em>val</em>, but only if <em>val</em> doesn&#39;t    already exist. The return value is an iterator to the element    inserted, and a boolean describing whether an insertion took    place.</li>  </ul>  <div class="related-name-format">    Related topics:  </div>  <div class="related-content">    (C++ Maps) <a href="../cppmap/map_operators.html">Map operators</a>  </div>  </div>  </td>    </tr>  </table></body></html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -