#17920: Reimplement IntegerLists using Polyhedron.integral_points()
-------------------------------------+-------------------------------------
Reporter: jdemeyer | Owner:
Type: enhancement | Status: needs_review
Priority: blocker | Milestone: sage-6.6
Component: combinatorics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/jdemeyer/ticket/17920 | b0a04aa5a4454766ed9802d8e99abcd7fb3e105b
Dependencies: #17937 | Stopgaps:
-------------------------------------+-------------------------------------
Changes (by tscrim):
* cc: nthiery (added)
Comment:
On the ordering, from the title of the class, the output should be in
lexicographical order. Moreover, since these are `EnumeratedSets`, the
change in the ordering could lead to subtle changes that breaks people's
code.
`Compositions` also does a similar thing with the max length and `outer`,
so I agree that those should be empty. However IMO these tests should be
in `Compositions`.
@vdelecroix It's mostly correct and there is a lot of code which depends
on this being fast. Minimal slowdowns are okay (IMO), but significant
slowdowns are unacceptable.
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:33>
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.
