Hello Joel,
Tuesday, December 27, 2005, 9:35:13 PM, you wrote:
JR> Quite possibly. I'm looking for hard proven results at this point and
JR> while you are making bold claims about the throughput of your
JR> pickling library you are not willing to demonstrate this throughput
JR> in a real-life situation.
i say about speed of unpickling only, your program may have more
bottlenecks. you can see my tests in Main.hs, for your task appropriate
benchmark code will be:
main = do buf <- mallocBytes (100*10^6)
h <- createBufferedMemoryStream =<< openMemory buf size
go (\_->get h) (25*10^6::Int)
--
Best regards,
Bulat mailto:[EMAIL PROTECTED]
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe
