RE: Cache Polling

On 2011-08-02 at 00:12:40, Philippe De Ryck wrote:
> By repeating this with 
> increasingly smaller values of maximumAge until an error occurs, it 
> can determine an approximate timestamp of this position.

The same effect can be achieved in O(logN) with a binary search.

But, as Andrei points out, why would you bother when a timestamp attribute tells you the exact time that location was generated?

Received on Tuesday, 2 August 2011 23:25:06 UTC