#7420: Fix uncaught infinite loop in coercion discovery
--------------------------------------------------+-------------------------
Reporter: nthiery | Owner: mhansen
Type: defect | Status: needs_review
Priority: blocker | Milestone: sage-4.2.1
Component: coercion | Keywords: coercion
Work_issues: | Author: Mike Hansen
Reviewer: Nicolas M. Thiéry, Robert Bradshaw | Merged:
--------------------------------------------------+-------------------------
Comment(by nthiery):
Replying to [comment:3 robertwb]:
> Yes, calling _register_pair would work here
I gave it a shot, and this works almost fine: all sage tests pass; except
that for jack polynomials. Looking at it, it appears that the coercion
model is picking a path which is *really* far from the shortest (see the
attached log). The previous version was doing reasonably. This sounds like
a pure piece of luck though, since in both cases, the strategy seems to be
depth first search + limited selection among the first conversions found.
Robert, Mike: from here, I see two options:
- Either you spot something stupid I did in the second version of the
patch, and then we go for it after fixing it.
- Or we go for the first version of the patch for the moment (after
applying Robert's suggestion for better indentation)
In both cases, after the category patches are in, we should definitely
rewrite the coercion lookup to use a breath first search.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7420#comment:4>
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
-~----------~----~----~----~------~----~------~--~---
