Andrea Giammarchi

As PR, yes

gotta be honest with you, I'm not actively using, nor maintaining, this project so PR welcome, otherwise have a look at the project that was born right after this called...

Unfortunately I don't have time for this, and any one-off donation won't be likely able to cover the time, which I don't have, needed to work on this

As a PR? Possibily! In general though, this project does its thing and I've never needed much else, so that if there are other libraries inspired by this project doing...

after running this benchmark in various machines with different CPUs, I've noticed that _consistent_ results are highly improbable in here, due to the following scenarios: * the shuffle/random test is...

not sure ivi is currently used in here, but a PR to add it to the list would be great

not sure if it helps, but I've described [the pitfall of string based algorithms in here](https://medium.com/@WebReflection/the-web-smallest-dom-diffing-library-5b69ac4d1f4d) ... the TL;DR version is: string based diffing algorithms don't have DOM constrains (a...

P.S. if interested, this is an [E.Meyers's O(ND) Based Diffing Algorithm](https://github.com/WebReflection/speedy-myers#readme) library with [a DOM diffing based example included](https://github.com/WebReflection/speedy-myers#a-dom-based-example). Performance are great, for a general purpose diffing library, yet far...

> Heckel doesn't work if it has duplicates in one of the lists which is not the case for DOM nodes. not sure I get you right here, but `a`...

> dom nodes vs unique strings in the A and B lists are comparable no? the issue is that the moment you flag a letter/sequence for insertion into `b`, the...