#15919: unrank via R[i] conflicts with notation for constructing polynomial
rings
in CartesianProduct
-------------------------------------+-------------------------------------
Reporter: darij | Owner:
Type: defect | Status: positive_review
Priority: major | Milestone: sage-6.2
Component: algebra | Resolution:
Keywords: notation, | Merged in:
algebra, polynomial | Reviewers: Travis Scrimshaw
Authors: Nicolas M. Thiéry | Work issues:
Report Upstream: N/A | Commit:
Branch: | 79d469861431ac8d6be5ad4edeace1c6ac8a62c8
u/tscrim/ticket/15919 | Stopgaps:
Dependencies: |
-------------------------------------+-------------------------------------
Comment (by darij):
The only thing that somewhat worries me is the speed. Before:
{{{
sage: T = range(20)
sage: C = CartesianProduct(T,T,T)
sage: %timeit C.unrank(3)
100000 loops, best of 3: 15 µs per loop
}}}
After:
{{{
sage: T = range(20)
sage: C = CartesianProduct(T,T,T)
sage: %timeit C.unrank(3)
10000 loops, best of 3: 35.5 µs per loop
}}}
(These timings are fairly independent on the 20 and the 3...)
I don't know how often this unranking is used, though.
--
Ticket URL: <http://trac.sagemath.org/ticket/15919#comment:23>
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.
