Viewing profile — vcmiraldo

Copy just copies once. The need for duplicate is clear if you're trying to diff something like `t = [a]` and `u = [a, a]`. You could copy `a`, but you'd have to decide whether to c…

omg!! I really should have left that typo somewhere in there! What a missed opportunity! xD

Indeed, we also designed a brand new generics library to work around that. Performance was really not an issue! :)

Efficiency is not the issue at this point. My prototype diffing algorithm was linear and there have been improvements on it already (I think something called "truediff" is linear b…

I really like the idea of focusing on producing patches for human consumption. I studied the problem of merging AST-level patches during my PhD ( https://github.com/VictorCMiraldo/…

> 2. Also left handed. I just turn off the menu when I'm drawing/writing [...] I know, but I often forgot to turn off the menu when annotating a pdf, and would close the pdf as soo…

Interesting, thanks, I didn't know this one! I did find a few similar projects back when I had the reMarkable, but none quite worked well for me. I'm sure this will help some other…

I bought one, then returned it. For the price they're selling it at, the following points were a deal breaker for me: 1. Custom file system: this means I can ssh into it, but I can…

Thanks for the reply Wilfred! I was not familiar with Autochrome, I will certainly have a look! That's interesting, I like the idea of not worrying about patching nor merging, givi…

you'll probably enjoy the patience diff: https://blog.jcoglan.com/2017/09/19/the-patience-diff-algori...

From you description it seems like we're just computing the standard insert-delete tree-edit-distance. These tend to be slow. This implies that the patch language only supports ins…

That is a really difficult problem for more reasons than what fits in this comment :) In fact, I got my PhD studying this very problem ( https://victorcmiraldo.github.io/data/Miral…