On Sun, 3 May 2009, Krzysztof Skrzętnicki wrote:
Hi
I'm looking for a data structure with following characteristics:
1. O(1) lookup
2. O(1) modification
3. amortized O(1) append
4. O(1) size query
This roughly characterizes C++ vector class. I'm ready to implement
it myself, but first I
Thank both of you for your responses. Unfortunately I decided to
switch to Python for this project, as I plan to use BerkeleyDB and
Haskell bindings for it are poorly written.
Best regards
Christopher Skrzętnicki
2009/5/3 Don Stewart d...@galois.com:
gtener:
Hi
I'm looking for a data
Interesting. Thanks for the feedback.
You were referring to Stephen Blackheath's BerkeleyDB package?
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/BerkeleyDB
-- Don
gtener:
Thank both of you for your responses. Unfortunately I decided to
switch to Python for this project,
Hi
I'm looking for a data structure with following characteristics:
1. O(1) lookup
2. O(1) modification
3. amortized O(1) append
4. O(1) size query
This roughly characterizes C++ vector class. I'm ready to implement
it myself, but first I would like to ask if anyone knows package with
similar
Hello Krzysztof,
Sunday, May 3, 2009, 10:06:30 PM, you wrote:
This roughly characterizes C++ vector class. I'm ready to implement
http://haskell.org/haskellwiki/Library/ArrayRef#Using_dynamic_.28resizable.29_arrays
although this (mine) package is probably incompatible with current ghc
