Rob Rix
|
4cfa993239
|
Move the Arbitrary gram functions into Data.RandomWalkSimilarity.
|
2016-07-05 09:18:53 -04:00 |
|
Rob Rix
|
827d654485
|
Use List.lookup and replace the found term.
|
2016-07-04 16:50:01 -04:00 |
|
Rob Rix
|
a8effb6d6d
|
Don’t filter, just operate over the unmapped list.
|
2016-07-04 15:29:22 -04:00 |
|
Rob Rix
|
89df373821
|
We don’t need to bind this after all.
|
2016-07-04 15:25:07 -04:00 |
|
Rob Rix
|
c724f61f49
|
Insert deletions in the correct position.
|
2016-07-04 15:20:18 -04:00 |
|
Rob Rix
|
ea9cbbd1e7
|
Keep track of the unmapped diffs, not the mapped ones.
|
2016-07-04 15:19:15 -04:00 |
|
Rob Rix
|
7b75edcb78
|
Don’t reconstruct the key/value pairs.
|
2016-07-04 15:06:21 -04:00 |
|
Rob Rix
|
f34e9a6a0a
|
🔥 a redundant import.
|
2016-07-04 15:04:35 -04:00 |
|
Rob Rix
|
063aeea8b0
|
Use leaf values in the labels.
|
2016-06-30 15:03:32 -04:00 |
|
Rob Rix
|
e967668572
|
Require a Hashable instance for the leaf type.
|
2016-06-30 15:03:00 -04:00 |
|
Rob Rix
|
e3a43b77a9
|
Fix overloaded string warning.
|
2016-06-30 15:02:28 -04:00 |
|
Rob Rix
|
02965e2edb
|
Cons.
|
2016-06-30 14:58:00 -04:00 |
|
Rob Rix
|
3cd2a4b82c
|
Extract a function to select the category.
|
2016-06-30 14:24:59 -04:00 |
|
Rob Rix
|
e54f216672
|
Shrink ArbitraryDiff generically.
|
2016-06-30 14:19:29 -04:00 |
|
Rob Rix
|
0770a410d4
|
Represent ArbitraryDiff as a datatype.
|
2016-06-30 14:19:22 -04:00 |
|
Rob Rix
|
5b70ff7635
|
Extract unArbitraryDiff.
|
2016-06-30 14:16:37 -04:00 |
|
Rob Rix
|
99ffbebd84
|
Construct ArbitraryDiff using the extracted syntaxOfSize function.
|
2016-06-30 14:14:41 -04:00 |
|
Rob Rix
|
2d821fec97
|
Construct ArbitraryTerm using the extracted syntaxOfSize function.
|
2016-06-30 14:13:39 -04:00 |
|
Rob Rix
|
84b550262e
|
Shrink ArbitraryTerm generically.
|
2016-06-30 14:13:29 -04:00 |
|
Rob Rix
|
8d043e7de9
|
Add an Arbitrary instance over Syntax.
This also implements sized arbitrary values.
|
2016-06-30 14:10:44 -04:00 |
|
Rob Rix
|
03b6964d7c
|
Derive a Generic instance over Syntax.
|
2016-06-30 14:10:12 -04:00 |
|
Rob Rix
|
dd71aa0c6e
|
Add an Arbitrary instance over OrderedMap.
|
2016-06-30 14:09:55 -04:00 |
|
Rob Rix
|
19905faee8
|
Derive a Generic instance for Data.OrderedMap.
|
2016-06-30 14:08:01 -04:00 |
|
Rob Rix
|
72a909ac52
|
ArbitraryTerm does not wrap CofreeF.
|
2016-06-30 14:01:54 -04:00 |
|
Rob Rix
|
d9e4602c67
|
Spacing.
|
2016-06-30 13:45:44 -04:00 |
|
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
|
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 |
|