#715: Parents probably not reclaimed due to too much caching
------------------------+---------------------------------------------------
Reporter: robertwb | Owner: somebody
Type: defect | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: coercion | Keywords: weak cache coercion
Work_issues: | Upstream: N/A
Reviewer: | Author: Simon King
Merged: | Dependencies: #9138, #11900
------------------------+---------------------------------------------------
Comment(by SimonKing):
I don't know why the patchbot keeps trying to apply ''all'' patches.
Anyway. First experiments show that a `MonoDict` (which would be my name
for a dictionary that uses weak keys, compares the keys by identity and
expect a singly item as a key) is a lot faster than a usual dictionary, if
the keys are frequently used parents such as finite fields. "A lot" means:
More than 20 times faster.
I will simply try whether things still work when I replace dictionaries by
`MonoDict` in the coercion model. If they do, I'll post here. If there are
difficult problems, I'll move it to a different ticket.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/715#comment:132>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
