New search algorithms for Boost.Algorithm #29
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Added quick search, Raita search, Tuned Boyer-Moore, Turbo Boyer-Moore, Zhu-Takaoka. Refactored Apostolico-Crochemore.
|
Soon i will rewrite preBmBc - it should use unordered_map\flat_map instead of alphabet array. Also I will add object interface. |
|
I think i should stop implement new algorithms. We should decide, what interface must have all of these algorithms. After that i will continue my work on searching. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Now in Boost.Algorithm we have only 3 algortihms for searching: Knuth-Morris-Prata, Boyer-Moore, Boyer-Moore-Horspool.
I want to add more algorithms.
Please, if you know something about string search algortihms, i want to talk with you.