-
```
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…
-
Add instructions to the tutorial explaining how to use the package as a framework for the development of new LCS variants. Currently the tutorial only explains how to use algorithms that come as part …
-
From my barest understanding of the code[^3], the current algorithm tries to do the classical approach to computing a longest common subsequence:
- Compute a N x M matrix of distances from (0,0) to…
-
```
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…
-
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…
-
```
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…
-
Somehow this project has `fetch` and `pull`, but missing `merge`?
FWIW, `pull` is a `fetch` immediately followed by `merge`, so how was the `pull` implemented in the first place?
For my case:
…
-
```
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…
-
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)…