#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:
Authors: Simon King | Work issues: Rework by using
Report Upstream: N/A | Sage's existing bitset code
Branch: | Commit:
u/SimonKing/ticket/15820 | 6dfb1cb1c6dc5704e2a8918cf2aeabdd8dbef69a
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
I do need a bit more for `biseq_t` than what is provided by `bitset_t`.
For example, I need to store the information how many bits are required to
store one item on the list. But anyway, I will now try to rewrite my code.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:154>
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.
