On 15 Dez., 17:30, Rob Beezer <goo...@beezer.cotse.net> wrote: > I'd think that If someone wants a handful of elements from a set they > know is infinite, then they should construct the iterator (which the > list-building routine is using anyway) and just get their elements > from that? A count keyword would be useful, though then the caching > behavior of these lists might need to be refined.
I thought .list(count=12) or whatever would be more convenient. Without looking at the code, I suppose making that work with caching shouldn't be a problem. -Leif -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
