7181 Commits

This Branch

This Branch

All Branches

Author	SHA1	Message	Date
Rob Rix	bf98d23d8f	The contrasting function takes functors.	2016-07-11 11:54:03 -04:00
Rob Rix	c597a8cfa6	Pass a contrasting function around.	2016-07-11 11:47:16 -04:00
Rob Rix	f97169b064	We no longer need syb.	2016-07-11 11:46:58 -04:00
Rob Rix	748bdbfc72	Merge branch 'master' into generic-zip	2016-07-11 11:41:58 -04:00
Rob Rix	dd4c1d9fde	Replace alignF with a typeclass for alignment.	2016-07-11 11:39:02 -04:00
Rob Rix	5ffecda63c	Pretty sure that guard is redundant to the one in alignM.	2016-07-08 18:00:28 -04:00
Rob Rix	6c2948e317	Try to implement alignment over functors. Try, and fail miserably.	2016-07-08 17:59:54 -04:00
Rob Rix	15a0022152	The contrasting function must be polymorphic.	2016-07-08 14:04:16 -04:00
Rob Rix	f6ba2f8408	Implement a partial alignment function for Syntax.	2016-07-08 14:01:09 -04:00
Rob Rix	59bc42b731	Don’t attempt to align non-overlapping terms.	2016-07-08 14:00:07 -04:00
Rob Rix	032dcb047b	Pass both the syntaxes to the helper function directly.	2016-07-08 13:57:25 -04:00
Rob Rix	9242d2fe7c	Add an alignment function over Cofree f a.	2016-07-08 13:44:29 -04:00
Rob Rix	39a1869bf5	Add a (naïve) Align instance over OrderedMap.	2016-07-08 13:38:48 -04:00
Rob Rix	1bf9d63acf	Whoops.	2016-07-08 12:17:38 -04:00
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
Josh Vera	81b37bd546	Merge pull request #628 from github/that's-a-wrap ... Hint to use `wrap`.	2016-07-07 17:20:01 -04:00
Rob Rix	7e9000853e	Hint to use wrap.	2016-07-07 17:09:39 -04:00
Josh Vera	6a23829516	Merge pull request #625 from github/strongly-ordered-random-walk-similarity-diffs ... Strongly ordered random walk similarity diffs	2016-07-07 16:31:07 -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	2108cddff6	Test rws’ behaviour w.r.t. ordering.	2016-07-07 10:37:55 -04:00
Rob Rix	6747e92e0b	🔥 firstAnnotation.	2016-07-06 15:55:11 -04:00
Rob Rix	6a6265be2d	Merge branch 'master' into strongly-ordered-random-walk-similarity-diffs	2016-07-06 14:18:44 -04:00
Josh Vera	6420010a6c	Merge pull request #617 from github/random-walk-similarity ... Random walk similarity	2016-07-06 14:15:32 -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