#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:
Report Upstream: N/A | Commit:
Branch: | 3d293b96fa5a584684efbaae8fe667b885618797
u/SimonKing/ticket/15820 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Replying to [comment:220 SimonKing]:
> Replying to [comment:217 jdemeyer]:
> > ...or perhaps easier: when given a length of zero, just make the
bitset have length 1 as special case.
>
> I am not sure if I want this, since in some cases (at least in my
applications) I ask `self.data.size` for the bitlength of the sequence,
and thus I would need other special cases there.
I would prefer not to assume that `data.size == length * itembitsize`. For
example, it might turn out to be more efficient to store some extra bits
(1 extra limb for example).
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:222>
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.
