haproxy VS diff-match-patch

I wanted to try it out just now but hit a roadblock immediately - it cannot automatically obtain and maintain TLS certificates. You have to use an external client (e.g. acme.sh), set up a cron to check/renew them, and poke HAProxy to reload them if necessary. I'm way past doing this in 2023.

https://www.haproxy.com/blog/haproxy-and-let-s-encrypt

https://github.com/haproxy/haproxy/issues/1864

For context I think this might be useful: https://github.com/haproxy/haproxy/blob/master/addons/promex/README

I turn on 1 relatively cheap cloud server to process DNS, https and stratum connections and route them via haproxy to one of N miner servers described above.

Full technical writeup here: https://github.com/haproxy/haproxy/commit/a8598a2eb11b6c989e81f0dbf10be361782e8d32

With the recent discussions about memory safe languages, HAProxy is still surprisingly written in C [0].

[0]: https://github.com/haproxy/haproxy

It does not, because HAProxy does not perform any disk access at runtime and thus would be unable to persist the certificates anywhere. Disks accesses can be unpredictably slow and would block the entire thread which is not something you want when handling hundreds of thousands of requests per second.

See this issue and especially the comment from Lukas Tribus: https://github.com/haproxy/haproxy/issues/1864

Disclosure: Community contributor to HAProxy, I help maintain HAProxy's issue tracker.

Code link: https://github.com/haproxy/haproxy

I also came across this diff match algorithms: https://github.com/google/diff-match-patch

Outside of that, to get the diffs there is a library called diff-match-patch that has implementations in most languages. Your data model / state tracking sounds like it matches the internal constraints.

So I'll just leave you with this question - why, as a developer, would I ever advise using this, when fast diff is an industry standard tool that does exactly this, but better, using well tested methods that are being implemented in JS and further optimized by one of the largest global tech companies. Mind you, this is the same company which has developed its own proprietary monolithic VCS, managing versioning for 2billion+ lines of code.

Hello HN!

I was always annoyed by conflicts that can be solved automatically, but still need human intervention. E.g. two people changing the same line, but at different, non-conflicting positions. So I searched for a character based patching library and found this nice article https://neil.fraser.name/writing/patch/ and its corresponding library https://github.com/google/diff-match-patch.

Parsing git conflicts, applying patches and showing some useful diffs in the UI helps me to solve 80% of my conflicts automatically. I hope it can help you too.

Happy Hacking!

A bit late to the party but have you checked this? google/diff-match-patch

Found this, simple and seems interesting: https://github.com/google/diff-match-patch

If you need to know exactly what the diff is, you might want to use something like github.com/google/diff-match-patch. Otherwise, a simple Levenshtein distance would suffice. This library seems to have a whole bunch of string distances implemented. Hope this helps!

Photo by Markus Spiske on Diff.Match.Patch based on Google library.