<font size="2"><font face="tahoma,sans-serif">Hello Haskellers,</font></font><div><font size="2"><font face="tahoma,sans-serif"><br></font></font></div><div><font size="2"><font face="tahoma,sans-serif">I'm playing a bit with Data.Judy. However, I noticed that using StablePtr incurs in some performance problems, I don't have any numbers but as a example use Int and ByteString as values and you can notice the difference without any benchmarking tool with the example that comes in the documentation.</font></font></div>
<div><font size="2"><font face="tahoma,sans-serif"><br></font></font></div><div><font size="2"><font face="tahoma,sans-serif">The question that I have is: is there any way to make it faster for types other than those that fits in word size? I understand that the way the binding to the C code has been done, stableptr is required. Am I wrong assuming this? I would be happy to submit a patch but I failed to find a way to improve the performance.</font></font></div>
<div><font size="2"><font face="tahoma,sans-serif"><br></font></font></div><div><font size="2"><font face="tahoma,sans-serif">The second question is what is a common practice to avoid memory leaks with StablePtr? I have zero experience programming with the Haskell FFI interface, so probably the most basic stuff would help me a lot in this case.<br clear="all">
</font></font><br></div><div>Thanks in advance,<br>-- <br>~dsouza<br>yahoo!im: paravinicius<br>gpg key fingerprint: 71B8 CE21 3A6E F894 5B1B 9ECE F88E 067F E891 651E<br>gpg pub key: <a href="http://bitforest.org/~dsouza/pub/gpg-pubkey.txt" target="_blank">http://bitforest.org/~dsouza/pub/gpg-pubkey.txt</a><br>
authorized_keys: <a href="http://bitforest.org/~dsouza/pub/authorized_keys.txt" target="_blank">http://bitforest.org/~dsouza/pub/authorized_keys.txt</a><br>
</div>