#5943: Sage 3.4.2.a0: len(prime_range(2^50)) segfaults
-----------------------------+----------------------------------------------
Reporter: mabshoff | Owner: was
Type: defect | Status: needs_review
Priority: critical | Milestone: sage-4.8
Component: number theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Changes (by mjo):
* cc: mjo (added)
* status: new => needs_review
Comment:
I think the current behavior is desirable given the alternatives.
The slower algorithm falls on its face just as hard if you choose an upper
bound that will cause out-of-memory, so there's no sense in falling back
to that after we catch the exception.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5943#comment:8>
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.
