Below is the result of your feedback form. It was submitted by ANNA
([EMAIL PROTECTED]) on Monday, September 17, 19101 at 15:22:13
---
message: Hello my friend
My cam is always on for you.for your sex
I cannot forget
I'm writing an atom table for a compiler/interpreter, and it
would be really
nice to use unsafePtrLT to implement tree-based finite maps.
For clarification, my atom table consists of these three functions:
mkAtom :: String - IO Atom
show :: Atom - String
(==) :: Atom - Atom -
Leon Smith [EMAIL PROTECTED] writes:
However, in this situation, pointer comparison is simply an arbitrary total
order on the set of all atoms, which is all we need to implement finite maps
based on search trees. And of course, pointer comparisons are a much cheaper
operation that actual
I can't think of a way to use unsafePtrCompare safely :-) The relative
ordering of objects isn't guaranteed to be stable under GC.
Cheers,
Simon
Doh, that would throw a monkey wrench into things, wouldn't it? I know of
compacting GC algorithms, but I didn't consider that GHC
