#15673: major improvements to lazy power series
-------------------------------------+-------------------------------------
Reporter: mhansen | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: LazyPowerSeries,, | Merged in:
days57 | Reviewers: Ralf Stephan,
Authors: Mike Hansen | Matthieu Dien
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/ticket/15673 | 5478a2de727c686fd1d892ea8186d54b8d839daa
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by vdelecroix):
Hello,
#16137 is in the process of being reviewed. Note that it will just be a
fast and flexible data structures for (finite or infinite) list like
objects. Features:
- it is very lazy (zero computation at instanciation)
- it is a tiny Cython wrapper above list and is hence very fast to access
the cached values
- definition can be recursive and involve other lazy lists
- there is no such thing as "ultimately constant lazy list" or "compute
with no cache lazy list"
- they are currently immutable (which allows to share memory for slices)
Vincent
--
Ticket URL: <http://trac.sagemath.org/ticket/15673#comment:38>
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 https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
