#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 vdelecroix):
Replying to [comment:18 tscrim]:
> I think it is good to have access to multiple implementations since
onemight be faster in certain situations and it makes for easier testing.
In the present case `itertools` is always faster and I think people should
use itertools directly.
> At the very least, it doesn't do any harm being there IMO. (There's also
a president for doing this with other such functions.)
Yes it does. This is one more function in the global namespace, one more
file to maintain.
--
Ticket URL: <http://trac.sagemath.org/ticket/13982#comment:19>
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.
