#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:
Jeroen Demeyer | Commit:
Report Upstream: N/A | d22c1ca23727402e376c7f772c2f51b8ed6af1f1
Branch: | Stopgaps:
u/jdemeyer/ticket/15820 |
Dependencies: #17195, #17196 |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Replying to [comment:254 jdemeyer]:
> My intention for this ticket is to implement an additional function
`biseq_setitem()` to set one item and then implement the `biseq` functions
using either `biseq_getitem()/biseq_setitem()` or `bitset` functions. In
cases where this cannot be done, add the required primitives and use
those. The end result will hopefully be a lot less code without loss of
efficiency.
Are you sure that, e.g., iteration will not be a lot slower when doing
almost the same shift operation repeatedly for all items contained in a
single limb?
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:256>
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.
