in reply to Re: Re: Re: Better implementation for 'Next entries -->'?
in thread Better implementation for 'Next entries -->'?

I don't think it would require any dynamic computation, actually. Or, rather, any more than is already being done! For instance, look at the link when you click on 'Next entries' on the SOPW page ... it is http://perlmonks.com/index.pl?next=10&node_id=479 (emphasis mine). The page shows ten nodes at a time. To see the first 10, the bolded field starts counting at 0. The second 10, 10. The third 10, 20. So on. Should be fairly simple, then, no?
  • Comment on Re: Re: Re: Re: Better implementation for 'Next entries -->'?

Replies are listed 'Best First'.
Re: Re: Re: Re: Re: Better implementation for 'Next entries -->'?
by QM (Parson) on May 09, 2004 at 23:14 UTC
    Go look at the OP again. To determine how many nodes there are , and thus pages to indicate [e.g., 7 of 243] the number of nodes of a given category must be known.

    Perhaps leaving off the page count, and going to a direct page jump [a "Jump to page &#091__]"], or giving a date pointer, is what you (OP?) wants?

    But to do that, you just need to Super Search with the given category selected. So someone might argue that Super Search is all you need, and why not just browse from there to start? I'm betting one of the Gods can give out the right link form to go directly to Super Search with the options needed.

    -QM
    --
    Quantum Mechanics: The dreams stuff is made of

[reply]

In Section Perl Monks Discussion