Hashtable with non-literal keys?

[Torsten Anders]

Dear Denys,

I perhaps should not comment this, because I am hardly able to contribute 
to this anyway ;-)

Nevertheless, if you are using addresses for this dictionary-like data 
structure, why not defining the data structure for all Oz values (not only 
literals and chunks), e.g., is there no unique address for a procedure?

Best,
Torsten


On Tuesday, May 13, 2003, at 09:50  am, Denys Duchier wrote:
> schulte at imit.kth.se (Christian Schulte) writes:
>
>> This is very unfortunately not possible
>
> not _currently_ :-) but we _could_ add a dictionary-like primitive
> datastructure that accepts literals and chunks as keys, internally
> using the address as hashindex.  It only needs to be rehashed after GC
> and typically this rehashing would only be done by need.  That's a
> fairly old technique from the Lisp world (personally, I learned it
> from T :-)
>
> Cheers,
>
> --
> Dr. Denys Duchier
> Équipe Calligramme
> LORIA, Nancy, FRANCE
> -
> Please send submissions to users at mozart-oz.org
> and administriva mail to users-request at mozart-oz.org.
> The Mozart Oz web site is at http://www.mozart-oz.org/.
> Please send bug reports to bugs at mozart-oz.org.

-
Please send submissions to users at mozart-oz.org
and administriva mail to users-request at mozart-oz.org.
The Mozart Oz web site is at http://www.mozart-oz.org/.
Please send bug reports to bugs at mozart-oz.org.