-
```
Just took a look at this code. Looks nice, clean, elegant, and to the
point. And a useful tool! Nicely done.
I would find it useful if there were a pure-Python version of the code,
which woul…
-
```
Just took a look at this code. Looks nice, clean, elegant, and to the
point. And a useful tool! Nicely done.
I would find it useful if there were a pure-Python version of the code,
which woul…
-
Hi,
Thank you for providing the code. I really appreciate your work.
I am using the SCE-UA algorithm for my research and just noticed that there may be a mistake in the code
Line 93 of the sce…
-
## License Policy Violation detected in diff-lcs-1.3.gem
Library - diff-lcs-1.3.gem
Diff::LCS computes the difference between two Enumerable sequences using the
McIlroy-Hunt longest common subsequen…
-
Hello. I find the following behavior (using Hashdiff 1.0.1) somewhat unexpected:
```ruby
Hashdiff.diff(%w[a b c], %w[a b d])
=> [["-", "[2]", "c"], ["+", "[2]", "d"]]
```
Would not it be bett…
-
Problem statement: https://tahoe-lafs.org/~zooko/badmerge/simple.html
Proposed solution: build an LCS between a, b1. Then build an LCS between b1 and b2. Then, combine these two LCS where if (x, y)…
-
-
It's nice to know that the LCS problem can be solved in O(n) space using the algorithm made by Hirschberg.
It's nice to know that quick-select can be done in O(n) worst-case (deterministic).
The…
-
Diffing arrays is particularly inefficient when changes trigger the full LCS algorithm. Implementing [Myers' algorithm](http://xmailserver.org/diff2.pdf) should be a significant speed-up.
(Leaving th…
-
Right now you'll get a problem for a missing doc, and a problem for a redundant doc. There might be a good algorithm out there that could infer this better.
dduan updated
4 years ago