Re: [Chicken-users] hash-tables

[address@hidden]

>From      : "Felix Winkelmann" address@hidden
> For short data-sets an association-list will likely be more efficient.
> Since Chicken uses a copying garbage-collector, one cannot (unfortunately)
> just take the address of an object in the heap and use that as a hash-code
> (which would be damn fast), so the hash-code has to be computed from
> the contents of the data. Actually, I exclusively use a-lists, unless
> I know it's going to be a big table. Doing some benchmarking for your
> particular application might be worthwhile.

I guess there are time routines for benchmarking purpose, but in the manual I
find time routines more related to the calendar. What should I use for 
benchmarks?

> > 2) I see in the manual that "get" and "put!" can have a "property"
> > argument; what's that?
> >
>
> The property may be anything, but it will be compared using `eq?'.

So ??  I do not get the purpose of properties from this reply.

            Michele