#13394: Write a WeakValueDictionary with safer key removal
-------------------------------------+-------------------------------------
Reporter: nbruin | Owner: rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.13
Component: memleak | Resolution:
Keywords: | Merged in:
Authors: Simon King | Reviewers:
Report Upstream: None of the above | Work issues:
- read trac for reasoning. | Commit:
Branch: | fab0ed4112b9f798e2690f4c885b57cd711ea698
u/SimonKing/ticket/13394 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
A guess: Inside of the iteration context invoked by `__getitem__`, I have
of course to do a comparison of the given key with the previously existing
keys. Could it be that comparison needs certain data to be computed, and
this computation will call `__setitem__`?
But then I wonder: How does a straight Python dict prevents this from
happening? I.e., if a hash bucket `B` is searched for equality with a key
`K`, how does Python make sure that the comparison with `K` does not
change the length of `B`?
--
Ticket URL: <http://trac.sagemath.org/ticket/13394#comment:46>
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.
