#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):
Ahah !! i=17 ! Now that's something ! I prefer when it is something around
a power of two, it makes more sense `:-)`
Well, for instance I wondered what the result of
{{{
1 << (uint_fast8) 17
}}}
is in C. Is 1 automatically set to type uint_fast8 ? In this case the
result is zero. Is it automatically set to integer ? In this case the
result is 2^17. Anyway this should not make much of a difference, as
accessing cslots[0] is not big deal -- it is the safest of them all to
access !
Oddly the allocation part seems totally safe
{{{
cslots = malloc(sizeof(subset_t) * (1ul << n));
}}}
Nathann
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11754#comment:11>
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.
