 | 1 | initial version |
I'm looking at Sage developer guide for Cython: https://doc.sagemath.org/html/en/developer/coding_in_cython.html
But I cannot find information about how to use static typing, which is what enables Cython (not necessarily in the context of Sage) to reach C-like performance. Since objects in Sage often have complicated types (expressions, polynomials), how would type declarations (cdef in Cython) work?
I'm looking at Sage developer guide for Cython: https://doc.sagemath.org/html/en/developer/coding_in_cython.html
But I cannot find information about how to use static typing, which is what enables Cython (not necessarily in the context of Sage) to reach C-like performance. Since objects in Sage often have complicated types (expressions, polynomials), how would type declarations (cdef in Cython) work?
P.S. Does Cython have some type inference capability (like the "auto" keyword in C++) so the user can avoid typing long type names?
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
