#15820: Implement sequences of bounded integers
-------------------------------------+-------------------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.3
Component: algebra | Resolution:
Keywords: sequence bounded | Merged in:
integer | Reviewers:
Authors: Simon King | Work issues: Document cdef
Report Upstream: N/A | functions
Branch: | Commit:
u/SimonKing/ticket/15820 | efef80bea22840f618335b7dd6f5d3e9a64fa301
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by fredrik.johansson):
If you use mpz functions, then getting/setting a single entry will be O(n)
instead of O(1), and iterating over all entries or creating a sequence
from a list of integers will be O(n^2^) instead of O(n). This makes the
implementation rather useless for a lot of applications where a datatype
like this would be useful (say if you want to store a million small
integers in a memory-efficient way). With mpn functions, you can get the
optimal complexity.
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:61>
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.
