#15820: Implement sequences of bounded integers
-------------------------------------+-------------------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: algebra | Resolution:
Keywords: sequence bounded | Merged in:
integer | Reviewers: Simon King
Authors: Simon King, | Work issues:
Jeroen Demeyer | Commit:
Report Upstream: N/A | 41c40cf2c59734e7e665ba9c2350da2930c9cc8e
Branch: | Stopgaps:
u/SimonKing/ticket/15820 |
Dependencies: #17195, #17196 |
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
I am going to leave this ticket alone for at least a few days.
I do think there is still a lot of improvement, mainly simplification:
1. Implement `biseq_setitem()` and use that in a lot of places.
2. Implement `mpn_equal_bits_shifted()` to compare bit patterns
efficiently for equality and use this for `biseq_max_overlap` and
`biseq_contains`.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:279>
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.
