Rob Rix
|
51d8fcd99a
|
Match the parameters only once.
|
2016-07-08 12:14:42 -04:00 |
|
Rob Rix
|
6961a9ac9c
|
Use wrap .
|
2016-07-08 12:14:21 -04:00 |
|
Rob Rix
|
bdda261c60
|
Correct the predicate on i/previous.
|
2016-07-07 12:23:31 -04:00 |
|
Rob Rix
|
ee212caad6
|
Allow i to equal the previous index.
|
2016-07-07 12:21:54 -04:00 |
|
Rob Rix
|
983719e9aa
|
Use accessors instead of destructuring.
|
2016-07-07 12:21:42 -04:00 |
|
Rob Rix
|
66a38fc95e
|
Avoid unnecessary nesting.
|
2016-07-07 11:58:31 -04:00 |
|
Rob Rix
|
433db16783
|
📝 UnmappedTerm.
|
2016-07-07 11:50:09 -04:00 |
|
Rob Rix
|
372943aee9
|
🔥 the lis/isSorted machinery.
|
2016-07-07 11:48:58 -04:00 |
|
Rob Rix
|
9c0bab1e6f
|
Revert "Add a function to lift a boolean into Maybe."
This reverts commit db5ff0e1cbeeaf093c495058d44b9b8143abec05.
|
2016-07-07 11:47:27 -04:00 |
|
Rob Rix
|
4ea8844b58
|
Skip reorders.
|
2016-07-07 11:47:17 -04:00 |
|
Rob Rix
|
ded6e48477
|
Add a function to lift a boolean into Maybe.
|
2016-07-07 11:45:01 -04:00 |
|
Rob Rix
|
34363d4eee
|
Insertions don’t really have indices.
|
2016-07-07 11:41:21 -04:00 |
|
Rob Rix
|
b543dfb0ac
|
Correct the recorded indices for deletions.
|
2016-07-07 11:25:28 -04:00 |
|
Rob Rix
|
cf7d4414f7
|
Go back to recording the positions in A.
|
2016-07-07 11:20:08 -04:00 |
|
Rob Rix
|
1c8113b184
|
Record the most recently seen index.
|
2016-07-07 11:11:02 -04:00 |
|
Rob Rix
|
6f59440684
|
Rename the index getter to termIndex.
|
2016-07-07 11:10:42 -04:00 |
|
Rob Rix
|
65cf0d223c
|
🔥 redundant handling of the Nothing case.
|
2016-07-07 11:08:55 -04:00 |
|
Rob Rix
|
f042889223
|
Use UnmappedTerm instead of nested tuples.
|
2016-07-07 11:06:05 -04:00 |
|
Rob Rix
|
09ea3c1a76
|
Add an UnmappedTerm type to clarify control flow.
|
2016-07-07 11:05:50 -04:00 |
|
Rob Rix
|
524f71916b
|
🔥 a redundant import.
|
2016-07-07 10:56:03 -04:00 |
|
Rob Rix
|
2d4ca17812
|
Assign diffs the indices from bs.
|
2016-07-07 10:52:44 -04:00 |
|
Rob Rix
|
6747e92e0b
|
🔥 firstAnnotation.
|
2016-07-06 15:55:11 -04:00 |
|
Rob Rix
|
e664aa9ab1
|
🔥 some parens.
|
2016-07-06 11:15:42 -04:00 |
|
Rob Rix
|
5428115895
|
Don’t unique the lists.
|
2016-07-06 10:26:05 -04:00 |
|
Rob Rix
|
04eb0126e2
|
Generalize longestIncreasingSubsequence with a function parameter.
|
2016-07-06 10:25:24 -04:00 |
|
Rob Rix
|
eb6967d006
|
Generalize isSorted with a function parameter.
|
2016-07-06 10:23:21 -04:00 |
|
Rob Rix
|
32a69b05c6
|
O(n) test for sortedness.
|
2016-07-06 10:01:07 -04:00 |
|
Rob Rix
|
5d091abc97
|
Add a (terrible, naïve, gross) implementation of the longest increasing subsequence.
|
2016-07-06 09:53:17 -04:00 |
|
Rob Rix
|
21f331cee9
|
Skip invalid comparisons.
|
2016-07-05 16:45:54 -04:00 |
|
Rob Rix
|
ef916364e5
|
Use the element’s index for replacements/comparisons.
|
2016-07-05 16:23:28 -04:00 |
|
Rob Rix
|
1037bab2d6
|
Swap the feature vector and index.
|
2016-07-05 15:23:02 -04:00 |
|
Rob Rix
|
1323455da4
|
Index the diffs.
|
2016-07-05 14:57:11 -04:00 |
|
Rob Rix
|
baafd5f7a8
|
📝 mergeMaybe, beforeTerm, and afterTerm.
|
2016-07-05 09:45:28 -04:00 |
|
Rob Rix
|
5ea93ba8de
|
🔥 merge.
|
2016-07-05 09:43:03 -04:00 |
|
Rob Rix
|
5d644f7d56
|
📝 rws.
|
2016-07-05 09:40:40 -04:00 |
|
Rob Rix
|
be674ecd97
|
📝 firstAnnotation.
|
2016-07-05 09:35:47 -04:00 |
|
Rob Rix
|
1e2ff9340f
|
📝 Gram.
|
2016-07-05 09:34:17 -04:00 |
|
Rob Rix
|
f53e7d61dd
|
📝 pqGrams.
|
2016-07-05 09:32:03 -04:00 |
|
Rob Rix
|
0a498656c7
|
🔥 serialize.
|
2016-07-05 09:30:28 -04:00 |
|
Rob Rix
|
952cb298eb
|
📝 windowed.
|
2016-07-05 09:29:27 -04:00 |
|
Rob Rix
|
3daf7f96ca
|
📝 featureVector.
|
2016-07-05 09:27:44 -04:00 |
|
Rob Rix
|
9632bea377
|
📝 vmagnitude.
|
2016-07-05 09:26:34 -04:00 |
|
Rob Rix
|
cf6a5d77a6
|
Tacit definition of vmagnitude .
|
2016-07-05 09:25:08 -04:00 |
|
Rob Rix
|
7f6fc45116
|
📝 gramWithPQ.
|
2016-07-05 09:21:49 -04:00 |
|
Rob Rix
|
84e739e540
|
🔥 the Bag type synonym.
|
2016-07-05 09:20:16 -04:00 |
|
Rob Rix
|
d6fef50ad5
|
Add a heading for the instances.
|
2016-07-05 09:19:36 -04:00 |
|
Rob Rix
|
f5ce4e0822
|
🔥 the nearestNeighbour function.
|
2016-07-05 09:19:30 -04:00 |
|
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
|
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
|
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
|
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
|
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
|
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 |
|