#13991: Mitigate speed regressions in symmetric function related code due to
#12313
---------------------------------+------------------------------------------
Reporter: nbruin | Owner: sage-combinat
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.7
Component: combinatorics | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by SimonKing):
Great! When implementing comparison of `UniqueRepresentation` via the
`__richcmp__` method of a cdef class, one gets:
{{{
sage: P = Partitions(1)
sage: Q = Partitions(4)
sage: %timeit P==Q
625 loops, best of 3: 696 ns per loop
sage: %timeit P is Q
625 loops, best of 3: 318 ns per loop
}}}
Still, I am not totally happy that it takes longer than 400 ns, but
certainly 696 ns is a lot better than 2.33 µs. I will try to make cythoned
unique representations work, but that will be on a different ticket.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13991#comment:21>
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.
