Eureka VS diff-match-patch

I was setting up microservices based on Netflix Eureka and experimenting on top of spring-cloud and after weeks of research and development the question rose!

The closest thing I've found is Netflix's Eureka, though its very Java oriented and I found hard to use.

There's an open issue documenting this problem on Spring Cloud Netflix and Netflix Eureka.

if you want to get more knowledge of the services, eureka etc, you can debug it. but I will digest you use the library instead of the annotations: https://github.com/Netflix/eureka

Service discovery — Traditionally provided by platforms like Netflix Eureka or Consul.

With multiple services running, it’s hard to discover where they’re located. The dependencies between multiple services are not always easily found, and new services may be deployed with a new dependency on an older service. Those services can be deployed anywhere in the infrastructure, so what you need is a Service Discovery service. There are plenty available, such as Netflix Eureka or HashiCorp Consul.

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.