#12371: The graph_decompositions/ code seems to have bounds issues
--------------------------------+-------------------------------------------
Reporter: Snark | Owner: jason, ncohen, rlm
Type: defect | Status: needs_review
Priority: major | Milestone: sage-5.0
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Changes (by ncohen):
* status: needs_info => needs_review
Comment:
Hellooo Jeroen !!
Sorry about that patch, the commit message is now updated !
I do not get your second question, though.... The popcount function as it
is implemented is made for 32 bits integers, and I thought it was better
to write a popcount function for "int" than to write a popcount function
for int32_fast_t, so here it is. This function just tests the size of an
int before returning its result, which has 0 cost as these things are
simplified by the compiler anyway. When do you think the behaviour may
change ?
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12371#comment:23>
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.
