#12371: The graph_decompositions/ code seems to have bounds issues
----------------------------+-----------------------------------------------
Reporter: Snark | Owner: jason, ncohen, rlm
Type: defect | Status: needs_work
Priority: major | Milestone: sage-5.0
Component: graph theory | Keywords:
Work_issues: | Upstream: N/A
Reviewer: | Author:
Merged: | Dependencies:
----------------------------+-----------------------------------------------
Comment(by ncohen):
Hellooooo !!
> Nathann, what is the status of this ticket?
Well.... You sent a patch while setting the ticket to "needs_work", so you
tell me `^^;`
I tried to answer the points you made in your 4 items list. I think (a
very personal advice) that points 1, 3 and 4 have more to do with theology
than with programming (there is nothing that makes me worry in any of
them, except that any patch fixing them would made the way harder to read)
and the remark you made in 2 is right for me, and can be fixed with the
trick I gave two comments above. That is : it can be fixed the stupid way
with a if(sizeof(int) == 4), at no cost in efficiency as this kind of
things is solver at compilation time) `:-)`
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12371#comment:15>
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.
