Feature/longest increasing substring #6
Conversation
This file contains hidden or 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
…. Fix. Clean. Doc.
….com/MarekKurdej/algorithm into feature/longest-increasing-substring Conflicts: include/boost/algorithm/searching/longest_increasing_substring.hpp test/Jamfile.v2 test/substring_test1.cpp
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Hi, I have written a new search algorithm: longest increasing substring that permits as well to find the longest decreasing/non-increasing/non-decreasing or differently ordered substring by defining comparison predicate. I have added tests for it using iterators, ranges, pointers and object's operator().
I am working on other algorithms: longest increasing subsequence and Aho-Corasick (multi-pattern) search.
The code itself is done, it needs writing more tests only.
I will create a PR for them soon.