On Sun, 2012-08-12 at 22:31 +0800, rushan chen wrote:
Hi Mark,
Very appreciate for your reply.
I see you mention that it's useful to implement a larger library of
efficient data structure, and I'm interested in that very much. I used to
work on projects which involve complicated but very
[Meant to send this to the list]
There's an implementation of a trie in guile-snmp, but it's one of the
first things I wrote in scheme and is pretty hideous. I keep meaning
to redo it using records instead of GOOPs.
I'd ask for code review, but, to be honest, I didn't really have a
clue what I
Hi nalaginrut,
Thanks for your reply.
I'd like to start with the vlist implementation Mark mentioned previously,
it would be cool if this can help speed up the compiler. But since I'm new
here, would anybody be kind enough to give me some clue on how to integrate
a c-version vlist into current
Hello,
Mark H Weaver m...@netris.org skribis:
Here's one specific data structure idea: we have a vlist data
structure, currently written in Scheme, but in my opinion it would be
useful to rewrite it in C for better efficiency.
FWIW, I’m not convinced that this is a fruitful approach.
First,
