Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

Re: Re: Better implementation for 'Next entries -->'?

by Chady (Priest)
on May 08, 2004 at 15:38 UTC ( #351725=note: print w/ replies, xml ) Need Help??


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

Go to a main section, ex Seekers of Perl Wisdom, and look at the bottom of the page.


He who asks will be a fool for five minutes, but he who doesn't ask will remain a fool for life.

Chady | http://chady.net/


Comment on Re: Re: Better implementation for 'Next entries -->'?
Re: Re: Re: Better implementation for 'Next entries -->'?
by QM (Vicar) on May 09, 2004 at 16:39 UTC
    Ah, OK. I never read them that way. I suppose if I wasn't so obsessive, and didn't check in once a day or so, and didn't read through [most of] the new posts, I might read them a section at a time.

    If I'm trying to catch up on the SOPW, jumping to page 11421 of 11427 would be helpful. But wouldn't those links change over time, and have to be computed [somewhat] dynamically? Perhaps once a day or better?

    Maybe computing them with higher page numbers for higher dates would solve it. Then the only artifact might be the opening page with only 1 entry. I'd be OK with that, given the improved functionality of page links, and the reduced load on the server/database.

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

      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?
        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

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://351725]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (7)
As of 2014-12-19 02:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (70 votes), past polls