> 
> There are a lot of spatial access data structures: 
> https://en.wikipedia.org/wiki/Spatial_database#Spatial_index 
> <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

Yes sure but I keep that in mind for later « exploration ».


> until you have thousands and thousands of records.

Potentially, on a person lifetime, adding hundreds information a day (and 
probably higher order of magnitude),  I think we can easily reach millions of 
data quite easily :) 

100 per day, in 10 years => 365 000

1000 per day in 100 years => 36 500 000

What I want is keeping track of all positions a person can have in his life 
(what can easily reach millions) and then rely on these « points » to index 
information added in the system.

> It's probably more important to really explore what you need and how your 
> constraints will influence the API

but I agree and I’ll work on that first.


> (e.g. since we haven't invented teleportation yet, events for one person that 
> are close in time are necessarily close in space)

yes… for now but in 50 years who knows :) 
This remark is nevertheless interesting as a premise that can be used to check 
the validity of data (geospatial resolver are not that precise). 

But yeah for now, an OrderedDic or another classic collection will do the job 
and will let me explore the API (and we might discuss it ^^).

I start this discussion as I thing this is one central modeling concept of what 
I want to do.

Cheers,

Cédrik

> 
> On 23 April 2016 at 14:08, Cédrick Béler <[email protected] 
> <mailto:[email protected]>> 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 <[email protected] 
> > <mailto:[email protected]>> 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 <[email protected] 
> >> <mailto:[email protected]>> 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 
> <http://people.untyped.org/damien.pollet>

Reply via email to