Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

(jcwren) Re: PerlMonks XP XML Ticker

by jcwren (Prior)
on Jun 02, 2002 at 00:41 UTC ( #170958=note: print w/replies, xml ) Need Help??


in reply to PerlMonks XP XML Ticker

The reason you have to login is because it contains the number of votes left, which is personal information, so it requires authentication.

The way I manage that is with cookies. Create a cookie and keep it local. Make a request to the page with the cookie loaded, and voila! It's as (in)secure as anything else on the site.

None of these will help you, but check out What XML generators are currently available on PerlMonks? for other interesting tickers.

--Chris

e-mail jcwren

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://170958]
help
Chatterbox?
[erix]: then you might as well send that patch to the DBIC guys :)
[Corion]: erix: Yeah, I just found that it has no documentation at all on how to circumvent/ eliminate "1+n SELECTs" by building a local hash... I guess I have to make ->has_many do the hash lookup instead of doing the SQL query. But as the problem ...
[Corion]: ... has only manifested itself so far through the puzzled questions of other bystanders, I won't go deeper at this time. But the DBIx::Class documentation could well do with a document on how to make "it" (that is, ORMs in general) faster ;)
[Corion]: I find that DBIx::Class, like most ORMs makes things easy until they become performance critical and then makes it horribly hard to change things because the design is highly inflexible if you don't already know about the problems of 1+n :-/

How do I use this? | Other CB clients
Other Users?
Others taking refuge in the Monastery: (7)
As of 2017-09-25 11:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    During the recent solar eclipse, I:









    Results (279 votes). Check out past polls.

    Notices?