virt-v2v VS nested-data-structure-traversal

In virt-v2v we eventually enforced that every module file also has a corresponding interface file: https://github.com/libguestfs/virt-v2v/blob/master/check-mli...

You can look at the project yourself: https://github.com/libguestfs/virt-v2v I've been writing OCaml for 20+ years and C for 40 years.

I develop in OCaml from time to time, and it's pretty practical. Separate compilation, makes small-ish binaries that most people wouldn't know weren't written in C/C++, easily call out to C if you need to. We steer clear of the more complex language features like functors because they confuse most programmers.

Here's an example of one very widely used production application: https://github.com/libguestfs/virt-v2v/tree/master/v2v

XPath is the real killer feature for XML. I don't think it's possible to use it in this particular example, but in the more generally useful cases where you want to pull (eg) all subnodes with key matching a particular string, XPath is great.

Here's it being used in real code (search for "xpath_"):

https://github.com/libguestfs/virt-v2v/blob/master/v2v/parse...

https://github.com/libguestfs/virt-v2v/blob/master/v2v/parse...

Oh boy, some of the recent additions are looking tragic. Completely ignoring "reset_lesson_position", to code-golf their own simplified ideal of the problem? Eg. (at time of my comment) https://github.com/josevalim/nested-data-structure-traversal/blob/master/rust/for_in_anonymous_tuples.rs

Amusingly, I think I will lose this if I don't link it here. https://github.com/josevalim/nested-data-structure-traversal... is my attempt at getting a LOOP solution in.

As noted in the message, I originally did this in elisp, which felt a bit more natural, for some reason.

Traversing nested data-structures in various languages\ (32 comments)