Yeah, that doesn't seem very lazy, does it. Without delving any further, it would appear that I'm wrong. You could at least get the behavior I describe by iterating over it yourself, I guess. That's a surprising code snippet.
Chris On Tue, Apr 12, 2016 at 3:21 AM, Joe Steeve <[email protected]> wrote: > On Mon, 2016-04-11 at 08:27 -0400, Chris Rossi wrote: > > It's lazy, so you don't have to load all of the keys, but you will > > probably load all of the keys that precede your offset, so it starts > > off pretty good and gets worse with higher pages. > > I was thinking that the whole "key set" was getting loaded because of > lines 1124-1126 in BTrees/_base.py: > > if isinstance(i, slice): > return list(self)[i] > > Will the list() still be lazy? > > -- > Joe Steeve > HiPro IT Solutions Private Limited > http://hipro.co.in/ > > -- > You received this message because you are subscribed to the Google Groups > "pylons-discuss" 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 https://groups.google.com/group/pylons-discuss. > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "pylons-discuss" 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 https://groups.google.com/group/pylons-discuss. For more options, visit https://groups.google.com/d/optout.
