Rob Rix
|
65f7490809
|
Don’t pass the term index to findNearestNeighbourTo'.
|
2017-10-23 21:06:18 -04:00 |
|
Rob Rix
|
d5c9a68f78
|
Handle the short-circuit cases early.
|
2017-10-23 21:05:30 -04:00 |
|
Rob Rix
|
95b50b2dc4
|
🔥 a redundant case.
|
2017-10-23 21:01:38 -04:00 |
|
Rob Rix
|
2ca40cad2b
|
Take the index of the first, not last, element.
|
2017-10-23 21:00:15 -04:00 |
|
Rob Rix
|
f30029d16d
|
Build up diff lists for contiguous chunks
|
2017-10-23 20:50:01 -04:00 |
|
Rob Rix
|
40631d8d00
|
Define top-level RWS in terms of mapContiguous.
|
2017-10-23 20:43:22 -04:00 |
|
Rob Rix
|
72f6981f15
|
Run RWS over the contiguous chunks.
|
2017-10-23 20:41:21 -04:00 |
|
Rob Rix
|
ed6be539aa
|
Correct the ComparabilityRelation’s type.
|
2017-10-23 20:41:10 -04:00 |
|
Rob Rix
|
6134a24d8d
|
Map the ls and rs separately.
|
2017-10-23 16:56:15 -04:00 |
|
Rob Rix
|
76d3373d39
|
mapContiguous takes a ComparabilityRelation.
|
2017-10-23 16:45:25 -04:00 |
|
Rob Rix
|
9c37f641da
|
Define a function mapping contiguous chunks of non-equivalent terms.
|
2017-10-23 16:43:17 -04:00 |
|
Rob Rix
|
39a1c46f6a
|
Delete elements before the mapped element.
|
2017-10-23 16:19:35 -04:00 |
|
Rob Rix
|
2be26f291a
|
🔥 an obsolete commented out line.
|
2017-10-23 16:13:46 -04:00 |
|
Rob Rix
|
44e58494af
|
Add the mappedness conditions to the alternative definition.
|
2017-10-23 16:12:38 -04:00 |
|
Rob Rix
|
e57b96c1de
|
Bind the tail of the list.
|
2017-10-23 16:11:37 -04:00 |
|
Rob Rix
|
95cba6a244
|
Find the min element once, early.
|
2017-10-23 16:09:56 -04:00 |
|
Rob Rix
|
9a61d32ae0
|
Add the mappedness condition to the predicate.
|
2017-10-23 16:08:19 -04:00 |
|
Rob Rix
|
192b797576
|
Fail fast when we’ve mapped everything.
|
2017-10-23 16:05:58 -04:00 |
|
Rob Rix
|
dcb4f256c1
|
Use the predicate definition of nearestUnmapped.
|
2017-10-23 15:54:09 -04:00 |
|
Rob Rix
|
76863d9e52
|
Use the fmap operator.
|
2017-10-23 15:50:06 -04:00 |
|
Rob Rix
|
226ba36c60
|
Pass the predicate directly to nearestUnmapped'.
|
2017-10-23 15:49:35 -04:00 |
|
Rob Rix
|
2f20573991
|
Give an alternative definition of findNearestNeighbourTo based on lists of unmapped terms.
|
2017-10-23 15:43:22 -04:00 |
|
Rob Rix
|
52921e8767
|
Give an alternative definition of nearestUnmapped based on lists of unmapped terms.
|
2017-10-23 15:43:02 -04:00 |
|
Rob Rix
|
c1fe9d588c
|
Move the filter back into findNearestNeighbourTo.
|
2017-10-23 15:32:09 -04:00 |
|
Rob Rix
|
9108620607
|
🔥 redundant parens.
|
2017-10-23 15:29:12 -04:00 |
|
Rob Rix
|
dda974e4c5
|
Express nearAndComparableTo without reference to the keys.
|
2017-10-23 15:25:55 -04:00 |
|
Rob Rix
|
919862a1a2
|
editDistanceUpTo does not need to be computed on pure insertions/deletions.
|
2017-10-23 15:04:44 -04:00 |
|
Rob Rix
|
bd3e1d35ba
|
The minimum index is the first index.
|
2017-10-23 14:57:44 -04:00 |
|
Rob Rix
|
c7bf64213d
|
Simplify the selection of the minimum term index.
|
2017-10-23 14:57:01 -04:00 |
|
Rob Rix
|
1dcc904639
|
Define deleteRemaining in terms of insertMapped.
|
2017-10-23 14:45:11 -04:00 |
|
Rob Rix
|
6bd44acdda
|
Chain the high-level flow.
|
2017-10-23 14:37:11 -04:00 |
|
Rob Rix
|
76cfa737e1
|
Represent MappedDiff as These of pairs rather than pairs of Theses.
|
2017-10-23 14:14:10 -04:00 |
|
Rob Rix
|
3729189aad
|
Restore defaultMoveBound & interpret it as the number of places following the previous index.
|
2017-10-23 13:35:00 -04:00 |
|
Rob Rix
|
1b432d9cba
|
Inline the definition of isInMoveBounds.
|
2017-10-23 13:27:01 -04:00 |
|
Rob Rix
|
f721f287b0
|
Extract a function for the nearby/comparability filter.
|
2017-10-23 12:40:46 -04:00 |
|
Rob Rix
|
e9f7e7e09e
|
Don’t pass the comparability relation to nearestUnmapped.
|
2017-10-23 12:23:12 -04:00 |
|
Rob Rix
|
8cd4c596bd
|
🔥 editDistanceIfComparable.
|
2017-10-23 12:22:14 -04:00 |
|
Rob Rix
|
598901b8da
|
🔥 the comparability test for the approximate edit distance computation.
|
2017-10-23 12:22:00 -04:00 |
|
Rob Rix
|
b41fa03a3e
|
🔥 a redundant comparability check.
|
2017-10-23 12:20:55 -04:00 |
|
Rob Rix
|
0fb84d5ff3
|
Filter the sets of candidates by comparability.
|
2017-10-23 12:20:22 -04:00 |
|
Rob Rix
|
3462892131
|
🔥 redundant imports.
|
2017-10-23 11:59:19 -04:00 |
|
Rob Rix
|
3351c60859
|
Move the permutation tests into InterpreterSpec.
|
2017-10-23 11:58:52 -04:00 |
|
Rob Rix
|
6200a00b6e
|
Rename the identity diff property.
|
2017-10-23 11:58:43 -04:00 |
|
Rob Rix
|
46e2b5fb15
|
Rename the interpreter spec.
|
2017-10-23 11:58:31 -04:00 |
|
Rob Rix
|
a23d60dc09
|
🔥 a redundant test that equal terms produce identity diffs.
|
2017-10-23 11:57:36 -04:00 |
|
Rob Rix
|
1652dc1147
|
🔥 redundant tests of the lossless property.
|
2017-10-23 11:55:44 -04:00 |
|
Rob Rix
|
9c1dce7ab9
|
🔥 the Context/Empty Listable instances.
|
2017-10-23 11:53:42 -04:00 |
|
Rob Rix
|
c0d833f361
|
🔥 the Context/Empty tests of the Mergeable laws.
|
2017-10-23 11:53:36 -04:00 |
|
Rob Rix
|
16b86bb9a2
|
beforeTerm/afterTerm can handle substructural diffs.
|
2017-10-23 11:10:53 -04:00 |
|
Rob Rix
|
293731e71b
|
Define the Mergeable instance for NonEmpty recursively.
This prevents failure in the first element precluding success later on.
|
2017-10-23 10:58:13 -04:00 |
|