From: George Ogata <g_ogata@...>
Date: 2004-04-08T07:44:18+09:00
Subject: Re: IdentityHash, like Hash but with keys using equals? vs eql?

Jean-Hugues ROBERT <jean_hugues_robert@yahoo.com> writes:

> BTW: I need that to detect "true" circular paths when walking a tree/graph.
> Rigth now I detect false circulars when nodes' values compare equal
> where in fact it is two different node objects (with the same "value").

Can you just hash the ids?

hash[obj.id] = blah