#19033: RIF/CIF: search and subintervals by a bisection-algorithm
-------------------------------------+-------------------------------------
Reporter: dkrenn | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.10
Component: numerical | Resolution:
Keywords: | Merged in:
Authors: Daniel Krenn | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/dkrenn/rif/bisect | dd7cb139c411ebda5993f1a8cea320dbbf9b49ed
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by dkrenn):
Replying to [comment:16 jdemeyer]:
> Replying to [comment:5 vdelecroix]:
> > - did you try to more typing. In other words `open = [] -> cdef list
open = []` and `iteration = 0 -> cdef size_t iteration = 0`, etc. Cython
does good job with Python list when it knows that these are lists.
>
> I agree, there should be a lot more typing. All variables which are
boolean should be typed `bint` and all integers a suitable integer type
(`Py_ssize_t` for lengths).
I've added `cdef bint success`; this saves about 5 percent in time in my
tested examples. I've tried to add `Py_ssize_t` and other `bint`...it does
not seem that this brought something. Maybe I am using it wrong...
--
Ticket URL: <http://trac.sagemath.org/ticket/19033#comment:21>
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.
