[prev in list] [next in list] [prev in thread] [next in thread] 

List:       haskell-cafe
Subject:    [Haskell-cafe] FiniteMap-like module for unordered keys?
From:       Graham Klyne <gk () ninebynine ! org>
Date:       2004-11-08 16:40:58
Message-ID: 5.1.0.14.2.20041108163317.00ba3bc8 () 127 ! 0 ! 0 ! 1
[Download RAW message or body]

Is there a module that provides functionality similar to that of 
Data.FiniteMap for keys that do not have a defined ordering relation?

(I looked at Data.HashTable, but I couldn't figure why it needs to be 
implemented in the IO monad, except to optimize the internal 
implementation.  Also, it's not clear to me how it behaves when a key is 
inserted that already exists.)

#g


------------
Graham Klyne
For email:
http://www.ninebynine.org/#Contact


[prev in list] [next in list] [prev in thread] [next in thread]