#14711: Weak references in the coercion graph
-------------------------------------+-------------------------------------
Reporter: jpflori | Owner: davidloeffler
Type: defect | Status: needs_review
Priority: critical | Milestone: sage-6.1
Component: number fields | Resolution:
Keywords: memleak, number | Merged in:
field, QuadraticField | Reviewers: Jean-Pierre Flori
Authors: Simon King | Work issues:
Report Upstream: N/A | Commit:
Branch: | 0af59ea93689cb6abb9d3fae0f1cf11f2aee5cca
u/jpflori/ticket/14711 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by SimonKing):
Replying to [comment:177 tscrim]:
> > Yes, but it is an interesting idea. Given the difficulties in #15303,
it would actually be worth while to go beyond and create an actual digraph
for dealing both with the search for coerce maps (and given an actual
graph, it might be easier to instrument graph algorithms) and strong/weak
references, caching of maps and so on.
>
> I was thinking it was outside of the scope of this ticket, but wasn't
sure from the discussion if something like that was needed as a
dependency.
No, it is more the other way around: Here, we lay the ground for building
a coercion framework without undue lifetime implications. At least this is
my viewpoint on this ticket.
--
Ticket URL: <http://trac.sagemath.org/ticket/14711#comment:179>
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.
