Rob Rix
|
b0b8aa0616
|
Test that Interpreter produces zero-cost diffs of equal terms.
|
2016-06-30 13:34:31 -04:00 |
|
Rob Rix
|
d674dd06b6
|
Require the fields to have an Ord instance.
|
2016-06-30 12:59:56 -04:00 |
|
Rob Rix
|
e914685790
|
Don’t warn of orphans so much.
|
2016-06-30 12:59:26 -04:00 |
|
Rob Rix
|
ad3bb31c0d
|
Derive an Ord instance over Patch.
|
2016-06-30 12:51:11 -04:00 |
|
Rob Rix
|
ee393400f2
|
Formatting.
|
2016-06-30 12:50:52 -04:00 |
|
Rob Rix
|
28abcd1b38
|
Move Record’s Arbitrary instance into Data.Record.
|
2016-06-30 12:49:50 -04:00 |
|
Rob Rix
|
60b92bfedf
|
Derive Ord instances for Size and Cost.
|
2016-06-30 12:47:21 -04:00 |
|
Rob Rix
|
605a5a9ce1
|
Add an Ord instance over Data.Record.
|
2016-06-30 12:46:22 -04:00 |
|
Rob Rix
|
58138d5867
|
Scale down the sizes by a factor of four.
|
2016-06-30 12:37:41 -04:00 |
|
Rob Rix
|
a5af331f71
|
Generate a pair of inputs.
This allows scaling to work correctly.
|
2016-06-30 12:37:27 -04:00 |
|
Rob Rix
|
1a35975c4f
|
Memoize the feature vector computation for bs.
|
2016-06-30 12:19:01 -04:00 |
|
Rob Rix
|
6e1a7957ec
|
Implement Recursive diffing pairwise over lists of inequal length.
|
2016-06-30 11:59:33 -04:00 |
|
Rob Rix
|
a679749112
|
Test for subtree membership, not just key membership.
|
2016-06-30 11:36:55 -04:00 |
|
Rob Rix
|
d6c041074c
|
Use a List instead of a Set.
|
2016-06-30 11:35:27 -04:00 |
|
Rob Rix
|
d89422d3ed
|
Define childrenOf in tacit style.
|
2016-06-30 11:28:18 -04:00 |
|
Rob Rix
|
cb71ba3467
|
Use the Foldable instance instead of specifying the constructor.
|
2016-06-30 11:27:37 -04:00 |
|
Rob Rix
|
5fa96d9849
|
Rough estimates of time.
|
2016-06-30 10:29:21 -04:00 |
|
Rob Rix
|
18c5d47174
|
Link a bunch of stuff to milestones & issues.
|
2016-06-30 10:26:48 -04:00 |
|
Rob Rix
|
27cc162e1c
|
Test against a set of children instead of sorting.
This reverts commit e5fb9a7a89da22373e7614d0163b64bb3a994b24.
|
2016-06-29 11:28:08 -04:00 |
|
Rob Rix
|
7bdbb0a963
|
Derive an Ord instance for Syntax.
|
2016-06-29 11:23:11 -04:00 |
|
Rob Rix
|
4c3c85bf87
|
Derive an Ord instance for OrderedMap.
|
2016-06-29 11:23:06 -04:00 |
|
Rob Rix
|
bd11e9e0ee
|
Enumerate and sort to pass the test.
|
2016-06-29 10:58:06 -04:00 |
|
Rob Rix
|
92fb23b65e
|
Revert "Revert "Define all our constants in one go.""
This reverts commit 6cb041549d0c8701c10e4574ede0af1ecc87881c.
|
2016-06-29 10:31:16 -04:00 |
|
Rob Rix
|
11a2ab907a
|
Revert "Carry indices along through the computation."
This reverts commit 2cc2d4d78688266a4a6791de47bfd27bfa3cca43.
|
2016-06-29 10:30:32 -04:00 |
|
Rob Rix
|
a5cce717c8
|
Revert "Carry the indices all the way along."
This reverts commit 35b54a6bd9f53d79767571e9ea0bdccf13506149.
|
2016-06-29 10:30:28 -04:00 |
|
Rob Rix
|
223d549397
|
Revert "Place the index last."
This reverts commit a7ff749b2d0fb5991b8b20c97cd1855105d48b49.
|
2016-06-29 10:30:24 -04:00 |
|
Rob Rix
|
b49997d83e
|
Revert "Don’t drop the indices until the very last."
This reverts commit a47ac6be869e7ee65482a2f8606553f2ca9f8dd2.
|
2016-06-29 10:30:21 -04:00 |
|
Rob Rix
|
237846979e
|
Revert "DRY up the computation of indexed, feature-assigned lists."
This reverts commit 40d1b8b449f61613ec40f0e7a7b7acb41189c53a.
|
2016-06-29 10:30:17 -04:00 |
|
Rob Rix
|
31786e1357
|
Revert "Define all our constants in one go."
This reverts commit 77c6cb8d94ccc4bd53d142851e815a74bfc79f14.
|
2016-06-29 10:30:10 -04:00 |
|
Rob Rix
|
79d05c9520
|
Revert "Don’t bind the after list’s index."
This reverts commit f5ef37312654f188a707a75e4994f4420b768516.
|
2016-06-29 10:29:37 -04:00 |
|
Rob Rix
|
b81fc5166d
|
Revert "Split out the computation of the deletions."
This reverts commit 06b52e9366d99739facb7e6aaff965b9dc634dee.
|
2016-06-29 10:29:30 -04:00 |
|
Rob Rix
|
9f6176a6cc
|
Split out the computation of the deletions.
|
2016-06-29 10:16:31 -04:00 |
|
Rob Rix
|
e5423587c5
|
Define all our constants in one go.
|
2016-06-29 10:15:35 -04:00 |
|
Rob Rix
|
d56f2176b9
|
Don’t bind the after list’s index.
|
2016-06-29 10:12:25 -04:00 |
|
Rob Rix
|
457082ba6f
|
DRY up the computation of indexed, feature-assigned lists.
|
2016-06-29 10:11:38 -04:00 |
|
Rob Rix
|
53cfdb8f15
|
Don’t drop the indices until the very last.
|
2016-06-29 10:07:38 -04:00 |
|
Rob Rix
|
b2003de8d4
|
Place the index last.
|
2016-06-29 10:06:35 -04:00 |
|
Rob Rix
|
5cb8d1ddc6
|
Carry the indices all the way along.
|
2016-06-29 10:05:24 -04:00 |
|
Rob Rix
|
488280d40d
|
Carry indices along through the computation.
|
2016-06-29 10:01:41 -04:00 |
|
Rob Rix
|
ad930bf047
|
Tidy up with fromMaybe.
|
2016-06-28 15:04:04 -04:00 |
|
Rob Rix
|
83a88d0e32
|
Only allow comparisons between terms with the same category.
|
2016-06-28 15:02:41 -04:00 |
|
Rob Rix
|
be3f43702b
|
Replace incomparable terms.
|
2016-06-28 15:01:02 -04:00 |
|
Rob Rix
|
2dde2a5775
|
🔥 some parens.
|
2016-06-28 14:56:01 -04:00 |
|
Rob Rix
|
99c36635b4
|
Use Categories for the annotations.
|
2016-06-28 14:09:51 -04:00 |
|
Rob Rix
|
88a79d736c
|
Invert the predicate.
|
2016-06-28 13:42:23 -04:00 |
|
Rob Rix
|
ada51ac730
|
Pencil in the roughest outline of the roadmap
|
2016-06-28 09:18:55 -04:00 |
|
Rob Rix
|
16b0fedee5
|
Delete the remaining terms in a.
|
2016-06-27 16:06:50 -04:00 |
|
Rob Rix
|
c9733cdc5a
|
Swap the operands to compare .
|
2016-06-27 15:59:37 -04:00 |
|
Rob Rix
|
e003549ef0
|
Rewrite to share the lists of child terms.
|
2016-06-27 15:38:45 -04:00 |
|
Rob Rix
|
38ecc3bb0a
|
Test that rws produces correct diffs.
|
2016-06-27 15:37:32 -04:00 |
|