Hi Jori, On 2014-08-26, Jori Mantysalo <[email protected]> wrote: > The code is much faster, about one second compared to one day with current > Sage. > > However, Sage does not give a list of posets, but an iterator over them; > hence memory requirements are almost none for code that searches for some > kind of posets. > > So what should we do with the code? Add something like "algorithm=fast" or > "format=iterator" -option to Posets(n)?
Perhaps change the C code so that it does not create the whole list but acts as iterator? My 0.02 Euros, Simon -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
