Ichthyostega eb8ad8ed11 code up the actual list diff generator algorithm ... sans the implementation of the index lookup table(s) The algorithm is KISS, a variant of insertion sort, i.e. worst time quadratic, but known to perform well on small data sets. The mere generation of the diff description is O(n log n), since we do not verify that we can "find" out of order elements. We leave this to the consumer of the diff, which at this point has to scan into the rest of the data sequence (leading to quadratic complexity)		2015-01-04 12:02:41 +01:00
..
diff-language.hpp	code up the actual list diff generator algorithm	2015-01-04 12:02:41 +01:00
diff.cpp	fix: neat a dedicated translation unit for definitions	2015-01-02 11:26:27 +01:00
list-diff-application.hpp	change list diff language to rely on 'find' instead of 'push'	2015-01-02 13:18:25 +01:00
list-diff.hpp	solution how to place and use the diff token constructors	2015-01-04 09:08:36 +01:00
tree-diff-application.hpp	Diff Handling and Diff Application: framework and definitions	2014-12-15 03:21:19 +01:00
tree-diff.hpp	Diff Handling and Diff Application: framework and definitions	2014-12-15 03:21:19 +01:00