diff options
| author | Simon Marlow <marlowsd@gmail.com> | 2016-03-04 13:06:42 +0000 |
|---|---|---|
| committer | Simon Marlow <marlowsd@gmail.com> | 2016-03-11 16:14:25 +0000 |
| commit | 2f45cf3f48162a5f843005755dafa1c5c1b451a7 (patch) | |
| tree | 33d4eaacb1e4107228361236cb9946226e8e4e0c /testsuite/tests/ado/ado-optimal.stdout | |
| parent | 7ba817c217d3c5c4dd9550b0cf0f4314b54895a3 (diff) | |
| download | haskell-2f45cf3f48162a5f843005755dafa1c5c1b451a7.tar.gz | |
Add -foptimal-applicative-do
Summary:
The algorithm for ApplicativeDo rearrangement is based on a heuristic
that runs in O(n^2). This patch adds the optimal algorithm, which is
O(n^3), selected by a flag (-foptimal-applicative-do). It finds better
solutions in a small number of cases (about 2% of the cases where
ApplicativeDo makes a difference), but it can be very slow for large do
expressions. I'm mainly adding it for experimental reasons.
ToDo: user guide docs
Test Plan: validate
Reviewers: simonpj, bgamari, austin, niteria, erikd
Subscribers: thomie
Differential Revision: https://phabricator.haskell.org/D1969
Diffstat (limited to 'testsuite/tests/ado/ado-optimal.stdout')
| -rw-r--r-- | testsuite/tests/ado/ado-optimal.stdout | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/testsuite/tests/ado/ado-optimal.stdout b/testsuite/tests/ado/ado-optimal.stdout new file mode 100644 index 0000000000..29f9856d5f --- /dev/null +++ b/testsuite/tests/ado/ado-optimal.stdout @@ -0,0 +1 @@ +((a; b) | (c; d)); e |