From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Hashing Algorithms
Date: 1996/03/25
Date: 1996-03-25T00:00:00+00:00 [thread overview]
Message-ID: <DouFM7.KHp@world.std.com> (raw)
In-Reply-To: 4j72g2$lbn@watnews1.watson.ibm.com
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
prev parent reply other threads:[~1996-03-25 0:00 UTC|newest]
Thread overview: 4+ messages / expand[flat|nested] mbox.gz Atom feed top
1996-03-25 0:00 Hashing Algorithms David Wallace
1996-03-25 0:00 ` Robert Dewar
1996-03-25 0:00 ` Norman H. Cohen
1996-03-25 0:00 ` Robert A Duff [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox