#14073: Cache a bounded number of recently-created parents.
-----------------------------------+----------------------------------------
Reporter: robertwb | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.7
Component: memleak | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: Robert Bradshaw | Merged in:
Dependencies: | Stopgaps:
-----------------------------------+----------------------------------------
Comment (by robertwb):
Replying to [comment:2 nbruin]:
> Apart from fixing `len(recently_created)` at compile-time this may well
be a good idea.
len(list) is really fast, much faster than creating a parent, and allows
our list to possibly grow or shrink in the future.
> Main objections:
> - It will make debugging that much harder. Given that doctests are
small, the parent deletion code will hardly be exercised.
> - Do we have good use-cases that show clear benefit from this approach?
Given that the frequency of garbage collection in python is rather low,
I'd expect that parents will relatively often still be around if they are
required soon after deletion.
I actually agree with both of these objections; I don't think this code
should go in unless it's clearly shown to be a problem.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/14073#comment:3>
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?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
