There are a lot of spatial access data structures:��https://en.wikipedia.org/wiki/Spatial_database#Spatial_index

But for a prototype I don't think you care; a simple linear search should be ok for testing until you have thousands and thousands of records. It's probably more important to really explore what you need and how your constraints will influence the API (e.g. since we haven't invented teleportation yet, events for one person that are close in time are necessarily close in space)

On 23 April 2016 at 14:08, C��drick B��ler <cdrick65@gmail.com> wrote:

Thanks Max,

I��ve seen in Pharo 5 OrderedDictionary, OrderedPreservingDictionary and some others. I guess they have the same intent.

I was actually trying them right now :)

Cheers,

C��drik

> Le 23 avr. 2016 �� 13:57, Max Leske <maxleske@gmail.com> a ��crit :
>
> There was talk about an ordered dictionary implementation IIRC a couple of months ago on this list.
>
> I��ve attached an implementation I found in a thread from 2010 (may not work out of the box).
>
> Cheers,
> Max
>
>

> <OrderedDictionary.st>

>
>> On 23 Apr 2016, at 13:46, C��drick B��ler <cdrick65@gmail.com> wrote:
>>
>> A dictionary with keys being the timestamp or the spatiotemporal object would probably do it...
>> I think I��ll do that but I wonder if there are better solutions out there ^^.
>>
>> Cheers,
>>
>> C��drik
>

Damien Pollet
type less, do more [ | ] http://people.untyped.org/damien.pollet