in memory datastore in haskell

Posted by Simon on Programmers See other posts from Programmers or by Simon
Published on 2013-07-16T11:37:53Z Indexed on 2013/11/11 16:15 UTC
Read the original article Hit count: 239

Filed under:
|

I want to implement an in memory datastore for a web service in Haskell. I want to run transactions in the stm monad.

When I google hash table steam Haskell I only get this: Data. BTree. HashTable. STM. The module name and complexities suggest that this is implemented as a tree. I would think that an array would be more efficient for mutable hash tables.

Is there a reason to avoid using an array for an STM hashtable? Do I gain anything with this stem hash table or should I just use a steam ref to an IntMap?

© Programmers or respective owner

Related posts about data-structures

Related posts about haskell