180 lines
16 KiB
HTML
180 lines
16 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::boyer_moore_horspool_searcher</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_utility_functional_boyer_moore_horspool_searcher 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::</span>boyer_moore_horspool_searcher</h1>
|
|
<div id="bodyContent">
|
|
<div id="contentSub"><span class="subpages">< <a href="cpp.html">cpp</a>‎ | <a href="cpp-utility.html">utility</a>‎ | <a href="cpp-utility-functional.html">functional</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-dsc-header">
|
|
<td>
|
|
<div>定义于头文件 <code><a href="cpp-header-functional.html"><functional></a></code></div>
|
|
</td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
<tr class="t-dcl t-since-cxx17">
|
|
<td>
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> RandomIt1,<br /></span>
|
|
<p> <span class="kw1">class</span> Hash <span class="sy1">=</span> <a href="cpp-utility-hash.html"><span class="kw1122">std::<span class="me2">hash</span></span></a><span class="sy1"><</span><span class="kw1">typename</span> <a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>RandomIt1<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span><span class="sy1">></span>,<br />
|
|
<span class="kw1">class</span> BinaryPredicate <span class="sy1">=</span> <a href="cpp-utility-functional-equal_to.html"><span class="kw1035">std::<span class="me2">equal_to</span></span></a><span class="sy1"><></span> <span class="sy1">></span><br /></p>
|
|
<span class="kw1">class</span> boyer_moore_horspool_searcher<span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></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>适用于 <span class="t-lc"><a href="cpp-algorithm-search.html">std::search</a></span> 的<a href="https://zh.cppreference.com/mwiki/index.php?title=cpp/named_req/Searcher&action=edit&redlink=1" class="new" title="cpp/named req/Searcher（页面不存在）"><span style="font-style:italic">搜索器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Searcher)</span></a> 的重载，实现了 <a rel="nofollow" class="external text" href="https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool_algorithm">Boyer-Moore-Horspool 字符串搜索算法</a>。</p>
|
|
<p><code>boyer_moore_horspool_searcher</code> 为<a href="cpp-named_req-CopyConstructible.html"><span style="font-style:italic">可复制构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyConstructible)</span></a> 及<a href="cpp-named_req-CopyAssignable.html"><span style="font-style:italic">可复制赋值</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyAssignable)</span></a> 。</p>
|
|
<p><code>RandomIt1</code> 必须满足<a href="cpp-named_req-RandomAccessIterator.html"><span style="font-style:italic">老式随机访问迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyRandomAccessIterator)</span></a> 的要求。</p>
|
|
<h3><span class="mw-headline" id=".E6.88.90.E5.91.98.E5.87.BD.E6.95.B0">成员函数</span></h3>
|
|
<div class="t-member">
|
|
<h2><span class="mw-headline" id="std::boyer_moore_horspool_searcher::boyer_moore_horspool_searcher"><span style="font-size:0.7em; line-height:130%">std::boyer_moore_horspool_searcher::</span>boyer_moore_horspool_searcher</span></h2>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl">
|
|
<td class="t-dcl-nopad">
|
|
<div><span class="mw-geshi cpp source-cpp">boyer_moore_horspool_searcher<span class="br0">(</span> RandomIt1 pat_first,<br /></span>
|
|
<p> RandomIt1 pat_last,<br />
|
|
Hash hf <span class="sy1">=</span> Hash<span class="br0">(</span><span class="br0">)</span>,<br /></p>
|
|
BinaryPredicate pred <span class="sy1">=</span> BinaryPredicate<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p>通过存储 <code>pat_first</code> 、 <code>pat_last</code> 、 <code>hf</code> 和 <code>pred</code> 的副本构造一个 <code>boyer_moore_horspool_searcher</code> ，安装任何需要的内部数据结构。</p>
|
|
<p><code>RandomIt1</code> 的值必须是<a href="cpp-named_req-DefaultConstructible.html"><span style="font-style:italic">可默认构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(DefaultConstructible)</span></a> 、<a href="cpp-named_req-CopyConstructible.html"><span style="font-style:italic">可复制构造</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyConstructible)</span></a> 及<a href="cpp-named_req-CopyAssignable.html"><span style="font-style:italic">可复制赋值</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(CopyAssignable)</span></a> 。</p>
|
|
<p>对于任意二个 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="cpp-iterator-iterator_traits.html"><span class="kw651">std::<span class="me2">iterator_traits</span></span></a><span class="sy1"><</span>RandomIt1<span class="sy1">></span><span class="sy4">::</span><span class="me2">value_type</span></span></span> 类型的值 <code>A</code> 和 <code>B</code> ，若 <span class="t-c"><span class="mw-geshi cpp source-cpp">pred<span class="br0">(</span>A, B<span class="br0">)</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> ，则 <span class="t-c"><span class="mw-geshi cpp source-cpp">hf<span class="br0">(</span>A<span class="br0">)</span> <span class="sy1">==</span> hf<span class="br0">(</span>B<span class="br0">)</span></span></span> 应为 <code>true</code> 。</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>pat_first, pat_last</td>
|
|
<td>-</td>
|
|
<td>表示要搜索的字符串的一对迭代器</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>hf</td>
|
|
<td>-</td>
|
|
<td>用于哈希字符串元素的可调用对象</td>
|
|
</tr>
|
|
<tr class="t-par">
|
|
<td>pred</td>
|
|
<td>-</td>
|
|
<td>确定相等的可调用对象</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E5.BC.82.E5.B8.B8">异常</span></h3>
|
|
<p>任何会为下列者抛出的异常</p>
|
|
<ul>
|
|
<li><code>RandomIt1</code> 的复制构造函数；</li>
|
|
<li><code>RandomIt1</code> 的 value_type 的默认构造函数、复制构造函数或复制赋值运算符；或</li>
|
|
<li><code>BinaryPredicate</code> 或 <code>Hash</code> 的复制构造函数或函数调用运算符.</li>
|
|
</ul>
|
|
<p>若为内部数据结构请求的附加内存无法分配，则亦可能抛出 <span class="t-lc"><a href="cpp-memory-new-bad_alloc.html">std::bad_alloc</a></span> 。</p>
|
|
</div>
|
|
<div class="t-member">
|
|
<h2><span class="mw-headline" id="std::boyer_moore_horspool_searcher::operator.28.29"><span style="font-size:0.7em; line-height:130%">std::boyer_moore_horspool_searcher::</span>operator()</span></h2>
|
|
<table class="t-dcl-begin">
|
|
<tbody>
|
|
<tr class="t-dcl">
|
|
<td class="t-dcl-nopad">
|
|
<div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1"><</span> <span class="kw1">class</span> RandomIt2 <span class="sy1">></span><br />
|
|
<a href="cpp-utility-pair.html"><span class="kw1094">std::<span class="me2">pair</span></span></a><span class="sy1"><</span>RandomIt2,RandomIt2<span class="sy1">></span> operator<span class="br0">(</span><span class="br0">)</span><span class="br0">(</span> RandomIt2 first, RandomIt2 last <span class="br0">)</span> <span class="kw4">const</span><span class="sy4">;</span></span></div>
|
|
</td>
|
|
<td class="t-dcl-nopad"></td>
|
|
<td class="t-dcl-nopad"></td>
|
|
</tr>
|
|
<tr class="t-dcl-sep">
|
|
<td></td>
|
|
<td></td>
|
|
<td></td>
|
|
</tr>
|
|
</tbody>
|
|
</table>
|
|
<p><span class="t-lc"><a href="cpp-algorithm-search.html">std::search</a></span> 的搜索器（Searcher）重载调用的该成员函数，以进行用此搜索器的搜索。 <code>RandomIt2</code> 必须满足<a href="cpp-named_req-RandomAccessIterator.html"><span style="font-style:italic">老式随机访问迭代器</span> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyRandomAccessIterator)</span></a> 的要求。</p>
|
|
<p><code>RandomIt1</code> 与 <code>RandomIt2</code> 必须拥有相同的值类型。</p>
|
|
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0_2">参数</span></h3>
|
|
<table class="t-par-begin">
|
|
<tr class="t-par">
|
|
<td>first, last</td>
|
|
<td>-</td>
|
|
<td>指代要被检验的字符串的一对迭代器</td>
|
|
</tr>
|
|
</table>
|
|
<h3><span class="mw-headline" id=".E8.BF.94.E5.9B.9E.E5.80.BC">返回值</span></h3>
|
|
<p>若模式（ <span class="texhtml" style="white-space: nowrap;">[pat_first, pat_last)</span> ）为空，则返回 <code>make_pair(first, first)</code> 。</p>
|
|
<p>否则，返回于 <span class="texhtml" style="white-space: nowrap;">[first, last)</span> 中指向首及尾后一位的一对迭代器，其中定位了与 <span class="texhtml" style="white-space: nowrap;">[pat_first, pat_last)</span> 由 <code>pred</code> 所定义比较相等的子序列，否则返回 <code>make_pair(last, last)</code> 。</p>
|
|
</div>
|
|
<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 <iostream></span>
|
|
<span class="co2">#include <string></span>
|
|
<span class="co2">#include <algorithm></span>
|
|
<span class="co2">#include <functional></span>
|
|
|
|
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
|
|
<span class="br0">{</span>
|
|
<a href="cpp-string-basic_string.html"><span class="kw1228">std::<span class="me2">string</span></span></a> in <span class="sy1">=</span> <span class="st0">"Lorem ipsum dolor sit amet, consectetur adipiscing elit,"</span>
|
|
<span class="st0">" sed do eiusmod tempor incididunt ut labore et dolore magna aliqua"</span><span class="sy4">;</span>
|
|
<a href="cpp-string-basic_string.html"><span class="kw1228">std::<span class="me2">string</span></span></a> needle <span class="sy1">=</span> <span class="st0">"pisci"</span><span class="sy4">;</span>
|
|
<span class="kw4">auto</span> it <span class="sy1">=</span> <a href="cpp-algorithm-search.html"><span class="kw1578">std::<span class="me2">search</span></span></a><span class="br0">(</span>in.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, in.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>,
|
|
std<span class="sy4">::</span><span class="me2">boyer_moore_horspool_searcher</span><span class="br0">(</span>
|
|
needle.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, needle.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
|
|
<span class="kw1">if</span><span class="br0">(</span>it <span class="sy3">!</span><span class="sy1">=</span> in.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1756">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"The string "</span> <span class="sy1"><<</span> needle <span class="sy1"><<</span> <span class="st0">" found at offset "</span>
|
|
<span class="sy1"><<</span> it <span class="sy2">-</span> in.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1"><<</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
|
|
<span class="kw1">else</span>
|
|
<a href="cpp-io-cout.html"><span class="kw1756">std::<span class="me2">cout</span></span></a> <span class="sy1"><<</span> <span class="st0">"The string "</span> <span class="sy1"><<</span> needle <span class="sy1"><<</span> <span class="st0">" not found<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">The string pisci found at offset 43</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-algorithm-search.html"><span class="t-lines"><span>search</span></span></a></div>
|
|
</div>
|
|
</td>
|
|
<td>搜索一个元素范围<br />
|
|
<span class="t-mark">(函数模板)</span></td>
|
|
</tr>
|
|
</table>
|
|
</div>
|
|
<div class="visualClear"></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</body>
|
|
</html>
|