New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add computation of longest commons extensions in a word #23131
Comments
New commits:
|
Commit: |
comment:4
You should put spaces between your operators (e.g., - INPUTS:
{ INPUT:
- x,y - positions in self
+ - ``x``, ``y`` -- positions in ``self``
- EXAMPLES:
+ EXAMPLES:: |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:7
Three additional comments, but once addressed, then this will be ready for a positive review.
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Reviewer: Travis Scrimshaw |
comment:9
I have made a last few little changes to the doc and made the doctests pass (specifically, indices are 0-based). If you agree with my changes, then positive review. New commits:
|
comment:10
Would it be worth the effort to modify the code to allow negative positions, indicating distance from the end of the word (the way that Python lists work) ? |
comment:11
I think that would complicate things, but I don't have uses for this code, so I have fundamentally no position on the matter. However, it would be consistent with words, e.g., |
Changed keywords from words to words, days88, IMA coding sprints |
comment:13
should work, right? |
Changed keywords from words, days88, IMA coding sprints to words |
Changed keywords from words to words, days88, IMA coding sprints |
comment:14
No, you need
So you need to be slightly more careful. |
comment:15
should work, right? |
comment:16
I think that should work. |
Branch pushed to git repo; I updated commit sha1. New commits:
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:19
I implemented Kevin's suggestion (except that I used |
Changed reviewer from Travis Scrimshaw to Travis Scrimshaw, Franco Saliola |
comment:20
LGTM. |
Changed branch from public/combinat/words/longest_common_extension-23131 to |
Add two methods to compute the longest commons extensions in forward and backward direction in a word.
Component: combinatorics
Keywords: words, days88, IMA coding sprints
Author: Émile Nadeau
Branch/Commit:
7ee5699
Reviewer: Travis Scrimshaw, Franco Saliola
Issue created by migration from https://trac.sagemath.org/ticket/23131
The text was updated successfully, but these errors were encountered: