#5519: [with patch, needs work] Irreducibility test is slow for polynomials over
GF(2)
-------------------------+--------------------------------------------------
Reporter: rhinton | Owner: rhinton
Type: enhancement | Status: new
Priority: major | Milestone:
Component: algebra | Keywords:
-------------------------+--------------------------------------------------
Comment(by rhinton):
Replying to [comment:8 malb]:
> Replying to [comment:7 rhinton]:
> > malb: Why don't you like the cpdef? That allows it to be called from
Python (current usage)
> > _and_ should make it faster if I call it from another Cython module
(possible future usage),
> > correct? I'm new at this, so I'm happy to learn more of the "why"s of
Sage coding.
>
> Because it seems like premature optimisation. If now one wants to change
stuff around one always has to touch the header now which I find annoying.
Also, I see little benefit in making this optimisation. From Python the
advantage is nil and from Cython it is trivial to call NTL's function
directly which is *much* faster.
You are absolutely right. Apparently I've already blocked out calling the
M4RI interface directly. :-)
> I agree that this is somewhat a question of taste but I'd rather avoid a
false sense of optimisation.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/5519#comment:10>
Sage <http://sagemath.org/>
Sage - Open Source Mathematical Software: Building the Car Instead of
Reinventing the Wheel
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
