[llvm-bugs] [Bug 35613] New: Optimizing std::search function
llvm-bugs at lists.llvm.org
Sun Dec 10 13:22:01 PST 2017
Bug ID: 35613
Summary: Optimizing std::search function
Component: All Bugs
Assignee: unassignedclangbugs at nondot.org
Reporter: zamazan4ik at tut.by
CC: llvm-bugs at lists.llvm.org, mclow.lists at gmail.com
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
You are receiving this mail because:
You are on the CC list for the bug.
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the llvm-bugs