On Wed, Feb 27, 2013 at 9:14 PM, Curtis Maurand wrote:
>
> Well that means the docs on the PEAR MDB2 website are incorrect and should
> be fixed. Thanks for the lesson.
If there's an issue with the docs, you're right, they should
definitely be fixed. We'd appreciate it very much if you coul
I have a project where my client would like to find the nearest street address
from where he current is. Getting the longitude and latitude is easy enough
but I'm having a hard time finding out how to get the nearest house. I have
found a lot of solutions for addresses maintained in a database
On 28.02.2013 12:36, Floyd Resler wrote:
I have a project where my client would like to find the nearest
street address from where he current is. Getting the longitude and
latitude is easy enough but I'm having a hard time finding out how to
get the nearest house. I have found a lot of solution
On Feb 28, 2013, at 1:04 PM, kenrb...@rbnsn.com wrote:
> On 28.02.2013 12:36, Floyd Resler wrote:
>> I have a project where my client would like to find the nearest
>> street address from where he current is. Getting the longitude and
>> latitude is easy enough but I'm having a hard time findi
HI,
It seems like you want something according to the following
you know your start long/lat
you can determine the long/lat arround it
for every of those you determine the route.
if you follow that route you know the house you find
otherwise you can use an increasing circle and if it finds an add
Serge,
That is precisely what I want! Any ideas on how to accomplish that?
Thanks!
Floyd
On Feb 28, 2013, at 2:52 PM, Serge Fonville wrote:
> HI,
>
> It seems like you want something according to the following
>
> you know your start long/lat
> you can determine the long/lat arround
well, not exactly.
But I can help you (so can others) to go through code flow (it will
probably be tedious)
you have a position you start and a certain distance from that point (in a
circle)
>From thereon you substract start(x,y) from dest(x,y) by substracting x from
x and y from y the diffence is
On Thu, Feb 28, 2013 at 3:18 PM, Serge Fonville wrote:
> well, not exactly.
> But I can help you (so can others) to go through code flow (it will
> probably be tedious)
>
> you have a position you start and a certain distance from that point (in a
> circle)
> From thereon you substract start(x,y)
You are right, there is more to it.
The incentive from me was to not further complicate a problem that by
itself can be very hard to solve.
but still, a more accurate measure van only determined by including these
concepts.
Kind regards/met vriendelijke groet,
Serge Fonville
http://www.sergefon
Just wanted to toss this out as something I quick developed in case it
could help others:
https://github.com/AdamJonR/PreHP
Essentially, I just wanted a quick pre-processor that would work with
PHP so I could limit some of the processing done at runtime. As
opposed to C macros, I wanted to design
On Thu, Feb 28, 2013 at 7:50 PM, Adam Richardson wrote:
> Just wanted to toss this out as something I quick developed in case it
> could help others:
> https://github.com/AdamJonR/PreHP
>
> Essentially, I just wanted a quick pre-processor that would work with
> PHP so I could limit some of the pro
On Thu, Feb 28, 2013 at 10:19 PM, tamouse mailing lists
wrote:
>
> Congratulations on ditching the Dreamweaver Templates!
>
> Now, as to preprocessing: how does this benchmark out? Have you
> noticed a significant different in processing time, memory usage, disk
> usage, etc?
Well, it depends...
12 matches
Mail list logo
