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

📄 unique_copy.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>unique_copy</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++ Algorithms</a> &gt; <a href=    "unique_copy.html">unique_copy</a>  </div>  <div class="name-format">    unique_copy  </div>  <div class="syntax-name-format">    Syntax:  </div>  <pre class="syntax-box">  #include &lt;algorithm&gt;  iterator unique_copy( iterator start, iterator end, iterator result );  iterator unique_copy( iterator start, iterator end, iterator result, BinPred p );</pre>  <p>The unique_copy() function copies the range  [<em>start</em>,<em>end</em>) to <em>result</em>, removing all  consecutive duplicate elements. If the binary predicate <em>p</em> is  provided, then it is used to test two elements to see if they are  duplicates.</p>  <p>The return value of unique_copy() is an iterator to the end of the  new range.</p>  <p>unique_copy() runs in <a href="../complexity.html">linear  time</a>.</p>  <div class="related-name-format">    Related topics:  </div>  <div class="related-content">    <a href="adjacent_find.html">adjacent_find</a><br>    <a href="remove.html">remove</a><br>    <a href="unique.html">unique</a>  </div>  </div>  </td>    </tr>  </table></body></html>

⌨️ 快捷键说明

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