Hi
I do not think the programming of such a new search function should be a problem for the person who programmed the other search functions, provided there is the time available to do it.
I would go about it in the following way:
- My position is: N34.264438 W114.369096 (WGS84)
- In the first run the program would search the data base for all localities which are between N34.278741 and N34.249925 . ( that is 1 mile north and 1 mile south of my position)
- The result is a long list of localities
- In the second run the program would search in this long list for localities which are between W114.351552 and W114.386799 (again 1 mile east and west of my position)
- The result is a shorter list with all localities which are in a 2x2 miles square around my position
I am sure there are more elegant ways to do it, like with a matrix –function.
If the person doing it is familiar with the other search functions there should be no problem with the other functions.
Regards
Richard