[r6rs-discuss] immutable hash tables and eqv?

[Alexander Kjeldaas]

On 5/24/07, Anton van Straaten <anton at appsolutions.com> wrote:
>
> Alexander Kjeldaas wrote:
> > I couldn't find a way to create an immutable hash table.
>
> The hashtable-copy procedure creates immutable hash tables by default.



Very good!  So I see that it is possible to create immutable strings and
hashtables (for strings it seems that you have to convert to a symbol and
back though).  Is it possible to do this for the other structures mentioned
as well: pairs, vectors, bytevectors and ports?  I would like to understand
if you can easily build general data structures that are immutable and eqv?
even if they are in different locations in the store.

Alexander
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.r6rs.org/pipermail/r6rs-discuss/attachments/20070524/f53a387e/attachment.htm