16 ms·
That's fascinating. Is the stored closure working on a snapshot of potential articles or does it have a state-less algorithm that can generate next n articles?
by wpeterson 16y ago
That's fascinating.
Is the stored closure working on a snapshot of potential articles or does it have a state-less algorithm that can generate next n articles?
People complain often about traditional offset/limit pagination, but this the most interesting alternative I've heard.
- bmm6o 16y ago> People complain often about traditional offset/limit pagination I haven't heard any. What kinds of complaints have you heard? I appreciate the generality and elegance of the closure approach, but the links expire far too quickly for my taste. About once a week I read a page slowly enough that the "next" link is dead by the time I click it.
- malandrew 16y agoI agree. It is occasionally disruptive to the user experience. For pagination, this is a very minor inconvenience. However for topic threads such as this one, expiring links is irritating.
- wpeterson 16y agoI was working on a caching problem and it reminded me that caching requests for a resource with standard pagination sucks. You cache Page 1 with some set of objects, by the time you cache Page 2 you have Page 2 of a different overall set. It's inconsistent and wonky. I was hoping there was a more clever way to tease out an elegant solution here.