https://bugs.llvm.org/show_bug.cgi?id=35613
Bug ID: 35613
Summary: Optimizing std::search function
Product: libc++
Version: unspecified
Hardware: PC
OS: All
Status: NEW
Severity: enhancement
Priority: P
Component: All Bugs
Assignee: unassignedclangb...@nondot.org
Reporter: zamazan...@tut.by
CC: llvm-bugs@lists.llvm.org, mclow.li...@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
Boost.Algorithm.
--
You are receiving this mail because:
You are on the CC list for the bug._______________________________________________
llvm-bugs mailing list
llvm-bugs@lists.llvm.org
http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-bugs
