From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: 
X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,deb99d30f6cbcdbe,start
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Hashing Algorithms
Date: 1996/03/25
Message-ID: <DouFM7.KHp@world.std.com>#1/1
X-Deja-AN: 144182556
references: <internews46B4920C5E@argonet.co.uk>
 <4j72g2$lbn@watnews1.watson.ibm.com>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-03-25T00:00:00+00:00
List-Id: <comp.lang.ada>

In article <4j72g2$lbn@watnews1.watson.ibm.com>,
Norman H. Cohen <ncohen@watson.ibm.com> wrote:
> ...For
>   example, if you were building a hash table of trees to ensure that
>   there is a unique copy of each subtree ever constructed, it would be
>   appropriate to hash access values pointing to tree nodes by
>   uncheckedly converting them to some integer type.

Beware garbage collectors that move things around in memory.

- Bob