Rob Rix
|
ba1601f089
|
Diff function call arguments byIndex.
|
2016-08-04 11:54:42 -04:00 |
|
Rob Rix
|
efeb01e970
|
Diff objects byIndex.
|
2016-08-04 11:53:08 -04:00 |
|
Rob Rix
|
970ae647d2
|
Diff class definitions byIndex.
|
2016-08-04 11:51:44 -04:00 |
|
Rob Rix
|
15460768bd
|
Diff switch statements’ cases byIndex.
|
2016-08-04 11:48:28 -04:00 |
|
Rob Rix
|
6f39c764fd
|
🔥 a redundant import.
|
2016-08-04 11:48:17 -04:00 |
|
Rob Rix
|
00e538fadb
|
Diff Commented nodes’ comments byIndex.
|
2016-08-04 11:46:02 -04:00 |
|
Rob Rix
|
bb40b363ba
|
Diff Array nodes byIndex.
|
2016-08-04 11:40:35 -04:00 |
|
Rob Rix
|
a138cf5ec2
|
Split out the Indexed handling into a helper function.
|
2016-08-04 11:40:27 -04:00 |
|
Rob Rix
|
e41a0589d5
|
Define recur by closing over the higher-order functions.
|
2016-08-04 11:12:52 -04:00 |
|
Rob Rix
|
d9a1bd29f2
|
🔥 run .
|
2016-08-04 11:11:22 -04:00 |
|
Rob Rix
|
360863cc21
|
Define diffComparableTerms in terms of runAlgorithm .
|
2016-08-04 11:11:12 -04:00 |
|
Rob Rix
|
78a5e8cf32
|
Pare algorithmWithTerms down to its essentials.
|
2016-08-04 11:09:48 -04:00 |
|
Rob Rix
|
401b78099c
|
Generalize algorithmWithTerms over the diff type.
|
2016-08-04 11:08:08 -04:00 |
|
Rob Rix
|
7a2c4ed783
|
Generalize the Algorithm DSL over the term & diff types.
|
2016-08-04 11:06:19 -04:00 |
|
Rob Rix
|
0598e0727e
|
algorithmWithTerms does not constrain the annotation type.
|
2016-08-04 11:03:13 -04:00 |
|
Rob Rix
|
27786f3326
|
🔥 constructAndRun.
|
2016-08-04 11:01:29 -04:00 |
|
Rob Rix
|
1df66429a6
|
run recurs via diffComparableTerms .
|
2016-08-04 11:01:25 -04:00 |
|
Rob Rix
|
47c2bdc60e
|
Use the diff constructor within algorithmWithTerms to compute costs &c.
|
2016-08-04 11:00:29 -04:00 |
|
Rob Rix
|
58fe4fdc89
|
Define constructAndRun.algorithm by case analysis.
|
2016-08-04 10:58:29 -04:00 |
|
Rob Rix
|
0953d430b9
|
Rearrange the definition of constructAndRun a little.
|
2016-08-04 10:56:20 -04:00 |
|
Rob Rix
|
7809ae1756
|
Unpack the annotations &c inline.
|
2016-08-04 10:54:36 -04:00 |
|
Rob Rix
|
99b076df80
|
Define diffTerms in terms of diffComparableTerms.
|
2016-08-04 10:47:31 -04:00 |
|
Rob Rix
|
c0d702c22d
|
Add a diffComparableTerms function.
|
2016-08-04 10:46:48 -04:00 |
|
Rob Rix
|
05b9aee4ea
|
Guard recur on the comparability of its operands.
|
2016-08-04 10:34:14 -04:00 |
|
Rob Rix
|
d12dd5d567
|
Extract the recur function into the where clause.
|
2016-08-04 10:33:37 -04:00 |
|
Rob Rix
|
5acf6ff0f2
|
Check for comparability in diffTerms .
|
2016-08-04 10:32:55 -04:00 |
|
Rob Rix
|
3808b89fe4
|
Use replacing in diffTerms.
|
2016-08-04 10:32:05 -04:00 |
|
Rob Rix
|
18065f5048
|
Merge branch 'master' into algorithm-dsl
|
2016-08-04 10:25:13 -04:00 |
|
Josh Vera
|
e742a8c86d
|
Merge pull request #676 from github/fix-some-other-warnings
Fix some other warnings
|
2016-08-04 10:24:02 -04:00 |
|
Rob Rix
|
f379deca33
|
Use the Foldable instance to avoid a mappend.
|
2016-08-04 10:19:46 -04:00 |
|
Rob Rix
|
5280b62a20
|
Commented terms are named from their children.
|
2016-08-04 10:19:02 -04:00 |
|
joshvera
|
e39ab20eee
|
Use termNameFromSource in toTermName
|
2016-08-04 10:13:56 -04:00 |
|
Rob Rix
|
0bc1993287
|
Merge branch 'master' into algorithm-dsl
|
2016-08-04 10:07:29 -04:00 |
|
Rob Rix
|
2286b2b37b
|
Define toTermName over Error nodes.
|
2016-08-04 10:04:33 -04:00 |
|
Rob Rix
|
6c39b170e8
|
Define toTermName over Commented nodes.
|
2016-08-04 10:04:33 -04:00 |
|
Rob Rix
|
70c6b42e69
|
Add the missing pattern match over methods.
|
2016-08-04 10:04:33 -04:00 |
|
Rob Rix
|
ff954d08c7
|
🔥 the unused CoArbitrary instance over Category.
This also allows us to 🔥 the orphan instance over Text.
|
2016-08-04 10:04:33 -04:00 |
|
Rick Winfrey
|
b91d91ef0f
|
Merge pull request #675 from github/fix-prologue-warnings
[WIP] Fix some warnings
|
2016-08-04 09:03:06 -05:00 |
|
Rob Rix
|
559011de3a
|
🔥 a redundant import.
|
2016-08-04 09:46:21 -04:00 |
|
Rob Rix
|
b41ae038b9
|
Traverse the recursive structure instead of embedding it.
|
2016-08-04 09:26:13 -04:00 |
|
Rob Rix
|
1ee3dcff66
|
Use the Patch DSL to construct replacements.
|
2016-08-04 09:25:33 -04:00 |
|
Rob Rix
|
663bb97a3d
|
Define a DSL for constructing Patches.
|
2016-08-04 09:25:18 -04:00 |
|
Rob Rix
|
53dfd9a3bd
|
Extract a function to construct replacements.
|
2016-08-04 09:05:17 -04:00 |
|
Rob Rix
|
190fa948e2
|
This is already getting exported via Protolude.
|
2016-08-04 08:52:25 -04:00 |
|
Rob Rix
|
b3d09f538e
|
Define run in terms of runAlgorithm.
|
2016-08-03 20:14:41 -04:00 |
|
Rob Rix
|
f9969601e8
|
runAlgorithm receives a constructing function.
|
2016-08-03 20:14:33 -04:00 |
|
Rob Rix
|
78701ddd90
|
Defines a constructor of algorithms over terms.
|
2016-08-03 20:08:20 -04:00 |
|
Rob Rix
|
10e38a8895
|
Algorithm is defined in the Church encoded free monad.
|
2016-08-03 19:50:16 -04:00 |
|
Rob Rix
|
840720d86e
|
Define a runAlgorithm function.
|
2016-08-03 19:48:51 -04:00 |
|
Rob Rix
|
9f6fb541a7
|
Define run by iteration.
|
2016-08-03 18:58:37 -04:00 |
|