Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: Re: Re: "Rites of Passage" wheel reinventing

by hardburn (Abbot)
on Feb 27, 2004 at 14:44 UTC ( #332257=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: "Rites of Passage" wheel reinventing
in thread "Rites of Passage" wheel reinventing

You say that the dependencies are too large for your taste. For me that is a sign of a robust design.

Playing Devil's Advocate: there are times when you can go way overboard with dependencies. For instance, Crypt::OpenPGP depends on a huge number of modules, including Math::Pari. Math::Pari is based on the pari C library, which is extremely touchy to compile. When setting up a new system, I often have to restart the pari compile a couple times (usually, the pari binary packages for my system aren't up to date enough). Once installed, Crypt::OpenPGP works quite well, but the Math::Pari dependency is always a pain.

----
: () { :|:& };:

Note: All code is untested, unless otherwise stated


Comment on Re: Re: Re: "Rites of Passage" wheel reinventing
Download Code

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (6)
As of 2015-07-04 02:32 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (57 votes), past polls