#15820: Implement sequences of bounded integers
-------------------------------------+-------------------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: algebra | Resolution:
Keywords: sequence bounded | Merged in:
integer | Reviewers: Jeroen Demeyer, Simon
Authors: Simon King, | King
Jeroen Demeyer | Work issues: interrupt handling
Report Upstream: N/A | Commit:
Branch: | 8db9f6542a54ead67c1df3d069103b620e85eea6
u/jdemeyer/ticket/15820 | Stopgaps:
Dependencies: #17195, #17196 |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
And one thing is not correct in the description of
`biseq_reverse_contains`:
{{{
Return ``i`` such that the bounded integer sequence ``S1`` starts with
the sequence ``S2[i:]``, where ``start <= i < S2.length``, or return
``-1`` if no such ``i`` exists.
}}}
If you apply the function (whatever it is named) to `<2,3,2,3,1>` and
`<1,2,3,2,3>` (I just notice that you also exchanged the rôles of `S1` and
`S2`!), then I want it to yield the ''maximal'' overlap: It should return
1, not 3. That's not clear from the new description.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:352>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
