Hello, Right now, we have the following functions - primes: an iterator over primes - prime_range: a list of primes (in Cython) - prime_powers: a list of prime powers - prime_power_range: another function that return a list of prime powers (in Cython from #16880)
Given that - we can implement iterator in Cyhon - most function that end with 's' return lists (elliptic_curves, prime_divisors, quadratic_residues, ...) What do you think about: - move everything in Cython in `fast_arith.pyx` - having `primes` and `prime_powers` return lists - having `prime_iterator`and `prime_power_iterator` return iterators (with deprecation and everything) Best, Vincent -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
