Rob Rix
|
fa2769ff9a
|
Use the EditScript synonym from SES.
|
2017-10-24 10:34:29 -04:00 |
|
Rob Rix
|
16d5c977bd
|
🔥 the MappedDiff synonym.
|
2017-10-24 10:21:40 -04:00 |
|
Rob Rix
|
f7ddbd81cc
|
🔥 the RWSEditScript synonym.
|
2017-10-24 10:21:21 -04:00 |
|
Rob Rix
|
9633727790
|
🔥 the Edit synonym.
|
2017-10-24 10:20:34 -04:00 |
|
Rob Rix
|
354204107c
|
Inline the definition of mapContiguous.
|
2017-10-24 10:08:03 -04:00 |
|
Rob Rix
|
7692812a38
|
🔥 mapChunk.
|
2017-10-24 10:06:20 -04:00 |
|
Rob Rix
|
a87d330323
|
🔥 redundant cases.
|
2017-10-24 10:05:50 -04:00 |
|
Rob Rix
|
fc65ef95b2
|
Featurize without getField.
|
2017-10-24 00:03:20 -04:00 |
|
Rob Rix
|
b2ef834746
|
Rename the min index in A.
|
2017-10-24 00:00:33 -04:00 |
|
Rob Rix
|
f6ea602cca
|
Replicate the random double action directly.
|
2017-10-23 23:56:52 -04:00 |
|
Rob Rix
|
0766bb4c1b
|
Generalize mapContiguous over the annotation types.
|
2017-10-23 23:50:10 -04:00 |
|
Rob Rix
|
e2d5e81f7f
|
Leave terms in UnmappedTerm.
|
2017-10-23 23:45:22 -04:00 |
|
Rob Rix
|
fedf85e823
|
Featurize the unmapped terms early.
|
2017-10-23 23:41:00 -04:00 |
|
Rob Rix
|
7c193c0b5e
|
Short-circuit single-element lists.
|
2017-10-23 23:23:08 -04:00 |
|
Rob Rix
|
e0ca6c7ec4
|
Compute the move bound relative to the current index.
|
2017-10-23 23:18:01 -04:00 |
|
Rob Rix
|
74c1c18822
|
Compute the indices up front.
|
2017-10-23 23:12:07 -04:00 |
|
Rob Rix
|
171decf71f
|
🔥 the old rws code path.
|
2017-10-23 23:00:45 -04:00 |
|
Rob Rix
|
d77aed7c2b
|
🔥 the redundant short-circuit cases.
|
2017-10-23 22:28:20 -04:00 |
|
Rob Rix
|
6d4067854d
|
Correct the initial value for the previous index.
|
2017-10-23 22:27:40 -04:00 |
|
Rob Rix
|
f20d5e41ac
|
Correct & align the docs for nearestUnmapped.
|
2017-10-23 21:20:24 -04:00 |
|
Rob Rix
|
01a1ab3b94
|
Name the lists consistently.
|
2017-10-23 21:16:55 -04:00 |
|
Rob Rix
|
4ea2a9dea8
|
Just reverse the lists.
|
2017-10-23 21:10:19 -04:00 |
|
Rob Rix
|
4e5e142381
|
Don’t pass the k-d maps to findNearestNeighbourTo'.
|
2017-10-23 21:07:45 -04:00 |
|
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 |
|
Rick Winfrey
|
1de4ab6bc0
|
Update if-statements tests
|
2017-10-23 16:52:36 -07:00 |
|
Rick Winfrey
|
d7be269a01
|
Assign if statements with if initializers
|
2017-10-23 16:41:11 -07:00 |
|
Rick Winfrey
|
5ad5a882ba
|
Merge branch 'master' into go-assignment
|
2017-10-23 15:10:29 -07: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 |
|