#6484: sage.combinat.ranker improvements
-------------------------------------+-------------------------------------
Reporter: nthiery | Owner: nthiery
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-6.4
Component: combinatorics | Resolution:
Keywords: rank, unrank | Merged in:
Authors: Nicolas M. Thiéry | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/nthiery/sage_combinat_ranker_improvements|
32d5cea664e153895d663b5913e45d03b8c0a305
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
I'm okay with the hashability as we assume all elements to be hashable,
nor is picklability important to me. However this now makes
`rank_from_list` to be the `O(n)` function, and the function itself is not
cached. So for large lists (or worse, say for a crystal where iteration is
relatively expensive), this could lead to a pretty large slowdown. How
about we just return the original implementation of `rank` as a cached
function?
--
Ticket URL: <http://trac.sagemath.org/ticket/6484#comment:11>
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/d/optout.
