| .. |
|
Control
|
Revert "Implement unfold over Free."
|
2016-03-04 15:37:28 -05:00 |
|
Data
|
Both is a PartialSemigroup under a PartialSemigroup which is also a Monoid.
|
2016-03-07 12:58:15 -05:00 |
|
Renderer
|
Swap the order of the operands to splitDiffByLines.
|
2016-03-04 19:29:57 -05:00 |
|
Algorithm.hs
|
Document Algorithm.hs
|
2016-02-03 10:28:44 -05:00 |
|
Alignment.hs
|
Take hlint’s advice.
|
2016-03-07 13:14:34 -05:00 |
|
Category.hs
|
Add an ArrayLiteral category.
|
2016-03-02 23:01:46 -05:00 |
|
Diff.hs
|
Rename the Annotated field accessors.
|
2016-03-02 11:52:20 -05:00 |
|
Diffing.hs
|
Use runBothWith to tidy up a few computations.
|
2016-02-29 19:43:57 -05:00 |
|
DiffOutput.hs
|
Output patches with trailing newlines
|
2016-03-03 13:03:21 -05:00 |
|
Interpreter.hs
|
Remove introduce.
|
2016-03-02 23:17:43 -05:00 |
|
Language.hs
|
.rb → Ruby.
|
2016-02-21 21:57:44 -06:00 |
|
Line.hs
|
Revert "Generic instances everywhere, why not."
|
2016-02-29 21:48:58 -05:00 |
|
Operation.hs
|
Document Operation.hs
|
2016-02-03 10:28:50 -05:00 |
|
Parser.hs
|
Depend on the keyed & fixed categories.
|
2016-02-17 11:03:21 -05:00 |
|
Patch.hs
|
Implement before & after over Both.
|
2016-03-02 14:31:40 -05:00 |
|
Range.hs
|
Remove the Functor constraint from unionRanges.
|
2016-03-04 20:10:45 -05:00 |
|
Renderer.hs
|
Data.Bifunctor.Join is actually Data.Functor.Both.
|
2016-02-28 21:29:59 -05:00 |
|
Row.hs
|
Revert "Construct Row from These."
|
2016-03-07 12:56:48 -05:00 |
|
SES.hs
|
Document SES.hs
|
2016-01-21 10:29:52 -05:00 |
|
Source.hs
|
Overload length to be O(1).
|
2016-03-03 15:32:57 -05:00 |
|
SplitDiff.hs
|
Revert "Sort and extend the imports."
|
2016-03-04 15:32:56 -05:00 |
|
Syntax.hs
|
Revert "Generic instances everywhere, why not."
|
2016-02-29 21:48:58 -05:00 |
|
Term.hs
|
The Foldable instance for OrderedMap takes care of this for us.
|
2016-02-29 19:38:22 -05:00 |
|
TreeSitter.hs
|
array maps to ArrayLiteral.
|
2016-03-02 23:03:47 -05:00 |
