#12371: The graph_decompositions/ code seems to have bounds issues
--------------------------------+-------------------------------------------
Reporter: Snark | Owner: jason, ncohen, rlm
Type: defect | Status: needs_info
Priority: major | Milestone: sage-5.0
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers:
Authors: | Merged in:
Dependencies: | Stopgaps:
--------------------------------+-------------------------------------------
Comment (by ncohen):
> Really? I highly doubt that you can write something which is faster
than `__builtin_popcount()`.
Well, it is not like I have an explanation for that, it is too low-level
for me. If I were to try to find an answer I would say that the function
implemented is inline while builtin_popcount is necessarily a function to
be called.
Of course, nothing beats using __builtin_popcount with a popcount
instruction enabled on the processor, as it is directly translated to a
function call.
Ok, now I made these tests a long time ago and it is actually very easy to
check. I will post that in a second.
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/12371#comment:30>
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.
