Dynamic stable names are a way of performing fast (O(1)), not-quite-exact comparison between objects.
Dynamic stable names solve the following problem: suppose you want to build a hash table with Haskell objects as keys, but you want to use pointer equality for comparison; maybe because the keys are large and hashing would be slow, or perhaps because the keys are infinite in size. We can't build a hash table using the address of the object as the key, because objects get moved around by the garbage collector, meaning a re-hash would be necessary after every garbage collection.
An abstract name for an object, that supports equality and hashing.
Dynamic stable names have the following property:
sn1 :: DynamicStableNameand
sn2 :: DynamicStableNameand
sn1 == sn2then
sn2were created by calls to
makeStableNameon the same object.
The reverse is not necessarily true: if two dynamic stable names are not
equal, then the objects they name may still be equal. Note in particular
makeDynamicStableName may return a different
after an object is evaluated.
Dynamic Stable Names are similar to Stable Pointers (Foreign.StablePtr), but differ in the following ways:
- There is no
freeDynamicStableNameoperation, unlike Foreign.StablePtrs. Dynamic Stable Names are reclaimed by the runtime system when they are no longer needed.
- There is no
deRefDynamicStableNameoperation. You can't get back from a dynamic stable name to the original Haskell object. The reason for this is that the existence of a stable name for an object does not guarantee the existence of the object itself; it can still be garbage collected.