Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Help match relevant data from three data structures

by dragonchild (Archbishop)
on Nov 27, 2007 at 16:17 UTC ( #653292=note: print w/replies, xml ) Need Help??


in reply to Help match relevant data from three data structures

I'd be delighted to do the job for you. You can contact me here for my rate. Of course, I'm not cheap. Alternately, you could post this to jobs.perl.org or one of the rent-a-coder sites.

Of course, you could just take the specification that you've described (which is quite good) and actually write it yourself. You'll be using a lot of hashes.

That said, what do you want "faster" for? This should just run once, right? Who cares if it runs in 2 minutes or overnight so long as it gets done ... ?


My criteria for good software:
  1. Does it work?
  2. Can someone else come in, make a change, and be reasonably certain no bugs were introduced?
  • Comment on Re: Help match relevant data from three data structures

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (5)
As of 2023-02-07 09:06 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    I prefer not to run the latest version of Perl because:







    Results (38 votes). Check out past polls.

    Notices?