Marc Weber wrote:
Excerpts from Adam Chlipala's message of Thu Dec 02 19:03:17 +0100 2010:
This isn't the kind of recursion I meant. In the world of type theory,
a "recursive type" is a type defined in terms of itself. Lists are a
There are only objects (= dictionaries or hashes) and arrays (which you
translate to lists) and primitive types (int, string, bool).
So you can't perform better that what you've done.
Your explanation doesn't tell me why it's not possible to do better,
but, if you're satisfied, then that's good enough for me. :-)
Your library seems to work perfectly. You did exactly what I had in
mind. Do you mind making the repo public?
I'll put that on my to-do list.
How efficient are those escape / unescape functions compared to plain C
functions ? Does it make sense to code them in C ?
Calling substring for each space could be inefficient.
There's definitely room to improve performance significantly by coding
parts in C.
_______________________________________________
Ur mailing list
[email protected]
http://www.impredicative.com/cgi-bin/mailman/listinfo/ur
