#11943: The category graph should comply with Python's method resolution order
---------------------------+------------------------------------------------
Reporter: SimonKing | Owner: nthiery
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.7.3
Component: categories | Keywords: category graph, method resolution
order
Work_issues: | Upstream: N/A
Reviewer: | Author: Simon King
Merged: | Dependencies: #11900
---------------------------+------------------------------------------------
Comment(by SimonKing):
I tried to track down the regression of `all_super_categories`. Recall
that my patch from #11900 did improve the implementation of
`all_super_categories`, but did not change the algorithm.
With #11900, the main work is done in `_all_super_categories_raw`. With
the patch from here, the work is done in `c3_algorithm` - and according to
%prun, ''less'' time is spent in `c3_algorithm` than it was in
`_all_super_categories_raw`. However, more time is spent in the expression
{{{
C.all_super_categories() for C in self.super_categories()
}}}
I guess I have to improve the implementation of the recursion.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11943#comment:5>
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.
