Hello, On Thu, Oct 30, 2008 at 12:49 AM, Henryk Trappmann <[EMAIL PROTECTED]> wrote: > Our lazy mechanism seems however very different. > While you use somehow Stream, I just have a hash table for each power > series.
Actually, they're doing pretty much the same thing. A stream models an infinite list, and you just need to provide a method for it to be able to compute the entries. Currently, this is usually done by providing an iterator, but it'd be trivial to make it so that it can take a function which take in n and produces the nth coefficient on the list. > As it should be more difficult to implement all the functionality of > my code into your code I propose > to take my code as a base and add functionality you need that is not > contained yet, thereby making the code more round. One of the main features that I need is the ability to handle recursively/implicitly defined power series. This is currently not possible in your code base because the series aren't "lazy enough". Specifically, in the constructor for your power series, you compute coefficients and set the _val attribute. I've looked over all of your code and would be willing to port over all of the features not currently in Sage next Tuesday. --Mike --~--~---------~--~----~------------~-------~--~----~ 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-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
