Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re^3: Mapping URLs to code - in search of perlish dispatch schemes

by jaa (Friar)
on Jul 21, 2006 at 09:31 UTC ( [id://562820]=note: print w/replies, xml ) Need Help??


in reply to Re^2: Mapping URLs to code - in search of perlish dispatch schemes
in thread Mapping URLs to code - in search of perlish dispatch schemes

I like both - thought I think the structured args approach will be mucho clearer for perl newbies and casuals.

I am worried about the efficiency of matching an actual URL against the parsed definitions. Do you have thoughts on how you are going to make this efficient? Efficiency being memory based for some, and speed based for others?

  • Comment on Re^3: Mapping URLs to code - in search of perlish dispatch schemes

Replies are listed 'Best First'.
Re^4: Mapping URLs to code - in search of perlish dispatch schemes
by Corion (Patriarch) on Jul 21, 2006 at 09:34 UTC

    I haven't thought about the speed at all yet, but seeing that the same decision tree is executed in traditional code as well, I don't think this will be much of a problem. Maybe the Prolog approach will be a performance problem, but first I want to get the syntax convenient before I worry about the implementation too much.

[reply]

In Section Seekers of Perl Wisdom

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?

www.com | www.net | www.org
Node Status?
node history
Node Type: note [id://562820]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? • Last hour • Other CB clients
Other Users?
Others exploiting the Monastery: (2)
As of 2024-04-26 03:37 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found