commit cd0adebad14a29c84b99b67c6b68a40cff9647e0 from: Stefan Sperling date: Tue Nov 12 12:33:45 2024 UTC update diff README; it was heavily outdated commit - edc37d001aae9784c6d575f08850d49139adf02f commit + cd0adebad14a29c84b99b67c6b68a40cff9647e0 blob - 4e99e6e3c2e246866ba13d435969f3757f271291 blob + 36e71da5217b19d914d046d2c99632a23c31542f --- README +++ README @@ -1,14 +1,9 @@ -This is a collection of diff algorithms, to test various combinations. +This is a collection of diff algorithms, implemented in portable C. -The initial aim was to provide a faster diff implementation for got -(gameoftrees.org) with a BSD license, at the u2k20 OpenBSD hackathon. -A side effect could be improving OpenBSD's /usr/bin/diff utility. +The aim is to provide a faster diff implementation for Game of Trees +(gameoftrees.org) with a BSD license. The project began at the u2k20 +OpenBSD hackathon. The original author is Neels Hofmeyr. -At the time of writing, this is little more than a playground / benchmark basis -/ diff algorithm analysis platform. What could be done: -- add profiling and test series to rate diff algorithm combinations. -- interface with / merge into got. - The Myers and Patience Diff algorithm implementations found here are based on the explanations found in these blog post series: https://blog.jcoglan.com/2017/02/12/the-myers-diff-algorithm-part-1/ ff.