#11754: Computation of rank-decompositions in Sage
-----------------------------+----------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-4.8
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: David Coudert | Author: Nathann Cohen
Merged: | Dependencies:
-----------------------------+----------------------------------------------
Comment(by ncohen):
HMmmmmmm.... In the part of the code I wrote the memory allocations are
checked, and it would be bad if it came from the original source code. We
try not to put our hands in this kind of code, in order to avoid any
troubles when the original source codes get updated (we would have to do
all our modifications again on the updated version). What we usually do in
these cases is report the bug upstream and wait for them to fix it.
The thing is that I was not able to reproduce your bug on my computer. It
begins to eat a lot of memory but no segfault, so I do not really know how
to debug it `^^;`
Are you testing this code on your mac ? I hope it is not one of those
integer initializations again `:-P`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11754#comment:5>
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.
