Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Re: Re: Re: Zipcode Proximity script

by paulbort (Hermit)
on Apr 03, 2003 at 15:58 UTC ( #247794=note: print w/ replies, xml ) Need Help??


in reply to Re: Re: Re: Zipcode Proximity script
in thread Zipcode Proximity script

At which point you're into a lot more complexity. If you're going to pre-generate that much data, just build a data set for each state that includes all zips within the greatest possible search radius, and start each search with the right data set.
--
Spring: Forces, Coiled Again!


Comment on Re: Re: Re: Re: Zipcode Proximity script
Re: Re: Re: Re: Re: Zipcode Proximity script
by shotgunefx (Parson) on Apr 03, 2003 at 18:07 UTC
    For the data set I was working with it really was no complexity at all. It certainly isn't the biggest reduction of the data but it's a fairly quick reduction to do. You could certainly partition it better but this was a quick and dirty way to do it that worked for my application.

    -Lee

    "To be civilized is to deny one's nature."

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others meditating upon the Monastery: (9)
As of 2015-07-03 15:43 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 (53 votes), past polls