#11849: ppl.pyx test takes a very long time contrary to what is claimed
--------------------------+-------------------------------------------------
Reporter: jdemeyer | Owner: was
Type: defect | Status: new
Priority: blocker | Milestone: sage-4.7.2
Component: interfaces | Keywords: Parma Polyhedra Library
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
--------------------------+-------------------------------------------------
Comment(by jdemeyer):
Replying to [comment:2 vbraun]:
> sage: C_Polyhedron(gs)
> }}}
> We could turn the `Polyhedron()` call into a shorter `# long time`
example.
Yes, please do that. I think you should aim for something taking at most
10 seconds or so on `sage.math`.
Also, I would rephrase the paragraph starting from line 112 as
{{{
The above computation (using PPL) finishes without noticeable delay
(timeit measures it to be 5ms on sage.math). Below we do the same
computation with cddlib, which needs about 10 seconds on the same
hardware::
sage: basis = range(0,6)
sage: x = [ Variable(i) for i in basis ]
sage: gs = [ tuple(coeff) for coeff in permutations(basis) ]
sage: Polyhedron(vertices=gs) # long time (10s on sage.math, 2011)
A 5-dimensional polyhedron in QQ^6 defined as the convex hull of 720
vertices.
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11849#comment:3>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
