#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: Simon King
Authors: Simon King, | Work issues:
Jeroen Demeyer | Commit:
Report Upstream: N/A | 6e03f19d4bc2379e44e0b8adc32c13ac6e0bcabb
Branch: | Stopgaps:
u/SimonKing/ticket/15820 |
Dependencies: #17195, #17196 |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Replying to [comment:309 jdemeyer]:
> In `biseq_slice`, the case `step == 1` should also be implemented using
bitset primitives.
Problem: We would need a bitset primitive that shifts a ''part'' of a
bitset S. Currently, `bitset_rshift` shifts all of S, not just a part of
S.
I see four ways to proceed:
- Write a new primitive `bitset_rshift_subset`, which means code
duplication
- Add an optional argument to `bitset_rshift`, which means that all places
using this function must be changed.
- Change `bitset_rshift` so that no assumption on the size of source and
target are needed: We just shift the minimum of the number of limbs that
is available in the source and of the number of limbs that fits into the
target.
- Do not use bitset primitives in `biseq_slice`.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:320>
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.
