Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Boyer–Moore string-search algorithm
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Implementations== Various implementations exist in different programming languages. In [[C++]] it is part of the Standard Library since C++17 and [[Boost (C++ libraries)|Boost]] provides the [http://www.boost.org/doc/libs/1_58_0/libs/algorithm/doc/html/algorithm/Searching.html#the_boost_algorithm_library.Searching.BoyerMoore generic Boyer–Moore search] implementation under the ''Algorithm'' library. In [[Go (programming language)]] there is an implementation in [https://golang.org/src/strings/search.go search.go]. [[D (programming language)]] uses a [http://dlang.org/phobos/std_algorithm_searching.html#boyerMooreFinder BoyerMooreFinder] for predicate based matching within ranges as a part of the Phobos Runtime Library. The Boyer–Moore algorithm is also used in [[GNU]]'s [[grep]].<ref>{{cite web| url=https://lists.freebsd.org/pipermail/freebsd-current/2010-August/019310.html |title=why GNU grep is fast |website=FreeBSD-current mailing list archive |date=21 August 2010 |first=Mike |last=Haertel}}</ref>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)