Sat, 15 Sep 2001 15:11:02 -0400, Leon Smith <[EMAIL PROTECTED]> pisze:
> The point of all of this is that now string equality, when strings
> are made into atoms, is just pointer equality, which is available
> as IOExts.unsafePtrEq.
>
> 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.
The physical pointer order changes with garbage collection.
--
__("< Marcin Kowalczyk * [EMAIL PROTECTED] http://qrczak.ids.net.pl/
\__/
^^ SYGNATURA ZASTĘPCZA
QRCZAK
_______________________________________________
Glasgow-haskell-users mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
