Demand is:
Users to generate orders, identified A positioning, to A point, at this point you need to order goods sent to the distribution station, distribution station have N, for N1... NX, you need to find the nearest point A N the actual distance

Solution:
Each produces an A call Scott interface, calculate the actual distance between A and several N

Question:
Amounts of this scheme is call interface, if there are 100 N, then A A it needs to call 100 interface, the problem is Scott interface call limitation, every day to ask is there A better alternative

Note: the location of the N is a number of fixed position

CodePudding user response:

Really can't do it according to their coordinates to calculate linear distance

CodePudding user response:

Linear distance inaccurate billing!

CodePudding user response:

refer to the second floor weixin_49345763 response:

straight line distance from inaccurate billing.

That can only look have the batch interface

CodePudding user response:

Change the account or IP or something, still can continue to rub free interface

CodePudding user response:

] first calculate the linear distance, select a few close, then request interface.

CodePudding user response:

Upstairs right, with linear distance first find several nearby N, again request interface, all N computation again too don't need to, even if the traversal calculated point probability will be near the linear distance of a few large N, the final solution must be paid

CodePudding user response:

Have you not zoning distribution station when the time comes across a city recently

CodePudding user response:

Can put the distribution station area (the area class all point to the distribution station are recent)