#13982: rewrite sage.combinat.combinat.unordered_tuples using
itertools.combinations_with_replacement
-------------------------------------+-------------------------------------
Reporter: nbruin | Owner: sage-combinat
Type: enhancement | Status: needs_review
Priority: minor | Milestone: sage-6.5
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Travis Scrimshaw | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
public/combinat/rewrite_unordered_tuples-13982|
3c0c50adb02c5046a9b26273498c1f56eee9385e
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by tscrim):
@ncohen Even if you could show it is always slower (large sets can behave
very differently, so it's not obvious to me), it makes it better testing
because they are independent algorithms (although it is highly unlikely
one of the algorithms has a bug).
@vdelecroix Sorry, I interpreted the "this" as my branch.
--
Ticket URL: <http://trac.sagemath.org/ticket/13982#comment:24>
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.
