Rob Rix
|
45c78ed7f3
|
Define a GEq1 instance for K1 with Eq fields.
|
2017-02-21 16:14:31 -05:00 |
|
Rob Rix
|
3e66861ac4
|
Define a GEq1 instance for Par1.
|
2017-02-21 16:13:36 -05:00 |
|
Rob Rix
|
991731e43f
|
Only export genericLiftEq.
|
2017-02-21 16:11:31 -05:00 |
|
Rob Rix
|
18374a0397
|
📝 genericLiftEq.
|
2017-02-21 16:11:10 -05:00 |
|
Rob Rix
|
6ecbe9538f
|
📝 GEq1.
|
2017-02-21 16:10:07 -05:00 |
|
Rob Rix
|
c5e9a5d6cd
|
Define a GEq1 instance for U1.
|
2017-02-21 16:08:46 -05:00 |
|
Rob Rix
|
64e0c00353
|
Define a generic liftEq for Generic1 types with GEq1 instances.
|
2017-02-21 16:08:35 -05:00 |
|
Rob Rix
|
1cd3216f47
|
Stub in a GEq1 typeclass.
|
2017-02-21 16:03:35 -05:00 |
|
Rob Rix
|
e31191f4fa
|
Stub in a module for a generic Eq1 instance.
|
2017-02-21 16:00:36 -05:00 |
|
Rob Rix
|
b48a15e277
|
Specialize decompose to record annotations.
|
2017-02-21 15:41:07 -05:00 |
|
Rob Rix
|
e7cc5a9c6e
|
Merge branch '🔥-cost' into interpreter-decomposition
|
2017-02-21 15:35:41 -05:00 |
|
Rob Rix
|
7daf9b3571
|
Merge branch 'gadt-algorithm' into interpreter-decomposition
|
2017-02-21 15:32:32 -05:00 |
|
Rob Rix
|
fe326bcf03
|
🔥 the comparability parameter to diffTerms.
|
2017-02-21 15:23:30 -05:00 |
|
Rob Rix
|
c4f37454d6
|
🔥 the construct parameter to diffTerms.
|
2017-02-21 15:17:35 -05:00 |
|
Rob Rix
|
04b929822e
|
🔥 Cost.
|
2017-02-21 14:58:39 -05:00 |
|
Rob Rix
|
d288ec1d17
|
🔥 cost & setCost.
|
2017-02-21 14:56:34 -05:00 |
|
Rob Rix
|
a7d73e9bf1
|
🔥 termCostDecorator.
|
2017-02-21 14:54:54 -05:00 |
|
Rob Rix
|
7be2232bb6
|
🔥 parserWithCost.
|
2017-02-21 14:54:23 -05:00 |
|
Rob Rix
|
6526076056
|
Don’t decorate terms with costs.
|
2017-02-21 14:53:42 -05:00 |
|
Rob Rix
|
d90957c4ba
|
parserForFilepath does not decorate with Cost.
|
2017-02-21 14:52:17 -05:00 |
|
Rob Rix
|
7f2b274668
|
Diffing does not require the presence of a Cost field.
|
2017-02-21 14:49:22 -05:00 |
|
Rob Rix
|
67b162895c
|
🔥 costs from Split output.
|
2017-02-21 14:48:03 -05:00 |
|
Rob Rix
|
cc776a2f6d
|
🔥 SES algorithms.
|
2017-02-21 14:35:22 -05:00 |
|
Rob Rix
|
01c47fa0c1
|
🔥 the computation of costs.
|
2017-02-21 14:34:24 -05:00 |
|
Rob Rix
|
691f7cfebf
|
Correct the docs for the smart constructors.
|
2017-02-21 14:03:57 -05:00 |
|
Rob Rix
|
c966257fc8
|
Decompose deletions, insertions, and replacements.
|
2017-02-21 13:55:06 -05:00 |
|
Rob Rix
|
330873659c
|
Merge branch 'master' into gadt-algorithm
|
2017-02-21 13:46:01 -05:00 |
|
Rob Rix
|
dfc992ad0e
|
Merge pull request #1014 from github/update-tree-sitter-scripts
Small script to make updating tree-sitter a bit easier
|
2017-02-21 13:45:40 -05:00 |
|
Rob Rix
|
3b71c510e7
|
Define a function decomposing an algorithm into its next steps.
|
2017-02-21 13:40:59 -05:00 |
|
Rob Rix
|
c198dac33d
|
Add galignWith to the GAlign typeclass.
|
2017-02-21 13:37:28 -05:00 |
|
Josh Vera
|
229712cc73
|
Merge branch 'master' into gadt-algorithm
|
2017-02-21 12:20:35 -05:00 |
|
Josh Vera
|
a8e921fe2d
|
Merge pull request #1013 from github/bump-languages
Bump Ruby and JavaScript parsers
|
2017-02-21 12:19:34 -05:00 |
|
Rob Rix
|
9cf6b262eb
|
Add Delete, Insert, and Replace algorithms.
|
2017-02-21 11:40:13 -05:00 |
|
Rob Rix
|
e33eaccc79
|
Correct the docs for the smart constructors.
|
2017-02-21 11:39:41 -05:00 |
|
Rob Rix
|
8ac9583171
|
Merge branch 'master' into bump-languages
|
2017-02-21 11:38:00 -05:00 |
|
Rob Rix
|
71ec6575ca
|
Merge pull request #1012 from github/bump-tree-sitter-error-recovery-fix
Bump tree-sitter (haskell-tree-sitter) to get latest error recovery fixes
|
2017-02-21 11:37:50 -05:00 |
|
Timothy Clem
|
2f2d72a462
|
Bump Ruby and JavaScript parsers
|
2017-02-21 08:24:43 -08:00 |
|
Timothy Clem
|
a8a9543d4c
|
++haskell-tree-sitter
|
2017-02-21 08:21:03 -08:00 |
|
Rob Rix
|
9b3d8a4949
|
Replace the old iterAp with the one taking a continuation.
|
2017-02-21 10:53:20 -05:00 |
|
Rob Rix
|
b5d6b4dbce
|
📝 iterAp'.
|
2017-02-21 10:47:06 -05:00 |
|
Rob Rix
|
687c7c5ea1
|
Rename the Algorithm constructors to reflect the algorithms performed.
|
2017-02-21 10:46:19 -05:00 |
|
Rob Rix
|
ddca615e65
|
Define an iterator which does not require a Functor instance.
|
2017-02-21 10:44:48 -05:00 |
|
Rob Rix
|
e682c4164c
|
Enable pattern-matches on AlgorithmF again.
|
2017-02-21 10:41:46 -05:00 |
|
Rob Rix
|
6f30690b71
|
Document time complexity.
|
2017-02-21 10:38:10 -05:00 |
|
Rob Rix
|
984be76b0f
|
Better docs for the AlgorithmF constructors.
|
2017-02-21 10:29:02 -05:00 |
|
Rob Rix
|
303ba57d27
|
Tidy up the AlgorithmF docs.
|
2017-02-21 10:26:27 -05:00 |
|
Rob Rix
|
f79adf7493
|
Express AlgorithmF as a GADT.
|
2017-02-21 10:25:25 -05:00 |
|
Rob Rix
|
5c1c055ba2
|
Merge pull request #1010 from github/ruby-constant-changes
++tree-sitter-ruby for new constant parsing
|
2017-02-21 09:12:13 -05:00 |
|
Timothy Clem
|
9910f8dd16
|
Add friendly category name now that we have singleton methods
|
2017-02-17 14:57:29 -08:00 |
|
Timothy Clem
|
854eeee9fb
|
++tree-sitter-ruby for new constant parsing
|
2017-02-17 14:16:29 -08:00 |
|