#15820: Implement sequences of bounded integers
--------------------------------------------+------------------------
Reporter: SimonKing | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-6.3
Component: algebra | Resolution:
Keywords: sequence bounded integer | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
--------------------------------------------+------------------------
Comment (by ncohen):
Hellooooooooooooooooo !!!
> EDIT: I have replaced the original example by something fairer, where it
says `var+var` everywhere, but in the templated version Cython can choose
the c-implementation of `var+var` at compile time, whereas it can't (and
hence loses time when running the code) in the untemplated version.
HMmmmmm... Does it make any difference ? gcc should resolve those "if" at
compile-time, so if Cython creates two version of the function with an
"if" inside depending on the type, gcc should not include it in the final
binary as the constants involved can be defined at compile-time.
Anyway, that's a good news ! `:-D`
Nathann
--
Ticket URL: <http://trac.sagemath.org/ticket/15820#comment:41>
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 unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
