Container for access values.

[David Pettersson <jan.karv@gmail.com>]

Hi!

If I want to store values of an access type in a Set, how do I do it. I want to implement a simple and inefficient garbage collector and need to store pointers (yes, coming from C) to objects that are roots for the scan for reachable objects.

If I try Hashed_Sets I get in trouble since I don't know how to compute a reasonable hash value for the access. I can do an unchecked cast to integer but the two methods for this that I know is not good for the purpose (?).

If I try Ordered_Sets there is no "<" defined for access and I have to define it myself in the same manner as hash value.

One problem with casting is that I might not get all the information if the destination is smaller than the size of the access (two words on gnat?). Or is it enought to use a long integer?

Is there a standard way to store accesses in Sets. Hashing the target will not work in this case since the targets value might change.

Any thoughts?
David