By the way, I'm rather confused as to why you deem this caching useful. A
priori, I would expect a simple bytevector->pointer call would be just as fast
as a to-pointer call. Do you somehow create lots of pointers to the contents of
the same bytevector so that weak references they hold incur a noticeable GC
overhead?

Attachment: signature.asc
Description: This is a digitally signed message part



Reply via email to