#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:
-------------------------------------+-------------------------------------
Comment (by jdemeyer):
Replying to [comment:44 ncohen]:
> > Interestingly, arithmetic with infinity also shows up quite high in
the profiling reports (up to 10% of the time), so optimizing
`src/sage/rings/infinity.py` will also give some speedup.
>
> Aahahah. Yaeh, Vincent has been fighting a lot with some abstractions we
have, which makes code run *much* slower. For `+oo` he advises to solve
the problem by using float("inf") instead of Infinity.
In general, I don't like the "X is slow, therefore let's not use X"
mentality. My idea is: "let's use X and then optimize X".
--
Ticket URL: <http://trac.sagemath.org/ticket/17920#comment:45>
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.
