#13394: Write a WeakValueDictionary with safer key removal
-------------------------------------+-------------------------------------
Reporter: nbruin | Owner: rlm
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.13
Component: memleak | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/SimonKing/ticket/13394 | f0ed60fbdf5f2b1c7cd15f6bab98099f4ff8b822
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by SimonKing):
I wonder: Is it really a good idea to have a dictionary storing one list
for each hash value? Granted, it does solve the problem of defunct keys in
the callback of weak values. However, storing the hash buckets similar to
what we do for `TripleDict` might turn out to be faster.
Well, I guess one should first have a version that works and is faster and
safer than `weakref.WeakValueDictionary`. And then we can further
optimise.
--
Ticket URL: <http://trac.sagemath.org/ticket/13394#comment:11>
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/groups/opt_out.
