<html>
<head>
<base href="https://bugs.llvm.org/">
</head>
<body><table border="1" cellspacing="0" cellpadding="8">
<tr>
<th>Bug ID</th>
<td><a class="bz_bug_link
bz_status_NEW "
title="NEW - Optimizing std::search function"
href="https://bugs.llvm.org/show_bug.cgi?id=35613">35613</a>
</td>
</tr>
<tr>
<th>Summary</th>
<td>Optimizing std::search function
</td>
</tr>
<tr>
<th>Product</th>
<td>libc++
</td>
</tr>
<tr>
<th>Version</th>
<td>unspecified
</td>
</tr>
<tr>
<th>Hardware</th>
<td>PC
</td>
</tr>
<tr>
<th>OS</th>
<td>All
</td>
</tr>
<tr>
<th>Status</th>
<td>NEW
</td>
</tr>
<tr>
<th>Severity</th>
<td>enhancement
</td>
</tr>
<tr>
<th>Priority</th>
<td>P
</td>
</tr>
<tr>
<th>Component</th>
<td>All Bugs
</td>
</tr>
<tr>
<th>Assignee</th>
<td>unassignedclangbugs@nondot.org
</td>
</tr>
<tr>
<th>Reporter</th>
<td>zamazan4ik@tut.by
</td>
</tr>
<tr>
<th>CC</th>
<td>llvm-bugs@lists.llvm.org, mclow.lists@gmail.com
</td>
</tr></table>
<p>
<div>
<pre>std::search can be optmized for Random Access Iterators by implementing inside
search algorithm like Boyer-Moore or Boyer-Moore-Horspool or Musser-Nishanov
algorithm (or smth faster). For Bidirectional iterators AFAIK Crochemore-Perrin
algorithm is very good.
AFAIK, now std::search use only naive search algortihm. Can be it improved?
P.S. I know about changes in C++17 new search algorithms, but i suggest use the
most efficient version for every type of iterators.
P.S.S Efficient algorithms you can find in Seqan library and in
Boost.Algorithm.</pre>
</div>
</p>
<hr>
<span>You are receiving this mail because:</span>
<ul>
<li>You are on the CC list for the bug.</li>
</ul>
</body>
</html>