01593aa...master · elk

.github/CONTRIBUTING.mdnew file+41

@@ -0,0 +1,41 @@

1+# Contributing to Elm

2+

3+Thanks helping with the development of Elm! This document describes the basic

4+standards for opening pull requests and making the review process as smooth as

5+possible.

6+

7+

8+## Expectations

9+

10+- Pull requests are reviewed in [batches](https://github.com/elm/expectations/blob/master/batching.md), so it can take some time to get a response.

11+- Smaller pull requests are easier to review. To fix nine typos, nine specific issues will always go faster than one big one. Learn why [here](https://github.com/elm/expectations/blob/master/small-pull-requests.md).

12+- Reviewers may not know as much as you about certain situations, so add links to supporting evidence for important claims, especially regarding standards for CSS, HTTP, URI, etc.

13+

14+Finally, please be patient with the core team. They are trying their best with limited resources!

15+

16+

17+## Style Guide

18+

19+ * Haskell — conform to [these guidelines][haskell]

20+ * JavaScript — use [Google's JS style guide][js]

21+

22+[haskell]: https://gist.github.com/evancz/0a1f3717c92fe71702be

23+[js]: https://google.github.io/styleguide/javascriptguide.xml

24+

25+

26+## Branches

27+

28+[The master branch][master] is the home of the next release of the compiler

29+so new features and improvements get merged there. Most pull requests

30+should target this branch!

31+

32+[master]: http://github.com/elm-lang/elm/tree/master

33+

34+

35+## Licensing

36+

37+Nothing extra to do for this. The default on GitHub described [here](https://docs.github.com/en/github/site-policy/github-terms-of-service#6-contributions-under-repository-license) is that:

38+

39+> Whenever you add Content to a repository containing notice of a license, you license that Content under the same terms, and you agree that you have the right to license that Content under those terms. If you have a separate agreement to license that Content under different terms, such as a contributor license agreement, that agreement will supersede.

40+

41+

.github/ISSUE_TEMPLATE.mdnew file+18

@@ -0,0 +1,18 @@

1+

2+**Quick Summary:** ???

3+

4+

5+## SSCCE

6+

7+```elm

8+

9+```

10+

11+- **Elm:** ???

12+- **Browser:** ???

13+- **Operating System:** ???

14+

15+

16+## Additional Details

17+

18+???

.github/PULL_REQUEST_TEMPLATE.mdnew file+18

@@ -0,0 +1,18 @@

1+

2+**Quick Summary:** ???

3+

4+

5+## SSCCE

6+

7+```elm

8+

9+```

10+

11+- **Elm:** ???

12+- **Browser:** ???

13+- **Operating System:** ???

14+

15+

16+## Additional Details

17+

18+???

.github/workflows/set-issue-expectations.ymlnew file+21

@@ -0,0 +1,21 @@

1+name: Set Issue Expectations

2+on:

3+ issues:

4+ types: [opened]

5+jobs:

6+ comment-on-issue:

7+ name: Comment On Issue

8+ runs-on: ubuntu-latest

9+ steps:

10+ - uses: actions/github@v1.0.0

11+ env:

12+ GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

13+ with:

14+ args: |

15+ comment "Thanks for reporting this! To set expectations:

16+

17+ - Issues are reviewed in [batches](https://github.com/elm/expectations/blob/master/batching.md), so it can take some time to get a response.

18+ - Ask questions in a [community forum](https://elm-lang.org/community). You will get an answer quicker that way!

19+ - If you experience something similar, open a new issue. [We like duplicates](https://github.com/elm/expectations/blob/master/duplicates.md).

20+

21+ Finally, please be patient with the core team. They are trying their best with limited resources."

.github/workflows/set-pull-expectations.ymlnew file+19

@@ -0,0 +1,19 @@

1+on:

2+ pull_request_target:

3+ types: [opened]

4+

5+jobs:

6+ comment-on-pull:

7+ name: Comment On Pull

8+ runs-on: ubuntu-latest

9+ steps:

10+ - uses: actions/github-script@v3

11+ with:

12+ github-token: ${{secrets.GITHUB_TOKEN}}

13+ script: |

14+ github.issues.createComment({

15+ issue_number: context.issue.number,

16+ owner: context.repo.owner,

17+ repo: context.repo.repo,

18+ body: "Thanks for suggesting these code changes. To set expectations:\n\n- Pull requests are reviewed in [batches](https://github.com/elm/expectations/blob/master/batching.md), so it can take some time to get a response.\n- Smaller pull requests are easier to review. To fix nine typos, nine specific issues will always go faster than one big one. Learn why [here](https://github.com/elm/expectations/blob/master/small-pull-requests.md).\n- Reviewers may not know as much as you about certain situations, so add links to supporting evidence for important claims, especially regarding standards for CSS, HTTP, URI, etc.\n\nFinally, please be patient with the core team. They are trying their best with limited resources."

19+ })

.gitignore+4−9

@@ -1,13 +1,8 @@

1+elm-stuff

12dist

23cabal-dev

3−*.o

4−*.hi

5−*.chi

6−*.chs.h

7−*.aes

8−*.elmi

9−*.elmo

10−data

11−*/ElmFiles/*

4+.cabal-sandbox/

5+cabal.sandbox.config

126.DS_Store

137*~

8+travis.log

.travis.yml+28−3

@@ -1,3 +1,28 @@

1−language: haskell

2−ghc:

3− - 7.6

1+language: minimal

2+services: docker

3+

4+env:

5+ global:

6+ - LINUX_ARCHIVE=binary-for-linux-64-bit.gz

7+

8+before_install:

9+ - docker build -t elm -f installers/linux/Dockerfile .

10+ - docker cp $(docker create elm):/usr/local/bin/elm .

11+ - gzip -9 -c elm > $LINUX_ARCHIVE

12+

13+deploy:

14+ provider: releases

15+ api_key:

16+ secure: Yz2Lo4u9rZQ7Ee7ohAsrZpkqsYDUerCSMdSQIH8ryrf7phHhiloPEkTKsM+NupHqU/LEAVsunxbau4QrCEjA2vPavAPVk8cKomRUWK/YjbXHKa24hPkal2c+A2bnMQ6w3qYk/PjL9rW+Goq++/SNLcYZwHBV0Chl2blivMwWCSA=

17+ file: $LINUX_ARCHIVE

18+ skip_cleanup: true

19+ on:

20+ branch: master

21+ tags: true

22+

23+notifications:

24+ email:

25+ recipients:

26+ - rlefevre@dmy.fr

27+ on_success: change

28+ on_failure: change

CONTRIBUTING.mddeleted−35

@@ -1,35 +0,0 @@

1−# Contributing to Elm

2−

3−Thanks helping with the development of Elm! This document

4−describes the basic standards for opening pull requests:

5−

6−## Branches

7−

8− * The master branch of Elm is for tagging previous releases

9− and non-breaking changes, like bug fixes. This branch is

10− handy for folks who want to build the most recent public

11− release from source.

12−

13− * The dev branch is where the most active development occurs.

14− It is the home of the next release of the compiler so new

15− features and improvements get merged there.

16−

17−## Opening a pull request

18−

19−**Please open PRs against the [dev branch of

20−Elm](http://github.com/evancz/elm/tree/dev) whenever possible.** Changes that

21−are compatible with the API of master will be merged to master as soon as

22−possible. Changes that affect Elm's API will be merged to master with a future

23−release of the compiler.

24−

25−Note that changes in the master branch of [Elm](https://github.com/evancz/Elm/)

26−are able to be compiled against the master branch of the [elm-lang.org

27−repo](https://github.com/evancz/elm-lang.org), and the dev branch of

28−[Elm](https://github.com/evancz/Elm/) is able to be built with the dev branch of

29−the [elm-lang.org repo](https://github.com/evancz/elm-lang.org). Please make

30−sure that your changes maintain this compatibility.

31−

32−## Licensing

33−

34−You should sign the [contributor agreement](ContributorAgreement.pdf)

35−and send it to <info@elm-lang.org> before opening your pull request.

ContributorAgreement.pdfdeleted

Binary file not shown.

Elm.cabaldeleted−278

@@ -1,278 +0,0 @@

1−Name: Elm

2−Version: 0.12

3−Synopsis: The Elm language module.

4−Description: Elm aims to make client-side web-development more pleasant.

5− It is a statically/strongly typed, functional reactive

6− language to HTML, CSS, and JS. This package provides a

7− library for Elm compilation in Haskell and a compiler

8− executable.

9−

10−Homepage: http://elm-lang.org

11−

12−License: BSD3

13−License-file: LICENSE

14−

15−Author: Evan Czaplicki

16−Maintainer: info@elm-lang.org

18−

19−Category: Compiler, Language

20−

21−Build-type: Custom

22−

23−Extra-source-files: changelog.md

24−Data-dir: data

25−Data-files: elm-runtime.js interfaces.data docs.json

26−Cabal-version: >=1.9

27−

28−source-repository head

29− type: git

30− location: git://github.com/evancz/Elm.git

31−

32−Library

33− exposed-modules: Elm.Internal.Dependencies,

34− Elm.Internal.Documentation,

35− Elm.Internal.Name,

36− Elm.Internal.Paths,

37− Elm.Internal.Utils,

38− Elm.Internal.Version

39− Hs-Source-Dirs: compiler

40− other-modules: SourceSyntax.Annotation,

41− SourceSyntax.Declaration,

42− SourceSyntax.Expression,

43− SourceSyntax.Helpers,

44− SourceSyntax.Literal,

45− SourceSyntax.Module,

46− SourceSyntax.Pattern,

47− SourceSyntax.PrettyPrint,

48− SourceSyntax.Type,

49− SourceSyntax.Variable,

50− Generate.JavaScript,

51− Generate.JavaScript.Helpers,

52− Generate.JavaScript.Ports,

53− Generate.Markdown,

54− Generate.Html,

55− Generate.Cases,

56− Transform.Canonicalize,

57− Transform.Check,

58− Transform.Expression,

59− Transform.Declaration,

60− Transform.Definition,

61− Transform.SafeNames,

62− Transform.SortDefinitions,

63− Transform.Substitute,

64− Metadata.Prelude,

65− Parse.Binop,

66− Parse.Declaration,

67− Parse.Expression,

68− Parse.Helpers,

69− Parse.Literal,

70− Parse.Module,

71− Parse.Parse,

72− Parse.Pattern,

73− Parse.Type,

74− Type.Alias,

75− Type.Constrain.Declaration,

76− Type.Constrain.Expression,

77− Type.Constrain.Literal,

78− Type.Constrain.Pattern,

79− Type.Environment,

80− Type.ExtraChecks,

81− Type.Fragment,

82− Type.Inference,

83− Type.PrettyPrint,

84− Type.Solve,

85− Type.State,

86− Type.Type,

87− Type.Unify,

88− Build.Dependencies,

89− Build.File,

90− Build.Flags,

91− Build.Interface,

92− Build.Print,

93− Build.Source,

94− Build.Utils,

95− Paths_Elm

96−

97− Build-depends: aeson,

98− base >=4.2 && <5,

99− binary >= 0.6.4.0,

100− blaze-html >= 0.5 && < 0.8,

101− blaze-markup,

102− bytestring,

103− cmdargs,

104− containers >= 0.3,

105− directory,

106− filepath,

107− indents,

108− language-ecmascript >=0.15 && < 1.0,

109− mtl >= 2,

110− pandoc >= 1.10,

111− parsec >= 3.1.1,

112− pretty,

113− text,

114− transformers >= 0.2,

115− union-find,

116− unordered-containers

117−

118−Executable elm

119− Main-is: Compiler.hs

120− ghc-options: -threaded -O2

121− Hs-Source-Dirs: compiler

122− other-modules: SourceSyntax.Annotation,

123− SourceSyntax.Declaration,

124− SourceSyntax.Expression,

125− SourceSyntax.Helpers,

126− SourceSyntax.Literal,

127− SourceSyntax.Module,

128− SourceSyntax.Pattern,

129− SourceSyntax.PrettyPrint,

130− SourceSyntax.Type,

131− SourceSyntax.Variable,

132− Generate.JavaScript,

133− Generate.JavaScript.Helpers,

134− Generate.JavaScript.Ports,

135− Generate.Markdown,

136− Generate.Html,

137− Generate.Cases,

138− Transform.Canonicalize,

139− Transform.Check,

140− Transform.Expression,

141− Transform.Declaration,

142− Transform.Definition,

143− Transform.SafeNames,

144− Transform.SortDefinitions,

145− Transform.Substitute,

146− Metadata.Prelude,

147− Parse.Binop,

148− Parse.Declaration,

149− Parse.Expression,

150− Parse.Helpers,

151− Parse.Literal,

152− Parse.Module,

153− Parse.Parse,

154− Parse.Pattern,

155− Parse.Type,

156− Type.Alias,

157− Type.Constrain.Declaration,

158− Type.Constrain.Expression,

159− Type.Constrain.Literal,

160− Type.Constrain.Pattern,

161− Type.Environment,

162− Type.ExtraChecks,

163− Type.Fragment,

164− Type.Inference,

165− Type.PrettyPrint,

166− Type.Solve,

167− Type.State,

168− Type.Type,

169− Type.Unify,

170− Build.Dependencies,

171− Build.File,

172− Build.Flags,

173− Build.Interface,

174− Build.Print,

175− Build.Source,

176− Build.Utils,

177− Paths_Elm

178−

179− Build-depends: aeson,

180− base >=4.2 && <5,

181− binary >= 0.6.4.0,

182− blaze-html >= 0.5 && < 0.8,

183− blaze-markup,

184− bytestring,

185− cmdargs,

186− containers >= 0.3,

187− directory,

188− filepath,

189− indents,

190− language-ecmascript >=0.15 && < 1.0,

191− mtl >= 2,

192− pandoc >= 1.10,

193− parsec >= 3.1.1,

194− pretty,

195− text,

196− transformers >= 0.2,

197− union-find,

198− unordered-containers

199−

200−Executable elm-doc

201− Main-is: Docs.hs

202− Hs-Source-Dirs: compiler

203− other-modules: SourceSyntax.Annotation,

204− SourceSyntax.Declaration,

205− SourceSyntax.Expression,

206− SourceSyntax.Helpers,

207− SourceSyntax.Literal,

208− SourceSyntax.Module,

209− SourceSyntax.Pattern,

210− SourceSyntax.PrettyPrint,

211− SourceSyntax.Type,

212− SourceSyntax.Variable,

213− Parse.Binop,

214− Parse.Declaration,

215− Parse.Expression,

216− Parse.Helpers,

217− Parse.Literal,

218− Parse.Module,

219− Parse.Pattern,

220− Parse.Type

221−

222− Build-depends: aeson,

223− aeson-pretty,

224− base >=4.2 && <5,

225− binary >= 0.6.4.0,

226− bytestring,

227− cmdargs,

228− containers >= 0.3,

229− directory,

230− filepath,

231− indents,

232− mtl >= 2,

233− pandoc >= 1.10,

234− parsec >= 3.1.1,

235− pretty,

236− text,

237− union-find

238−

239−Test-Suite test-elm

240− Type: exitcode-stdio-1.0

241− Hs-Source-Dirs: tests, compiler

242− Main-is: Main.hs

243− other-modules: Tests.Compiler

244− Tests.Property

245− Tests.Property.Arbitrary

246− SourceSyntax.Helpers

247− SourceSyntax.Literal

248− SourceSyntax.PrettyPrint

249− build-depends: base,

250− directory,

251− Elm,

252− test-framework,

253− test-framework-hunit,

254− test-framework-quickcheck2 >= 0.3,

255− HUnit,

256− pretty,

257− QuickCheck >= 2 && < 3,

258− filemanip,

259− aeson,

260− base >=4.2 && <5,

261− binary >= 0.6.4.0,

262− blaze-html == 0.5.* || == 0.6.*,

263− blaze-markup == 0.5.1.*,

264− bytestring,

265− cmdargs,

266− containers >= 0.3,

267− directory,

268− filepath,

269− indents,

270− language-ecmascript >=0.15 && < 1.0,

271− mtl >= 2,

272− pandoc >= 1.10,

273− parsec >= 3.1.1,

274− pretty,

275− text,

276− transformers >= 0.2,

277− union-find,

278− unordered-containers

How to Request Features.mddeleted−93

@@ -1,93 +0,0 @@

1−# How to make a Feature Request

2−

3−Adding features is hard work and has long term implications for Elm.

4−If you think your particular feature is important, help make it happen

5−by doing some of the background work that goes into actually adding it.

6−

7−### Before making a Request / Formatting:

8−

9− - Make sure your feature has not already been requested. Look through the

10− email list to find similar requests.

11− - Submit feature requests by emailing the list. This allows the broadest

12− discussion and does not clutter up the GitHub repository with speculative

13− issues. I'd prefer to use the GitHub issue tracker for bug tracking and

14− issues with the existing code base.

15− - Label all feature requests with a subject like "Request: _____". For

16− example, if you want to be the umpteenth person to request type classes,

17− you would use the subject "Request: Type Classes".

18−

19−### Body of the Request:

20−

21−Your request should address all of the following issues:

22−

23−**General Problem:** Clearly define the purpose of adding the feature.

24−What general problem do you want to solve? Why is that problem important?

25−Why is it important for a functional GUI language?

26−

27−**Specific Use-Cases:** What are the specific cases when the general problem

28−is actually an issue? How often does this case come up? Why are these cases

29−important to easily designing graphical user interfaces? Why are existing

30−solutions in Elm unsuitable?

31−

32−**Background Materials:** Are there relevant papers on the topic? Are there

33−languages or libraries that already have this feature? Organize this material

34−and provide a concise and helpful overview.

35−

36−**Alternatives:** What are all the ways to address the general problem or a

37−closely related problem? For example, the semantic flexibility of type classes

38−can be largely replicated with a module system in the style of ML.

39−What are the strengths and weakness of each of the alternative solutions?

40−

41−**Suggested Approach:** Outline your specific approach. How does it address

42−the general problem? How does it work? How hard is it going to be to add?

43−What other language features does it depend on that need to be added first?

44−Try to take a look at the relevant code to see if it would require significant

45−changes. If you are suggesting an API or library changes, include an interface

46−(a list of type signatures) for the functions you would like to add (perhaps

47−multiple interfaces if there are many good approaches).

48−

49−**Known Issues:** Search for issues that people have already found. Think of

50−any other possible downside and list them too. For example, one downside of

51−typeclasses is that they are globally defined for each type, so you cannot

52−have multiple `Ord` instances for Strings. This can lead to namespace pollution

53−within a project. In general you can only implement an "interface" once per

54−type, so it is very tricky to get the flexibility of ML's module functors.

55−

56−**Justification:** Why is the added complexity of your feature worth it? Discuss

57−both implementation complexity in the compiler, and conceptual complexity that

58−users must deal with. Why is your feature better than the alternative solutions?

59−Why is it okay to ignore the known issues? Is there any way to overcome the known

60−issues? Will it be difficult or confusing for users coming from JavaScript?

61−

62−### Some final notes:

63−

64−If for some reason you cannot provide details for some of these categories,

65−explain why the category is not applicable.

66−

67−Re-read before posting. Is your request constructive? Is it well organized?

68−Are there any details you forgot? Can anything be clarified or trimmed down?

69−Considering a request takes time, so be considerate about how much work a

70−reader has to do to take it seriously.

71−

72−A feature request is not an opportunity to be sassy or glib. Try to present

73−the information and argument clearly, concisely, thoroughly, and in an unbiased

74−manner.

75−

76−This is likely to be an iterative process. People will have comments and

77−questions. Everyone please be kind. Commenters, if you think you have a

78−concern, raise it as a question: "But what happens when you do blah?" instead

79−of "This will break when you do blah". Assume you have misunderstood their

80−proposal or only have a shallow understanding of it. Seek clarification, not victory.

81−

82−Comments are not a place for flame wars. Discuss specific issues. Vague

83−complaining and unsupported claims should either be forgotten or developed

84−into specific and well-supported concerns.

85−

86−I am always working hard to add cool stuff to Elm, and it is a lot of work.

87−I must prioritize issues to focus on the things that have the highest impact

88−for improving the quality of Elm, addressing the concerns of current users,

89−and making Elm more appealing for new users. I do not have infinite time,

90−so some things must receive more attention than others. I apologize in advance.

91−

92−And to summarize, just be cool! I want Elm to be really fun and easy to use,

93−and I want your projects to be amazing!

LICENSE+6−25

@@ -1,30 +1,11 @@

22

3+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:

44

5−Redistribution and use in source and binary forms, with or without

6−modification, are permitted provided that the following conditions are met:

5+1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.

76

8− * Redistributions of source code must retain the above copyright

9− notice, this list of conditions and the following disclaimer.

7+2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.

108

11− * Redistributions in binary form must reproduce the above

12− copyright notice, this list of conditions and the following

13− disclaimer in the documentation and/or other materials provided

14− with the distribution.

9+3. Neither the name of the copyright holder nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.

1510

16− * Neither the name of Evan Czaplicki nor the names of other

17− contributors may be used to endorse or promote products derived

18− from this software without specific prior written permission.

19−

20−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS

21−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT

22−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR

23−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT

24−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,

25−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT

26−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,

27−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY

28−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT

29−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE

30−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

11+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

README.md+11−49

@@ -1,60 +1,22 @@

1−Learn about the Elm programming language at [elm-lang.org](http://elm-lang.org/).

1+# Elm

22

3−[![Build Status](https://travis-ci.org/evancz/Elm.png)](https://travis-ci.org/evancz/Elm)

3+A delightful language for reliable webapps.

44

5−## Install

6−

7−**Arch Linux** — follow [these directions](https://github.com/evancz/Elm/wiki/Installing-Elm#arch-linux) and then

8−jump to the [My First Project](#my-first-project) section.

9−<br/>

10−**OS X 10.9 or XCode 5** — follow

11−[these directions](http://justtesting.org/post/64947952690/the-glasgow-haskell-compiler-ghc-on-os-x-10-9)

12−before continuing with the platform agnostic directions below.

13−

14−**Platform Agnostic** —

15−download the [Haskell Platform 2012.2.0.0 or later](http://hackage.haskell.org/platform/).

16−Once the Haskell Platform is installed:

5+Check out the [Home Page](http://elm-lang.org/), [Try Online](http://elm-lang.org/try), or [The Official Guide](http://guide.elm-lang.org/)

176

18− cabal update

19− cabal install elm

20− cabal install elm-server

217

22−## Use

8+<br>

239

24−To use `elm` and `elm-server` you may need to add a new directory to your PATH.

25−

26−Cabal should tell you where your executables are located upon

27−successful installation. It'll be something like `/home/evan/.cabal/bin`

28−which you should append to your PATH variable.

29−See this tutorial if you are new to changing your PATH in

30−[Unix/Linux](http://www.cyberciti.biz/faq/unix-linux-adding-path/).

31−

32−## My First Project

10+## Install

3311

34−Now we will create a simple Elm project.

35−The following commands will set-up a very basic project and start the Elm server.

12+✨ [Install](https://guide.elm-lang.org/install/elm.html) ✨

3613

37− mkdir helloElm

38− cd helloElm

39− printf "import Mouse\n\nmain = lift asText Mouse.position" > Main.elm

40− elm-server

14+For multiple versions, previous versions, and uninstallation, see the instructions [here](https://github.com/elm/compiler/blob/master/installers/README.md).

4115

42−The first two commands create a new directory and navigate into it. The `printf`

43−commands place a simple program into `Main.elm`. Do this manually if you do not

44−have `printf`. The final command starts the Elm server at [localhost:8000](http://localhost:8000/),

45−allowing you to navigate to `Main.elm` and see your first program in action.

16+<br>

4617

47−#### Final Notes

18+## Help

4819

49−The `elm` package provides

50−[some utility functions](http://hackage.haskell.org/package/Elm) for

51−working with Elm in Haskell. This can be useful for creating tooling

52−for Elm, and has been useful for projects like

53−[the website](http://elm-lang.org/) and

54−[`elm-get`](https://github.com/evancz/elm-get). Email the list if you

55−want to rely on these functions!

20+If you are stuck, ask around on [the Elm slack channel][slack]. Folks are friendly and happy to help with questions!

5621

57−If you are stuck, email

58−[the list](https://groups.google.com/forum/?fromgroups#!forum/elm-discuss)

59−or ask a question in the

60−[#Elm IRC channel](http://webchat.freenode.net/?channels=elm).

22+[slack]: http://elmlang.herokuapp.com/

Setup.hsdeleted−180

@@ -1,180 +0,0 @@

1−import Distribution.Simple

2−import Distribution.Simple.LocalBuildInfo

3−import Distribution.Simple.Setup

4−import Distribution.PackageDescription

5−

6−import System.Cmd

7−import System.Directory

8−import System.FilePath

9−import System.IO

10−import System.Process

11−

12−import Control.Monad

13−import qualified Data.Binary as Binary

14−import qualified Data.ByteString.Lazy as BS

15−import qualified Data.List as List

16−

17−-- Part 1

18−-- ------

19−-- Add a build callout

20−-- We need to build elm-doc and run it because that generates the file "docs.json"

21−-- needs by Libraries.hs which is part of the elm library and executable

22−-- Unfort. there seems to be no way to tell cabal that:

23−-- (a) elm-doc generates docs.json, and

24−-- (b) elm (library) depends on docs.json

25−-- Therefore, we either use make instead (or a script), or hack around in cabal

26−

27−-- Part 2

28−-- ------

29−-- Add a post-build callout.

30−-- We need to build the runtime.js after we've built elm (because we use elm to generate some of the JavaScript),

31−-- but before cabal does the install file copy step

32−

33−-- Assumptions

34−-- Elm.cabal expects the generated files to end up in dist/data

35−-- git won't look in dist + cabal will clean it

36−rtsDir :: LocalBuildInfo -> FilePath

37−rtsDir lbi = "data"

38−

39−tempDir :: LocalBuildInfo -> FilePath

40−tempDir lbi = "temp"

41−

42−-- The runtime is called:

43−rts :: LocalBuildInfo -> FilePath

44−rts lbi = rtsDir lbi </> "elm-runtime.js"

45−

46−-- The runtime is called:

47−docs :: LocalBuildInfo -> FilePath

48−docs lbi = rtsDir lbi </> "docs.json"

49−

50−-- The interfaces for the Standard Libraries live in:

51−interfaces :: LocalBuildInfo -> FilePath

52−interfaces lbi = rtsDir lbi </> "interfaces.data"

53−

54−elm :: LocalBuildInfo -> FilePath

55−elm lbi = buildDir lbi </> "elm" </> "elm"

56−

57−document :: LocalBuildInfo -> FilePath

58−document lbi = buildDir lbi </> "elm-doc" </> "elm-doc"

59−

60−-- Care! This appears to be based on an unstable API

61−-- See: http://www.haskell.org/cabal/release/cabal-latest/doc/API/Cabal/Distribution-Simple.html#2

62−

63−

64−main :: IO ()

65−main = defaultMainWithHooks simpleUserHooks { postBuild = myPostBuild }

66−

67−

68−-- Build

69−

70−-- note(1): We use to include docs.json directly into LoadLibraries at compile time

71−-- If docs.json is used in other (template) haskell files, they should be copied

72−-- and compiled in a separate directory (eg, dist/copiedSrc).

73−-- This is to make sure they are re-compiled on docs.json changes.

74−-- Copying is a better solution than 'touch'ing the source files

75−-- (touch is non-portable and confusing wrt RCS).

76−

77−-- In the PackageDescription, the list of stuff to build is held in library

78−-- (in a Maybe) and the executables list. We want a PackageDescription that

79−-- only mentions the executable 'name'

80−filterExe :: String -> PackageDescription -> PackageDescription

81−filterExe name pd = pd {

82− library = Nothing,

83− executables = filter (\x -> (exeName x == name)) (executables pd)

84− }

85−

86−

87−-- Post Build

88−

89−myPostBuild :: Args -> BuildFlags -> PackageDescription -> LocalBuildInfo -> IO ()

90−myPostBuild as bfs pd lbi = do

91− putStrLn "Custom build step: compiling standard libraries"

92− (elmos, elmis) <- compileLibraries lbi

93− putStrLn "Custom build step: build interfaces.data"

94− buildInterfaces lbi elmis

95− putStrLn "Custom build step: build elm-runtime.js"

96− buildRuntime lbi elmos

97− putStrLn "Custom build step: build docs.json"

98− buildDocs lbi

99− removeDirectoryRecursive (tempDir lbi)

100− removeDirectoryRecursive ("libraries" </> "docs")

101− postBuild simpleUserHooks as bfs pd lbi

102−

103−

104−compileLibraries lbi = do

105− let temp = tempDir lbi -- temp

106− rts = rtsDir lbi -- data

107− createDirectoryIfMissing True temp

108− createDirectoryIfMissing True rts

109− out_c <- canonicalizePath temp -- temp (root folder)

110− elm_c <- canonicalizePath (elm lbi) -- dist/build/elm/elm

111− doc_c <- canonicalizePath (document lbi) -- dist/build/elm-doc/elm-doc

112− rtd_c <- canonicalizePath rts -- data

113−

114− let make file = do

115− -- replace 'system' call with 'runProcess' which handles args better

116− -- and allows env variable "Elm_datadir" which is used by LoadLibraries

117− -- to find docs.json

118− let args = [ "--only-js", "--make", "--no-prelude"

119− , "--cache-dir="++out_c, "--build-dir="++out_c, file ]

120− arg = Just [("Elm_datadir", rtd_c)]

121− handle <- runProcess elm_c args Nothing arg Nothing Nothing Nothing

122− exitCode <- waitForProcess handle

123− return ( out_c </> replaceExtension file "elmo"

124− , out_c </> replaceExtension file "elmi")

125−

126− setCurrentDirectory "libraries"

127− paths <- getFiles ".elm" "."

128− files <- unzip `fmap` mapM make paths

129− mapM_ (\path -> rawSystem doc_c [path]) paths

130− setCurrentDirectory ".."

131− return files

132−

133−buildInterfaces :: LocalBuildInfo -> [FilePath] -> IO ()

134−buildInterfaces lbi elmis = do

135− createDirectoryIfMissing True (rtsDir lbi)

136− let ifaces = interfaces lbi

137− ifaceHandle <- openBinaryFile ifaces WriteMode

138− BS.hPut ifaceHandle (Binary.encode (length elmis))

139− let append file = do

140− handle <- openBinaryFile file ReadMode

141− bits <- hGetContents handle

142− length bits `seq` hPutStr ifaceHandle bits

143− hClose handle

144− mapM_ append elmis

145− hClose ifaceHandle

146−

147−buildRuntime :: LocalBuildInfo -> [FilePath] -> IO ()

148−buildRuntime lbi elmos = do

149− createDirectoryIfMissing True (rtsDir lbi)

150− let rts' = rts lbi

151− writeFile rts' "'use strict';\n\

152− \var Elm = {}; Elm.Native = {}; Elm.Native.Graphics = {};\n\

153− \var ElmRuntime = {}; ElmRuntime.Render = {};\n"

154− mapM_ (appendTo rts') =<< getFiles ".js" "libraries"

155− mapM_ (appendTo rts') elmos

156− mapM_ (appendTo rts') =<< getFiles ".js" "runtime"

157−

158−buildDocs :: LocalBuildInfo -> IO ()

159−buildDocs lbi = do

160− createDirectoryIfMissing True (rtsDir lbi)

161− let docs' = docs lbi

162− writeFile docs' "[\n"

163− json <- getFiles ".json" ("libraries" </> "docs")

164− let appends = map (appendTo docs') json

165− addCommas = List.intersperse (appendFile docs' ",\n")

166− sequence_ (addCommas appends)

167− appendFile docs' "\n]"

168−

169−getFiles ext dir = do

170− contents <- map (dir </>) `fmap` getDirectoryContents dir

171− let files = filter (\f -> takeExtension f == ext) contents

172− dirs = filter (not . hasExtension) contents

173− filess <- mapM (getFiles ext) dirs

174− return (files ++ concat filess)

175−

176−appendTo :: FilePath -> FilePath -> IO ()

177−appendTo destination source = do

178− str <- readFile source

179− length str `seq` return ()

180− appendFile destination str

builder/src/BackgroundWriter.hsnew file+42

@@ -0,0 +1,42 @@

1+{-# LANGUAGE BangPatterns #-}

2+module BackgroundWriter

3+ ( Scope

4+ , withScope

5+ , writeBinary

6+ )

7+ where

8+

9+

10+import Control.Concurrent (forkIO)

11+import Control.Concurrent.MVar (MVar, newEmptyMVar, newMVar, putMVar, takeMVar)

12+import qualified Data.Binary as Binary

13+import Data.Foldable (traverse_)

14+

15+import qualified File

16+

17+

18+

19+-- BACKGROUND WRITER

20+

21+

22+newtype Scope =

23+ Scope (MVar [MVar ()])

24+

25+

26+withScope :: (Scope -> IO a) -> IO a

27+withScope callback =

28+ do workList <- newMVar []

29+ result <- callback (Scope workList)

30+ mvars <- takeMVar workList

31+ traverse_ takeMVar mvars

32+ return result

33+

34+

35+writeBinary :: (Binary.Binary a) => Scope -> FilePath -> a -> IO ()

36+writeBinary (Scope workList) path value =

37+ do mvar <- newEmptyMVar

38+ _ <- forkIO (File.writeBinary path value >> putMVar mvar ())

39+ oldWork <- takeMVar workList

40+ let !newWork = mvar:oldWork

41+ putMVar workList newWork

42+

builder/src/Build.hsnew file+1251

@@ -0,0 +1,1251 @@

1+{-# OPTIONS_GHC -Wno-unused-do-bind #-}

2+{-# LANGUAGE BangPatterns, GADTs, OverloadedStrings #-}

3+module Build

4+ ( fromExposed

5+ , fromPaths

6+ , fromRepl

7+ , Artifacts(..)

8+ , Root(..)

9+ , Module(..)

10+ , CachedInterface(..)

11+ , ReplArtifacts(..)

12+ , DocsGoal(..)

13+ , getRootNames

14+ )

15+ where

16+

17+

18+import Control.Concurrent (forkIO)

19+import Control.Concurrent.MVar

20+import Control.Monad (filterM, mapM_, sequence_)

21+import qualified Data.ByteString as B

22+import qualified Data.Char as Char

23+import qualified Data.Graph as Graph

24+import qualified Data.List as List

25+import qualified Data.Map.Utils as Map

26+import qualified Data.Map.Strict as Map

27+import Data.Map.Strict ((!))

28+import qualified Data.Maybe as Maybe

29+import qualified Data.Name as Name

30+import qualified Data.NonEmptyList as NE

31+import qualified Data.OneOrMore as OneOrMore

32+import qualified Data.Set as Set

33+import qualified System.Directory as Dir

34+import qualified System.FilePath as FP

35+import System.FilePath ((</>), (<.>))

36+

37+import qualified AST.Canonical as Can

38+import qualified AST.Source as Src

39+import qualified AST.Optimized as Opt

40+import qualified Compile

41+import qualified Elm.Details as Details

42+import qualified Elm.Docs as Docs

43+import qualified Elm.Interface as I

44+import qualified Elm.ModuleName as ModuleName

45+import qualified Elm.Outline as Outline

46+import qualified Elm.Package as Pkg

47+import qualified File

48+import qualified Json.Encode as E

49+import qualified Parse.Module as Parse

50+import qualified Reporting

51+import qualified Reporting.Annotation as A

52+import qualified Reporting.Error as Error

53+import qualified Reporting.Error.Docs as EDocs

54+import qualified Reporting.Error.Syntax as Syntax

55+import qualified Reporting.Error.Import as Import

56+import qualified Reporting.Exit as Exit

57+import qualified Reporting.Render.Type.Localizer as L

58+import qualified Stuff

59+

60+

61+

62+-- ENVIRONMENT

63+

64+

65+data Env =

66+ Env

67+ { _key :: Reporting.BKey

68+ , _root :: FilePath

69+ , _project :: Parse.ProjectType

70+ , _srcDirs :: [AbsoluteSrcDir]

71+ , _buildID :: Details.BuildID

72+ , _locals :: Map.Map ModuleName.Raw Details.Local

73+ , _foreigns :: Map.Map ModuleName.Raw Details.Foreign

74+ }

75+

76+

77+makeEnv :: Reporting.BKey -> FilePath -> Details.Details -> IO Env

78+makeEnv key root (Details.Details _ validOutline buildID locals foreigns _) =

79+ case validOutline of

80+ Details.ValidApp givenSrcDirs ->

81+ do srcDirs <- traverse (toAbsoluteSrcDir root) (NE.toList givenSrcDirs)

82+ return $ Env key root Parse.Application srcDirs buildID locals foreigns

83+

84+ Details.ValidPkg pkg _ _ ->

85+ do srcDir <- toAbsoluteSrcDir root (Outline.RelativeSrcDir "src")

86+ return $ Env key root (Parse.Package pkg) [srcDir] buildID locals foreigns

87+

88+

89+

90+-- SOURCE DIRECTORY

91+

92+

93+newtype AbsoluteSrcDir =

94+ AbsoluteSrcDir FilePath

95+

96+

97+toAbsoluteSrcDir :: FilePath -> Outline.SrcDir -> IO AbsoluteSrcDir

98+toAbsoluteSrcDir root srcDir =

99+ AbsoluteSrcDir <$> Dir.canonicalizePath

100+ (

101+ case srcDir of

102+ Outline.AbsoluteSrcDir dir -> dir

103+ Outline.RelativeSrcDir dir -> root </> dir

104+ )

105+

106+

107+addRelative :: AbsoluteSrcDir -> FilePath -> FilePath

108+addRelative (AbsoluteSrcDir srcDir) path =

109+ srcDir </> path

110+

111+

112+

113+-- FORK

114+

115+

116+-- PERF try using IORef semephore on file crawl phase?

117+-- described in Chapter 13 of Parallel and Concurrent Programming in Haskell by Simon Marlow

118+-- https://www.oreilly.com/library/view/parallel-and-concurrent/9781449335939/ch13.html#sec_conc-par-overhead

119+--

120+fork :: IO a -> IO (MVar a)

121+fork work =

122+ do mvar <- newEmptyMVar

123+ _ <- forkIO $ putMVar mvar =<< work

124+ return mvar

125+

126+

127+{-# INLINE forkWithKey #-}

128+forkWithKey :: (k -> a -> IO b) -> Map.Map k a -> IO (Map.Map k (MVar b))

129+forkWithKey func dict =

130+ Map.traverseWithKey (\k v -> fork (func k v)) dict

131+

132+

133+

134+-- FROM EXPOSED

135+

136+

137+fromExposed :: Reporting.Style -> FilePath -> Details.Details -> DocsGoal docs -> NE.List ModuleName.Raw -> IO (Either Exit.BuildProblem docs)

138+fromExposed style root details docsGoal exposed@(NE.List e es) =

139+ Reporting.trackBuild style $ \key ->

140+ do env <- makeEnv key root details

141+ dmvar <- Details.loadInterfaces root details

142+

143+ -- crawl

144+ mvar <- newEmptyMVar

145+ let docsNeed = toDocsNeed docsGoal

146+ roots <- Map.fromKeysA (fork . crawlModule env mvar docsNeed) (e:es)

147+ putMVar mvar roots

148+ mapM_ readMVar roots

149+ statuses <- traverse readMVar =<< readMVar mvar

150+

151+ -- compile

152+ midpoint <- checkMidpoint dmvar statuses

153+ case midpoint of

154+ Left problem ->

155+ return (Left (Exit.BuildProjectProblem problem))

156+

157+ Right foreigns ->

158+ do rmvar <- newEmptyMVar

159+ resultMVars <- forkWithKey (checkModule env foreigns rmvar) statuses

160+ putMVar rmvar resultMVars

161+ results <- traverse readMVar resultMVars

162+ writeDetails root details results

163+ finalizeExposed root docsGoal exposed results

164+

165+

166+

167+-- FROM PATHS

168+

169+

170+data Artifacts =

171+ Artifacts

172+ { _name :: Pkg.Name

173+ , _deps :: Dependencies

174+ , _roots :: NE.List Root

175+ , _modules :: [Module]

176+ }

177+

178+

179+data Module

180+ = Fresh ModuleName.Raw I.Interface Opt.LocalGraph

181+ | Cached ModuleName.Raw Bool (MVar CachedInterface)

182+

183+

184+type Dependencies =

185+ Map.Map ModuleName.Canonical I.DependencyInterface

186+

187+

188+fromPaths :: Reporting.Style -> FilePath -> Details.Details -> NE.List FilePath -> IO (Either Exit.BuildProblem Artifacts)

189+fromPaths style root details paths =

190+ Reporting.trackBuild style $ \key ->

191+ do env <- makeEnv key root details

192+

193+ elroots <- findRoots env paths

194+ case elroots of

195+ Left problem ->

196+ return (Left (Exit.BuildProjectProblem problem))

197+

198+ Right lroots ->

199+ do -- crawl

200+ dmvar <- Details.loadInterfaces root details

201+ smvar <- newMVar Map.empty

202+ srootMVars <- traverse (fork . crawlRoot env smvar) lroots

203+ sroots <- traverse readMVar srootMVars

204+ statuses <- traverse readMVar =<< readMVar smvar

205+

206+ midpoint <- checkMidpointAndRoots dmvar statuses sroots

207+ case midpoint of

208+ Left problem ->

209+ return (Left (Exit.BuildProjectProblem problem))

210+

211+ Right foreigns ->

212+ do -- compile

213+ rmvar <- newEmptyMVar

214+ resultsMVars <- forkWithKey (checkModule env foreigns rmvar) statuses

215+ putMVar rmvar resultsMVars

216+ rrootMVars <- traverse (fork . checkRoot env resultsMVars) sroots

217+ results <- traverse readMVar resultsMVars

218+ writeDetails root details results

219+ toArtifacts env foreigns results <$> traverse readMVar rrootMVars

220+

221+

222+

223+-- GET ROOT NAMES

224+

225+

226+getRootNames :: Artifacts -> NE.List ModuleName.Raw

227+getRootNames (Artifacts _ _ roots _) =

228+ fmap getRootName roots

229+

230+

231+getRootName :: Root -> ModuleName.Raw

232+getRootName root =

233+ case root of

234+ Inside name -> name

235+ Outside name _ _ -> name

236+

237+

238+

239+-- CRAWL

240+

241+

242+type StatusDict =

243+ Map.Map ModuleName.Raw (MVar Status)

244+

245+

246+data Status

247+ = SCached Details.Local

248+ | SChanged Details.Local B.ByteString Src.Module DocsNeed

249+ | SBadImport Import.Problem

250+ | SBadSyntax FilePath File.Time B.ByteString Syntax.Error

251+ | SForeign Pkg.Name

252+ | SKernel

253+

254+

255+crawlDeps :: Env -> MVar StatusDict -> [ModuleName.Raw] -> a -> IO a

256+crawlDeps env mvar deps blockedValue =

257+ do statusDict <- takeMVar mvar

258+ let depsDict = Map.fromKeys (\_ -> ()) deps

259+ let newsDict = Map.difference depsDict statusDict

260+ statuses <- Map.traverseWithKey crawlNew newsDict

261+ putMVar mvar (Map.union statuses statusDict)

262+ mapM_ readMVar statuses

263+ return blockedValue

264+ where

265+ crawlNew name () = fork (crawlModule env mvar (DocsNeed False) name)

266+

267+

268+crawlModule :: Env -> MVar StatusDict -> DocsNeed -> ModuleName.Raw -> IO Status

269+crawlModule env@(Env _ root projectType srcDirs buildID locals foreigns) mvar docsNeed name =

270+ do let fileName = ModuleName.toFilePath name <.> "elm"

271+

272+ paths <- filterM File.exists (map (`addRelative` fileName) srcDirs)

273+

274+ case paths of

275+ [path] ->

276+ case Map.lookup name foreigns of

277+ Just (Details.Foreign dep deps) ->

278+ return $ SBadImport $ Import.Ambiguous path [] dep deps

279+

280+ Nothing ->

281+ do newTime <- File.getTime path

282+ case Map.lookup name locals of

283+ Nothing ->

284+ crawlFile env mvar docsNeed name path newTime buildID

285+

286+ Just local@(Details.Local oldPath oldTime deps _ lastChange _) ->

287+ if path /= oldPath || oldTime /= newTime || needsDocs docsNeed

288+ then crawlFile env mvar docsNeed name path newTime lastChange

289+ else crawlDeps env mvar deps (SCached local)

290+

291+ p1:p2:ps ->

292+ return $ SBadImport $ Import.AmbiguousLocal (FP.makeRelative root p1) (FP.makeRelative root p2) (map (FP.makeRelative root) ps)

293+

294+ [] ->

295+ case Map.lookup name foreigns of

296+ Just (Details.Foreign dep deps) ->

297+ case deps of

298+ [] ->

299+ return $ SForeign dep

300+

301+ d:ds ->

302+ return $ SBadImport $ Import.AmbiguousForeign dep d ds

303+

304+ Nothing ->

305+ if Name.isKernel name && Parse.isKernel projectType then

306+ do exists <- File.exists ("src" </> ModuleName.toFilePath name <.> "js")

307+ return $ if exists then SKernel else SBadImport Import.NotFound

308+ else

309+ return $ SBadImport Import.NotFound

310+

311+

312+crawlFile :: Env -> MVar StatusDict -> DocsNeed -> ModuleName.Raw -> FilePath -> File.Time -> Details.BuildID -> IO Status

313+crawlFile env@(Env _ root projectType _ buildID _ _) mvar docsNeed expectedName path time lastChange =

314+ do source <- File.readUtf8 (root </> path)

315+

316+ case Parse.fromByteString projectType source of

317+ Left err ->

318+ return $ SBadSyntax path time source err

319+

320+ Right modul@(Src.Module maybeActualName _ _ imports values _ _ _ _) ->

321+ case maybeActualName of

322+ Nothing ->

323+ return $ SBadSyntax path time source (Syntax.ModuleNameUnspecified expectedName)

324+

325+ Just name@(A.At _ actualName) ->

326+ if expectedName == actualName then

327+ let

328+ deps = map Src.getImportName imports

329+ local = Details.Local path time deps (any isMain values) lastChange buildID

330+ in

331+ crawlDeps env mvar deps (SChanged local source modul docsNeed)

332+ else

333+ return $ SBadSyntax path time source (Syntax.ModuleNameMismatch expectedName name)

334+

335+

336+isMain :: A.Located Src.Value -> Bool

337+isMain (A.At _ (Src.Value (A.At _ name) _ _ _)) =

338+ name == Name._main

339+

340+

341+

342+-- CHECK MODULE

343+

344+

345+type ResultDict =

346+ Map.Map ModuleName.Raw (MVar Result)

347+

348+

349+data Result

350+ = RNew !Details.Local !I.Interface !Opt.LocalGraph !(Maybe Docs.Module)

351+ | RSame !Details.Local !I.Interface !Opt.LocalGraph !(Maybe Docs.Module)

352+ | RCached Bool Details.BuildID (MVar CachedInterface)

353+ | RNotFound Import.Problem

354+ | RProblem Error.Module

355+ | RBlocked

356+ | RForeign I.Interface

357+ | RKernel

358+

359+

360+data CachedInterface

361+ = Unneeded

362+ | Loaded I.Interface

363+ | Corrupted

364+

365+

366+checkModule :: Env -> Dependencies -> MVar ResultDict -> ModuleName.Raw -> Status -> IO Result

367+checkModule env@(Env _ root projectType _ _ _ _) foreigns resultsMVar name status =

368+ case status of

369+ SCached local@(Details.Local path time deps hasMain lastChange lastCompile) ->

370+ do results <- readMVar resultsMVar

371+ depsStatus <- checkDeps root results deps lastCompile

372+ case depsStatus of

373+ DepsChange ifaces ->

374+ do source <- File.readUtf8 path

375+ case Parse.fromByteString projectType source of

376+ Right modul -> compile env (DocsNeed False) local source ifaces modul

377+ Left err ->

378+ return $ RProblem $

379+ Error.Module name path time source (Error.BadSyntax err)

380+

381+ DepsSame _ _ ->

382+ do mvar <- newMVar Unneeded

383+ return (RCached hasMain lastChange mvar)

384+

385+ DepsBlock ->

386+ return RBlocked

387+

388+ DepsNotFound problems ->

389+ do source <- File.readUtf8 path

390+ return $ RProblem $ Error.Module name path time source $

391+ case Parse.fromByteString projectType source of

392+ Right (Src.Module _ _ _ imports _ _ _ _ _) ->

393+ Error.BadImports (toImportErrors env results imports problems)

394+

395+ Left err ->

396+ Error.BadSyntax err

397+

398+ SChanged local@(Details.Local path time deps _ _ lastCompile) source modul@(Src.Module _ _ _ imports _ _ _ _ _) docsNeed ->

399+ do results <- readMVar resultsMVar

400+ depsStatus <- checkDeps root results deps lastCompile

401+ case depsStatus of

402+ DepsChange ifaces ->

403+ compile env docsNeed local source ifaces modul

404+

405+ DepsSame same cached ->

406+ do maybeLoaded <- loadInterfaces root same cached

407+ case maybeLoaded of

408+ Nothing -> return RBlocked

409+ Just ifaces -> compile env docsNeed local source ifaces modul

410+

411+ DepsBlock ->

412+ return RBlocked

413+

414+ DepsNotFound problems ->

415+ return $ RProblem $ Error.Module name path time source $

416+ Error.BadImports (toImportErrors env results imports problems)

417+

418+ SBadImport importProblem ->

419+ return (RNotFound importProblem)

420+

421+ SBadSyntax path time source err ->

422+ return $ RProblem $ Error.Module name path time source $

423+ Error.BadSyntax err

424+

425+ SForeign home ->

426+ case foreigns ! ModuleName.Canonical home name of

427+ I.Public iface -> return (RForeign iface)

428+ I.Private _ _ _ -> error $ "mistakenly seeing private interface for " ++ Pkg.toChars home ++ " " ++ ModuleName.toChars name

429+

430+ SKernel ->

431+ return RKernel

432+

433+

434+

435+-- CHECK DEPS

436+

437+

438+data DepsStatus

439+ = DepsChange (Map.Map ModuleName.Raw I.Interface)

440+ | DepsSame [Dep] [CDep]

441+ | DepsBlock

442+ | DepsNotFound (NE.List (ModuleName.Raw, Import.Problem))

443+

444+

445+checkDeps :: FilePath -> ResultDict -> [ModuleName.Raw] -> Details.BuildID -> IO DepsStatus

446+checkDeps root results deps lastCompile =

447+ checkDepsHelp root results deps [] [] [] [] False 0 lastCompile

448+

449+

450+type Dep = (ModuleName.Raw, I.Interface)

451+type CDep = (ModuleName.Raw, MVar CachedInterface)

452+

453+

454+checkDepsHelp :: FilePath -> ResultDict -> [ModuleName.Raw] -> [Dep] -> [Dep] -> [CDep] -> [(ModuleName.Raw,Import.Problem)] -> Bool -> Details.BuildID -> Details.BuildID -> IO DepsStatus

455+checkDepsHelp root results deps new same cached importProblems isBlocked lastDepChange lastCompile =

456+ case deps of

457+ dep:otherDeps ->

458+ do result <- readMVar (results ! dep)

459+ case result of

460+ RNew (Details.Local _ _ _ _ lastChange _) iface _ _ ->

461+ checkDepsHelp root results otherDeps ((dep,iface) : new) same cached importProblems isBlocked (max lastChange lastDepChange) lastCompile

462+

463+ RSame (Details.Local _ _ _ _ lastChange _) iface _ _ ->

464+ checkDepsHelp root results otherDeps new ((dep,iface) : same) cached importProblems isBlocked (max lastChange lastDepChange) lastCompile

465+

466+ RCached _ lastChange mvar ->

467+ checkDepsHelp root results otherDeps new same ((dep,mvar) : cached) importProblems isBlocked (max lastChange lastDepChange) lastCompile

468+

469+ RNotFound prob ->

470+ checkDepsHelp root results otherDeps new same cached ((dep,prob) : importProblems) True lastDepChange lastCompile

471+

472+ RProblem _ ->

473+ checkDepsHelp root results otherDeps new same cached importProblems True lastDepChange lastCompile

474+

475+ RBlocked ->

476+ checkDepsHelp root results otherDeps new same cached importProblems True lastDepChange lastCompile

477+

478+ RForeign iface ->

479+ checkDepsHelp root results otherDeps new ((dep,iface) : same) cached importProblems isBlocked lastDepChange lastCompile

480+

481+ RKernel ->

482+ checkDepsHelp root results otherDeps new same cached importProblems isBlocked lastDepChange lastCompile

483+

484+

485+ [] ->

486+ case reverse importProblems of

487+ p:ps ->

488+ return $ DepsNotFound (NE.List p ps)

489+

490+ [] ->

491+ if isBlocked then

492+ return $ DepsBlock

493+

494+ else if null new && lastDepChange <= lastCompile then

495+ return $ DepsSame same cached

496+

497+ else

498+ do maybeLoaded <- loadInterfaces root same cached

499+ case maybeLoaded of

500+ Nothing -> return DepsBlock

501+ Just ifaces -> return $ DepsChange $ Map.union (Map.fromList new) ifaces

502+

503+

504+

505+-- TO IMPORT ERROR

506+

507+

508+toImportErrors :: Env -> ResultDict -> [Src.Import] -> NE.List (ModuleName.Raw, Import.Problem) -> NE.List Import.Error

509+toImportErrors (Env _ _ _ _ _ locals foreigns) results imports problems =

510+ let

511+ knownModules =

512+ Set.unions

513+ [ Map.keysSet foreigns

514+ , Map.keysSet locals

515+ , Map.keysSet results

516+ ]

517+

518+ unimportedModules =

519+ Set.difference knownModules (Set.fromList (map Src.getImportName imports))

520+

521+ regionDict =

522+ Map.fromList (map (\(Src.Import (A.At region name) _ _) -> (name, region)) imports)

523+

524+ toError (name, problem) =

525+ Import.Error (regionDict ! name) name unimportedModules problem

526+ in

527+ fmap toError problems

528+

529+

530+

531+-- LOAD CACHED INTERFACES

532+

533+

534+loadInterfaces :: FilePath -> [Dep] -> [CDep] -> IO (Maybe (Map.Map ModuleName.Raw I.Interface))

535+loadInterfaces root same cached =

536+ do loading <- traverse (fork . loadInterface root) cached

537+ maybeLoaded <- traverse readMVar loading

538+ case sequence maybeLoaded of

539+ Nothing ->

540+ return Nothing

541+

542+ Just loaded ->

543+ return $ Just $ Map.union (Map.fromList loaded) (Map.fromList same)

544+

545+

546+loadInterface :: FilePath -> CDep -> IO (Maybe Dep)

547+loadInterface root (name, ciMvar) =

548+ do cachedInterface <- takeMVar ciMvar

549+ case cachedInterface of

550+ Corrupted ->

551+ do putMVar ciMvar cachedInterface

552+ return Nothing

553+

554+ Loaded iface ->

555+ do putMVar ciMvar cachedInterface

556+ return (Just (name, iface))

557+

558+ Unneeded ->

559+ do maybeIface <- File.readBinary (Stuff.elmi root name)

560+ case maybeIface of

561+ Nothing ->

562+ do putMVar ciMvar Corrupted

563+ return Nothing

564+

565+ Just iface ->

566+ do putMVar ciMvar (Loaded iface)

567+ return (Just (name, iface))

568+

569+

570+

571+-- CHECK PROJECT

572+

573+

574+checkMidpoint :: MVar (Maybe Dependencies) -> Map.Map ModuleName.Raw Status -> IO (Either Exit.BuildProjectProblem Dependencies)

575+checkMidpoint dmvar statuses =

576+ case checkForCycles statuses of

577+ Nothing ->

578+ do maybeForeigns <- readMVar dmvar

579+ case maybeForeigns of

580+ Nothing -> return (Left Exit.BP_CannotLoadDependencies)

581+ Just fs -> return (Right fs)

582+

583+ Just (NE.List name names) ->

584+ do _ <- readMVar dmvar

585+ return (Left (Exit.BP_Cycle name names))

586+

587+

588+checkMidpointAndRoots :: MVar (Maybe Dependencies) -> Map.Map ModuleName.Raw Status -> NE.List RootStatus -> IO (Either Exit.BuildProjectProblem Dependencies)

589+checkMidpointAndRoots dmvar statuses sroots =

590+ case checkForCycles statuses of

591+ Nothing ->

592+ case checkUniqueRoots statuses sroots of

593+ Nothing ->

594+ do maybeForeigns <- readMVar dmvar

595+ case maybeForeigns of

596+ Nothing -> return (Left Exit.BP_CannotLoadDependencies)

597+ Just fs -> return (Right fs)

598+

599+ Just problem ->

600+ do _ <- readMVar dmvar

601+ return (Left problem)

602+

603+ Just (NE.List name names) ->

604+ do _ <- readMVar dmvar

605+ return (Left (Exit.BP_Cycle name names))

606+

607+

608+

609+-- CHECK FOR CYCLES

610+

611+

612+checkForCycles :: Map.Map ModuleName.Raw Status -> Maybe (NE.List ModuleName.Raw)

613+checkForCycles modules =

614+ let

615+ !graph = Map.foldrWithKey addToGraph [] modules

616+ !sccs = Graph.stronglyConnComp graph

617+ in

618+ checkForCyclesHelp sccs

619+

620+

621+checkForCyclesHelp :: [Graph.SCC ModuleName.Raw] -> Maybe (NE.List ModuleName.Raw)

622+checkForCyclesHelp sccs =

623+ case sccs of

624+ [] ->

625+ Nothing

626+

627+ scc:otherSccs ->

628+ case scc of

629+ Graph.AcyclicSCC _ -> checkForCyclesHelp otherSccs

630+ Graph.CyclicSCC [] -> checkForCyclesHelp otherSccs

631+ Graph.CyclicSCC (m:ms) -> Just (NE.List m ms)

632+

633+

634+type Node =

635+ ( ModuleName.Raw, ModuleName.Raw, [ModuleName.Raw] )

636+

637+

638+addToGraph :: ModuleName.Raw -> Status -> [Node] -> [Node]

639+addToGraph name status graph =

640+ let

641+ dependencies =

642+ case status of

643+ SCached (Details.Local _ _ deps _ _ _) -> deps

644+ SChanged (Details.Local _ _ deps _ _ _) _ _ _ -> deps

645+ SBadImport _ -> []

646+ SBadSyntax _ _ _ _ -> []

647+ SForeign _ -> []

648+ SKernel -> []

649+ in

650+ (name, name, dependencies) : graph

651+

652+

653+

654+-- CHECK UNIQUE ROOTS

655+

656+

657+checkUniqueRoots :: Map.Map ModuleName.Raw Status -> NE.List RootStatus -> Maybe Exit.BuildProjectProblem

658+checkUniqueRoots insides sroots =

659+ let

660+ outsidesDict =

661+ Map.fromListWith OneOrMore.more (Maybe.mapMaybe rootStatusToNamePathPair (NE.toList sroots))

662+ in

663+ case Map.traverseWithKey checkOutside outsidesDict of

664+ Left problem ->

665+ Just problem

666+

667+ Right outsides ->

668+ case sequence_ (Map.intersectionWithKey checkInside outsides insides) of

669+ Right () -> Nothing

670+ Left problem -> Just problem

671+

672+

673+rootStatusToNamePathPair :: RootStatus -> Maybe (ModuleName.Raw, OneOrMore.OneOrMore FilePath)

674+rootStatusToNamePathPair sroot =

675+ case sroot of

676+ SInside _ -> Nothing

677+ SOutsideOk (Details.Local path _ _ _ _ _) _ modul -> Just (Src.getName modul, OneOrMore.one path)

678+ SOutsideErr _ -> Nothing

679+

680+

681+checkOutside :: ModuleName.Raw -> OneOrMore.OneOrMore FilePath -> Either Exit.BuildProjectProblem FilePath

682+checkOutside name paths =

683+ case OneOrMore.destruct NE.List paths of

684+ NE.List p [] -> Right p

685+ NE.List p1 (p2:_) -> Left (Exit.BP_RootNameDuplicate name p1 p2)

686+

687+

688+checkInside :: ModuleName.Raw -> FilePath -> Status -> Either Exit.BuildProjectProblem ()

689+checkInside name p1 status =

690+ case status of

691+ SCached (Details.Local p2 _ _ _ _ _) -> Left (Exit.BP_RootNameDuplicate name p1 p2)

692+ SChanged (Details.Local p2 _ _ _ _ _) _ _ _ -> Left (Exit.BP_RootNameDuplicate name p1 p2)

693+ SBadImport _ -> Right ()

694+ SBadSyntax _ _ _ _ -> Right ()

695+ SForeign _ -> Right ()

696+ SKernel -> Right ()

697+

698+

699+

700+-- COMPILE MODULE

701+

702+

703+compile :: Env -> DocsNeed -> Details.Local -> B.ByteString -> Map.Map ModuleName.Raw I.Interface -> Src.Module -> IO Result

704+compile (Env key root projectType _ buildID _ _) docsNeed (Details.Local path time deps main lastChange _) source ifaces modul =

705+ let

706+ pkg = projectTypeToPkg projectType

707+ in

708+ case Compile.compile pkg ifaces modul of

709+ Right (Compile.Artifacts canonical annotations objects) ->

710+ case makeDocs docsNeed canonical of

711+ Left err ->

712+ return $ RProblem $

713+ Error.Module (Src.getName modul) path time source (Error.BadDocs err)

714+

715+ Right docs ->

716+ do let name = Src.getName modul

717+ let iface = I.fromModule pkg canonical annotations

718+ let elmi = Stuff.elmi root name

719+ File.writeBinary (Stuff.elmo root name) objects

720+ maybeOldi <- File.readBinary elmi

721+ case maybeOldi of

722+ Just oldi | oldi == iface ->

723+ do -- iface should be fully forced by equality check

724+ Reporting.report key Reporting.BDone

725+ let local = Details.Local path time deps main lastChange buildID

726+ return (RSame local iface objects docs)

727+

728+ _ ->

729+ do -- iface may be lazy still

730+ File.writeBinary elmi iface

731+ Reporting.report key Reporting.BDone

732+ let local = Details.Local path time deps main buildID buildID

733+ return (RNew local iface objects docs)

734+

735+ Left err ->

736+ return $ RProblem $

737+ Error.Module (Src.getName modul) path time source err

738+

739+

740+projectTypeToPkg :: Parse.ProjectType -> Pkg.Name

741+projectTypeToPkg projectType =

742+ case projectType of

743+ Parse.Package pkg -> pkg

744+ Parse.Application -> Pkg.dummyName

745+

746+

747+

748+-- WRITE DETAILS

749+

750+

751+writeDetails :: FilePath -> Details.Details -> Map.Map ModuleName.Raw Result -> IO ()

752+writeDetails root (Details.Details time outline buildID locals foreigns extras) results =

753+ File.writeBinary (Stuff.details root) $

754+ Details.Details time outline buildID (Map.foldrWithKey addNewLocal locals results) foreigns extras

755+

756+

757+addNewLocal :: ModuleName.Raw -> Result -> Map.Map ModuleName.Raw Details.Local -> Map.Map ModuleName.Raw Details.Local

758+addNewLocal name result locals =

759+ case result of

760+ RNew local _ _ _ -> Map.insert name local locals

761+ RSame local _ _ _ -> Map.insert name local locals

762+ RCached _ _ _ -> locals

763+ RNotFound _ -> locals

764+ RProblem _ -> locals

765+ RBlocked -> locals

766+ RForeign _ -> locals

767+ RKernel -> locals

768+

769+

770+

771+-- FINALIZE EXPOSED

772+

773+

774+finalizeExposed :: FilePath -> DocsGoal docs -> NE.List ModuleName.Raw -> Map.Map ModuleName.Raw Result -> IO (Either Exit.BuildProblem docs)

775+finalizeExposed root docsGoal exposed results =

776+ case foldr (addImportProblems results) [] (NE.toList exposed) of

777+ p:ps ->

778+ return $ Left $ Exit.BuildProjectProblem (Exit.BP_MissingExposed (NE.List p ps))

779+

780+ [] ->

781+ case Map.foldr addErrors [] results of

782+ [] -> Right <$> finalizeDocs docsGoal results

783+ e:es -> return $ Left $ Exit.BuildBadModules root e es

784+

785+

786+addErrors :: Result -> [Error.Module] -> [Error.Module]

787+addErrors result errors =

788+ case result of

789+ RNew _ _ _ _ -> errors

790+ RSame _ _ _ _ -> errors

791+ RCached _ _ _ -> errors

792+ RNotFound _ -> errors

793+ RProblem e -> e:errors

794+ RBlocked -> errors

795+ RForeign _ -> errors

796+ RKernel -> errors

797+

798+

799+addImportProblems :: Map.Map ModuleName.Raw Result -> ModuleName.Raw -> [(ModuleName.Raw, Import.Problem)] -> [(ModuleName.Raw, Import.Problem)]

800+addImportProblems results name problems =

801+ case results ! name of

802+ RNew _ _ _ _ -> problems

803+ RSame _ _ _ _ -> problems

804+ RCached _ _ _ -> problems

805+ RNotFound p -> (name, p) : problems

806+ RProblem _ -> problems

807+ RBlocked -> problems

808+ RForeign _ -> problems

809+ RKernel -> problems

810+

811+

812+

813+-- DOCS

814+

815+

816+data DocsGoal a where

817+ KeepDocs :: DocsGoal Docs.Documentation

818+ WriteDocs :: FilePath -> DocsGoal ()

819+ IgnoreDocs :: DocsGoal ()

820+

821+

822+newtype DocsNeed =

823+ DocsNeed { needsDocs :: Bool }

824+

825+

826+toDocsNeed :: DocsGoal a -> DocsNeed

827+toDocsNeed goal =

828+ case goal of

829+ IgnoreDocs -> DocsNeed False

830+ WriteDocs _ -> DocsNeed True

831+ KeepDocs -> DocsNeed True

832+

833+

834+makeDocs :: DocsNeed -> Can.Module -> Either EDocs.Error (Maybe Docs.Module)

835+makeDocs (DocsNeed isNeeded) modul =

836+ if isNeeded then

837+ case Docs.fromModule modul of

838+ Right docs -> Right (Just docs)

839+ Left err -> Left err

840+ else

841+ Right Nothing

842+

843+

844+finalizeDocs :: DocsGoal docs -> Map.Map ModuleName.Raw Result -> IO docs

845+finalizeDocs goal results =

846+ case goal of

847+ KeepDocs ->

848+ return $ Map.mapMaybe toDocs results

849+

850+ WriteDocs path ->

851+ E.writeUgly path $ Docs.encode $ Map.mapMaybe toDocs results

852+

853+ IgnoreDocs ->

854+ return ()

855+

856+

857+toDocs :: Result -> Maybe Docs.Module

858+toDocs result =

859+ case result of

860+ RNew _ _ _ d -> d

861+ RSame _ _ _ d -> d

862+ RCached _ _ _ -> Nothing

863+ RNotFound _ -> Nothing

864+ RProblem _ -> Nothing

865+ RBlocked -> Nothing

866+ RForeign _ -> Nothing

867+ RKernel -> Nothing

868+

869+

870+

871+--------------------------------------------------------------------------------

872+------ NOW FOR SOME REPL STUFF -------------------------------------------------

873+--------------------------------------------------------------------------------

874+

875+

876+-- FROM REPL

877+

878+

879+data ReplArtifacts =

880+ ReplArtifacts

881+ { _repl_home :: ModuleName.Canonical

882+ , _repl_modules :: [Module]

883+ , _repl_localizer :: L.Localizer

884+ , _repl_annotations :: Map.Map Name.Name Can.Annotation

885+ }

886+

887+

888+fromRepl :: FilePath -> Details.Details -> B.ByteString -> IO (Either Exit.Repl ReplArtifacts)

889+fromRepl root details source =

890+ do env@(Env _ _ projectType _ _ _ _) <- makeEnv Reporting.ignorer root details

891+ case Parse.fromByteString projectType source of

892+ Left syntaxError ->

893+ return $ Left $ Exit.ReplBadInput source $ Error.BadSyntax syntaxError

894+

895+ Right modul@(Src.Module _ _ _ imports _ _ _ _ _) ->

896+ do dmvar <- Details.loadInterfaces root details

897+

898+ let deps = map Src.getImportName imports

899+ mvar <- newMVar Map.empty

900+ crawlDeps env mvar deps ()

901+

902+ statuses <- traverse readMVar =<< readMVar mvar

903+ midpoint <- checkMidpoint dmvar statuses

904+

905+ case midpoint of

906+ Left problem ->

907+ return $ Left $ Exit.ReplProjectProblem problem

908+

909+ Right foreigns ->

910+ do rmvar <- newEmptyMVar

911+ resultMVars <- forkWithKey (checkModule env foreigns rmvar) statuses

912+ putMVar rmvar resultMVars

913+ results <- traverse readMVar resultMVars

914+ writeDetails root details results

915+ depsStatus <- checkDeps root resultMVars deps 0

916+ finalizeReplArtifacts env source modul depsStatus resultMVars results

917+

918+

919+finalizeReplArtifacts :: Env -> B.ByteString -> Src.Module -> DepsStatus -> ResultDict -> Map.Map ModuleName.Raw Result -> IO (Either Exit.Repl ReplArtifacts)

920+finalizeReplArtifacts env@(Env _ root projectType _ _ _ _) source modul@(Src.Module _ _ _ imports _ _ _ _ _) depsStatus resultMVars results =

921+ let

922+ pkg =

923+ projectTypeToPkg projectType

924+

925+ compileInput ifaces =

926+ case Compile.compile pkg ifaces modul of

927+ Right (Compile.Artifacts canonical annotations objects) ->

928+ let

929+ h = Can._name canonical

930+ m = Fresh (Src.getName modul) (I.fromModule pkg canonical annotations) objects

931+ ms = Map.foldrWithKey addInside [] results

932+ in

933+ return $ Right $ ReplArtifacts h (m:ms) (L.fromModule modul) annotations

934+

935+ Left errors ->

936+ return $ Left $ Exit.ReplBadInput source errors

937+ in

938+ case depsStatus of

939+ DepsChange ifaces ->

940+ compileInput ifaces

941+

942+ DepsSame same cached ->

943+ do maybeLoaded <- loadInterfaces root same cached

944+ case maybeLoaded of

945+ Just ifaces -> compileInput ifaces

946+ Nothing -> return $ Left $ Exit.ReplBadCache

947+

948+ DepsBlock ->

949+ case Map.foldr addErrors [] results of

950+ [] -> return $ Left $ Exit.ReplBlocked

951+ e:es -> return $ Left $ Exit.ReplBadLocalDeps root e es

952+

953+ DepsNotFound problems ->

954+ return $ Left $ Exit.ReplBadInput source $ Error.BadImports $

955+ toImportErrors env resultMVars imports problems

956+

957+

958+

959+--------------------------------------------------------------------------------

960+--------------------------------------------------------------------------------

961+------ AFTER THIS, EVERYTHING IS ABOUT HANDLING MODULES GIVEN BY FILEPATH ------

962+--------------------------------------------------------------------------------

963+--------------------------------------------------------------------------------

964+

965+

966+

967+-- FIND ROOT

968+

969+

970+data RootLocation

971+ = LInside ModuleName.Raw

972+ | LOutside FilePath

973+

974+

975+findRoots :: Env -> NE.List FilePath -> IO (Either Exit.BuildProjectProblem (NE.List RootLocation))

976+findRoots env paths =

977+ do mvars <- traverse (fork . getRootInfo env) paths

978+ einfos <- traverse readMVar mvars

979+ return $ checkRoots =<< sequence einfos

980+

981+

982+checkRoots :: NE.List RootInfo -> Either Exit.BuildProjectProblem (NE.List RootLocation)

983+checkRoots infos =

984+ let

985+ toOneOrMore loc@(RootInfo absolute _ _) =

986+ (absolute, OneOrMore.one loc)

987+

988+ fromOneOrMore loc locs =

989+ case locs of

990+ [] -> Right ()

991+ loc2:_ -> Left (Exit.BP_MainPathDuplicate (_relative loc) (_relative loc2))

992+ in

993+ fmap (\_ -> fmap _location infos) $

994+ traverse (OneOrMore.destruct fromOneOrMore) $

995+ Map.fromListWith OneOrMore.more $ map toOneOrMore (NE.toList infos)

996+

997+

998+

999+-- ROOT INFO

1000+

1001+

1002+data RootInfo =

1003+ RootInfo

1004+ { _absolute :: FilePath

1005+ , _relative :: FilePath

1006+ , _location :: RootLocation

1007+ }

1008+

1009+

1010+getRootInfo :: Env -> FilePath -> IO (Either Exit.BuildProjectProblem RootInfo)

1011+getRootInfo env path =

1012+ do exists <- File.exists path

1013+ if exists

1014+ then getRootInfoHelp env path =<< Dir.canonicalizePath path

1015+ else return (Left (Exit.BP_PathUnknown path))

1016+

1017+

1018+getRootInfoHelp :: Env -> FilePath -> FilePath -> IO (Either Exit.BuildProjectProblem RootInfo)

1019+getRootInfoHelp (Env _ _ _ srcDirs _ _ _) path absolutePath =

1020+ let

1021+ (dirs, file) = FP.splitFileName absolutePath

1022+ (final, ext) = FP.splitExtension file

1023+ in

1024+ if ext /= ".elm"

1025+ then

1026+ return $ Left $ Exit.BP_WithBadExtension path

1027+ else

1028+ let

1029+ absoluteSegments = FP.splitDirectories dirs ++ [final]

1030+ in

1031+ case Maybe.mapMaybe (isInsideSrcDirByPath absoluteSegments) srcDirs of

1032+ [] ->

1033+ return $ Right $ RootInfo absolutePath path (LOutside path)

1034+

1035+ [(_, Right names)] ->

1036+ do let name = Name.fromChars (List.intercalate "." names)

1037+ matchingDirs <- filterM (isInsideSrcDirByName names) srcDirs

1038+ case matchingDirs of

1039+ d1:d2:_ ->

1040+ do let p1 = addRelative d1 (FP.joinPath names <.> "elm")

1041+ let p2 = addRelative d2 (FP.joinPath names <.> "elm")

1042+ return $ Left $ Exit.BP_RootNameDuplicate name p1 p2

1043+

1044+ _ ->

1045+ return $ Right $ RootInfo absolutePath path (LInside name)

1046+

1047+ [(s, Left names)] ->

1048+ return $ Left $ Exit.BP_RootNameInvalid path s names

1049+

1050+ (s1,_):(s2,_):_ ->

1051+ return $ Left $ Exit.BP_WithAmbiguousSrcDir path s1 s2

1052+

1053+

1054+

1055+isInsideSrcDirByName :: [String] -> AbsoluteSrcDir -> IO Bool

1056+isInsideSrcDirByName names srcDir =

1057+ File.exists (addRelative srcDir (FP.joinPath names <.> "elm"))

1058+

1059+

1060+isInsideSrcDirByPath :: [String] -> AbsoluteSrcDir -> Maybe (FilePath, Either [String] [String])

1061+isInsideSrcDirByPath segments (AbsoluteSrcDir srcDir) =

1062+ case dropPrefix (FP.splitDirectories srcDir) segments of

1063+ Nothing ->

1064+ Nothing

1065+

1066+ Just names ->

1067+ if all isGoodName names

1068+ then Just (srcDir, Right names)

1069+ else Just (srcDir, Left names)

1070+

1071+

1072+isGoodName :: [Char] -> Bool

1073+isGoodName name =

1074+ case name of

1075+ [] ->

1076+ False

1077+

1078+ char:chars ->

1079+ Char.isUpper char && all (\c -> Char.isAlphaNum c || c == '_') chars

1080+

1081+

1082+-- INVARIANT: Dir.canonicalizePath has been run on both inputs

1083+--

1084+dropPrefix :: [FilePath] -> [FilePath] -> Maybe [FilePath]

1085+dropPrefix roots paths =

1086+ case roots of

1087+ [] ->

1088+ Just paths

1089+

1090+ r:rs ->

1091+ case paths of

1092+ [] -> Nothing

1093+ p:ps -> if r == p then dropPrefix rs ps else Nothing

1094+

1095+

1096+

1097+-- CRAWL ROOTS

1098+

1099+

1100+data RootStatus

1101+ = SInside ModuleName.Raw

1102+ | SOutsideOk Details.Local B.ByteString Src.Module

1103+ | SOutsideErr Error.Module

1104+

1105+

1106+crawlRoot :: Env -> MVar StatusDict -> RootLocation -> IO RootStatus

1107+crawlRoot env@(Env _ _ projectType _ buildID _ _) mvar root =

1108+ case root of

1109+ LInside name ->

1110+ do statusMVar <- newEmptyMVar

1111+ statusDict <- takeMVar mvar

1112+ putMVar mvar (Map.insert name statusMVar statusDict)

1113+ putMVar statusMVar =<< crawlModule env mvar (DocsNeed False) name

1114+ return (SInside name)

1115+

1116+ LOutside path ->

1117+ do time <- File.getTime path

1118+ source <- File.readUtf8 path

1119+ case Parse.fromByteString projectType source of

1120+ Right modul@(Src.Module _ _ _ imports values _ _ _ _) ->

1121+ do let deps = map Src.getImportName imports

1122+ let local = Details.Local path time deps (any isMain values) buildID buildID

1123+ crawlDeps env mvar deps (SOutsideOk local source modul)

1124+

1125+ Left syntaxError ->

1126+ return $ SOutsideErr $

1127+ Error.Module "???" path time source (Error.BadSyntax syntaxError)

1128+

1129+

1130+

1131+-- CHECK ROOTS

1132+

1133+

1134+data RootResult

1135+ = RInside ModuleName.Raw

1136+ | ROutsideOk ModuleName.Raw I.Interface Opt.LocalGraph

1137+ | ROutsideErr Error.Module

1138+ | ROutsideBlocked

1139+

1140+

1141+checkRoot :: Env -> ResultDict -> RootStatus -> IO RootResult

1142+checkRoot env@(Env _ root _ _ _ _ _) results rootStatus =

1143+ case rootStatus of

1144+ SInside name ->

1145+ return (RInside name)

1146+

1147+ SOutsideErr err ->

1148+ return (ROutsideErr err)

1149+

1150+ SOutsideOk local@(Details.Local path time deps _ _ lastCompile) source modul@(Src.Module _ _ _ imports _ _ _ _ _) ->

1151+ do depsStatus <- checkDeps root results deps lastCompile

1152+ case depsStatus of

1153+ DepsChange ifaces ->

1154+ compileOutside env local source ifaces modul

1155+

1156+ DepsSame same cached ->

1157+ do maybeLoaded <- loadInterfaces root same cached

1158+ case maybeLoaded of

1159+ Nothing -> return ROutsideBlocked

1160+ Just ifaces -> compileOutside env local source ifaces modul

1161+

1162+ DepsBlock ->

1163+ return ROutsideBlocked

1164+

1165+ DepsNotFound problems ->

1166+ return $ ROutsideErr $ Error.Module (Src.getName modul) path time source $

1167+ Error.BadImports (toImportErrors env results imports problems)

1168+

1169+

1170+compileOutside :: Env -> Details.Local -> B.ByteString -> Map.Map ModuleName.Raw I.Interface -> Src.Module -> IO RootResult

1171+compileOutside (Env key _ projectType _ _ _ _) (Details.Local path time _ _ _ _) source ifaces modul =

1172+ let

1173+ pkg = projectTypeToPkg projectType

1174+ name = Src.getName modul

1175+ in

1176+ case Compile.compile pkg ifaces modul of

1177+ Right (Compile.Artifacts canonical annotations objects) ->

1178+ do Reporting.report key Reporting.BDone

1179+ return $ ROutsideOk name (I.fromModule pkg canonical annotations) objects

1180+

1181+ Left errors ->

1182+ return $ ROutsideErr $ Error.Module name path time source errors

1183+

1184+

1185+

1186+-- TO ARTIFACTS

1187+

1188+

1189+data Root

1190+ = Inside ModuleName.Raw

1191+ | Outside ModuleName.Raw I.Interface Opt.LocalGraph

1192+

1193+

1194+toArtifacts :: Env -> Dependencies -> Map.Map ModuleName.Raw Result -> NE.List RootResult -> Either Exit.BuildProblem Artifacts

1195+toArtifacts (Env _ root projectType _ _ _ _) foreigns results rootResults =

1196+ case gatherProblemsOrMains results rootResults of

1197+ Left (NE.List e es) ->

1198+ Left (Exit.BuildBadModules root e es)

1199+

1200+ Right roots ->

1201+ Right $ Artifacts (projectTypeToPkg projectType) foreigns roots $

1202+ Map.foldrWithKey addInside (foldr addOutside [] rootResults) results

1203+

1204+

1205+gatherProblemsOrMains :: Map.Map ModuleName.Raw Result -> NE.List RootResult -> Either (NE.List Error.Module) (NE.List Root)

1206+gatherProblemsOrMains results (NE.List rootResult rootResults) =

1207+ let

1208+ addResult result (es, roots) =

1209+ case result of

1210+ RInside n -> ( es, Inside n : roots)

1211+ ROutsideOk n i o -> ( es, Outside n i o : roots)

1212+ ROutsideErr e -> (e:es, roots)

1213+ ROutsideBlocked -> ( es, roots)

1214+

1215+ errors = Map.foldr addErrors [] results

1216+ in

1217+ case (rootResult, foldr addResult (errors, []) rootResults) of

1218+ (RInside n , ( [], ms)) -> Right (NE.List (Inside n) ms)

1219+ (RInside _ , (e:es, _ )) -> Left (NE.List e es)

1220+ (ROutsideOk n i o, ( [], ms)) -> Right (NE.List (Outside n i o) ms)

1221+ (ROutsideOk _ _ _, (e:es, _ )) -> Left (NE.List e es)

1222+ (ROutsideErr e , ( es, _ )) -> Left (NE.List e es)

1223+ (ROutsideBlocked , ( [], _ )) -> error "seems like elm-stuff/ is corrupted"

1224+ (ROutsideBlocked , (e:es, _ )) -> Left (NE.List e es)

1225+

1226+

1227+addInside :: ModuleName.Raw -> Result -> [Module] -> [Module]

1228+addInside name result modules =

1229+ case result of

1230+ RNew _ iface objs _ -> Fresh name iface objs : modules

1231+ RSame _ iface objs _ -> Fresh name iface objs : modules

1232+ RCached main _ mvar -> Cached name main mvar : modules

1233+ RNotFound _ -> error (badInside name)

1234+ RProblem _ -> error (badInside name)

1235+ RBlocked -> error (badInside name)

1236+ RForeign _ -> modules

1237+ RKernel -> modules

1238+

1239+

1240+badInside :: ModuleName.Raw -> [Char]

1241+badInside name =

1242+ "Error from `" ++ Name.toChars name ++ "` should have been reported already."

1243+

1244+

1245+addOutside :: RootResult -> [Module] -> [Module]

1246+addOutside root modules =

1247+ case root of

1248+ RInside _ -> modules

1249+ ROutsideOk name iface objs -> Fresh name iface objs : modules

1250+ ROutsideErr _ -> modules

1251+ ROutsideBlocked -> modules

builder/src/Deps/Bump.hsnew file+37

@@ -0,0 +1,37 @@

1+module Deps.Bump

2+ ( getPossibilities

3+ )

4+ where

5+

6+

7+import qualified Data.List as List

8+

9+import qualified Deps.Registry as Registry

10+import qualified Elm.Magnitude as M

11+import qualified Elm.Version as V

12+

13+

14+

15+-- GET POSSIBILITIES

16+

17+

18+getPossibilities :: Registry.KnownVersions -> [(V.Version, V.Version, M.Magnitude)]

19+getPossibilities (Registry.KnownVersions latest previous) =

20+ let

21+ allVersions = reverse (latest:previous)

22+ minorPoints = map last (List.groupBy sameMajor allVersions)

23+ patchPoints = map last (List.groupBy sameMinor allVersions)

24+ in

25+ (latest, V.bumpMajor latest, M.MAJOR)

26+ : map (\v -> (v, V.bumpMinor v, M.MINOR)) minorPoints

27+ ++ map (\v -> (v, V.bumpPatch v, M.PATCH)) patchPoints

28+

29+

30+sameMajor :: V.Version -> V.Version -> Bool

31+sameMajor (V.Version major1 _ _) (V.Version major2 _ _) =

32+ major1 == major2

33+

34+

35+sameMinor :: V.Version -> V.Version -> Bool

36+sameMinor (V.Version major1 minor1 _) (V.Version major2 minor2 _) =

37+ major1 == major2 && minor1 == minor2

builder/src/Deps/Diff.hsnew file+383

@@ -0,0 +1,383 @@

1+{-# LANGUAGE OverloadedStrings #-}

2+module Deps.Diff

3+ ( diff

4+ , PackageChanges(..)

5+ , ModuleChanges(..)

6+ , Changes(..)

7+ , moduleChangeMagnitude

8+ , toMagnitude

9+ , bump

10+ , getDocs

11+ )

12+ where

13+

14+

15+import Control.Monad (zipWithM)

16+import Data.Function (on)

17+import qualified Data.List as List

18+import qualified Data.Map as Map

19+import qualified Data.Name as Name

20+import qualified Data.Set as Set

21+import qualified System.Directory as Dir

22+import System.FilePath ((</>))

23+

24+import qualified Deps.Website as Website

25+import qualified Elm.Compiler.Type as Type

26+import qualified Elm.Docs as Docs

27+import qualified Elm.Magnitude as M

28+import qualified Elm.ModuleName as ModuleName

29+import qualified Elm.Package as Pkg

30+import qualified Elm.Version as V

31+import qualified File

32+import qualified Http

33+import qualified Json.Decode as D

34+import qualified Reporting.Exit as Exit

35+import qualified Stuff

36+

37+

38+

39+-- CHANGES

40+

41+

42+data PackageChanges =

43+ PackageChanges

44+ { _modules_added :: [ModuleName.Raw]

45+ , _modules_changed :: Map.Map ModuleName.Raw ModuleChanges

46+ , _modules_removed :: [ModuleName.Raw]

47+ }

48+

49+

50+data ModuleChanges =

51+ ModuleChanges

52+ { _unions :: Changes Name.Name Docs.Union

53+ , _aliases :: Changes Name.Name Docs.Alias

54+ , _values :: Changes Name.Name Docs.Value

55+ , _binops :: Changes Name.Name Docs.Binop

56+ }

57+

58+

59+data Changes k v =

60+ Changes

61+ { _added :: Map.Map k v

62+ , _changed :: Map.Map k (v,v)

63+ , _removed :: Map.Map k v

64+ }

65+

66+

67+getChanges :: (Ord k) => (v -> v -> Bool) -> Map.Map k v -> Map.Map k v -> Changes k v

68+getChanges isEquivalent old new =

69+ let

70+ overlap = Map.intersectionWith (,) old new

71+ changed = Map.filter (not . uncurry isEquivalent) overlap

72+ in

73+ Changes (Map.difference new old) changed (Map.difference old new)

74+

75+

76+

77+-- DIFF

78+

79+

80+diff :: Docs.Documentation -> Docs.Documentation -> PackageChanges

81+diff oldDocs newDocs =

82+ let

83+ filterOutPatches chngs =

84+ Map.filter (\chng -> moduleChangeMagnitude chng /= M.PATCH) chngs

85+

86+ (Changes added changed removed) =

87+ getChanges (\_ _ -> False) oldDocs newDocs

88+ in

89+ PackageChanges

90+ (Map.keys added)

91+ (filterOutPatches (Map.map diffModule changed))

92+ (Map.keys removed)

93+

94+

95+

96+diffModule :: (Docs.Module, Docs.Module) -> ModuleChanges

97+diffModule (Docs.Module _ _ u1 a1 v1 b1, Docs.Module _ _ u2 a2 v2 b2) =

98+ ModuleChanges

99+ (getChanges isEquivalentUnion u1 u2)

100+ (getChanges isEquivalentAlias a1 a2)

101+ (getChanges isEquivalentValue v1 v2)

102+ (getChanges isEquivalentBinop b1 b2)

103+

104+

105+

106+-- EQUIVALENCE

107+

108+

109+isEquivalentUnion :: Docs.Union -> Docs.Union -> Bool

110+isEquivalentUnion (Docs.Union oldComment oldVars oldCtors) (Docs.Union newComment newVars newCtors) =

111+ length oldCtors == length newCtors

112+ && and (zipWith (==) (map fst oldCtors) (map fst newCtors))

113+ && and (Map.elems (Map.intersectionWith equiv (Map.fromList oldCtors) (Map.fromList newCtors)))

114+ where

115+ equiv :: [Type.Type] -> [Type.Type] -> Bool

116+ equiv oldTypes newTypes =

117+ let

118+ allEquivalent =

119+ zipWith

120+ isEquivalentAlias

121+ (map (Docs.Alias oldComment oldVars) oldTypes)

122+ (map (Docs.Alias newComment newVars) newTypes)

123+ in

124+ length oldTypes == length newTypes

125+ && and allEquivalent

126+

127+

128+isEquivalentAlias :: Docs.Alias -> Docs.Alias -> Bool

129+isEquivalentAlias (Docs.Alias _ oldVars oldType) (Docs.Alias _ newVars newType) =

130+ case diffType oldType newType of

131+ Nothing ->

132+ False

133+

134+ Just renamings ->

135+ length oldVars == length newVars

136+ && isEquivalentRenaming (zip oldVars newVars ++ renamings)

137+

138+

139+isEquivalentValue :: Docs.Value -> Docs.Value -> Bool

140+isEquivalentValue (Docs.Value c1 t1) (Docs.Value c2 t2) =

141+ isEquivalentAlias (Docs.Alias c1 [] t1) (Docs.Alias c2 [] t2)

142+

143+

144+isEquivalentBinop :: Docs.Binop -> Docs.Binop -> Bool

145+isEquivalentBinop (Docs.Binop c1 t1 a1 p1) (Docs.Binop c2 t2 a2 p2) =

146+ isEquivalentAlias (Docs.Alias c1 [] t1) (Docs.Alias c2 [] t2)

147+ && a1 == a2

148+ && p1 == p2

149+

150+

151+

152+-- DIFF TYPES

153+

154+

155+diffType :: Type.Type -> Type.Type -> Maybe [(Name.Name,Name.Name)]

156+diffType oldType newType =

157+ case (oldType, newType) of

158+ (Type.Var oldName, Type.Var newName) ->

159+ Just [(oldName, newName)]

160+

161+ (Type.Lambda a b, Type.Lambda a' b') ->

162+ (++)

163+ <$> diffType a a'

164+ <*> diffType b b'

165+

166+ (Type.Type oldName oldArgs, Type.Type newName newArgs) ->

167+ if not (isSameName oldName newName) || length oldArgs /= length newArgs then

168+ Nothing

169+ else

170+ concat <$> zipWithM diffType oldArgs newArgs

171+

172+ (Type.Record fields maybeExt, Type.Record fields' maybeExt') ->

173+ case (maybeExt, maybeExt') of

174+ (Nothing, Just _) ->

175+ Nothing

176+

177+ (Just _, Nothing) ->

178+ Nothing

179+

180+ (Nothing, Nothing) ->

181+ diffFields fields fields'

182+

183+ (Just oldExt, Just newExt) ->

184+ (:) (oldExt, newExt) <$> diffFields fields fields'

185+

186+ (Type.Unit, Type.Unit) ->

187+ Just []

188+

189+ (Type.Tuple a b cs, Type.Tuple x y zs) ->

190+ if length cs /= length zs then

191+ Nothing

192+ else

193+ do aVars <- diffType a x

194+ bVars <- diffType b y

195+ cVars <- concat <$> zipWithM diffType cs zs

196+ return (aVars ++ bVars ++ cVars)

197+

198+ (_, _) ->

199+ Nothing

200+

201+

202+-- handle very old docs that do not use qualified names

203+isSameName :: Name.Name -> Name.Name -> Bool

204+isSameName oldFullName newFullName =

205+ let

206+ dedot name =

207+ reverse (Name.splitDots name)

208+ in

209+ case ( dedot oldFullName, dedot newFullName ) of

210+ (oldName:[], newName:_) ->

211+ oldName == newName

212+

213+ (oldName:_, newName:[]) ->

214+ oldName == newName

215+

216+ _ ->

217+ oldFullName == newFullName

218+

219+

220+diffFields :: [(Name.Name, Type.Type)] -> [(Name.Name, Type.Type)] -> Maybe [(Name.Name,Name.Name)]

221+diffFields oldRawFields newRawFields =

222+ let

223+ sort = List.sortBy (compare `on` fst)

224+ oldFields = sort oldRawFields

225+ newFields = sort newRawFields

226+ in

227+ if length oldRawFields /= length newRawFields then

228+ Nothing

229+

230+ else if or (zipWith ((/=) `on` fst) oldFields newFields) then

231+ Nothing

232+

233+ else

234+ concat <$> zipWithM (diffType `on` snd) oldFields newFields

235+

236+

237+

238+-- TYPE VARIABLES

239+

240+

241+isEquivalentRenaming :: [(Name.Name,Name.Name)] -> Bool

242+isEquivalentRenaming varPairs =

243+ let

244+ renamings =

245+ Map.toList (foldr insert Map.empty varPairs)

246+

247+ insert (old,new) dict =

248+ Map.insertWith (++) old [new] dict

249+

250+ verify (old, news) =

251+ case news of

252+ [] ->

253+ Nothing

254+

255+ new : rest ->

256+ if all (new ==) rest then

257+ Just (old, new)

258+ else

259+ Nothing

260+

261+ allUnique list =

262+ length list == Set.size (Set.fromList list)

263+ in

264+ case mapM verify renamings of

265+ Nothing ->

266+ False

267+

268+ Just verifiedRenamings ->

269+ all compatibleVars verifiedRenamings

270+ &&

271+ allUnique (map snd verifiedRenamings)

272+

273+

274+compatibleVars :: (Name.Name, Name.Name) -> Bool

275+compatibleVars (old, new) =

276+ case (categorizeVar old, categorizeVar new) of

277+ (CompAppend, CompAppend) -> True

278+ (Comparable, Comparable) -> True

279+ (Appendable, Appendable) -> True

280+ (Number , Number ) -> True

281+ (Number , Comparable) -> True

282+

283+ (_, Var) -> True

284+

285+ (_, _) -> False

286+

287+

288+data TypeVarCategory

289+ = CompAppend

290+ | Comparable

291+ | Appendable

292+ | Number

293+ | Var

294+

295+

296+categorizeVar :: Name.Name -> TypeVarCategory

297+categorizeVar name

298+ | Name.isCompappendType name = CompAppend

299+ | Name.isComparableType name = Comparable

300+ | Name.isAppendableType name = Appendable

301+ | Name.isNumberType name = Number

302+ | otherwise = Var

303+

304+

305+

306+-- MAGNITUDE

307+

308+

309+bump :: PackageChanges -> V.Version -> V.Version

310+bump changes version =

311+ case toMagnitude changes of

312+ M.PATCH ->

313+ V.bumpPatch version

314+

315+ M.MINOR ->

316+ V.bumpMinor version

317+

318+ M.MAJOR ->

319+ V.bumpMajor version

320+

321+

322+toMagnitude :: PackageChanges -> M.Magnitude

323+toMagnitude (PackageChanges added changed removed) =

324+ let

325+ addMag = if null added then M.PATCH else M.MINOR

326+ removeMag = if null removed then M.PATCH else M.MAJOR

327+ changeMags = map moduleChangeMagnitude (Map.elems changed)

328+ in

329+ maximum (addMag : removeMag : changeMags)

330+

331+

332+moduleChangeMagnitude :: ModuleChanges -> M.Magnitude

333+moduleChangeMagnitude (ModuleChanges unions aliases values binops) =

334+ maximum

335+ [ changeMagnitude unions

336+ , changeMagnitude aliases

337+ , changeMagnitude values

338+ , changeMagnitude binops

339+ ]

340+

341+

342+changeMagnitude :: Changes k v -> M.Magnitude

343+changeMagnitude (Changes added changed removed) =

344+ if Map.size removed > 0 || Map.size changed > 0 then

345+ M.MAJOR

346+

347+ else if Map.size added > 0 then

348+ M.MINOR

349+

350+ else

351+ M.PATCH

352+

353+

354+

355+-- GET DOCS

356+

357+

358+getDocs :: Stuff.PackageCache -> Http.Manager -> Pkg.Name -> V.Version -> IO (Either Exit.DocsProblem Docs.Documentation)

359+getDocs cache manager name version =

360+ do let home = Stuff.package cache name version

361+ let path = home </> "docs.json"

362+ exists <- File.exists path

363+ if exists

364+ then

365+ do bytes <- File.readUtf8 path

366+ case D.fromByteString Docs.decoder bytes of

367+ Right docs ->

368+ return $ Right docs

369+

370+ Left _ ->

371+ do File.remove path

372+ return $ Left Exit.DP_Cache

373+ else

374+ do let url = Website.metadata name version "docs.json"

375+ Http.get manager url [] Exit.DP_Http $ \body ->

376+ case D.fromByteString Docs.decoder body of

377+ Right docs ->

378+ do Dir.createDirectoryIfMissing True home

379+ File.writeUtf8 path body

380+ return $ Right docs

381+

382+ Left _ ->

383+ return $ Left $ Exit.DP_Data url body

builder/src/Deps/Registry.hsnew file+213

@@ -0,0 +1,213 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE BangPatterns, OverloadedStrings #-}

3+module Deps.Registry

4+ ( Registry(..)

5+ , KnownVersions(..)

6+ , read

7+ , fetch

8+ , update

9+ , latest

10+ , getVersions

11+ , getVersions'

12+ )

13+ where

14+

15+

16+import Prelude hiding (read)

17+import Control.Monad (liftM2)

18+import Data.Binary (Binary, get, put)

19+import qualified Data.List as List

20+import qualified Data.Map.Strict as Map

21+

22+import qualified Deps.Website as Website

23+import qualified Elm.Package as Pkg

24+import qualified Elm.Version as V

25+import qualified File

26+import qualified Http

27+import qualified Json.Decode as D

28+import qualified Parse.Primitives as P

29+import qualified Reporting.Exit as Exit

30+import qualified Stuff

31+

32+

33+

34+-- REGISTRY

35+

36+

37+data Registry =

38+ Registry

39+ { _count :: !Int

40+ , _versions :: !(Map.Map Pkg.Name KnownVersions)

41+ }

42+

43+

44+data KnownVersions =

45+ KnownVersions

46+ { _newest :: V.Version

47+ , _previous :: ![V.Version]

48+ }

49+

50+

51+

52+-- READ

53+

54+

55+read :: Stuff.PackageCache -> IO (Maybe Registry)

56+read cache =

57+ File.readBinary (Stuff.registry cache)

58+

59+

60+

61+-- FETCH

62+

63+

64+fetch :: Http.Manager -> Stuff.PackageCache -> IO (Either Exit.RegistryProblem Registry)

65+fetch manager cache =

66+ post manager "/all-packages" allPkgsDecoder $

67+ \versions ->

68+ do let size = Map.foldr' addEntry 0 versions

69+ let registry = Registry size versions

70+ let path = Stuff.registry cache

71+ File.writeBinary path registry

72+ return registry

73+

74+

75+addEntry :: KnownVersions -> Int -> Int

76+addEntry (KnownVersions _ vs) count =

77+ count + 1 + length vs

78+

79+

80+allPkgsDecoder :: D.Decoder () (Map.Map Pkg.Name KnownVersions)

81+allPkgsDecoder =

82+ let

83+ keyDecoder =

84+ Pkg.keyDecoder bail

85+

86+ versionsDecoder =

87+ D.list (D.mapError (\_ -> ()) V.decoder)

88+

89+ toKnownVersions versions =

90+ case List.sortBy (flip compare) versions of

91+ v:vs -> return (KnownVersions v vs)

92+ [] -> D.failure ()

93+ in

94+ D.dict keyDecoder (toKnownVersions =<< versionsDecoder)

95+

96+

97+

98+-- UPDATE

99+

100+

101+update :: Http.Manager -> Stuff.PackageCache -> Registry -> IO (Either Exit.RegistryProblem Registry)

102+update manager cache oldRegistry@(Registry size packages) =

103+ post manager ("/all-packages/since/" ++ show size) (D.list newPkgDecoder) $

104+ \news ->

105+ case news of

106+ [] ->

107+ return oldRegistry

108+

109+ _:_ ->

110+ let

111+ newSize = size + length news

112+ newPkgs = foldr addNew packages news

113+ newRegistry = Registry newSize newPkgs

114+ in

115+ do File.writeBinary (Stuff.registry cache) newRegistry

116+ return newRegistry

117+

118+

119+addNew :: (Pkg.Name, V.Version) -> Map.Map Pkg.Name KnownVersions -> Map.Map Pkg.Name KnownVersions

120+addNew (name, version) versions =

121+ let

122+ add maybeKnowns =

123+ case maybeKnowns of

124+ Just (KnownVersions v vs) ->

125+ KnownVersions version (v:vs)

126+

127+ Nothing ->

128+ KnownVersions version []

129+ in

130+ Map.alter (Just . add) name versions

131+

132+

133+

134+-- NEW PACKAGE DECODER

135+

136+

137+newPkgDecoder :: D.Decoder () (Pkg.Name, V.Version)

138+newPkgDecoder =

139+ D.customString newPkgParser bail

140+

141+

142+newPkgParser :: P.Parser () (Pkg.Name, V.Version)

143+newPkgParser =

144+ do pkg <- P.specialize (\_ _ _ -> ()) Pkg.parser

145+ P.word1 0x40 {-@-} bail

146+ vsn <- P.specialize (\_ _ _ -> ()) V.parser

147+ return (pkg, vsn)

148+

149+

150+bail :: row -> col -> ()

151+bail _ _ =

152+ ()

153+

154+

155+

156+-- LATEST

157+

158+

159+latest :: Http.Manager -> Stuff.PackageCache -> IO (Either Exit.RegistryProblem Registry)

160+latest manager cache =

161+ do maybeOldRegistry <- read cache

162+ case maybeOldRegistry of

163+ Just oldRegistry ->

164+ update manager cache oldRegistry

165+

166+ Nothing ->

167+ fetch manager cache

168+

169+

170+

171+-- GET VERSIONS

172+

173+

174+getVersions :: Pkg.Name -> Registry -> Maybe KnownVersions

175+getVersions name (Registry _ versions) =

176+ Map.lookup name versions

177+

178+

179+getVersions' :: Pkg.Name -> Registry -> Either [Pkg.Name] KnownVersions

180+getVersions' name (Registry _ versions) =

181+ case Map.lookup name versions of

182+ Just kvs -> Right kvs

183+ Nothing -> Left $ Pkg.nearbyNames name (Map.keys versions)

184+

185+

186+

187+-- POST

188+

189+

190+post :: Http.Manager -> String -> D.Decoder x a -> (a -> IO b) -> IO (Either Exit.RegistryProblem b)

191+post manager path decoder callback =

192+ let

193+ url = Website.route path []

194+ in

195+ Http.post manager url [] Exit.RP_Http $

196+ \body ->

197+ case D.fromByteString decoder body of

198+ Right a -> Right <$> callback a

199+ Left _ -> return $ Left $ Exit.RP_Data url body

200+

201+

202+

203+-- BINARY

204+

205+

206+instance Binary Registry where

207+ get = liftM2 Registry get get

208+ put (Registry a b) = put a >> put b

209+

210+

211+instance Binary KnownVersions where

212+ get = liftM2 KnownVersions get get

213+ put (KnownVersions a b) = put a >> put b

builder/src/Deps/Solver.hsnew file+444

@@ -0,0 +1,444 @@

1+{-# LANGUAGE OverloadedStrings, Rank2Types #-}

2+module Deps.Solver

3+ ( Solver

4+ , Result(..)

5+ , Connection(..)

6+ --

7+ , Details(..)

8+ , verify

9+ --

10+ , AppSolution(..)

11+ , addToApp

12+ --

13+ , Env(..)

14+ , initEnv

15+ )

16+ where

17+

18+

19+import Control.Monad (foldM)

20+import Control.Concurrent (forkIO, newEmptyMVar, putMVar, readMVar)

21+import qualified Data.Map as Map

22+import Data.Map ((!))

23+import qualified System.Directory as Dir

24+import System.FilePath ((</>))

25+

26+import qualified Deps.Registry as Registry

27+import qualified Deps.Website as Website

28+import qualified Elm.Constraint as C

29+import qualified Elm.Package as Pkg

30+import qualified Elm.Outline as Outline

31+import qualified Elm.Version as V

32+import qualified File

33+import qualified Http

34+import qualified Json.Decode as D

35+import qualified Reporting.Exit as Exit

36+import qualified Stuff

37+

38+

39+

40+-- SOLVER

41+

42+

43+newtype Solver a =

44+ Solver

45+ (

46+ forall b.

47+ State

48+ -> (State -> a -> (State -> IO b) -> IO b)

49+ -> (State -> IO b)

50+ -> (Exit.Solver -> IO b)

51+ -> IO b

52+ )

53+

54+

55+data State =

56+ State

57+ { _cache :: Stuff.PackageCache

58+ , _connection :: Connection

59+ , _registry :: Registry.Registry

60+ , _constraints :: Map.Map (Pkg.Name, V.Version) Constraints

61+ }

62+

63+

64+data Constraints =

65+ Constraints

66+ { _elm :: C.Constraint

67+ , _deps :: Map.Map Pkg.Name C.Constraint

68+ }

69+

70+

71+data Connection

72+ = Online Http.Manager

73+ | Offline

74+

75+

76+

77+-- RESULT

78+

79+

80+data Result a

81+ = Ok a

82+ | NoSolution

83+ | NoOfflineSolution

84+ | Err Exit.Solver

85+

86+

87+

88+-- VERIFY -- used by Elm.Details

89+

90+

91+data Details =

92+ Details V.Version (Map.Map Pkg.Name C.Constraint)

93+

94+

95+verify :: Stuff.PackageCache -> Connection -> Registry.Registry -> Map.Map Pkg.Name C.Constraint -> IO (Result (Map.Map Pkg.Name Details))

96+verify cache connection registry constraints =

97+ Stuff.withRegistryLock cache $

98+ case try constraints of

99+ Solver solver ->

100+ solver (State cache connection registry Map.empty)

101+ (\s a _ -> return $ Ok (Map.mapWithKey (addDeps s) a))

102+ (\_ -> return $ noSolution connection)

103+ (\e -> return $ Err e)

104+

105+

106+addDeps :: State -> Pkg.Name -> V.Version -> Details

107+addDeps (State _ _ _ constraints) name vsn =

108+ case Map.lookup (name, vsn) constraints of

109+ Just (Constraints _ deps) -> Details vsn deps

110+ Nothing -> error "compiler bug manifesting in Deps.Solver.addDeps"

111+

112+

113+noSolution :: Connection -> Result a

114+noSolution connection =

115+ case connection of

116+ Online _ -> NoSolution

117+ Offline -> NoOfflineSolution

118+

119+

120+

121+-- ADD TO APP - used in Install

122+

123+

124+data AppSolution =

125+ AppSolution

126+ { _old :: Map.Map Pkg.Name V.Version

127+ , _new :: Map.Map Pkg.Name V.Version

128+ , _app :: Outline.AppOutline

129+ }

130+

131+

132+addToApp :: Stuff.PackageCache -> Connection -> Registry.Registry -> Pkg.Name -> Outline.AppOutline -> IO (Result AppSolution)

133+addToApp cache connection registry pkg outline@(Outline.AppOutline _ _ direct indirect testDirect testIndirect) =

134+ Stuff.withRegistryLock cache $

135+ let

136+ allIndirects = Map.union indirect testIndirect

137+ allDirects = Map.union direct testDirect

138+ allDeps = Map.union allDirects allIndirects

139+

140+ attempt toConstraint deps =

141+ try (Map.insert pkg C.anything (Map.map toConstraint deps))

142+ in

143+ case

144+ oneOf

145+ ( attempt C.exactly allDeps )

146+ [ attempt C.exactly allDirects

147+ , attempt C.untilNextMinor allDirects

148+ , attempt C.untilNextMajor allDirects

149+ , attempt (\_ -> C.anything) allDirects

150+ ]

151+ of

152+ Solver solver ->

153+ solver (State cache connection registry Map.empty)

154+ (\s a _ -> return $ Ok (toApp s pkg outline allDeps a))

155+ (\_ -> return $ noSolution connection)

156+ (\e -> return $ Err e)

157+

158+

159+toApp :: State -> Pkg.Name -> Outline.AppOutline -> Map.Map Pkg.Name V.Version -> Map.Map Pkg.Name V.Version -> AppSolution

160+toApp (State _ _ _ constraints) pkg (Outline.AppOutline elm srcDirs direct _ testDirect _) old new =

161+ let

162+ d = Map.intersection new (Map.insert pkg V.one direct)

163+ i = Map.difference (getTransitive constraints new (Map.toList d) Map.empty) d

164+ td = Map.intersection new (Map.delete pkg testDirect)

165+ ti = Map.difference new (Map.unions [d,i,td])

166+ in

167+ AppSolution old new (Outline.AppOutline elm srcDirs d i td ti)

168+

169+

170+getTransitive :: Map.Map (Pkg.Name, V.Version) Constraints -> Map.Map Pkg.Name V.Version -> [(Pkg.Name,V.Version)] -> Map.Map Pkg.Name V.Version -> Map.Map Pkg.Name V.Version

171+getTransitive constraints solution unvisited visited =

172+ case unvisited of

173+ [] ->

174+ visited

175+

176+ info@(pkg,vsn) : infos ->

177+ if Map.member pkg visited

178+ then getTransitive constraints solution infos visited

179+ else

180+ let

181+ newDeps = _deps (constraints ! info)

182+ newUnvisited = Map.toList (Map.intersection solution (Map.difference newDeps visited))

183+ newVisited = Map.insert pkg vsn visited

184+ in

185+ getTransitive constraints solution infos $

186+ getTransitive constraints solution newUnvisited newVisited

187+

188+

189+

190+-- TRY

191+

192+

193+try :: Map.Map Pkg.Name C.Constraint -> Solver (Map.Map Pkg.Name V.Version)

194+try constraints =

195+ exploreGoals (Goals constraints Map.empty)

196+

197+

198+

199+-- EXPLORE GOALS

200+

201+

202+data Goals =

203+ Goals

204+ { _pending :: Map.Map Pkg.Name C.Constraint

205+ , _solved :: Map.Map Pkg.Name V.Version

206+ }

207+

208+

209+exploreGoals :: Goals -> Solver (Map.Map Pkg.Name V.Version)

210+exploreGoals (Goals pending solved) =

211+ case Map.minViewWithKey pending of

212+ Nothing ->

213+ return solved

214+

215+ Just ((name, constraint), otherPending) ->

216+ do let goals1 = Goals otherPending solved

217+ let addVsn = addVersion goals1 name

218+ (v,vs) <- getRelevantVersions name constraint

219+ goals2 <- oneOf (addVsn v) (map addVsn vs)

220+ exploreGoals goals2

221+

222+

223+addVersion :: Goals -> Pkg.Name -> V.Version -> Solver Goals

224+addVersion (Goals pending solved) name version =

225+ do (Constraints elm deps) <- getConstraints name version

226+ if C.goodElm elm

227+ then

228+ do newPending <- foldM (addConstraint solved) pending (Map.toList deps)

229+ return (Goals newPending (Map.insert name version solved))

230+ else

231+ backtrack

232+

233+

234+addConstraint :: Map.Map Pkg.Name V.Version -> Map.Map Pkg.Name C.Constraint -> (Pkg.Name, C.Constraint) -> Solver (Map.Map Pkg.Name C.Constraint)

235+addConstraint solved unsolved (name, newConstraint) =

236+ case Map.lookup name solved of

237+ Just version ->

238+ if C.satisfies newConstraint version

239+ then return unsolved

240+ else backtrack

241+

242+ Nothing ->

243+ case Map.lookup name unsolved of

244+ Nothing ->

245+ return $ Map.insert name newConstraint unsolved

246+

247+ Just oldConstraint ->

248+ case C.intersect oldConstraint newConstraint of

249+ Nothing ->

250+ backtrack

251+

252+ Just mergedConstraint ->

253+ if oldConstraint == mergedConstraint

254+ then return unsolved

255+ else return (Map.insert name mergedConstraint unsolved)

256+

257+

258+

259+-- GET RELEVANT VERSIONS

260+

261+

262+getRelevantVersions :: Pkg.Name -> C.Constraint -> Solver (V.Version, [V.Version])

263+getRelevantVersions name constraint =

264+ Solver $ \state@(State _ _ registry _) ok back _ ->

265+ case Registry.getVersions name registry of

266+ Just (Registry.KnownVersions newest previous) ->

267+ case filter (C.satisfies constraint) (newest:previous) of

268+ [] -> back state

269+ v:vs -> ok state (v,vs) back

270+

271+ Nothing ->

272+ back state

273+

274+

275+

276+-- GET CONSTRAINTS

277+

278+

279+getConstraints :: Pkg.Name -> V.Version -> Solver Constraints

280+getConstraints pkg vsn =

281+ Solver $ \state@(State cache connection registry cDict) ok back err ->

282+ do let key = (pkg, vsn)

283+ case Map.lookup key cDict of

284+ Just cs ->

285+ ok state cs back

286+

287+ Nothing ->

288+ do let toNewState cs = State cache connection registry (Map.insert key cs cDict)

289+ let home = Stuff.package cache pkg vsn

290+ let path = home </> "elm.json"

291+ outlineExists <- File.exists path

292+ if outlineExists

293+ then

294+ do bytes <- File.readUtf8 path

295+ case D.fromByteString constraintsDecoder bytes of

296+ Right cs ->

297+ case connection of

298+ Online _ ->

299+ ok (toNewState cs) cs back

300+

301+ Offline ->

302+ do srcExists <- Dir.doesDirectoryExist (Stuff.package cache pkg vsn </> "src")

303+ if srcExists

304+ then ok (toNewState cs) cs back

305+ else back state

306+

307+ Left _ ->

308+ do File.remove path

309+ err (Exit.SolverBadCacheData pkg vsn)

310+ else

311+ case connection of

312+ Offline ->

313+ back state

314+

315+ Online manager ->

316+ do let url = Website.metadata pkg vsn "elm.json"

317+ result <- Http.get manager url [] id (return . Right)

318+ case result of

319+ Left httpProblem ->

320+ err (Exit.SolverBadHttp pkg vsn httpProblem)

321+

322+ Right body ->

323+ case D.fromByteString constraintsDecoder body of

324+ Right cs ->

325+ do Dir.createDirectoryIfMissing True home

326+ File.writeUtf8 path body

327+ ok (toNewState cs) cs back

328+

329+ Left _ ->

330+ err (Exit.SolverBadHttpData pkg vsn url)

331+

332+

333+constraintsDecoder :: D.Decoder () Constraints

334+constraintsDecoder =

335+ do outline <- D.mapError (const ()) Outline.decoder

336+ case outline of

337+ Outline.Pkg (Outline.PkgOutline _ _ _ _ _ deps _ elmConstraint) ->

338+ return (Constraints elmConstraint deps)

339+

340+ Outline.App _ ->

341+ D.failure ()

342+

343+

344+

345+-- ENVIRONMENT

346+

347+

348+data Env =

349+ Env Stuff.PackageCache Http.Manager Connection Registry.Registry

350+

351+

352+initEnv :: IO (Either Exit.RegistryProblem Env)

353+initEnv =

354+ do mvar <- newEmptyMVar

355+ _ <- forkIO $ putMVar mvar =<< Http.getManager

356+ cache <- Stuff.getPackageCache

357+ Stuff.withRegistryLock cache $

358+ do maybeRegistry <- Registry.read cache

359+ manager <- readMVar mvar

360+

361+ case maybeRegistry of

362+ Nothing ->

363+ do eitherRegistry <- Registry.fetch manager cache

364+ case eitherRegistry of

365+ Right latestRegistry ->

366+ return $ Right $ Env cache manager (Online manager) latestRegistry

367+

368+ Left problem ->

369+ return $ Left $ problem

370+

371+ Just cachedRegistry ->

372+ do eitherRegistry <- Registry.update manager cache cachedRegistry

373+ case eitherRegistry of

374+ Right latestRegistry ->

375+ return $ Right $ Env cache manager (Online manager) latestRegistry

376+

377+ Left _ ->

378+ return $ Right $ Env cache manager Offline cachedRegistry

379+

380+

381+

382+-- INSTANCES

383+

384+

385+instance Functor Solver where

386+ fmap func (Solver solver) =

387+ Solver $ \state ok back err ->

388+ let

389+ okA stateA arg backA = ok stateA (func arg) backA

390+ in

391+ solver state okA back err

392+

393+

394+instance Applicative Solver where

395+ pure a =

396+ Solver $ \state ok back _ -> ok state a back

397+

398+ (<*>) (Solver solverFunc) (Solver solverArg) =

399+ Solver $ \state ok back err ->

400+ let

401+ okF stateF func backF =

402+ let

403+ okA stateA arg backA = ok stateA (func arg) backA

404+ in

405+ solverArg stateF okA backF err

406+ in

407+ solverFunc state okF back err

408+

409+

410+instance Monad Solver where

411+ return a =

412+ Solver $ \state ok back _ -> ok state a back

413+

414+ (>>=) (Solver solverA) callback =

415+ Solver $ \state ok back err ->

416+ let

417+ okA stateA a backA =

418+ case callback a of

419+ Solver solverB -> solverB stateA ok backA err

420+ in

421+ solverA state okA back err

422+

423+

424+oneOf :: Solver a -> [Solver a] -> Solver a

425+oneOf solver@(Solver solverHead) solvers =

426+ case solvers of

427+ [] ->

428+ solver

429+

430+ s:ss ->

431+ Solver $ \state0 ok back err ->

432+ let

433+ tryTail state1 =

434+ let

435+ (Solver solverTail) = oneOf s ss

436+ in

437+ solverTail state1 ok back err

438+ in

439+ solverHead state0 ok tryTail err

440+

441+

442+backtrack :: Solver a

443+backtrack =

444+ Solver $ \state _ back _ -> back state

builder/src/Deps/Website.hsnew file+26

@@ -0,0 +1,26 @@

1+module Deps.Website

2+ ( domain

3+ , route

4+ , metadata

5+ )

6+ where

7+

8+

9+import qualified Elm.Package as Pkg

10+import qualified Elm.Version as V

11+import qualified Http

12+

13+

14+domain :: String

15+domain =

16+ "https://package.elm-lang.org"

17+

18+

19+route :: String -> [(String,String)] -> String

20+route path params =

21+ Http.toUrl (domain ++ path) params

22+

23+

24+metadata :: Pkg.Name -> V.Version -> String -> String

25+metadata name version file =

26+ domain ++ "/packages/" ++ Pkg.toUrl name ++ "/" ++ V.toChars version ++ "/" ++ file

builder/src/Elm/Details.hsnew file+833

@@ -0,0 +1,833 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE BangPatterns, OverloadedStrings #-}

3+module Elm.Details

4+ ( Details(..)

5+ , BuildID

6+ , ValidOutline(..)

7+ , Local(..)

8+ , Foreign(..)

9+ , load

10+ , loadObjects

11+ , loadInterfaces

12+ , verifyInstall

13+ )

14+ where

15+

16+

17+import Control.Concurrent (forkIO)

18+import Control.Concurrent.MVar (MVar, newEmptyMVar, newMVar, putMVar, readMVar, takeMVar)

19+import Control.Monad (liftM, liftM2, liftM3)

20+import Data.Binary (Binary, get, put, getWord8, putWord8)

21+import qualified Data.Either as Either

22+import qualified Data.Map as Map

23+import qualified Data.Map.Utils as Map

24+import qualified Data.Map.Merge.Strict as Map

25+import qualified Data.Maybe as Maybe

26+import qualified Data.Name as Name

27+import qualified Data.NonEmptyList as NE

28+import qualified Data.OneOrMore as OneOrMore

29+import qualified Data.Set as Set

30+import qualified Data.Utf8 as Utf8

31+import Data.Word (Word64)

32+import qualified System.Directory as Dir

33+import System.FilePath ((</>), (<.>))

34+

35+import qualified AST.Canonical as Can

36+import qualified AST.Source as Src

37+import qualified AST.Optimized as Opt

38+import qualified BackgroundWriter as BW

39+import qualified Compile

40+import qualified Deps.Registry as Registry

41+import qualified Deps.Solver as Solver

42+import qualified Deps.Website as Website

43+import qualified Elm.Constraint as Con

44+import qualified Elm.Docs as Docs

45+import qualified Elm.Interface as I

46+import qualified Elm.Kernel as Kernel

47+import qualified Elm.ModuleName as ModuleName

48+import qualified Elm.Outline as Outline

49+import qualified Elm.Package as Pkg

50+import qualified Elm.Version as V

51+import qualified File

52+import qualified Http

53+import qualified Json.Decode as D

54+import qualified Json.Encode as E

55+import qualified Parse.Module as Parse

56+import qualified Reporting

57+import qualified Reporting.Annotation as A

58+import qualified Reporting.Exit as Exit

59+import qualified Reporting.Task as Task

60+import qualified Stuff

61+

62+

63+

64+-- DETAILS

65+

66+

67+data Details =

68+ Details

69+ { _outlineTime :: File.Time

70+ , _outline :: ValidOutline

71+ , _buildID :: BuildID

72+ , _locals :: Map.Map ModuleName.Raw Local

73+ , _foreigns :: Map.Map ModuleName.Raw Foreign

74+ , _extras :: Extras

75+ }

76+

77+

78+type BuildID = Word64

79+

80+

81+data ValidOutline

82+ = ValidApp (NE.List Outline.SrcDir)

83+ | ValidPkg Pkg.Name [ModuleName.Raw] (Map.Map Pkg.Name V.Version {- for docs in reactor -})

84+

85+

86+-- NOTE: we need two ways to detect if a file must be recompiled:

87+--

88+-- (1) _time is the modification time from the last time we compiled the file.

89+-- By checking EQUALITY with the current modification time, we can detect file

90+-- saves and `git checkout` of previous versions. Both need a recompile.

91+--

92+-- (2) _lastChange is the BuildID from the last time a new interface file was

93+-- generated, and _lastCompile is the BuildID from the last time the file was

94+-- compiled. These may be different if a file is recompiled but the interface

95+-- stayed the same. When the _lastCompile is LESS THAN the _lastChange of any

96+-- imports, we need to recompile. This can happen when a project has multiple

97+-- entrypoints and some modules are compiled less often than their imports.

98+--

99+data Local =

100+ Local

101+ { _path :: FilePath

102+ , _time :: File.Time

103+ , _deps :: [ModuleName.Raw]

104+ , _main :: Bool

105+ , _lastChange :: BuildID

106+ , _lastCompile :: BuildID

107+ }

108+

109+

110+data Foreign =

111+ Foreign Pkg.Name [Pkg.Name]

112+

113+

114+data Extras

115+ = ArtifactsCached

116+ | ArtifactsFresh Interfaces Opt.GlobalGraph

117+

118+

119+type Interfaces =

120+ Map.Map ModuleName.Canonical I.DependencyInterface

121+

122+

123+

124+-- LOAD ARTIFACTS

125+

126+

127+loadObjects :: FilePath -> Details -> IO (MVar (Maybe Opt.GlobalGraph))

128+loadObjects root (Details _ _ _ _ _ extras) =

129+ case extras of

130+ ArtifactsFresh _ o -> newMVar (Just o)

131+ ArtifactsCached -> fork (File.readBinary (Stuff.objects root))

132+

133+

134+loadInterfaces :: FilePath -> Details -> IO (MVar (Maybe Interfaces))

135+loadInterfaces root (Details _ _ _ _ _ extras) =

136+ case extras of

137+ ArtifactsFresh i _ -> newMVar (Just i)

138+ ArtifactsCached -> fork (File.readBinary (Stuff.interfaces root))

139+

140+

141+

142+-- VERIFY INSTALL -- used by Install

143+

144+

145+verifyInstall :: BW.Scope -> FilePath -> Solver.Env -> Outline.Outline -> IO (Either Exit.Details ())

146+verifyInstall scope root (Solver.Env cache manager connection registry) outline =

147+ do time <- File.getTime (root </> "elm.json")

148+ let key = Reporting.ignorer

149+ let env = Env key scope root cache manager connection registry

150+ case outline of

151+ Outline.Pkg pkg -> Task.run (verifyPkg env time pkg >> return ())

152+ Outline.App app -> Task.run (verifyApp env time app >> return ())

153+

154+

155+

156+-- LOAD -- used by Make, Repl, Reactor

157+

158+

159+load :: Reporting.Style -> BW.Scope -> FilePath -> IO (Either Exit.Details Details)

160+load style scope root =

161+ do newTime <- File.getTime (root </> "elm.json")

162+ maybeDetails <- File.readBinary (Stuff.details root)

163+ case maybeDetails of

164+ Nothing ->

165+ generate style scope root newTime

166+

167+ Just details@(Details oldTime _ buildID _ _ _) ->

168+ if oldTime == newTime

169+ then return (Right details { _buildID = buildID + 1 })

170+ else generate style scope root newTime

171+

172+

173+

174+-- GENERATE

175+

176+

177+generate :: Reporting.Style -> BW.Scope -> FilePath -> File.Time -> IO (Either Exit.Details Details)

178+generate style scope root time =

179+ Reporting.trackDetails style $ \key ->

180+ do result <- initEnv key scope root

181+ case result of

182+ Left exit ->

183+ return (Left exit)

184+

185+ Right (env, outline) ->

186+ case outline of

187+ Outline.Pkg pkg -> Task.run (verifyPkg env time pkg)

188+ Outline.App app -> Task.run (verifyApp env time app)

189+

190+

191+

192+-- ENV

193+

194+

195+data Env =

196+ Env

197+ { _key :: Reporting.DKey

198+ , _scope :: BW.Scope

199+ , _root :: FilePath

200+ , _cache :: Stuff.PackageCache

201+ , _manager :: Http.Manager

202+ , _connection :: Solver.Connection

203+ , _registry :: Registry.Registry

204+ }

205+

206+

207+initEnv :: Reporting.DKey -> BW.Scope -> FilePath -> IO (Either Exit.Details (Env, Outline.Outline))

208+initEnv key scope root =

209+ do mvar <- fork Solver.initEnv

210+ eitherOutline <- Outline.read root

211+ case eitherOutline of

212+ Left problem ->

213+ return $ Left $ Exit.DetailsBadOutline problem

214+

215+ Right outline ->

216+ do maybeEnv <- readMVar mvar

217+ case maybeEnv of

218+ Left problem ->

219+ return $ Left $ Exit.DetailsCannotGetRegistry problem

220+

221+ Right (Solver.Env cache manager connection registry) ->

222+ return $ Right (Env key scope root cache manager connection registry, outline)

223+

224+

225+

226+-- VERIFY PROJECT

227+

228+

229+type Task a = Task.Task Exit.Details a

230+

231+

232+verifyPkg :: Env -> File.Time -> Outline.PkgOutline -> Task Details

233+verifyPkg env time (Outline.PkgOutline pkg _ _ _ exposed direct testDirect elm) =

234+ if Con.goodElm elm

235+ then

236+ do solution <- verifyConstraints env =<< union noDups direct testDirect

237+ let exposedList = Outline.flattenExposed exposed

238+ let exactDeps = Map.map (\(Solver.Details v _) -> v) solution -- for pkg docs in reactor

239+ verifyDependencies env time (ValidPkg pkg exposedList exactDeps) solution direct

240+ else

241+ Task.throw $ Exit.DetailsBadElmInPkg elm

242+

243+

244+verifyApp :: Env -> File.Time -> Outline.AppOutline -> Task Details

245+verifyApp env time outline@(Outline.AppOutline elmVersion srcDirs direct _ _ _) =

246+ if elmVersion == V.compiler

247+ then

248+ do stated <- checkAppDeps outline

249+ actual <- verifyConstraints env (Map.map Con.exactly stated)

250+ if Map.size stated == Map.size actual

251+ then verifyDependencies env time (ValidApp srcDirs) actual direct

252+ else Task.throw $ Exit.DetailsHandEditedDependencies

253+ else

254+ Task.throw $ Exit.DetailsBadElmInAppOutline elmVersion

255+

256+

257+checkAppDeps :: Outline.AppOutline -> Task (Map.Map Pkg.Name V.Version)

258+checkAppDeps (Outline.AppOutline _ _ direct indirect testDirect testIndirect) =

259+ do x <- union allowEqualDups indirect testDirect

260+ y <- union noDups direct testIndirect

261+ union noDups x y

262+

263+

264+

265+-- VERIFY CONSTRAINTS

266+

267+

268+verifyConstraints :: Env -> Map.Map Pkg.Name Con.Constraint -> Task (Map.Map Pkg.Name Solver.Details)

269+verifyConstraints (Env _ _ _ cache _ connection registry) constraints =

270+ do result <- Task.io $ Solver.verify cache connection registry constraints

271+ case result of

272+ Solver.Ok details -> return details

273+ Solver.NoSolution -> Task.throw $ Exit.DetailsNoSolution

274+ Solver.NoOfflineSolution -> Task.throw $ Exit.DetailsNoOfflineSolution

275+ Solver.Err exit -> Task.throw $ Exit.DetailsSolverProblem exit

276+

277+

278+

279+-- UNION

280+

281+

282+union :: (Ord k) => (k -> v -> v -> Task v) -> Map.Map k v -> Map.Map k v -> Task (Map.Map k v)

283+union tieBreaker deps1 deps2 =

284+ Map.mergeA Map.preserveMissing Map.preserveMissing (Map.zipWithAMatched tieBreaker) deps1 deps2

285+

286+

287+noDups :: k -> v -> v -> Task v

288+noDups _ _ _ =

289+ Task.throw Exit.DetailsHandEditedDependencies

290+

291+

292+allowEqualDups :: (Eq v) => k -> v -> v -> Task v

293+allowEqualDups _ v1 v2 =

294+ if v1 == v2

295+ then return v1

296+ else Task.throw Exit.DetailsHandEditedDependencies

297+

298+

299+

300+-- FORK

301+

302+

303+fork :: IO a -> IO (MVar a)

304+fork work =

305+ do mvar <- newEmptyMVar

306+ _ <- forkIO $ putMVar mvar =<< work

307+ return mvar

308+

309+

310+

311+-- VERIFY DEPENDENCIES

312+

313+

314+verifyDependencies :: Env -> File.Time -> ValidOutline -> Map.Map Pkg.Name Solver.Details -> Map.Map Pkg.Name a -> Task Details

315+verifyDependencies env@(Env key scope root cache _ _ _) time outline solution directDeps =

316+ Task.eio id $

317+ do Reporting.report key (Reporting.DStart (Map.size solution))

318+ mvar <- newEmptyMVar

319+ mvars <- Stuff.withRegistryLock cache $

320+ Map.traverseWithKey (\k v -> fork (verifyDep env mvar solution k v)) solution

321+ putMVar mvar mvars

322+ deps <- traverse readMVar mvars

323+ case sequence deps of

324+ Left _ ->

325+ do home <- Stuff.getElmHome

326+ return $ Left $ Exit.DetailsBadDeps home $

327+ Maybe.catMaybes $ Either.lefts $ Map.elems deps

328+

329+ Right artifacts ->

330+ let

331+ objs = Map.foldr addObjects Opt.empty artifacts

332+ ifaces = Map.foldrWithKey (addInterfaces directDeps) Map.empty artifacts

333+ foreigns = Map.map (OneOrMore.destruct Foreign) $ Map.foldrWithKey gatherForeigns Map.empty $ Map.intersection artifacts directDeps

334+ details = Details time outline 0 Map.empty foreigns (ArtifactsFresh ifaces objs)

335+ in

336+ do BW.writeBinary scope (Stuff.objects root) objs

337+ BW.writeBinary scope (Stuff.interfaces root) ifaces

338+ BW.writeBinary scope (Stuff.details root) details

339+ return (Right details)

340+

341+

342+addObjects :: Artifacts -> Opt.GlobalGraph -> Opt.GlobalGraph

343+addObjects (Artifacts _ objs) graph =

344+ Opt.addGlobalGraph objs graph

345+

346+

347+addInterfaces :: Map.Map Pkg.Name a -> Pkg.Name -> Artifacts -> Interfaces -> Interfaces

348+addInterfaces directDeps pkg (Artifacts ifaces _) dependencyInterfaces =

349+ Map.union dependencyInterfaces $ Map.mapKeysMonotonic (ModuleName.Canonical pkg) $

350+ if Map.member pkg directDeps

351+ then ifaces

352+ else Map.map I.privatize ifaces

353+

354+

355+gatherForeigns :: Pkg.Name -> Artifacts -> Map.Map ModuleName.Raw (OneOrMore.OneOrMore Pkg.Name) -> Map.Map ModuleName.Raw (OneOrMore.OneOrMore Pkg.Name)

356+gatherForeigns pkg (Artifacts ifaces _) foreigns =

357+ let

358+ isPublic di =

359+ case di of

360+ I.Public _ -> Just (OneOrMore.one pkg)

361+ I.Private _ _ _ -> Nothing

362+ in

363+ Map.unionWith OneOrMore.more foreigns (Map.mapMaybe isPublic ifaces)

364+

365+

366+

367+-- VERIFY DEPENDENCY

368+

369+

370+data Artifacts =

371+ Artifacts

372+ { _ifaces :: Map.Map ModuleName.Raw I.DependencyInterface

373+ , _objects :: Opt.GlobalGraph

374+ }

375+

376+

377+type Dep =

378+ Either (Maybe Exit.DetailsBadDep) Artifacts

379+

380+

381+verifyDep :: Env -> MVar (Map.Map Pkg.Name (MVar Dep)) -> Map.Map Pkg.Name Solver.Details -> Pkg.Name -> Solver.Details -> IO Dep

382+verifyDep (Env key _ _ cache manager _ _) depsMVar solution pkg details@(Solver.Details vsn directDeps) =

383+ do let fingerprint = Map.intersectionWith (\(Solver.Details v _) _ -> v) solution directDeps

384+ exists <- Dir.doesDirectoryExist (Stuff.package cache pkg vsn </> "src")

385+ if exists

386+ then

387+ do Reporting.report key Reporting.DCached

388+ maybeCache <- File.readBinary (Stuff.package cache pkg vsn </> "artifacts.dat")

389+ case maybeCache of

390+ Nothing ->

391+ build key cache depsMVar pkg details fingerprint Set.empty

392+

393+ Just (ArtifactCache fingerprints artifacts) ->

394+ if Set.member fingerprint fingerprints

395+ then Reporting.report key Reporting.DBuilt >> return (Right artifacts)

396+ else build key cache depsMVar pkg details fingerprint fingerprints

397+ else

398+ do Reporting.report key Reporting.DRequested

399+ result <- downloadPackage cache manager pkg vsn

400+ case result of

401+ Left problem ->

402+ do Reporting.report key (Reporting.DFailed pkg vsn)

403+ return $ Left $ Just $ Exit.BD_BadDownload pkg vsn problem

404+

405+ Right () ->

406+ do Reporting.report key (Reporting.DReceived pkg vsn)

407+ build key cache depsMVar pkg details fingerprint Set.empty

408+

409+

410+

411+-- ARTIFACT CACHE

412+

413+

414+data ArtifactCache =

415+ ArtifactCache

416+ { _fingerprints :: Set.Set Fingerprint

417+ , _artifacts :: Artifacts

418+ }

419+

420+

421+type Fingerprint =

422+ Map.Map Pkg.Name V.Version

423+

424+

425+

426+-- BUILD

427+

428+

429+build :: Reporting.DKey -> Stuff.PackageCache -> MVar (Map.Map Pkg.Name (MVar Dep)) -> Pkg.Name -> Solver.Details -> Fingerprint -> Set.Set Fingerprint -> IO Dep

430+build key cache depsMVar pkg (Solver.Details vsn _) f fs =

431+ do eitherOutline <- Outline.read (Stuff.package cache pkg vsn)

432+ case eitherOutline of

433+ Left _ ->

434+ do Reporting.report key Reporting.DBroken

435+ return $ Left $ Just $ Exit.BD_BadBuild pkg vsn f

436+

437+ Right (Outline.App _) ->

438+ do Reporting.report key Reporting.DBroken

439+ return $ Left $ Just $ Exit.BD_BadBuild pkg vsn f

440+

441+ Right (Outline.Pkg (Outline.PkgOutline _ _ _ _ exposed deps _ _)) ->

442+ do allDeps <- readMVar depsMVar

443+ directDeps <- traverse readMVar (Map.intersection allDeps deps)

444+ case sequence directDeps of

445+ Left _ ->

446+ do Reporting.report key Reporting.DBroken

447+ return $ Left $ Nothing

448+

449+ Right directArtifacts ->

450+ do let src = Stuff.package cache pkg vsn </> "src"

451+ let foreignDeps = gatherForeignInterfaces directArtifacts

452+ let exposedDict = Map.fromKeys (\_ -> ()) (Outline.flattenExposed exposed)

453+ docsStatus <- getDocsStatus cache pkg vsn

454+ mvar <- newEmptyMVar

455+ mvars <- Map.traverseWithKey (const . fork . crawlModule foreignDeps mvar pkg src docsStatus) exposedDict

456+ putMVar mvar mvars

457+ mapM_ readMVar mvars

458+ maybeStatuses <- traverse readMVar =<< readMVar mvar

459+ case sequence maybeStatuses of

460+ Nothing ->

461+ do Reporting.report key Reporting.DBroken

462+ return $ Left $ Just $ Exit.BD_BadBuild pkg vsn f

463+

464+ Just statuses ->

465+ do rmvar <- newEmptyMVar

466+ rmvars <- traverse (fork . compile pkg rmvar) statuses

467+ putMVar rmvar rmvars

468+ maybeResults <- traverse readMVar rmvars

469+ case sequence maybeResults of

470+ Nothing ->

471+ do Reporting.report key Reporting.DBroken

472+ return $ Left $ Just $ Exit.BD_BadBuild pkg vsn f

473+

474+ Just results ->

475+ let

476+ path = Stuff.package cache pkg vsn </> "artifacts.dat"

477+ ifaces = gatherInterfaces exposedDict results

478+ objects = gatherObjects results

479+ artifacts = Artifacts ifaces objects

480+ fingerprints = Set.insert f fs

481+ in

482+ do writeDocs cache pkg vsn docsStatus results

483+ File.writeBinary path (ArtifactCache fingerprints artifacts)

484+ Reporting.report key Reporting.DBuilt

485+ return (Right artifacts)

486+

487+

488+

489+-- GATHER

490+

491+

492+gatherObjects :: Map.Map ModuleName.Raw Result -> Opt.GlobalGraph

493+gatherObjects results =

494+ Map.foldrWithKey addLocalGraph Opt.empty results

495+

496+

497+addLocalGraph :: ModuleName.Raw -> Result -> Opt.GlobalGraph -> Opt.GlobalGraph

498+addLocalGraph name status graph =

499+ case status of

500+ RLocal _ objs _ -> Opt.addLocalGraph objs graph

501+ RForeign _ -> graph

502+ RKernelLocal cs -> Opt.addKernel (Name.getKernel name) cs graph

503+ RKernelForeign -> graph

504+

505+

506+gatherInterfaces :: Map.Map ModuleName.Raw () -> Map.Map ModuleName.Raw Result -> Map.Map ModuleName.Raw I.DependencyInterface

507+gatherInterfaces exposed artifacts =

508+ let

509+ onLeft = Map.mapMissing (error "compiler bug manifesting in Elm.Details.gatherInterfaces")

510+ onRight = Map.mapMaybeMissing (\_ iface -> toLocalInterface I.private iface)

511+ onBoth = Map.zipWithMaybeMatched (\_ () iface -> toLocalInterface I.public iface)

512+ in

513+ Map.merge onLeft onRight onBoth exposed artifacts

514+

515+

516+toLocalInterface :: (I.Interface -> a) -> Result -> Maybe a

517+toLocalInterface func result =

518+ case result of

519+ RLocal iface _ _ -> Just (func iface)

520+ RForeign _ -> Nothing

521+ RKernelLocal _ -> Nothing

522+ RKernelForeign -> Nothing

523+

524+

525+

526+-- GATHER FOREIGN INTERFACES

527+

528+

529+data ForeignInterface

530+ = ForeignAmbiguous

531+ | ForeignSpecific I.Interface

532+

533+

534+gatherForeignInterfaces :: Map.Map Pkg.Name Artifacts -> Map.Map ModuleName.Raw ForeignInterface

535+gatherForeignInterfaces directArtifacts =

536+ Map.map (OneOrMore.destruct finalize) $

537+ Map.foldrWithKey gather Map.empty directArtifacts

538+ where

539+ finalize :: I.Interface -> [I.Interface] -> ForeignInterface

540+ finalize i is =

541+ case is of

542+ [] -> ForeignSpecific i

543+ _:_ -> ForeignAmbiguous

544+

545+ gather :: Pkg.Name -> Artifacts -> Map.Map ModuleName.Raw (OneOrMore.OneOrMore I.Interface) -> Map.Map ModuleName.Raw (OneOrMore.OneOrMore I.Interface)

546+ gather _ (Artifacts ifaces _) buckets =

547+ Map.unionWith OneOrMore.more buckets (Map.mapMaybe isPublic ifaces)

548+

549+ isPublic :: I.DependencyInterface -> Maybe (OneOrMore.OneOrMore I.Interface)

550+ isPublic di =

551+ case di of

552+ I.Public iface -> Just (OneOrMore.one iface)

553+ I.Private _ _ _ -> Nothing

554+

555+

556+

557+-- CRAWL

558+

559+

560+type StatusDict =

561+ Map.Map ModuleName.Raw (MVar (Maybe Status))

562+

563+

564+data Status

565+ = SLocal DocsStatus (Map.Map ModuleName.Raw ()) Src.Module

566+ | SForeign I.Interface

567+ | SKernelLocal [Kernel.Chunk]

568+ | SKernelForeign

569+

570+

571+crawlModule :: Map.Map ModuleName.Raw ForeignInterface -> MVar StatusDict -> Pkg.Name -> FilePath -> DocsStatus -> ModuleName.Raw -> IO (Maybe Status)

572+crawlModule foreignDeps mvar pkg src docsStatus name =

573+ do let path = src </> ModuleName.toFilePath name <.> "elm"

574+ exists <- File.exists path

575+ case Map.lookup name foreignDeps of

576+ Just ForeignAmbiguous ->

577+ return Nothing

578+

579+ Just (ForeignSpecific iface) ->

580+ if exists

581+ then return Nothing

582+ else return (Just (SForeign iface))

583+

584+ Nothing ->

585+ if exists then

586+ crawlFile foreignDeps mvar pkg src docsStatus name path

587+

588+ else if Pkg.isKernel pkg && Name.isKernel name then

589+ crawlKernel foreignDeps mvar pkg src name

590+

591+ else

592+ return Nothing

593+

594+

595+crawlFile :: Map.Map ModuleName.Raw ForeignInterface -> MVar StatusDict -> Pkg.Name -> FilePath -> DocsStatus -> ModuleName.Raw -> FilePath -> IO (Maybe Status)

596+crawlFile foreignDeps mvar pkg src docsStatus expectedName path =

597+ do bytes <- File.readUtf8 path

598+ case Parse.fromByteString (Parse.Package pkg) bytes of

599+ Right modul@(Src.Module (Just (A.At _ actualName)) _ _ imports _ _ _ _ _) | expectedName == actualName ->

600+ do deps <- crawlImports foreignDeps mvar pkg src imports

601+ return (Just (SLocal docsStatus deps modul))

602+

603+ _ ->

604+ return Nothing

605+

606+

607+crawlImports :: Map.Map ModuleName.Raw ForeignInterface -> MVar StatusDict -> Pkg.Name -> FilePath -> [Src.Import] -> IO (Map.Map ModuleName.Raw ())

608+crawlImports foreignDeps mvar pkg src imports =

609+ do statusDict <- takeMVar mvar

610+ let deps = Map.fromList (map (\i -> (Src.getImportName i, ())) imports)

611+ let news = Map.difference deps statusDict

612+ mvars <- Map.traverseWithKey (const . fork . crawlModule foreignDeps mvar pkg src DocsNotNeeded) news

613+ putMVar mvar (Map.union mvars statusDict)

614+ mapM_ readMVar mvars

615+ return deps

616+

617+

618+crawlKernel :: Map.Map ModuleName.Raw ForeignInterface -> MVar StatusDict -> Pkg.Name -> FilePath -> ModuleName.Raw -> IO (Maybe Status)

619+crawlKernel foreignDeps mvar pkg src name =

620+ do let path = src </> ModuleName.toFilePath name <.> "js"

621+ exists <- File.exists path

622+ if exists

623+ then

624+ do bytes <- File.readUtf8 path

625+ case Kernel.fromByteString pkg (Map.mapMaybe getDepHome foreignDeps) bytes of

626+ Nothing ->

627+ return Nothing

628+

629+ Just (Kernel.Content imports chunks) ->

630+ do _ <- crawlImports foreignDeps mvar pkg src imports

631+ return (Just (SKernelLocal chunks))

632+ else

633+ return (Just SKernelForeign)

634+

635+

636+getDepHome :: ForeignInterface -> Maybe Pkg.Name

637+getDepHome fi =

638+ case fi of

639+ ForeignSpecific (I.Interface pkg _ _ _ _) -> Just pkg

640+ ForeignAmbiguous -> Nothing

641+

642+

643+

644+-- COMPILE

645+

646+

647+data Result

648+ = RLocal !I.Interface !Opt.LocalGraph (Maybe Docs.Module)

649+ | RForeign I.Interface

650+ | RKernelLocal [Kernel.Chunk]

651+ | RKernelForeign

652+

653+

654+compile :: Pkg.Name -> MVar (Map.Map ModuleName.Raw (MVar (Maybe Result))) -> Status -> IO (Maybe Result)

655+compile pkg mvar status =

656+ case status of

657+ SLocal docsStatus deps modul ->

658+ do resultsDict <- readMVar mvar

659+ maybeResults <- traverse readMVar (Map.intersection resultsDict deps)

660+ case sequence maybeResults of

661+ Nothing ->

662+ return Nothing

663+

664+ Just results ->

665+ case Compile.compile pkg (Map.mapMaybe getInterface results) modul of

666+ Left _ ->

667+ return Nothing

668+

669+ Right (Compile.Artifacts canonical annotations objects) ->

670+ let

671+ ifaces = I.fromModule pkg canonical annotations

672+ docs = makeDocs docsStatus canonical

673+ in

674+ return (Just (RLocal ifaces objects docs))

675+

676+ SForeign iface ->

677+ return (Just (RForeign iface))

678+

679+ SKernelLocal chunks ->

680+ return (Just (RKernelLocal chunks))

681+

682+ SKernelForeign ->

683+ return (Just RKernelForeign)

684+

685+

686+getInterface :: Result -> Maybe I.Interface

687+getInterface result =

688+ case result of

689+ RLocal iface _ _ -> Just iface

690+ RForeign iface -> Just iface

691+ RKernelLocal _ -> Nothing

692+ RKernelForeign -> Nothing

693+

694+

695+

696+-- MAKE DOCS

697+

698+

699+data DocsStatus

700+ = DocsNeeded

701+ | DocsNotNeeded

702+

703+

704+getDocsStatus :: Stuff.PackageCache -> Pkg.Name -> V.Version -> IO DocsStatus

705+getDocsStatus cache pkg vsn =

706+ do exists <- File.exists (Stuff.package cache pkg vsn </> "docs.json")

707+ if exists

708+ then return DocsNotNeeded

709+ else return DocsNeeded

710+

711+

712+makeDocs :: DocsStatus -> Can.Module -> Maybe Docs.Module

713+makeDocs status modul =

714+ case status of

715+ DocsNeeded ->

716+ case Docs.fromModule modul of

717+ Right docs -> Just docs

718+ Left _ -> Nothing

719+

720+ DocsNotNeeded ->

721+ Nothing

722+

723+

724+writeDocs :: Stuff.PackageCache -> Pkg.Name -> V.Version -> DocsStatus -> Map.Map ModuleName.Raw Result -> IO ()

725+writeDocs cache pkg vsn status results =

726+ case status of

727+ DocsNeeded ->

728+ E.writeUgly (Stuff.package cache pkg vsn </> "docs.json") $

729+ Docs.encode $ Map.mapMaybe toDocs results

730+

731+ DocsNotNeeded ->

732+ return ()

733+

734+

735+toDocs :: Result -> Maybe Docs.Module

736+toDocs result =

737+ case result of

738+ RLocal _ _ docs -> docs

739+ RForeign _ -> Nothing

740+ RKernelLocal _ -> Nothing

741+ RKernelForeign -> Nothing

742+

743+

744+

745+-- DOWNLOAD PACKAGE

746+

747+

748+downloadPackage :: Stuff.PackageCache -> Http.Manager -> Pkg.Name -> V.Version -> IO (Either Exit.PackageProblem ())

749+downloadPackage cache manager pkg vsn =

750+ let

751+ url = Website.metadata pkg vsn "endpoint.json"

752+ in

753+ do eitherByteString <-

754+ Http.get manager url [] id (return . Right)

755+

756+ case eitherByteString of

757+ Left err ->

758+ return $ Left $ Exit.PP_BadEndpointRequest err

759+

760+ Right byteString ->

761+ case D.fromByteString endpointDecoder byteString of

762+ Left _ ->

763+ return $ Left $ Exit.PP_BadEndpointContent url

764+

765+ Right (endpoint, expectedHash) ->

766+ Http.getArchive manager endpoint Exit.PP_BadArchiveRequest (Exit.PP_BadArchiveContent endpoint) $

767+ \(sha, archive) ->

768+ if expectedHash == Http.shaToChars sha

769+ then Right <$> File.writePackage (Stuff.package cache pkg vsn) archive

770+ else return $ Left $ Exit.PP_BadArchiveHash endpoint expectedHash (Http.shaToChars sha)

771+

772+

773+endpointDecoder :: D.Decoder e (String, String)

774+endpointDecoder =

775+ do url <- D.field "url" D.string

776+ hash <- D.field "hash" D.string

777+ return (Utf8.toChars url, Utf8.toChars hash)

778+

779+

780+

781+-- BINARY

782+

783+

784+instance Binary Details where

785+ put (Details a b c d e _) = put a >> put b >> put c >> put d >> put e

786+ get =

787+ do a <- get

788+ b <- get

789+ c <- get

790+ d <- get

791+ e <- get

792+ return (Details a b c d e ArtifactsCached)

793+

794+

795+instance Binary ValidOutline where

796+ put outline =

797+ case outline of

798+ ValidApp a -> putWord8 0 >> put a

799+ ValidPkg a b c -> putWord8 1 >> put a >> put b >> put c

800+

801+ get =

802+ do n <- getWord8

803+ case n of

804+ 0 -> liftM ValidApp get

805+ 1 -> liftM3 ValidPkg get get get

806+ _ -> fail "binary encoding of ValidOutline was corrupted"

807+

808+

809+instance Binary Local where

810+ put (Local a b c d e f) = put a >> put b >> put c >> put d >> put e >> put f

811+ get =

812+ do a <- get

813+ b <- get

814+ c <- get

815+ d <- get

816+ e <- get

817+ f <- get

818+ return (Local a b c d e f)

819+

820+

821+instance Binary Foreign where

822+ get = liftM2 Foreign get get

823+ put (Foreign a b) = put a >> put b

824+

825+

826+instance Binary Artifacts where

827+ get = liftM2 Artifacts get get

828+ put (Artifacts a b) = put a >> put b

829+

830+

831+instance Binary ArtifactCache where

832+ get = liftM2 ArtifactCache get get

833+ put (ArtifactCache a b) = put a >> put b

builder/src/Elm/Outline.hsnew file+407

@@ -0,0 +1,407 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE MultiWayIf, OverloadedStrings #-}

3+module Elm.Outline

4+ ( Outline(..)

5+ , AppOutline(..)

6+ , PkgOutline(..)

7+ , Exposed(..)

8+ , SrcDir(..)

9+ , read

10+ , write

11+ , encode

12+ , decoder

13+ , defaultSummary

14+ , flattenExposed

15+ )

16+ where

17+

18+

19+import Prelude hiding (read)

20+import Control.Monad (filterM, liftM)

21+import Data.Binary (Binary, get, put, getWord8, putWord8)

22+import qualified Data.Map as Map

23+import qualified Data.NonEmptyList as NE

24+import qualified Data.OneOrMore as OneOrMore

25+import Foreign.Ptr (minusPtr)

26+import qualified System.Directory as Dir

27+import qualified System.FilePath as FP

28+import System.FilePath ((</>))

29+

30+import qualified Elm.Constraint as Con

31+import qualified Elm.Licenses as Licenses

32+import qualified Elm.ModuleName as ModuleName

33+import qualified Elm.Package as Pkg

34+import qualified Elm.Version as V

35+import qualified File

36+import qualified Json.Decode as D

37+import qualified Json.Encode as E

38+import Json.Encode ((==>))

39+import qualified Json.String as Json

40+import qualified Parse.Primitives as P

41+import qualified Reporting.Exit as Exit

42+

43+

44+

45+-- OUTLINE

46+

47+

48+data Outline

49+ = App AppOutline

50+ | Pkg PkgOutline

51+

52+

53+data AppOutline =

54+ AppOutline

55+ { _app_elm_version :: V.Version

56+ , _app_source_dirs :: NE.List SrcDir

57+ , _app_deps_direct :: Map.Map Pkg.Name V.Version

58+ , _app_deps_indirect :: Map.Map Pkg.Name V.Version

59+ , _app_test_direct :: Map.Map Pkg.Name V.Version

60+ , _app_test_indirect :: Map.Map Pkg.Name V.Version

61+ }

62+

63+

64+data PkgOutline =

65+ PkgOutline

66+ { _pkg_name :: Pkg.Name

67+ , _pkg_summary :: Json.String

68+ , _pkg_license :: Licenses.License

69+ , _pkg_version :: V.Version

70+ , _pkg_exposed :: Exposed

71+ , _pkg_deps :: Map.Map Pkg.Name Con.Constraint

72+ , _pkg_test_deps :: Map.Map Pkg.Name Con.Constraint

73+ , _pkg_elm_version :: Con.Constraint

74+ }

75+

76+

77+data Exposed

78+ = ExposedList [ModuleName.Raw]

79+ | ExposedDict [(Json.String, [ModuleName.Raw])]

80+

81+

82+data SrcDir

83+ = AbsoluteSrcDir FilePath

84+ | RelativeSrcDir FilePath

85+

86+

87+

88+-- DEFAULTS

89+

90+

91+defaultSummary :: Json.String

92+defaultSummary =

93+ Json.fromChars "helpful summary of your project, less than 80 characters"

94+

95+

96+

97+-- HELPERS

98+

99+

100+flattenExposed :: Exposed -> [ModuleName.Raw]

101+flattenExposed exposed =

102+ case exposed of

103+ ExposedList names ->

104+ names

105+

106+ ExposedDict sections ->

107+ concatMap snd sections

108+

109+

110+

111+-- WRITE

112+

113+

114+write :: FilePath -> Outline -> IO ()

115+write root outline =

116+ E.write (root </> "elm.json") (encode outline)

117+

118+

119+

120+-- JSON ENCODE

121+

122+

123+encode :: Outline -> E.Value

124+encode outline =

125+ case outline of

126+ App (AppOutline elm srcDirs depsDirect depsTrans testDirect testTrans) ->

127+ E.object

128+ [ "type" ==> E.chars "application"

129+ , "source-directories" ==> E.list encodeSrcDir (NE.toList srcDirs)

130+ , "elm-version" ==> V.encode elm

131+ , "dependencies" ==>

132+ E.object

133+ [ "direct" ==> encodeDeps V.encode depsDirect

134+ , "indirect" ==> encodeDeps V.encode depsTrans

135+ ]

136+ , "test-dependencies" ==>

137+ E.object

138+ [ "direct" ==> encodeDeps V.encode testDirect

139+ , "indirect" ==> encodeDeps V.encode testTrans

140+ ]

141+ ]

142+

143+ Pkg (PkgOutline name summary license version exposed deps tests elm) ->

144+ E.object

145+ [ "type" ==> E.string (Json.fromChars "package")

146+ , "name" ==> Pkg.encode name

147+ , "summary" ==> E.string summary

148+ , "license" ==> Licenses.encode license

149+ , "version" ==> V.encode version

150+ , "exposed-modules" ==> encodeExposed exposed

151+ , "elm-version" ==> Con.encode elm

152+ , "dependencies" ==> encodeDeps Con.encode deps

153+ , "test-dependencies" ==> encodeDeps Con.encode tests

154+ ]

155+

156+

157+encodeExposed :: Exposed -> E.Value

158+encodeExposed exposed =

159+ case exposed of

160+ ExposedList modules ->

161+ E.list encodeModule modules

162+

163+ ExposedDict chunks ->

164+ E.object (map (fmap (E.list encodeModule)) chunks)

165+

166+

167+encodeModule :: ModuleName.Raw -> E.Value

168+encodeModule name =

169+ E.name name

170+

171+

172+encodeDeps :: (a -> E.Value) -> Map.Map Pkg.Name a -> E.Value

173+encodeDeps encodeValue deps =

174+ E.dict Pkg.toJsonString encodeValue deps

175+

176+

177+encodeSrcDir :: SrcDir -> E.Value

178+encodeSrcDir srcDir =

179+ case srcDir of

180+ AbsoluteSrcDir dir -> E.chars dir

181+ RelativeSrcDir dir -> E.chars dir

182+

183+

184+

185+-- PARSE AND VERIFY

186+

187+

188+read :: FilePath -> IO (Either Exit.Outline Outline)

189+read root =

190+ do bytes <- File.readUtf8 (root </> "elm.json")

191+ case D.fromByteString decoder bytes of

192+ Left err ->

193+ return $ Left (Exit.OutlineHasBadStructure err)

194+

195+ Right outline ->

196+ case outline of

197+ Pkg (PkgOutline pkg _ _ _ _ deps _ _) ->

198+ return $

199+ if Map.notMember Pkg.core deps && pkg /= Pkg.core

200+ then Left Exit.OutlineNoPkgCore

201+ else Right outline

202+

203+ App (AppOutline _ srcDirs direct indirect _ _)

204+ | Map.notMember Pkg.core direct ->

205+ return $ Left Exit.OutlineNoAppCore

206+

207+ | Map.notMember Pkg.json direct && Map.notMember Pkg.json indirect ->

208+ return $ Left Exit.OutlineNoAppJson

209+

210+ | otherwise ->

211+ do badDirs <- filterM (isSrcDirMissing root) (NE.toList srcDirs)

212+ case map toGiven badDirs of

213+ d:ds ->

214+ return $ Left (Exit.OutlineHasMissingSrcDirs d ds)

215+

216+ [] ->

217+ do maybeDups <- detectDuplicates root (NE.toList srcDirs)

218+ case maybeDups of

219+ Nothing ->

220+ return $ Right outline

221+

222+ Just (canonicalDir, (dir1,dir2)) ->

223+ return $ Left (Exit.OutlineHasDuplicateSrcDirs canonicalDir dir1 dir2)

224+

225+

226+isSrcDirMissing :: FilePath -> SrcDir -> IO Bool

227+isSrcDirMissing root srcDir =

228+ not <$> Dir.doesDirectoryExist (toAbsolute root srcDir)

229+

230+

231+toGiven :: SrcDir -> FilePath

232+toGiven srcDir =

233+ case srcDir of

234+ AbsoluteSrcDir dir -> dir

235+ RelativeSrcDir dir -> dir

236+

237+

238+toAbsolute :: FilePath -> SrcDir -> FilePath

239+toAbsolute root srcDir =

240+ case srcDir of

241+ AbsoluteSrcDir dir -> dir

242+ RelativeSrcDir dir -> root </> dir

243+

244+

245+detectDuplicates :: FilePath -> [SrcDir] -> IO (Maybe (FilePath, (FilePath, FilePath)))

246+detectDuplicates root srcDirs =

247+ do pairs <- traverse (toPair root) srcDirs

248+ return $ Map.lookupMin $ Map.mapMaybe isDup $

249+ Map.fromListWith OneOrMore.more pairs

250+

251+

252+toPair :: FilePath -> SrcDir -> IO (FilePath, OneOrMore.OneOrMore FilePath)

253+toPair root srcDir =

254+ do key <- Dir.canonicalizePath (toAbsolute root srcDir)

255+ return (key, OneOrMore.one (toGiven srcDir))

256+

257+

258+isDup :: OneOrMore.OneOrMore FilePath -> Maybe (FilePath, FilePath)

259+isDup paths =

260+ case paths of

261+ OneOrMore.One _ -> Nothing

262+ OneOrMore.More a b -> Just (OneOrMore.getFirstTwo a b)

263+

264+

265+

266+-- JSON DECODE

267+

268+

269+type Decoder a =

270+ D.Decoder Exit.OutlineProblem a

271+

272+

273+decoder :: Decoder Outline

274+decoder =

275+ let

276+ application = Json.fromChars "application"

277+ package = Json.fromChars "package"

278+ in

279+ do tipe <- D.field "type" D.string

280+ if | tipe == application -> App <$> appDecoder

281+ | tipe == package -> Pkg <$> pkgDecoder

282+ | otherwise -> D.failure Exit.OP_BadType

283+

284+

285+appDecoder :: Decoder AppOutline

286+appDecoder =

287+ AppOutline

288+ <$> D.field "elm-version" versionDecoder

289+ <*> D.field "source-directories" dirsDecoder

290+ <*> D.field "dependencies" (D.field "direct" (depsDecoder versionDecoder))

291+ <*> D.field "dependencies" (D.field "indirect" (depsDecoder versionDecoder))

292+ <*> D.field "test-dependencies" (D.field "direct" (depsDecoder versionDecoder))

293+ <*> D.field "test-dependencies" (D.field "indirect" (depsDecoder versionDecoder))

294+

295+

296+pkgDecoder :: Decoder PkgOutline

297+pkgDecoder =

298+ PkgOutline

299+ <$> D.field "name" nameDecoder

300+ <*> D.field "summary" summaryDecoder

301+ <*> D.field "license" (Licenses.decoder Exit.OP_BadLicense)

302+ <*> D.field "version" versionDecoder

303+ <*> D.field "exposed-modules" exposedDecoder

304+ <*> D.field "dependencies" (depsDecoder constraintDecoder)

305+ <*> D.field "test-dependencies" (depsDecoder constraintDecoder)

306+ <*> D.field "elm-version" constraintDecoder

307+

308+

309+

310+-- JSON DECODE HELPERS

311+

312+

313+nameDecoder :: Decoder Pkg.Name

314+nameDecoder =

315+ D.mapError (uncurry Exit.OP_BadPkgName) Pkg.decoder

316+

317+

318+summaryDecoder :: Decoder Json.String

319+summaryDecoder =

320+ D.customString

321+ (boundParser 80 Exit.OP_BadSummaryTooLong)

322+ (\_ _ -> Exit.OP_BadSummaryTooLong)

323+

324+

325+versionDecoder :: Decoder V.Version

326+versionDecoder =

327+ D.mapError (uncurry Exit.OP_BadVersion) V.decoder

328+

329+

330+constraintDecoder :: Decoder Con.Constraint

331+constraintDecoder =

332+ D.mapError Exit.OP_BadConstraint Con.decoder

333+

334+

335+depsDecoder :: Decoder a -> Decoder (Map.Map Pkg.Name a)

336+depsDecoder valueDecoder =

337+ D.dict (Pkg.keyDecoder Exit.OP_BadDependencyName) valueDecoder

338+

339+

340+dirsDecoder :: Decoder (NE.List SrcDir)

341+dirsDecoder =

342+ fmap (toSrcDir . Json.toChars) <$> D.nonEmptyList D.string Exit.OP_NoSrcDirs

343+

344+

345+toSrcDir :: FilePath -> SrcDir

346+toSrcDir path =

347+ if FP.isRelative path

348+ then RelativeSrcDir path

349+ else AbsoluteSrcDir path

350+

351+

352+

353+-- EXPOSED MODULES DECODER

354+

355+

356+exposedDecoder :: Decoder Exposed

357+exposedDecoder =

358+ D.oneOf

359+ [ ExposedList <$> D.list moduleDecoder

360+ , ExposedDict <$> D.pairs headerKeyDecoder (D.list moduleDecoder)

361+ ]

362+

363+

364+moduleDecoder :: Decoder ModuleName.Raw

365+moduleDecoder =

366+ D.mapError (uncurry Exit.OP_BadModuleName) ModuleName.decoder

367+

368+

369+headerKeyDecoder :: D.KeyDecoder Exit.OutlineProblem Json.String

370+headerKeyDecoder =

371+ D.KeyDecoder

372+ (boundParser 20 Exit.OP_BadModuleHeaderTooLong)

373+ (\_ _ -> Exit.OP_BadModuleHeaderTooLong)

374+

375+

376+

377+-- BOUND PARSER

378+

379+

380+boundParser :: Int -> x -> P.Parser x Json.String

381+boundParser bound tooLong =

382+ P.Parser $ \(P.State src pos end indent row col) cok _ cerr _ ->

383+ let

384+ len = minusPtr end pos

385+ newCol = col + fromIntegral len

386+ in

387+ if len < bound

388+ then cok (Json.fromPtr pos end) (P.State src end end indent row newCol)

389+ else cerr row newCol (\_ _ -> tooLong)

390+

391+

392+

393+-- BINARY

394+

395+

396+instance Binary SrcDir where

397+ put outline =

398+ case outline of

399+ AbsoluteSrcDir a -> putWord8 0 >> put a

400+ RelativeSrcDir a -> putWord8 1 >> put a

401+

402+ get =

403+ do n <- getWord8

404+ case n of

405+ 0 -> liftM AbsoluteSrcDir get

406+ 1 -> liftM RelativeSrcDir get

407+ _ -> fail "binary encoding of SrcDir was corrupted"

builder/src/File.hsnew file+231

@@ -0,0 +1,231 @@

1+module File

2+ ( Time

3+ , getTime

4+ , zeroTime

5+ , writeBinary

6+ , readBinary

7+ , writeUtf8

8+ , readUtf8

9+ , writeBuilder

10+ , writePackage

11+ , exists

12+ , remove

13+ , removeDir

14+ )

15+ where

16+

17+

18+import qualified Codec.Archive.Zip as Zip

19+import Control.Exception (catch)

20+import qualified Data.Binary as Binary

21+import qualified Data.ByteString as BS

22+import qualified Data.ByteString.Internal as BS

23+import qualified Data.ByteString.Builder as B

24+import qualified Data.ByteString.Lazy as LBS

25+import qualified Data.Fixed as Fixed

26+import qualified Data.List as List

27+import qualified Data.Time.Clock as Time

28+import qualified Data.Time.Clock.POSIX as Time

29+import qualified Foreign.ForeignPtr as FPtr

30+import GHC.IO.Exception (IOException, IOErrorType(InvalidArgument))

31+import qualified System.Directory as Dir

32+import qualified System.FilePath as FP

33+import System.FilePath ((</>))

34+import qualified System.IO as IO

35+import System.IO.Error (ioeGetErrorType, annotateIOError, modifyIOError)

36+

37+

38+

39+-- TIME

40+

41+

42+newtype Time = Time Fixed.Pico

43+ deriving (Eq, Ord)

44+

45+

46+getTime :: FilePath -> IO Time

47+getTime path =

48+ fmap

49+ (Time . Time.nominalDiffTimeToSeconds . Time.utcTimeToPOSIXSeconds)

50+ (Dir.getModificationTime path)

51+

52+

53+zeroTime :: Time

54+zeroTime =

55+ Time 0

56+

57+

58+instance Binary.Binary Time where

59+ put (Time time) = Binary.put time

60+ get = Time <$> Binary.get

61+

62+

63+

64+-- BINARY

65+

66+

67+writeBinary :: (Binary.Binary a) => FilePath -> a -> IO ()

68+writeBinary path value =

69+ do let dir = FP.dropFileName path

70+ Dir.createDirectoryIfMissing True dir

71+ Binary.encodeFile path value

72+

73+

74+readBinary :: (Binary.Binary a) => FilePath -> IO (Maybe a)

75+readBinary path =

76+ do pathExists <- Dir.doesFileExist path

77+ if pathExists

78+ then

79+ do result <- Binary.decodeFileOrFail path

80+ case result of

81+ Right a ->

82+ return (Just a)

83+

84+ Left (offset, message) ->

85+ do IO.hPutStrLn IO.stderr $ unlines $

86+ [ "+-------------------------------------------------------------------------------"

87+ , "| Corrupt File: " ++ path

88+ , "| Byte Offset: " ++ show offset

89+ , "| Message: " ++ message

90+ , "|"

91+ , "| Please report this to https://github.com/elm/compiler/issues"

92+ , "| Trying to continue anyway."

93+ , "+-------------------------------------------------------------------------------"

94+ ]

95+ return Nothing

96+ else

97+ return Nothing

98+

99+

100+

101+-- WRITE UTF-8

102+

103+

104+writeUtf8 :: FilePath -> BS.ByteString -> IO ()

105+writeUtf8 path content =

106+ withUtf8 path IO.WriteMode $ \handle ->

107+ BS.hPut handle content

108+

109+

110+withUtf8 :: FilePath -> IO.IOMode -> (IO.Handle -> IO a) -> IO a

111+withUtf8 path mode callback =

112+ IO.withFile path mode $ \handle ->

113+ do IO.hSetEncoding handle IO.utf8

114+ callback handle

115+

116+

117+

118+-- READ UTF-8

119+

120+

121+readUtf8 :: FilePath -> IO BS.ByteString

122+readUtf8 path =

123+ withUtf8 path IO.ReadMode $ \handle ->

124+ modifyIOError (encodingError path) $

125+ do fileSize <- catch (IO.hFileSize handle) useZeroIfNotRegularFile

126+ let readSize = max 0 (fromIntegral fileSize) + 1

127+ hGetContentsSizeHint handle readSize (max 255 readSize)

128+

129+

130+useZeroIfNotRegularFile :: IOException -> IO Integer

131+useZeroIfNotRegularFile _ =

132+ return 0

133+

134+

135+hGetContentsSizeHint :: IO.Handle -> Int -> Int -> IO BS.ByteString

136+hGetContentsSizeHint handle =

137+ readChunks []

138+ where

139+ readChunks chunks readSize incrementSize =

140+ do fp <- BS.mallocByteString readSize

141+ readCount <- FPtr.withForeignPtr fp $ \buf -> IO.hGetBuf handle buf readSize

142+ let chunk = BS.PS fp 0 readCount

143+ if readCount < readSize && readSize > 0

144+ then return $! BS.concat (reverse (chunk:chunks))

145+ else readChunks (chunk:chunks) incrementSize (min 32752 (readSize + incrementSize))

146+

147+

148+encodingError :: FilePath -> IOError -> IOError

149+encodingError path ioErr =

150+ case ioeGetErrorType ioErr of

151+ InvalidArgument ->

152+ annotateIOError

153+ (userError "Bad encoding; the file must be valid UTF-8")

154+ ""

155+ Nothing

156+ (Just path)

157+

158+ _ ->

159+ ioErr

160+

161+

162+

163+-- WRITE BUILDER

164+

165+

166+writeBuilder :: FilePath -> B.Builder -> IO ()

167+writeBuilder path builder =

168+ IO.withBinaryFile path IO.WriteMode $ \handle ->

169+ do IO.hSetBuffering handle (IO.BlockBuffering Nothing)

170+ B.hPutBuilder handle builder

171+

172+

173+

174+-- WRITE PACKAGE

175+

176+

177+writePackage :: FilePath -> Zip.Archive -> IO ()

178+writePackage destination archive =

179+ case Zip.zEntries archive of

180+ [] ->

181+ return ()

182+

183+ entry:entries ->

184+ do let root = length (Zip.eRelativePath entry)

185+ mapM_ (writeEntry destination root) entries

186+

187+

188+writeEntry :: FilePath -> Int -> Zip.Entry -> IO ()

189+writeEntry destination root entry =

190+ let

191+ path = drop root (Zip.eRelativePath entry)

192+ in

193+ if List.isPrefixOf "src/" path

194+ || path == "LICENSE"

195+ || path == "README.md"

196+ || path == "elm.json"

197+ then

198+ if not (null path) && last path == '/'

199+ then Dir.createDirectoryIfMissing True (destination </> path)

200+ else LBS.writeFile (destination </> path) (Zip.fromEntry entry)

201+ else

202+ return ()

203+

204+

205+

206+-- EXISTS

207+

208+

209+exists :: FilePath -> IO Bool

210+exists path =

211+ Dir.doesFileExist path

212+

213+

214+

215+-- REMOVE FILES

216+

217+

218+remove :: FilePath -> IO ()

219+remove path =

220+ do exists_ <- Dir.doesFileExist path

221+ if exists_

222+ then Dir.removeFile path

223+ else return ()

224+

225+

226+removeDir :: FilePath -> IO ()

227+removeDir path =

228+ do exists_ <- Dir.doesDirectoryExist path

229+ if exists_

230+ then Dir.removeDirectoryRecursive path

231+ else return ()

builder/src/Generate.hsnew file+211

@@ -0,0 +1,211 @@

1+{-# LANGUAGE BangPatterns #-}

2+module Generate

3+ ( debug

4+ , dev

5+ , prod

6+ , repl

7+ )

8+ where

9+

10+

11+import Prelude hiding (cycle, print)

12+import Control.Concurrent (MVar, forkIO, newEmptyMVar, newMVar, putMVar, readMVar)

13+import Control.Monad (liftM2)

14+import qualified Data.ByteString.Builder as B

15+import Data.Map ((!))

16+import qualified Data.Map as Map

17+import qualified Data.Maybe as Maybe

18+import qualified Data.Name as N

19+import qualified Data.NonEmptyList as NE

20+

21+import qualified AST.Optimized as Opt

22+import qualified Build

23+import qualified Elm.Compiler.Type.Extract as Extract

24+import qualified Elm.Details as Details

25+import qualified Elm.Interface as I

26+import qualified Elm.ModuleName as ModuleName

27+import qualified Elm.Package as Pkg

28+import qualified File

29+import qualified Generate.JavaScript as JS

30+import qualified Generate.Mode as Mode

31+import qualified Nitpick.Debug as Nitpick

32+import qualified Reporting.Exit as Exit

33+import qualified Reporting.Task as Task

34+import qualified Stuff

35+

36+

37+-- NOTE: This is used by Make, Repl, and Reactor right now. But it may be

38+-- desireable to have Repl and Reactor to keep foreign objects in memory

39+-- to make things a bit faster?

40+

41+

42+

43+-- GENERATORS

44+

45+

46+type Task a =

47+ Task.Task Exit.Generate a

48+

49+

50+debug :: FilePath -> Details.Details -> Build.Artifacts -> Task B.Builder

51+debug root details (Build.Artifacts pkg ifaces roots modules) =

52+ do loading <- loadObjects root details modules

53+ types <- loadTypes root ifaces modules

54+ objects <- finalizeObjects loading

55+ let mode = Mode.Dev (Just types)

56+ let graph = objectsToGlobalGraph objects

57+ let mains = gatherMains pkg objects roots

58+ return $ JS.generate mode graph mains

59+

60+

61+dev :: FilePath -> Details.Details -> Build.Artifacts -> Task B.Builder

62+dev root details (Build.Artifacts pkg _ roots modules) =

63+ do objects <- finalizeObjects =<< loadObjects root details modules

64+ let mode = Mode.Dev Nothing

65+ let graph = objectsToGlobalGraph objects

66+ let mains = gatherMains pkg objects roots

67+ return $ JS.generate mode graph mains

68+

69+

70+prod :: FilePath -> Details.Details -> Build.Artifacts -> Task B.Builder

71+prod root details (Build.Artifacts pkg _ roots modules) =

72+ do objects <- finalizeObjects =<< loadObjects root details modules

73+ checkForDebugUses objects

74+ let graph = objectsToGlobalGraph objects

75+ let mode = Mode.Prod (Mode.shortenFieldNames graph)

76+ let mains = gatherMains pkg objects roots

77+ return $ JS.generate mode graph mains

78+

79+

80+repl :: FilePath -> Details.Details -> Bool -> Build.ReplArtifacts -> N.Name -> Task B.Builder

81+repl root details ansi (Build.ReplArtifacts home modules localizer annotations) name =

82+ do objects <- finalizeObjects =<< loadObjects root details modules

83+ let graph = objectsToGlobalGraph objects

84+ return $ JS.generateForRepl ansi localizer graph home name (annotations ! name)

85+

86+

87+

88+-- CHECK FOR DEBUG

89+

90+

91+checkForDebugUses :: Objects -> Task ()

92+checkForDebugUses (Objects _ locals) =

93+ case Map.keys (Map.filter Nitpick.hasDebugUses locals) of

94+ [] -> return ()

95+ m:ms -> Task.throw (Exit.GenerateCannotOptimizeDebugValues m ms)

96+

97+

98+

99+-- GATHER MAINS

100+

101+

102+gatherMains :: Pkg.Name -> Objects -> NE.List Build.Root -> Map.Map ModuleName.Canonical Opt.Main

103+gatherMains pkg (Objects _ locals) roots =

104+ Map.fromList $ Maybe.mapMaybe (lookupMain pkg locals) (NE.toList roots)

105+

106+

107+lookupMain :: Pkg.Name -> Map.Map ModuleName.Raw Opt.LocalGraph -> Build.Root -> Maybe (ModuleName.Canonical, Opt.Main)

108+lookupMain pkg locals root =

109+ let

110+ toPair name (Opt.LocalGraph maybeMain _ _) =

111+ (,) (ModuleName.Canonical pkg name) <$> maybeMain

112+ in

113+ case root of

114+ Build.Inside name -> toPair name =<< Map.lookup name locals

115+ Build.Outside name _ g -> toPair name g

116+

117+

118+

119+-- LOADING OBJECTS

120+

121+

122+data LoadingObjects =

123+ LoadingObjects

124+ { _foreign_mvar :: MVar (Maybe Opt.GlobalGraph)

125+ , _local_mvars :: Map.Map ModuleName.Raw (MVar (Maybe Opt.LocalGraph))

126+ }

127+

128+

129+loadObjects :: FilePath -> Details.Details -> [Build.Module] -> Task LoadingObjects

130+loadObjects root details modules =

131+ Task.io $

132+ do mvar <- Details.loadObjects root details

133+ mvars <- traverse (loadObject root) modules

134+ return $ LoadingObjects mvar (Map.fromList mvars)

135+

136+

137+loadObject :: FilePath -> Build.Module -> IO (ModuleName.Raw, MVar (Maybe Opt.LocalGraph))

138+loadObject root modul =

139+ case modul of

140+ Build.Fresh name _ graph ->

141+ do mvar <- newMVar (Just graph)

142+ return (name, mvar)

143+

144+ Build.Cached name _ _ ->

145+ do mvar <- newEmptyMVar

146+ _ <- forkIO $ putMVar mvar =<< File.readBinary (Stuff.elmo root name)

147+ return (name, mvar)

148+

149+

150+

151+-- FINALIZE OBJECTS

152+

153+

154+data Objects =

155+ Objects

156+ { _foreign :: Opt.GlobalGraph

157+ , _locals :: Map.Map ModuleName.Raw Opt.LocalGraph

158+ }

159+

160+

161+finalizeObjects :: LoadingObjects -> Task Objects

162+finalizeObjects (LoadingObjects mvar mvars) =

163+ Task.eio id $

164+ do result <- readMVar mvar

165+ results <- traverse readMVar mvars

166+ case liftM2 Objects result (sequence results) of

167+ Just loaded -> return (Right loaded)

168+ Nothing -> return (Left Exit.GenerateCannotLoadArtifacts)

169+

170+

171+objectsToGlobalGraph :: Objects -> Opt.GlobalGraph

172+objectsToGlobalGraph (Objects globals locals) =

173+ foldr Opt.addLocalGraph globals locals

174+

175+

176+

177+-- LOAD TYPES

178+

179+

180+loadTypes :: FilePath -> Map.Map ModuleName.Canonical I.DependencyInterface -> [Build.Module] -> Task Extract.Types

181+loadTypes root ifaces modules =

182+ Task.eio id $

183+ do mvars <- traverse (loadTypesHelp root) modules

184+ let !foreigns = Extract.mergeMany (Map.elems (Map.mapWithKey Extract.fromDependencyInterface ifaces))

185+ results <- traverse readMVar mvars

186+ case sequence results of

187+ Just ts -> return (Right (Extract.merge foreigns (Extract.mergeMany ts)))

188+ Nothing -> return (Left Exit.GenerateCannotLoadArtifacts)

189+

190+

191+loadTypesHelp :: FilePath -> Build.Module -> IO (MVar (Maybe Extract.Types))

192+loadTypesHelp root modul =

193+ case modul of

194+ Build.Fresh name iface _ ->

195+ newMVar (Just (Extract.fromInterface name iface))

196+

197+ Build.Cached name _ ciMVar ->

198+ do cachedInterface <- readMVar ciMVar

199+ case cachedInterface of

200+ Build.Unneeded ->

201+ do mvar <- newEmptyMVar

202+ _ <- forkIO $

203+ do maybeIface <- File.readBinary (Stuff.elmi root name)

204+ putMVar mvar (Extract.fromInterface name <$> maybeIface)

205+ return mvar

206+

207+ Build.Loaded iface ->

208+ newMVar (Just (Extract.fromInterface name iface))

209+

210+ Build.Corrupted ->

211+ newMVar Nothing

builder/src/Http.hsnew file+244

@@ -0,0 +1,244 @@

1+{-# LANGUAGE OverloadedStrings #-}

2+module Http

3+ ( Manager

4+ , getManager

5+ , toUrl

6+ -- fetch

7+ , get

8+ , post

9+ , Header

10+ , accept

11+ , Error(..)

12+ -- archives

13+ , Sha

14+ , shaToChars

15+ , getArchive

16+ -- upload

17+ , upload

18+ , filePart

19+ , jsonPart

20+ , stringPart

21+ )

22+ where

23+

24+

25+import Prelude hiding (zip)

26+import qualified Codec.Archive.Zip as Zip

27+import Control.Exception (SomeException, handle)

28+import qualified Data.Binary as Binary

29+import qualified Data.Binary.Get as Binary

30+import qualified Data.ByteString.Builder as B

31+import qualified Data.ByteString.Char8 as BS

32+import qualified Data.Digest.Pure.SHA as SHA

33+import qualified Data.String as String

34+import Network.HTTP (urlEncodeVars)

35+import Network.HTTP.Client

36+import Network.HTTP.Client.TLS (tlsManagerSettings)

37+import Network.HTTP.Types.Header (Header, hAccept, hAcceptEncoding, hUserAgent)

38+import Network.HTTP.Types.Method (Method, methodGet, methodPost)

39+import qualified Network.HTTP.Client as Multi (RequestBody(RequestBodyLBS))

40+import qualified Network.HTTP.Client.MultipartFormData as Multi

41+

42+import qualified Json.Encode as Encode

43+import qualified Elm.Version as V

44+

45+

46+

47+-- MANAGER

48+

49+

50+getManager :: IO Manager

51+getManager =

52+ newManager tlsManagerSettings

53+

54+

55+

56+-- URL

57+

58+

59+toUrl :: String -> [(String,String)] -> String

60+toUrl url params =

61+ case params of

62+ [] -> url

63+ _:_ -> url ++ "?" ++ urlEncodeVars params

64+

65+

66+

67+-- FETCH

68+

69+

70+get :: Manager -> String -> [Header] -> (Error -> e) -> (BS.ByteString -> IO (Either e a)) -> IO (Either e a)

71+get =

72+ fetch methodGet

73+

74+

75+post :: Manager -> String -> [Header] -> (Error -> e) -> (BS.ByteString -> IO (Either e a)) -> IO (Either e a)

76+post =

77+ fetch methodPost

78+

79+

80+fetch :: Method -> Manager -> String -> [Header] -> (Error -> e) -> (BS.ByteString -> IO (Either e a)) -> IO (Either e a)

81+fetch methodVerb manager url headers onError onSuccess =

82+ handle (handleSomeException url onError) $

83+ handle (handleHttpException url onError) $

84+ do req0 <- parseUrlThrow url

85+ let req1 =

86+ req0

87+ { method = methodVerb

88+ , requestHeaders = addDefaultHeaders headers

89+ }

90+ withResponse req1 manager $ \response ->

91+ do chunks <- brConsume (responseBody response)

92+ onSuccess (BS.concat chunks)

93+

94+

95+addDefaultHeaders :: [Header] -> [Header]

96+addDefaultHeaders headers =

97+ (hUserAgent, userAgent) : (hAcceptEncoding, "gzip") : headers

98+

99+

100+{-# NOINLINE userAgent #-}

101+userAgent :: BS.ByteString

102+userAgent =

103+ BS.pack ("elm/" ++ V.toChars V.compiler)

104+

105+

106+accept :: BS.ByteString -> Header

107+accept mime =

108+ (hAccept, mime)

109+

110+

111+

112+-- EXCEPTIONS

113+

114+

115+data Error

116+ = BadUrl String String

117+ | BadHttp String HttpExceptionContent

118+ | BadMystery String SomeException

119+

120+

121+handleHttpException :: String -> (Error -> e) -> HttpException -> IO (Either e a)

122+handleHttpException url onError httpException =

123+ case httpException of

124+ InvalidUrlException _ reason ->

125+ return (Left (onError (BadUrl url reason)))

126+

127+ HttpExceptionRequest _ content ->

128+ return (Left (onError (BadHttp url content)))

129+

130+

131+handleSomeException :: String -> (Error -> e) -> SomeException -> IO (Either e a)

132+handleSomeException url onError exception =

133+ return (Left (onError (BadMystery url exception)))

134+

135+

136+

137+-- SHA

138+

139+

140+type Sha = SHA.Digest SHA.SHA1State

141+

142+

143+shaToChars :: Sha -> String

144+shaToChars =

145+ SHA.showDigest

146+

147+

148+

149+-- FETCH ARCHIVE

150+

151+

152+getArchive

153+ :: Manager

154+ -> String

155+ -> (Error -> e)

156+ -> e

157+ -> ((Sha, Zip.Archive) -> IO (Either e a))

158+ -> IO (Either e a)

159+getArchive manager url onError err onSuccess =

160+ handle (handleSomeException url onError) $

161+ handle (handleHttpException url onError) $

162+ do req0 <- parseUrlThrow url

163+ let req1 =

164+ req0

165+ { method = methodGet

166+ , requestHeaders = addDefaultHeaders []

167+ }

168+ withResponse req1 manager $ \response ->

169+ do result <- readArchive (responseBody response)

170+ case result of

171+ Nothing -> return (Left err)

172+ Just shaAndArchive -> onSuccess shaAndArchive

173+

174+

175+readArchive :: BodyReader -> IO (Maybe (Sha, Zip.Archive))

176+readArchive body =

177+ readArchiveHelp body $

178+ AS 0 SHA.sha1Incremental (Binary.runGetIncremental Binary.get)

179+

180+

181+data ArchiveState =

182+ AS

183+ { _len :: !Int

184+ , _sha :: !(Binary.Decoder SHA.SHA1State)

185+ , _zip :: !(Binary.Decoder Zip.Archive)

186+ }

187+

188+

189+readArchiveHelp :: BodyReader -> ArchiveState -> IO (Maybe (Sha, Zip.Archive))

190+readArchiveHelp body (AS len sha zip) =

191+ case zip of

192+ Binary.Fail _ _ _ ->

193+ return Nothing

194+

195+ Binary.Partial k ->

196+ do chunk <- brRead body

197+ readArchiveHelp body $

198+ AS

199+ { _len = len + BS.length chunk

200+ , _sha = Binary.pushChunk sha chunk

201+ , _zip = k (if BS.null chunk then Nothing else Just chunk)

202+ }

203+

204+ Binary.Done _ _ archive ->

205+ return $ Just ( SHA.completeSha1Incremental sha len, archive )

206+

207+

208+

209+-- UPLOAD

210+

211+

212+upload :: Manager -> String -> [Multi.Part] -> IO (Either Error ())

213+upload manager url parts =

214+ handle (handleSomeException url id) $

215+ handle (handleHttpException url id) $

216+ do req0 <- parseUrlThrow url

217+ req1 <-

218+ Multi.formDataBody parts $

219+ req0

220+ { method = methodPost

221+ , requestHeaders = addDefaultHeaders []

222+ , responseTimeout = responseTimeoutNone

223+ }

224+ withResponse req1 manager $ \_ ->

225+ return (Right ())

226+

227+

228+filePart :: String -> FilePath -> Multi.Part

229+filePart name filePath =

230+ Multi.partFileSource (String.fromString name) filePath

231+

232+

233+jsonPart :: String -> FilePath -> Encode.Value -> Multi.Part

234+jsonPart name filePath value =

235+ let

236+ body =

237+ Multi.RequestBodyLBS $ B.toLazyByteString $ Encode.encodeUgly value

238+ in

239+ Multi.partFileRequestBody (String.fromString name) filePath body

240+

241+

242+stringPart :: String -> String -> Multi.Part

243+stringPart name string =

244+ Multi.partBS (String.fromString name) (BS.pack string)

builder/src/Reporting.hsnew file+474

@@ -0,0 +1,474 @@

1+{-# LANGUAGE BangPatterns, OverloadedStrings #-}

2+module Reporting

3+ ( Style

4+ , silent

5+ , json

6+ , terminal

7+ --

8+ , attempt

9+ , attemptWithStyle

10+ --

11+ , Key

12+ , report

13+ , ignorer

14+ , ask

15+ --

16+ , DKey

17+ , DMsg(..)

18+ , trackDetails

19+ --

20+ , BKey

21+ , BMsg(..)

22+ , trackBuild

23+ --

24+ , reportGenerate

25+ )

26+ where

27+

28+

29+import Control.Concurrent

30+import Control.Exception (SomeException, AsyncException(UserInterrupt), catch, fromException, throw)

31+import Control.Monad (when)

32+import qualified Data.ByteString.Builder as B

33+import qualified Data.NonEmptyList as NE

34+import qualified System.Exit as Exit

35+import qualified System.Info as Info

36+import System.IO (hFlush, hPutStr, hPutStrLn, stderr, stdout)

37+

38+import qualified Elm.ModuleName as ModuleName

39+import qualified Elm.Package as Pkg

40+import qualified Elm.Version as V

41+import qualified Json.Encode as Encode

42+import Reporting.Doc ((<+>), (<>))

43+import qualified Reporting.Doc as D

44+import qualified Reporting.Exit as Exit

45+import qualified Reporting.Exit.Help as Help

46+

47+

48+

49+-- STYLE

50+

51+

52+data Style

53+ = Silent

54+ | Json

55+ | Terminal (MVar ())

56+

57+

58+silent :: Style

59+silent =

60+ Silent

61+

62+

63+json :: Style

64+json =

65+ Json

66+

67+

68+terminal :: IO Style

69+terminal =

70+ Terminal <$> newMVar ()

71+

72+

73+

74+-- ATTEMPT

75+

76+

77+attempt :: (x -> Help.Report) -> IO (Either x a) -> IO a

78+attempt toReport work =

79+ do result <- work `catch` reportExceptionsNicely

80+ case result of

81+ Right a ->

82+ return a

83+

84+ Left x ->

85+ do Exit.toStderr (toReport x)

86+ Exit.exitFailure

87+

88+

89+attemptWithStyle :: Style -> (x -> Help.Report) -> IO (Either x a) -> IO a

90+attemptWithStyle style toReport work =

91+ do result <- work `catch` reportExceptionsNicely

92+ case result of

93+ Right a ->

94+ return a

95+

96+ Left x ->

97+ case style of

98+ Silent ->

99+ do Exit.exitFailure

100+

101+ Json ->

102+ do B.hPutBuilder stderr (Encode.encodeUgly (Exit.toJson (toReport x)))

103+ Exit.exitFailure

104+

105+ Terminal mvar ->

106+ do readMVar mvar

107+ Exit.toStderr (toReport x)

108+ Exit.exitFailure

109+

110+

111+

112+-- MARKS

113+

114+

115+goodMark :: D.Doc

116+goodMark =

117+ D.green $ if isWindows then "+" else "●"

118+

119+

120+badMark :: D.Doc

121+badMark =

122+ D.red $ if isWindows then "X" else "✗"

123+

124+

125+isWindows :: Bool

126+isWindows =

127+ Info.os == "mingw32"

128+

129+

130+

131+-- KEY

132+

133+

134+newtype Key msg = Key (msg -> IO ())

135+

136+

137+report :: Key msg -> msg -> IO ()

138+report (Key send) msg =

139+ send msg

140+

141+

142+ignorer :: Key msg

143+ignorer =

144+ Key (\_ -> return ())

145+

146+

147+

148+-- ASK

149+

150+

151+ask :: D.Doc -> IO Bool

152+ask doc =

153+ do Help.toStdout doc

154+ askHelp

155+

156+

157+askHelp :: IO Bool

158+askHelp =

159+ do hFlush stdout

160+ input <- getLine

161+ case input of

162+ "" -> return True

163+ "Y" -> return True

164+ "y" -> return True

165+ "n" -> return False

166+ _ ->

167+ do putStr "Must type 'y' for yes or 'n' for no: "

168+ askHelp

169+

170+

171+-- DETAILS

172+

173+

174+type DKey = Key DMsg

175+

176+

177+trackDetails :: Style -> (DKey -> IO a) -> IO a

178+trackDetails style callback =

179+ case style of

180+ Silent ->

181+ callback (Key (\_ -> return ()))

182+

183+ Json ->

184+ callback (Key (\_ -> return ()))

185+

186+ Terminal mvar ->

187+ do chan <- newChan

188+

189+ _ <- forkIO $

190+ do takeMVar mvar

191+ detailsLoop chan (DState 0 0 0 0 0 0 0)

192+ putMVar mvar ()

193+

194+ answer <- callback (Key (writeChan chan . Just))

195+ writeChan chan Nothing

196+ return answer

197+

198+

199+detailsLoop :: Chan (Maybe DMsg) -> DState -> IO ()

200+detailsLoop chan state@(DState total _ _ _ _ built _) =

201+ do msg <- readChan chan

202+ case msg of

203+ Just dmsg ->

204+ detailsLoop chan =<< detailsStep dmsg state

205+

206+ Nothing ->

207+ putStrLn $ clear (toBuildProgress total total) $

208+ if built == total

209+ then "Dependencies ready!"

210+ else "Dependency problem!"

211+

212+

213+data DState =

214+ DState

215+ { _total :: !Int

216+ , _cached :: !Int

217+ , _requested :: !Int

218+ , _received :: !Int

219+ , _failed :: !Int

220+ , _built :: !Int

221+ , _broken :: !Int

222+ }

223+

224+

225+data DMsg

226+ = DStart Int

227+ | DCached

228+ | DRequested

229+ | DReceived Pkg.Name V.Version

230+ | DFailed Pkg.Name V.Version

231+ | DBuilt

232+ | DBroken

233+

234+

235+detailsStep :: DMsg -> DState -> IO DState

236+detailsStep msg (DState total cached rqst rcvd failed built broken) =

237+ case msg of

238+ DStart numDependencies ->

239+ return (DState numDependencies 0 0 0 0 0 0)

240+

241+ DCached ->

242+ putTransition (DState total (cached + 1) rqst rcvd failed built broken)

243+

244+ DRequested ->

245+ do when (rqst == 0) (putStrLn "Starting downloads...\n")

246+ return (DState total cached (rqst + 1) rcvd failed built broken)

247+

248+ DReceived pkg vsn ->

249+ do putDownload goodMark pkg vsn

250+ putTransition (DState total cached rqst (rcvd + 1) failed built broken)

251+

252+ DFailed pkg vsn ->

253+ do putDownload badMark pkg vsn

254+ putTransition (DState total cached rqst rcvd (failed + 1) built broken)

255+

256+ DBuilt ->

257+ putBuilt (DState total cached rqst rcvd failed (built + 1) broken)

258+

259+ DBroken ->

260+ putBuilt (DState total cached rqst rcvd failed built (broken + 1))

261+

262+

263+putDownload :: D.Doc -> Pkg.Name -> V.Version -> IO ()

264+putDownload mark pkg vsn =

265+ Help.toStdout $ D.indent 2 $

266+ mark

267+ <+> D.fromPackage pkg

268+ <+> D.fromVersion vsn

269+ <> "\n"

270+

271+

272+putTransition :: DState -> IO DState

273+putTransition state@(DState total cached _ rcvd failed built broken) =

274+ if cached + rcvd + failed < total then

275+ return state

276+

277+ else

278+ do let char = if rcvd + failed == 0 then '\r' else '\n'

279+ putStrFlush (char : toBuildProgress (built + broken + failed) total)

280+ return state

281+

282+

283+putBuilt :: DState -> IO DState

284+putBuilt state@(DState total cached _ rcvd failed built broken) =

285+ do when (total == cached + rcvd + failed) $

286+ putStrFlush $ '\r' : toBuildProgress (built + broken + failed) total

287+ return state

288+

289+

290+toBuildProgress :: Int -> Int -> [Char]

291+toBuildProgress built total =

292+ "Verifying dependencies (" ++ show built ++ "/" ++ show total ++ ")"

293+

294+

295+clear :: [Char] -> [Char] -> [Char]

296+clear before after =

297+ '\r' : replicate (length before) ' ' ++ '\r' : after

298+

299+

300+

301+-- BUILD

302+

303+

304+type BKey = Key BMsg

305+

306+type BResult a = Either Exit.BuildProblem a

307+

308+

309+trackBuild :: Style -> (BKey -> IO (BResult a)) -> IO (BResult a)

310+trackBuild style callback =

311+ case style of

312+ Silent ->

313+ callback (Key (\_ -> return ()))

314+

315+ Json ->

316+ callback (Key (\_ -> return ()))

317+

318+ Terminal mvar ->

319+ do chan <- newChan

320+

321+ _ <- forkIO $

322+ do takeMVar mvar

323+ putStrFlush "Compiling ..."

324+ buildLoop chan 0

325+ putMVar mvar ()

326+

327+ result <- callback (Key (writeChan chan . Left))

328+ writeChan chan (Right result)

329+ return result

330+

331+

332+data BMsg

333+ = BDone

334+

335+

336+buildLoop :: Chan (Either BMsg (BResult a)) -> Int -> IO ()

337+buildLoop chan done =

338+ do msg <- readChan chan

339+ case msg of

340+ Left BDone ->

341+ do let !done1 = done + 1

342+ putStrFlush $ "\rCompiling (" ++ show done1 ++ ")"

343+ buildLoop chan done1

344+

345+ Right result ->

346+ let

347+ !message = toFinalMessage done result

348+ !width = 12 + length (show done)

349+ in

350+ putStrLn $

351+ if length message < width

352+ then '\r' : replicate width ' ' ++ '\r' : message

353+ else '\r' : message

354+

355+

356+toFinalMessage :: Int -> BResult a -> [Char]

357+toFinalMessage done result =

358+ case result of

359+ Right _ ->

360+ case done of

361+ 0 -> "Success!"

362+ 1 -> "Success! Compiled 1 module."

363+ n -> "Success! Compiled " ++ show n ++ " modules."

364+

365+ Left problem ->

366+ case problem of

367+ Exit.BuildBadModules _ _ [] ->

368+ "Detected problems in 1 module."

369+

370+ Exit.BuildBadModules _ _ (_:ps) ->

371+ "Detected problems in " ++ show (2 + length ps) ++ " modules."

372+

373+ Exit.BuildProjectProblem _ ->

374+ "Detected a problem."

375+

376+

377+

378+-- GENERATE

379+

380+

381+reportGenerate :: Style -> NE.List ModuleName.Raw -> FilePath -> IO ()

382+reportGenerate style names output =

383+ case style of

384+ Silent ->

385+ return ()

386+

387+ Json ->

388+ return ()

389+

390+ Terminal mvar ->

391+ do readMVar mvar

392+ let cnames = fmap ModuleName.toChars names

393+ putStrLn ('\n' : toGenDiagram cnames output)

394+

395+

396+toGenDiagram :: NE.List [Char] -> FilePath -> [Char]

397+toGenDiagram (NE.List name names) output =

398+ let

399+ width = 3 + foldr (max . length) (length name) names

400+ in

401+ case names of

402+ [] ->

403+ toGenLine width name ('>' : ' ' : output ++ "\n")

404+

405+ _:_ ->

406+ unlines $

407+ toGenLine width name (vtop : hbar : hbar : '>' : ' ' : output)

408+ : reverse (zipWith (toGenLine width) (reverse names) ([vbottom] : repeat [vmiddle]))

409+

410+

411+toGenLine :: Int -> [Char] -> [Char] -> [Char]

412+toGenLine width name end =

413+ " " ++ name ++ ' ' : replicate (width - length name) hbar ++ end

414+

415+

416+hbar :: Char

417+hbar = if isWindows then '-' else '─'

418+

419+vtop :: Char

420+vtop = if isWindows then '+' else '┬'

421+

422+vmiddle :: Char

423+vmiddle = if isWindows then '+' else '┤'

424+

425+vbottom :: Char

426+vbottom = if isWindows then '+' else '┘'

427+

428+

429+--

430+

431+

432+putStrFlush :: String -> IO ()

433+putStrFlush str =

434+ hPutStr stdout str >> hFlush stdout

435+

436+

437+

438+-- REPORT EXCEPTIONS NICELY

439+

440+

441+reportExceptionsNicely :: SomeException -> IO a

442+reportExceptionsNicely e =

443+ case fromException e of

444+ Just UserInterrupt -> throw e

445+ _ -> putException e >> throw e

446+

447+

448+putException :: SomeException -> IO ()

449+putException e = do

450+ hPutStrLn stderr ""

451+ Help.toStderr $ D.stack $

452+ [ D.dullyellow "-- ERROR -----------------------------------------------------------------------"

453+ , D.reflow $

454+ "I ran into something that bypassed the normal error reporting process!\

455+ \ I extracted whatever information I could from the internal error:"

456+ , D.vcat $ map (\line -> D.red ">" <> " " <> D.fromChars line) (lines (show e))

457+ , D.reflow $

458+ "These errors are usually pretty confusing, so start by asking around on one of\

459+ \ forums listed at https://elm-lang.org/community to see if anyone can get you\

460+ \ unstuck quickly."

461+ , D.dullyellow "-- REQUEST ---------------------------------------------------------------------"

462+ , D.reflow $

463+ "If you are feeling up to it, please try to get your code down to the smallest\

464+ \ version that still triggers this message. Ideally in a single Main.elm and\

465+ \ elm.json file."

466+ , D.reflow $

467+ "From there open a NEW issue at https://github.com/elm/compiler/issues with\

468+ \ your reduced example pasted in directly. (Not a link to a repo or gist!) Do not\

469+ \ worry about if someone else saw something similar. More examples is better!"

470+ , D.reflow $

471+ "This kind of error is usually tied up in larger architectural choices that are\

472+ \ hard to change, so even when we have a couple good examples, it can take some\

473+ \ time to resolve in a solid way."

474+ ]

builder/src/Reporting/Exit.hsnew file+2069

@@ -0,0 +1,2069 @@

1+{-# LANGUAGE OverloadedStrings #-}

2+module Reporting.Exit

3+ ( Init(..), initToReport

4+ , Diff(..), diffToReport

5+ , Make(..), makeToReport

6+ , Bump(..), bumpToReport

7+ , Repl(..), replToReport

8+ , Publish(..), publishToReport

9+ , Install(..), installToReport

10+ , Reactor(..), reactorToReport

11+ , newPackageOverview

12+ --

13+ , Solver(..)

14+ , Outline(..)

15+ , OutlineProblem(..)

16+ , Details(..)

17+ , DetailsBadDep(..)

18+ , PackageProblem(..)

19+ , RegistryProblem(..)

20+ , BuildProblem(..)

21+ , BuildProjectProblem(..)

22+ , DocsProblem(..)

23+ , Generate(..)

24+ --

25+ , toString

26+ , toStderr

27+ , toJson

28+ )

29+ where

30+

31+

32+import qualified Data.ByteString as BS

33+import qualified Data.ByteString.UTF8 as BS_UTF8

34+import qualified Data.List as List

35+import qualified Data.Map as Map

36+import qualified Data.Name as N

37+import qualified Data.NonEmptyList as NE

38+import qualified Network.HTTP.Client as HTTP

39+import qualified Network.HTTP.Types.Header as HTTP

40+import qualified Network.HTTP.Types.Status as HTTP

41+import qualified System.FilePath as FP

42+import System.FilePath ((</>), (<.>))

43+

44+import qualified Elm.Constraint as C

45+import qualified Elm.Magnitude as M

46+import qualified Elm.ModuleName as ModuleName

47+import qualified Elm.Package as Pkg

48+import qualified Elm.Version as V

49+import qualified File

50+import qualified Http

51+import qualified Json.Decode as Decode

52+import qualified Json.Encode as Encode

53+import qualified Json.String as Json

54+import Parse.Primitives (Row, Col)

55+import qualified Reporting.Annotation as A

56+import Reporting.Doc ((<>))

57+import qualified Reporting.Doc as D

58+import qualified Reporting.Error.Import as Import

59+import qualified Reporting.Error.Json as Json

60+import qualified Reporting.Exit.Help as Help

61+import qualified Reporting.Error as Error

62+import qualified Reporting.Render.Code as Code

63+

64+

65+

66+-- RENDERERS

67+

68+

69+toString :: Help.Report -> String

70+toString report =

71+ Help.toString (Help.reportToDoc report)

72+

73+

74+toStderr :: Help.Report -> IO ()

75+toStderr report =

76+ Help.toStderr (Help.reportToDoc report)

77+

78+

79+toJson :: Help.Report -> Encode.Value

80+toJson report =

81+ Help.reportToJson report

82+

83+

84+

85+-- INIT

86+

87+

88+data Init

89+ = InitNoSolution [Pkg.Name]

90+ | InitNoOfflineSolution [Pkg.Name]

91+ | InitSolverProblem Solver

92+ | InitAlreadyExists

93+ | InitRegistryProblem RegistryProblem

94+

95+

96+initToReport :: Init -> Help.Report

97+initToReport exit =

98+ case exit of

99+ InitNoSolution pkgs ->

100+ Help.report "NO SOLUTION" Nothing

101+ "I tried to create an elm.json with the following direct dependencies:"

102+ [ D.indent 4 $ D.vcat $

103+ map (D.dullyellow . D.fromChars . Pkg.toChars) pkgs

104+ , D.reflow $

105+ "I could not find compatible versions though! This should not happen, so please\

106+ \ ask around one of the community forums at https://elm-lang.org/community to learn\

107+ \ what is going on!"

108+ ]

109+

110+ InitNoOfflineSolution pkgs ->

111+ Help.report "NO OFFLINE SOLUTION" Nothing

112+ "I tried to create an elm.json with the following direct dependencies:"

113+ [ D.indent 4 $ D.vcat $

114+ map (D.dullyellow . D.fromChars . Pkg.toChars) pkgs

115+ , D.reflow $

116+ "I could not find compatible versions though, but that may be because I could not\

117+ \ connect to https://package.elm-lang.org to get the latest list of packages. Are\

118+ \ you able to connect to the internet? Please ask around one of the community\

119+ \ forums at https://elm-lang.org/community for help!"

120+ ]

121+

122+ InitSolverProblem solver ->

123+ toSolverReport solver

124+

125+ InitAlreadyExists ->

126+ Help.report "EXISTING PROJECT" Nothing

127+ "You already have an elm.json file, so there is nothing for me to initialize!"

128+ [ D.fillSep

129+ ["Maybe",D.green (D.fromChars (D.makeLink "init")),"can","help"

130+ ,"you","figure","out","what","to","do","next?"

131+ ]

132+ ]

133+

134+ InitRegistryProblem problem ->

135+ toRegistryProblemReport "PROBLEM LOADING PACKAGE LIST" problem $

136+ "I need the list of published packages before I can start initializing projects"

137+

138+

139+

140+-- DIFF

141+

142+

143+data Diff

144+ = DiffNoOutline

145+ | DiffBadOutline Outline

146+ | DiffApplication

147+ | DiffNoExposed

148+ | DiffUnpublished

149+ | DiffUnknownPackage Pkg.Name [Pkg.Name]

150+ | DiffUnknownVersion Pkg.Name V.Version [V.Version]

151+ | DiffDocsProblem V.Version DocsProblem

152+ | DiffMustHaveLatestRegistry RegistryProblem

153+ | DiffBadDetails Details

154+ | DiffBadBuild BuildProblem

155+

156+

157+diffToReport :: Diff -> Help.Report

158+diffToReport diff =

159+ case diff of

160+ DiffNoOutline ->

161+ Help.report "DIFF WHAT?" Nothing

162+ "I cannot find an elm.json so I am not sure what you want me to diff.\

163+ \ Normally you run `elm diff` from within a project!"

164+ [ D.reflow $ "If you are just curious to see a diff, try running this command:"

165+ , D.indent 4 $ D.green $ "elm diff elm/http 1.0.0 2.0.0"

166+ ]

167+

168+ DiffBadOutline outline ->

169+ toOutlineReport outline

170+

171+ DiffApplication ->

172+ Help.report "CANNOT DIFF APPLICATIONS" (Just "elm.json")

173+ "Your elm.json says this project is an application, but `elm diff` only works\

174+ \ with packages. That way there are previously published versions of the API to\

175+ \ diff against!"

176+ [ D.reflow $ "If you are just curious to see a diff, try running this command:"

177+ , D.indent 4 $ D.dullyellow $ "elm diff elm/json 1.0.0 1.1.2"

178+ ]

179+

180+ DiffNoExposed ->

181+ Help.report "NO EXPOSED MODULES" (Just "elm.json")

182+ "Your elm.json has no \"exposed-modules\" which means there is no public API at\

183+ \ all right now! What am I supposed to diff?"

184+ [ D.reflow $

185+ "Try adding some modules back to the \"exposed-modules\" field."

186+ ]

187+

188+ DiffUnpublished ->

189+ Help.report "UNPUBLISHED" Nothing

190+ "This package is not published yet. There is nothing to diff against!"

191+ []

192+

193+ DiffUnknownPackage pkg suggestions ->

194+ Help.report "UNKNOWN PACKAGE" Nothing

195+ ( "I cannot find a package called:"

196+ )

197+ [ D.indent 4 $ D.red $ D.fromChars $ Pkg.toChars pkg

198+ , "Maybe you want one of these instead?"

199+ , D.indent 4 $ D.dullyellow $ D.vcat $ map (D.fromChars . Pkg.toChars) suggestions

200+ , "But check <https://package.elm-lang.org> to see all possibilities!"

201+ ]

202+

203+ DiffUnknownVersion _pkg vsn realVersions ->

204+ Help.docReport "UNKNOWN VERSION" Nothing

205+ ( D.fillSep $

206+ [ "Version", D.red (D.fromVersion vsn)

207+ , "has", "never", "been", "published,", "so", "I"

208+ , "cannot", "diff", "against", "it."

209+ ]

210+ )

211+ [ "Here are all the versions that HAVE been published:"

212+ , D.indent 4 $ D.dullyellow $ D.vcat $

213+ let

214+ sameMajor v1 v2 = V._major v1 == V._major v2

215+ mkRow vsns = D.hsep $ map D.fromVersion vsns

216+ in

217+ map mkRow $ List.groupBy sameMajor (List.sort realVersions)

218+ , "Want one of those instead?"

219+ ]

220+

221+ DiffDocsProblem version problem ->

222+ toDocsProblemReport problem $

223+ "I need the docs for " ++ V.toChars version ++ " to compute this diff"

224+

225+ DiffMustHaveLatestRegistry problem ->

226+ toRegistryProblemReport "PROBLEM UPDATING PACKAGE LIST" problem $

227+ "I need the latest list of published packages before I do this diff"

228+

229+ DiffBadDetails details ->

230+ toDetailsReport details

231+

232+ DiffBadBuild buildProblem ->

233+ toBuildProblemReport buildProblem

234+

235+

236+

237+-- BUMP

238+

239+

240+data Bump

241+ = BumpNoOutline

242+ | BumpBadOutline Outline

243+ | BumpApplication

244+ | BumpUnexpectedVersion V.Version [V.Version]

245+ | BumpMustHaveLatestRegistry RegistryProblem

246+ | BumpCannotFindDocs Pkg.Name V.Version DocsProblem

247+ | BumpBadDetails Details

248+ | BumpNoExposed

249+ | BumpBadBuild BuildProblem

250+

251+

252+bumpToReport :: Bump -> Help.Report

253+bumpToReport bump =

254+ case bump of

255+ BumpNoOutline ->

256+ Help.report "BUMP WHAT?" Nothing

257+ "I cannot find an elm.json so I am not sure what you want me to bump."

258+ [ D.reflow $

259+ "Elm packages always have an elm.json that says current the version number. If\

260+ \ you run this command from a directory with an elm.json file, I will try to bump\

261+ \ the version in there based on the API changes."

262+ ]

263+

264+ BumpBadOutline outline ->

265+ toOutlineReport outline

266+

267+ BumpApplication ->

268+ Help.report "CANNOT BUMP APPLICATIONS" (Just "elm.json")

269+ "Your elm.json says this is an application. That means it cannot be published\

270+ \ on <https://package.elm-lang.org> and therefore has no version to bump!"

271+ []

272+

273+ BumpUnexpectedVersion vsn versions ->

274+ Help.docReport "CANNOT BUMP" (Just "elm.json")

275+ ( D.fillSep

276+ ["Your","elm.json","says","I","should","bump","relative","to","version"

277+ ,D.red (D.fromVersion vsn) <> ","

278+ ,"but","I","cannot","find","that","version","on","<https://package.elm-lang.org>."

279+ ,"That","means","there","is","no","API","for","me","to","diff","against","and"

280+ ,"figure","out","if","these","are","MAJOR,","MINOR,","or","PATCH","changes."

281+ ]

282+ )

283+ [ D.fillSep $

284+ ["Try","bumping","again","after","changing","the",D.dullyellow "\"version\"","in","elm.json"]

285+ ++ if length versions == 1 then ["to:"] else ["to","one","of","these:"]

286+ , D.vcat $ map (D.green . D.fromVersion) versions

287+ ]

288+

289+ BumpMustHaveLatestRegistry problem ->

290+ toRegistryProblemReport "PROBLEM UPDATING PACKAGE LIST" problem $

291+ "I need the latest list of published packages before I can bump any versions"

292+

293+ BumpCannotFindDocs _ version problem ->

294+ toDocsProblemReport problem $

295+ "I need the docs for " ++ V.toChars version ++ " to compute the next version number"

296+

297+ BumpBadDetails details ->

298+ toDetailsReport details

299+

300+ BumpNoExposed ->

301+ Help.docReport "NO EXPOSED MODULES" (Just "elm.json")

302+ ( D.fillSep $

303+ [ "To", "bump", "a", "package,", "the"

304+ , D.dullyellow "\"exposed-modules\"", "field", "of", "your"

305+ , "elm.json", "must", "list", "at", "least", "one", "module."

306+ ]

307+ )

308+ [ D.reflow $

309+ "Try adding some modules back to the \"exposed-modules\" field."

310+ ]

311+

312+ BumpBadBuild problem ->

313+ toBuildProblemReport problem

314+

315+

316+

317+-- OVERVIEW OF VERSIONING

318+

319+

320+newPackageOverview :: String

321+newPackageOverview =

322+ unlines

323+ [ "This package has never been published before. Here's how things work:"

324+ , ""

325+ , " - Versions all have exactly three parts: MAJOR.MINOR.PATCH"

326+ , ""

327+ , " - All packages start with initial version " ++ V.toChars V.one

328+ , ""

329+ , " - Versions are incremented based on how the API changes:"

330+ , ""

331+ , " PATCH = the API is the same, no risk of breaking code"

332+ , " MINOR = values have been added, existing values are unchanged"

333+ , " MAJOR = existing values have been changed or removed"

334+ , ""

335+ , " - I will bump versions for you, automatically enforcing these rules"

336+ , ""

337+ ]

338+

339+

340+

341+-- PUBLISH

342+

343+

344+data Publish

345+ = PublishNoOutline

346+ | PublishBadOutline Outline

347+ | PublishBadDetails Details

348+ | PublishMustHaveLatestRegistry RegistryProblem

349+ | PublishApplication

350+ | PublishNotInitialVersion V.Version

351+ | PublishAlreadyPublished V.Version

352+ | PublishInvalidBump V.Version V.Version

353+ | PublishBadBump V.Version V.Version M.Magnitude V.Version M.Magnitude

354+ | PublishNoSummary

355+ | PublishNoExposed

356+ | PublishNoReadme

357+ | PublishShortReadme

358+ | PublishNoLicense

359+ | PublishBuildProblem BuildProblem

360+ | PublishMissingTag V.Version

361+ | PublishCannotGetTag V.Version Http.Error

362+ | PublishCannotGetTagData V.Version String BS.ByteString

363+ | PublishCannotGetZip Http.Error

364+ | PublishCannotDecodeZip String

365+ | PublishCannotGetDocs V.Version V.Version DocsProblem

366+ | PublishCannotRegister Http.Error

367+ | PublishNoGit

368+ | PublishLocalChanges V.Version

369+ --

370+ | PublishZipBadDetails Details

371+ | PublishZipApplication

372+ | PublishZipNoExposed

373+ | PublishZipBuildProblem BuildProblem

374+

375+

376+publishToReport :: Publish -> Help.Report

377+publishToReport publish =

378+ case publish of

379+ PublishNoOutline ->

380+ Help.report "PUBLISH WHAT?" Nothing

381+ "I cannot find an elm.json so I am not sure what you want me to publish."

382+ [ D.reflow $

383+ "Elm packages always have an elm.json that states the version number,\

384+ \ dependencies, exposed modules, etc."

385+ ]

386+

387+ PublishBadOutline outline ->

388+ toOutlineReport outline

389+

390+ PublishBadDetails problem ->

391+ toDetailsReport problem

392+

393+ PublishMustHaveLatestRegistry problem ->

394+ toRegistryProblemReport "PROBLEM UPDATING PACKAGE LIST" problem $

395+ "I need the latest list of published packages to make sure this is safe to publish"

396+

397+ PublishApplication ->

398+ Help.report "UNPUBLISHABLE" Nothing "I cannot publish applications, only packages!" []

399+

400+ PublishNotInitialVersion vsn ->

401+ Help.docReport "INVALID VERSION" Nothing

402+ ( D.fillSep

403+ ["I","cannot","publish"

404+ ,D.red (D.fromVersion vsn)

405+ ,"as","the","initial","version."

406+ ]

407+ )

408+ [ D.fillSep

409+ ["Change","it","to",D.green "1.0.0","which","is"

410+ ,"the","initial","version","for","all","Elm","packages."

411+ ]

412+ ]

413+

414+ PublishAlreadyPublished vsn ->

415+ Help.docReport "ALREADY PUBLISHED" Nothing

416+ ( D.vcat

417+ [ D.fillSep

418+ [ "Version", D.green (D.fromVersion vsn)

419+ , "has", "already", "been", "published.", "You", "cannot"

420+ , "publish", "it", "again!"

421+ ]

422+ , "Try using the `bump` command:"

423+ ]

424+ )

425+ [ D.dullyellow $ D.indent 4 "elm bump"

426+ , D.reflow $

427+ "It computes the version number based on API changes, ensuring\

428+ \ that no breaking changes end up in PATCH releases!"

429+ ]

430+

431+ PublishInvalidBump statedVersion latestVersion ->

432+ Help.docReport "INVALID VERSION" (Just "elm.json")

433+ ( D.fillSep $

434+ ["Your","elm.json","says","the","next","version","should","be"

435+ ,D.red (D.fromVersion statedVersion) <> ","

436+ ,"but","that","is","not","valid","based","on","the","previously"

437+ ,"published","versions."

438+ ]

439+ )

440+ [ D.fillSep $

441+ ["Change","the","version","back","to"

442+ ,D.green (D.fromVersion latestVersion)

443+ ,"which","is","the","most","recently","published","version."

444+ ,"From","there,","have","Elm","bump","the","version","by","running:"

445+ ]

446+ , D.indent 4 $ D.green "elm bump"

447+ , D.reflow $

448+ "If you want more insight on the API changes Elm detects, you\

449+ \ can run `elm diff` at this point as well."

450+ ]

451+

452+ PublishBadBump old new magnitude realNew realMagnitude ->

453+ Help.docReport "INVALID VERSION" (Just "elm.json")

454+ (

455+ D.fillSep $

456+ ["Your","elm.json","says","the","next","version","should","be"

457+ ,D.red (D.fromVersion new) <> ","

458+ ,"indicating","a",D.fromChars (M.toChars magnitude)

459+ ,"change","to","the","public","API."

460+ ,"This","does","not","match","the","API","diff","given","by:"

461+ ]

462+ )

463+ [ D.indent 4 $ D.fromChars $

464+ "elm diff " ++ V.toChars old

465+

466+ , D.fillSep $

467+ ["This","command","says","this","is","a"

468+ ,D.fromChars (M.toChars realMagnitude)

469+ ,"change,","so","the","next","version","should","be"

470+ ,D.green (D.fromVersion realNew) <> "."

471+ ,"Double","check","everything","to","make","sure","you"

472+ ,"are","publishing","what","you","want!"

473+ ]

474+ , D.reflow $

475+ "Also, next time use `elm bump` and I'll figure all this out for you!"

476+ ]

477+

478+ PublishNoSummary ->

479+ Help.docReport "NO SUMMARY" (Just "elm.json")

480+ ( D.fillSep $

481+ [ "To", "publish", "a", "package,", "your", "elm.json", "must"

482+ , "have", "a", D.dullyellow "\"summary\"", "field", "that", "gives"

483+ , "a", "consice", "overview", "of", "your", "project."

484+ ]

485+ )

486+ [ D.reflow $

487+ "The summary must be less than 80 characters. It should describe\

488+ \ the concrete use of your package as clearly and as plainly as possible."

489+ ]

490+

491+ PublishNoExposed ->

492+ Help.docReport "NO EXPOSED MODULES" (Just "elm.json")

493+ ( D.fillSep $

494+ [ "To", "publish", "a", "package,", "the"

495+ , D.dullyellow "\"exposed-modules\"", "field", "of", "your"

496+ , "elm.json", "must", "list", "at", "least", "one", "module."

497+ ]

498+ )

499+ [ D.reflow $

500+ "Which modules do you want users of the package to have access to? Add their\

501+ \ names to the \"exposed-modules\" list."

502+ ]

503+

504+ PublishNoReadme ->

505+ toBadReadmeReport "NO README" $

506+ "Every published package must have a helpful README.md\

507+ \ file, but I do not see one in your project."

508+

509+ PublishShortReadme ->

510+ toBadReadmeReport "SHORT README" $

511+ "This README.md is too short. Having more details will help\

512+ \ people assess your package quickly and fairly."

513+

514+ PublishNoLicense ->

515+ Help.report "NO LICENSE FILE" (Just "LICENSE")

516+ "By publishing a package you are inviting the Elm community to build\

517+ \ upon your work. But without knowing your license, we have no idea if\

518+ \ that is legal!"

519+ [ D.reflow $

520+ "Once you pick an OSI approved license from <https://spdx.org/licenses/>,\

521+ \ you must share that choice in two places. First, the license\

522+ \ identifier must appear in your elm.json file. Second, the full\

523+ \ license text must appear in the root of your project in a file\

524+ \ named LICENSE. Add that file and you will be all set!"

525+ ]

526+

527+ PublishBuildProblem buildProblem ->

528+ toBuildProblemReport buildProblem

529+

530+ PublishMissingTag version ->

531+ let vsn = V.toChars version in

532+ Help.docReport "NO TAG" Nothing

533+ ( D.fillSep $

534+ [ "Packages", "must", "be", "tagged", "in", "git,", "but", "I"

535+ , "cannot", "find", "a", D.green (D.fromChars vsn), "tag."

536+ ]

537+ )

538+ [ D.vcat

539+ [ "These tags make it possible to find this specific version on GitHub."

540+ , "To tag the most recent commit and push it to GitHub, run this:"

541+ ]

542+ , D.indent 4 $ D.dullyellow $ D.vcat $ map D.fromChars $

543+ [ "git tag -a " ++ vsn ++ " -m \"new release\""

544+ , "git push origin " ++ vsn

545+ ]

546+ , "The -m flag is for a helpful message. Try to make it more informative!"

547+ ]

548+

549+ PublishCannotGetTag version httpError ->

550+ case httpError of

551+ Http.BadHttp _ (HTTP.StatusCodeException response _)

552+ | HTTP.statusCode (HTTP.responseStatus response) == 404 ->

553+ let vsn = V.toChars version in

554+ Help.report "NO TAG ON GITHUB" Nothing

555+ ("You have version " ++ vsn ++ " tagged locally, but not on GitHub.")

556+ [ D.reflow

557+ "Run the following command to make this tag available on GitHub:"

558+ , D.indent 4 $ D.dullyellow $ D.fromChars $

559+ "git push origin " ++ vsn

560+ , D.reflow

561+ "This will make it possible to find your code online based on the version number."

562+ ]

563+

564+ _ ->

565+ toHttpErrorReport "PROBLEM VERIFYING TAG" httpError

566+ "I need to check that the version tag is registered on GitHub"

567+

568+ PublishCannotGetTagData version url body ->

569+ Help.report "PROBLEM VERIFYING TAG" Nothing

570+ ("I need to check that version " ++ V.toChars version ++ " is tagged on GitHub, so I fetched:")

571+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

572+ , D.reflow $

573+ "I got the data back, but it was not what I was expecting. The response\

574+ \ body contains " ++ show (BS.length body) ++ " bytes. Here is the "

575+ ++ if BS.length body <= 76 then "whole thing:" else "beginning:"

576+ , D.indent 4 $ D.dullyellow $ D.fromChars $

577+ if BS.length body <= 76

578+ then BS_UTF8.toString body

579+ else take 73 (BS_UTF8.toString body) ++ "..."

580+ , D.reflow $

581+ "Does this error keep showing up? Maybe there is something weird with your\

582+ \ internet connection. We have gotten reports that schools, businesses,\

583+ \ airports, etc. sometimes intercept requests and add things to the body\

584+ \ or change its contents entirely. Could that be the problem?"

585+ ]

586+

587+ PublishCannotGetZip httpError ->

588+ toHttpErrorReport "PROBLEM DOWNLOADING CODE" httpError $

589+ "I need to check that folks can download and build the source code when they\

590+ \ install this package"

591+

592+ PublishCannotDecodeZip url ->

593+ Help.report "PROBLEM DOWNLOADING CODE" Nothing

594+ "I need to check that folks can download and build the source code when they\

595+ \ install this package, so I downloaded the code from:"

596+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

597+ , D.reflow $

598+ "I was unable to unzip the archive though. Maybe there is something weird with\

599+ \ your internet connection. We have gotten reports that schools, businesses,\

600+ \ airports, etc. sometimes intercept requests and add things to the body or\

601+ \ change its contents entirely. Could that be the problem?"

602+ ]

603+

604+ PublishCannotGetDocs old new docsProblem ->

605+ toDocsProblemReport docsProblem $

606+ "I need the docs for " ++ V.toChars old ++ " to verify that "

607+ ++ V.toChars new ++ " really does come next"

608+

609+ PublishCannotRegister httpError ->

610+ toHttpErrorReport "PROBLEM PUBLISHING PACKAGE" httpError $

611+ "I need to send information about your package to the package website"

612+

613+ PublishNoGit ->

614+ Help.report "NO GIT" Nothing

615+ "I searched your PATH environment variable for `git` and could not\

616+ \ find it. Is it available through your PATH?"

617+ [ D.reflow $

618+ "Who cares about this? Well, I currently use `git` to check if there\

619+ \ are any local changes in your code. Local changes are a good sign\

620+ \ that some important improvements have gotten mistagged, so this\

621+ \ check can be extremely helpful for package authors!"

622+ , D.toSimpleNote $

623+ "We plan to do this without the `git` binary in a future release."

624+ ]

625+

626+ PublishLocalChanges version ->

627+ let vsn = V.toChars version in

628+ Help.docReport "LOCAL CHANGES" Nothing

629+ ( D.fillSep $

630+ [ "The", "code", "tagged", "as", D.green (D.fromChars vsn), "in"

631+ , "git", "does", "not", "match", "the", "code", "in", "your"

632+ , "working", "directory.", "This", "means", "you", "have"

633+ , "commits", "or", "local", "changes", "that", "are", "not"

634+ , "going", "to", "be", "published!"

635+ ]

636+ )

637+ [ D.toSimpleNote $

638+ "If you are sure everything is in order, you can run `git checkout "

639+ ++ vsn ++ "` and publish your code from there."

640+ ]

641+

642+ PublishZipBadDetails _ ->

643+ badZipReport

644+

645+ PublishZipApplication ->

646+ badZipReport

647+

648+ PublishZipNoExposed ->

649+ badZipReport

650+

651+ PublishZipBuildProblem _ ->

652+ badZipReport

653+

654+

655+toBadReadmeReport :: String -> String -> Help.Report

656+toBadReadmeReport title summary =

657+ Help.report title (Just "README.md") summary

658+ [ D.reflow $

659+ "When people look at your README, they are wondering:"

660+ , D.vcat

661+ [ " - What does this package even do?"

662+ , " - Will it help me solve MY problems?"

663+ ]

664+ , D.reflow $

665+ "So I recommend starting your README with a small example of the\

666+ \ most common usage scenario. Show people what they can expect if\

667+ \ they learn more!"

668+ , D.toSimpleNote $

669+ "By publishing your package, you are inviting people to invest time in\

670+ \ understanding your work. Spending an hour on your README to communicate your\

671+ \ knowledge more clearly can save the community days or weeks of time in\

672+ \ aggregate, and saving time in aggregate is the whole point of publishing\

673+ \ packages! People really appreciate it, and it makes the whole ecosystem feel\

674+ \ nicer!"

675+ ]

676+

677+

678+badZipReport :: Help.Report

679+badZipReport =

680+ Help.report "PROBLEM VERIFYING PACKAGE" Nothing

681+ "Before publishing packages, I download the code from GitHub and try to build it\

682+ \ from scratch. That way I can be more confident that it will work for other\

683+ \ people too. But I am not able to build it!"

684+ [ D.reflow $

685+ "I was just able to build your local copy though. Is there some way the version\

686+ \ on GitHub could be different?"

687+ ]

688+

689+

690+

691+-- DOCS

692+

693+

694+data DocsProblem

695+ = DP_Http Http.Error

696+ | DP_Data String BS.ByteString

697+ | DP_Cache

698+

699+

700+toDocsProblemReport :: DocsProblem -> String -> Help.Report

701+toDocsProblemReport problem context =

702+ case problem of

703+ DP_Http httpError ->

704+ toHttpErrorReport "PROBLEM LOADING DOCS" httpError context

705+

706+ DP_Data url body ->

707+ Help.report "PROBLEM LOADING DOCS" Nothing (context ++ ", so I fetched:")

708+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

709+ , D.reflow $

710+ "I got the data back, but it was not what I was expecting. The response\

711+ \ body contains " ++ show (BS.length body) ++ " bytes. Here is the "

712+ ++ if BS.length body <= 76 then "whole thing:" else "beginning:"

713+ , D.indent 4 $ D.dullyellow $ D.fromChars $

714+ if BS.length body <= 76

715+ then BS_UTF8.toString body

716+ else take 73 (BS_UTF8.toString body) ++ "..."

717+ , D.reflow $

718+ "Does this error keep showing up? Maybe there is something weird with your\

719+ \ internet connection. We have gotten reports that schools, businesses,\

720+ \ airports, etc. sometimes intercept requests and add things to the body\

721+ \ or change its contents entirely. Could that be the problem?"

722+ ]

723+

724+ DP_Cache ->

725+ Help.report "PROBLEM LOADING DOCS" Nothing (context ++ ", but the local copy seems to be corrupted.")

726+ [ D.reflow $

727+ "I deleted the cached version, so the next run should download a fresh copy of\

728+ \ the docs. Hopefully that will get you unstuck, but it will not resolve the root\

729+ \ problem if, for example, a 3rd party editor plugin is modifing cached files\

730+ \ for some reason."

731+ ]

732+

733+

734+

735+-- INSTALL

736+

737+

738+data Install

739+ = InstallNoOutline

740+ | InstallBadOutline Outline

741+ | InstallBadRegistry RegistryProblem

742+ | InstallNoArgs FilePath

743+ | InstallNoOnlineAppSolution Pkg.Name

744+ | InstallNoOfflineAppSolution Pkg.Name

745+ | InstallNoOnlinePkgSolution Pkg.Name

746+ | InstallNoOfflinePkgSolution Pkg.Name

747+ | InstallHadSolverTrouble Solver

748+ | InstallUnknownPackageOnline Pkg.Name [Pkg.Name]

749+ | InstallUnknownPackageOffline Pkg.Name [Pkg.Name]

750+ | InstallBadDetails Details

751+

752+

753+installToReport :: Install -> Help.Report

754+installToReport exit =

755+ case exit of

756+ InstallNoOutline ->

757+ Help.report "NEW PROJECT?" Nothing

758+ "Are you trying to start a new project? Try this command instead:"

759+ [ D.indent 4 $ D.green "elm init"

760+ , D.reflow "It will help you get started!"

761+ ]

762+

763+ InstallBadOutline outline ->

764+ toOutlineReport outline

765+

766+ InstallBadRegistry problem ->

767+ toRegistryProblemReport "PROBLEM LOADING PACKAGE LIST" problem $

768+ "I need the list of published packages to figure out how to install things"

769+

770+ InstallNoArgs elmHome ->

771+ Help.report "INSTALL WHAT?" Nothing

772+ "I am expecting commands like:"

773+ [ D.green $ D.indent 4 $ D.vcat $

774+ [ "elm install elm/http"

775+ , "elm install elm/json"

776+ , "elm install elm/random"

777+ ]

778+ , D.toFancyHint

779+ ["In","JavaScript","folks","run","`npm install`","to","start","projects."

780+ ,"\"Gotta","download","everything!\"","But","why","download","packages"

781+ ,"again","and","again?","Instead,","Elm","caches","packages","in"

782+ ,D.dullyellow (D.fromChars elmHome)

783+ ,"so","each","one","is","downloaded","and","built","ONCE","on","your","machine."

784+ ,"Elm","projects","check","that","cache","before","trying","the","internet."

785+ ,"This","reduces","build","times,","reduces","server","costs,","and","makes","it"

786+ ,"easier","to","work","offline.","As","a","result"

787+ ,D.dullcyan "elm install","is","only","for","adding","dependencies","to","elm.json,"

788+ ,"whereas",D.dullcyan "elm make","is","in","charge","of","gathering","dependencies"

789+ ,"and","building","everything.","So","maybe","try",D.green "elm make","instead?"

790+ ]

791+ ]

792+

793+ InstallNoOnlineAppSolution pkg ->

794+ Help.report "CANNOT FIND COMPATIBLE VERSION" (Just "elm.json")

795+ (

796+ "I cannot find a version of " ++ Pkg.toChars pkg ++ " that is compatible\

797+ \ with your existing dependencies."

798+ )

799+ [ D.reflow $

800+ "I checked all the published versions. When that failed, I tried to find any\

801+ \ compatible combination of these packages, even if it meant changing all your\

802+ \ existing dependencies! That did not work either!"

803+ , D.reflow $

804+ "This is most likely to happen when a package is not upgraded yet. Maybe a new\

805+ \ version of Elm came out recently? Maybe a common package was changed recently?\

806+ \ Maybe a better package came along, so there was no need to upgrade this one?\

807+ \ Try asking around https://elm-lang.org/community to learn what might be going on\

808+ \ with this package."

809+ , D.toSimpleNote $

810+ "Whatever the case, please be kind to the relevant package authors! Having\

811+ \ friendly interactions with users is great motivation, and conversely, getting\

812+ \ berated by strangers on the internet sucks your soul dry. Furthermore, package\

813+ \ authors are humans with families, friends, jobs, vacations, responsibilities,\

814+ \ goals, etc. They face obstacles outside of their technical work you will never\

815+ \ know about, so please assume the best and try to be patient and supportive!"

816+ ]

817+

818+ InstallNoOfflineAppSolution pkg ->

819+ Help.report "CANNOT FIND COMPATIBLE VERSION LOCALLY" (Just "elm.json")

820+ (

821+ "I cannot find a version of " ++ Pkg.toChars pkg ++ " that is compatible\

822+ \ with your existing dependencies."

823+ )

824+ [ D.reflow $

825+ "I was not able to connect to https://package.elm-lang.org/ though, so I was only\

826+ \ able to look through packages that you have downloaded in the past."

827+ , D.reflow $

828+ "Try again later when you have internet!"

829+ ]

830+

831+ InstallNoOnlinePkgSolution pkg ->

832+ Help.report "CANNOT FIND COMPATIBLE VERSION" (Just "elm.json")

833+ (

834+ "I cannot find a version of " ++ Pkg.toChars pkg ++ " that is compatible\

835+ \ with your existing constraints."

836+ )

837+ [ D.reflow $

838+ "With applications, I try to broaden the constraints to see if anything works,\

839+ \ but messing with package constraints is much more delicate business. E.g. making\

840+ \ your constraints stricter may make it harder for applications to find compatible\

841+ \ dependencies. So fixing something here may break it for a lot of other people!"

842+ , D.reflow $

843+ "So I recommend making an application with the same dependencies as your package.\

844+ \ See if there is a solution at all. From there it may be easier to figure out\

845+ \ how to proceed in a way that will disrupt your users as little as possible. And\

846+ \ the solution may be to help other package authors to get their packages updated,\

847+ \ or to drop a dependency entirely."

848+ ]

849+

850+ InstallNoOfflinePkgSolution pkg ->

851+ Help.report "CANNOT FIND COMPATIBLE VERSION LOCALLY" (Just "elm.json")

852+ (

853+ "I cannot find a version of " ++ Pkg.toChars pkg ++ " that is compatible\

854+ \ with your existing constraints."

855+ )

856+ [ D.reflow $

857+ "I was not able to connect to https://package.elm-lang.org/ though, so I was only\

858+ \ able to look through packages that you have downloaded in the past."

859+ , D.reflow $

860+ "Try again later when you have internet!"

861+ ]

862+

863+ InstallHadSolverTrouble solver ->

864+ toSolverReport solver

865+

866+ InstallUnknownPackageOnline pkg suggestions ->

867+ Help.docReport "UNKNOWN PACKAGE" Nothing

868+ (

869+ D.fillSep

870+ ["I","cannot","find","a","package","named",D.red (D.fromPackage pkg) <> "."]

871+ )

872+ [ D.reflow $

873+ "I looked through https://package.elm-lang.org for packages with similar names\

874+ \ and found these:"

875+ , D.indent 4 $ D.dullyellow $ D.vcat $ map D.fromPackage suggestions

876+ , D.reflow $ "Maybe you want one of these instead?"

877+ ]

878+

879+ InstallUnknownPackageOffline pkg suggestions ->

880+ Help.docReport "UNKNOWN PACKAGE" Nothing

881+ (

882+ D.fillSep

883+ ["I","cannot","find","a","package","named",D.red (D.fromPackage pkg) <> "."]

884+ )

885+ [ D.reflow $

886+ "I could not connect to https://package.elm-lang.org though, so new packages may\

887+ \ have been published since I last updated my local cache of package names."

888+ , D.reflow $

889+ "Looking through the locally cached names, the closest ones are:"

890+ , D.indent 4 $ D.dullyellow $ D.vcat $ map D.fromPackage suggestions

891+ , D.reflow $ "Maybe you want one of these instead?"

892+ ]

893+

894+ InstallBadDetails details ->

895+ toDetailsReport details

896+

897+

898+

899+-- SOLVER

900+

901+

902+data Solver

903+ = SolverBadCacheData Pkg.Name V.Version

904+ | SolverBadHttpData Pkg.Name V.Version String

905+ | SolverBadHttp Pkg.Name V.Version Http.Error

906+

907+

908+toSolverReport :: Solver -> Help.Report

909+toSolverReport problem =

910+ case problem of

911+ SolverBadCacheData pkg vsn ->

912+ Help.report "PROBLEM SOLVING PACKAGE CONSTRAINTS" Nothing

913+ (

914+ "I need the elm.json of " ++ Pkg.toChars pkg ++ " " ++ V.toChars vsn ++ " to\

915+ \ help me search for a set of compatible packages. I had it cached locally, but\

916+ \ it looks like the file was corrupted!"

917+ )

918+ [ D.reflow $

919+ "I deleted the cached version, so the next run should download a fresh copy.\

920+ \ Hopefully that will get you unstuck, but it will not resolve the root\

921+ \ problem if a 3rd party tool is modifing cached files for some reason."

922+ ]

923+

924+ SolverBadHttpData pkg vsn url ->

925+ Help.report "PROBLEM SOLVING PACKAGE CONSTRAINTS" Nothing

926+ (

927+ "I need the elm.json of " ++ Pkg.toChars pkg ++ " " ++ V.toChars vsn ++ " to\

928+ \ help me search for a set of compatible packages, but I ran into corrupted\

929+ \ information from:"

930+ )

931+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

932+ , D.reflow $

933+ "Is something weird with your internet connection. We have gotten reports that\

934+ \ schools, businesses, airports, etc. sometimes intercept requests and add things\

935+ \ to the body or change its contents entirely. Could that be the problem?"

936+ ]

937+

938+ SolverBadHttp pkg vsn httpError ->

939+ toHttpErrorReport "PROBLEM SOLVING PACKAGE CONSTRAINTS" httpError $

940+ "I need the elm.json of " ++ Pkg.toChars pkg ++ " " ++ V.toChars vsn

941+ ++ " to help me search for a set of compatible packages"

942+

943+

944+

945+-- OUTLINE

946+

947+

948+data Outline

949+ = OutlineHasBadStructure (Decode.Error OutlineProblem)

950+ | OutlineHasMissingSrcDirs FilePath [FilePath]

951+ | OutlineHasDuplicateSrcDirs FilePath FilePath FilePath

952+ | OutlineNoPkgCore

953+ | OutlineNoAppCore

954+ | OutlineNoAppJson

955+

956+

957+data OutlineProblem

958+ = OP_BadType

959+ | OP_BadPkgName Row Col

960+ | OP_BadVersion Row Col

961+ | OP_BadConstraint C.Error

962+ | OP_BadModuleName Row Col

963+ | OP_BadModuleHeaderTooLong

964+ | OP_BadDependencyName Row Col

965+ | OP_BadLicense Json.String [Json.String]

966+ | OP_BadSummaryTooLong

967+ | OP_NoSrcDirs

968+

969+

970+toOutlineReport :: Outline -> Help.Report

971+toOutlineReport problem =

972+ case problem of

973+ OutlineHasBadStructure decodeError ->

974+ Json.toReport "elm.json" (Json.FailureToReport toOutlineProblemReport) decodeError $

975+ Json.ExplicitReason "I ran into a problem with your elm.json file."

976+

977+ OutlineHasMissingSrcDirs dir dirs ->

978+ case dirs of

979+ [] ->

980+ Help.report "MISSING SOURCE DIRECTORY" (Just "elm.json")

981+ "I need a valid elm.json file, but the \"source-directories\" field lists the following directory:"

982+ [ D.indent 4 $ D.red $ D.fromChars dir

983+ , D.reflow $

984+ "I cannot find it though. Is it missing? Is there a typo?"

985+ ]

986+

987+ _:_ ->

988+ Help.report "MISSING SOURCE DIRECTORIES" (Just "elm.json")

989+ "I need a valid elm.json file, but the \"source-directories\" field lists the following directories:"

990+ [ D.indent 4 $ D.vcat $

991+ map (D.red . D.fromChars) (dir:dirs)

992+ , D.reflow $

993+ "I cannot find them though. Are they missing? Are there typos?"

994+ ]

995+

996+ OutlineHasDuplicateSrcDirs canonicalDir dir1 dir2 ->

997+ if dir1 == dir2 then

998+ Help.report "REDUNDANT SOURCE DIRECTORIES" (Just "elm.json")

999+ "I need a valid elm.json file, but the \"source-directories\" field lists the same directory twice:"

1000+ [ D.indent 4 $ D.vcat $

1001+ map (D.red . D.fromChars) [dir1,dir2]

1002+ , D.reflow $

1003+ "Remove one of the entries!"

1004+ ]

1005+ else

1006+ Help.report "REDUNDANT SOURCE DIRECTORIES" (Just "elm.json")

1007+ "I need a valid elm.json file, but the \"source-directories\" field has some redundant directories:"

1008+ [ D.indent 4 $ D.vcat $

1009+ map (D.red . D.fromChars) [dir1,dir2]

1010+ , D.reflow $

1011+ "These are two different ways of refering to the same directory:"

1012+ , D.indent 4 $ D.dullyellow $ D.fromChars canonicalDir

1013+ , D.reflow $

1014+ "Remove one of the redundant entries from your \"source-directories\" field."

1015+ ]

1016+

1017+ OutlineNoPkgCore ->

1018+ Help.report "MISSING DEPENDENCY" (Just "elm.json")

1019+ "I need to see an \"elm/core\" dependency your elm.json file. The default imports\

1020+ \ of `List` and `Maybe` do not work without it."

1021+ [ D.reflow $

1022+ "If you modified your elm.json by hand, try to change it back! And if you are\

1023+ \ having trouble getting back to a working elm.json, it may be easier to find a\

1024+ \ working package and start fresh with their elm.json file."

1025+ ]

1026+

1027+ OutlineNoAppCore ->

1028+ Help.report "MISSING DEPENDENCY" (Just "elm.json")

1029+ "I need to see an \"elm/core\" dependency your elm.json file. The default imports\

1030+ \ of `List` and `Maybe` do not work without it."

1031+ [ D.reflow $

1032+ "If you modified your elm.json by hand, try to change it back! And if you are\

1033+ \ having trouble getting back to a working elm.json, it may be easier to delete it\

1034+ \ and use `elm init` to start fresh."

1035+ ]

1036+

1037+ OutlineNoAppJson ->

1038+ Help.report "MISSING DEPENDENCY" (Just "elm.json")

1039+ "I need to see an \"elm/json\" dependency your elm.json file. It helps me handle\

1040+ \ flags and ports."

1041+ [ D.reflow $

1042+ "If you modified your elm.json by hand, try to change it back! And if you are\

1043+ \ having trouble getting back to a working elm.json, it may be easier to delete it\

1044+ \ and use `elm init` to start fresh."

1045+ ]

1046+

1047+

1048+toOutlineProblemReport :: FilePath -> Code.Source -> Json.Context -> A.Region -> OutlineProblem -> Help.Report

1049+toOutlineProblemReport path source _ region problem =

1050+ let

1051+ toHighlight row col =

1052+ Just $ A.Region (A.Position row col) (A.Position row col)

1053+

1054+ toSnippet title highlight pair =

1055+ Help.jsonReport title (Just path) $

1056+ Code.toSnippet source region highlight pair

1057+ in

1058+ case problem of

1059+ OP_BadType ->

1060+ toSnippet "UNEXPECTED TYPE" Nothing

1061+ ( D.reflow $

1062+ "I got stuck while reading your elm.json file. I cannot handle a \"type\" like this:"

1063+ , D.fillSep

1064+ ["Try","changing","the","\"type\"","to"

1065+ ,D.green "\"application\"","or",D.green "\"package\"","instead."

1066+ ]

1067+ )

1068+

1069+ OP_BadPkgName row col ->

1070+ toSnippet "INVALID PACKAGE NAME" (toHighlight row col)

1071+ ( D.reflow $

1072+ "I got stuck while reading your elm.json file. I ran into trouble with the package name:"

1073+ , D.stack

1074+ [ D.fillSep

1075+ ["Package","names","are","always","written","as"

1076+ ,D.green "\"author/project\""

1077+ ,"so","I","am","expecting","to","see","something","like:"

1078+ ]

1079+ , D.dullyellow $ D.indent 4 $ D.vcat $

1080+ [ "\"mdgriffith/elm-ui\""

1081+ , "\"w0rm/elm-physics\""

1082+ , "\"Microsoft/elm-json-tree-view\""

1083+ , "\"FordLabs/elm-star-rating\""

1084+ , "\"1602/json-schema\""

1085+ ]

1086+ , D.reflow

1087+ "The author name should match your GitHub name exactly, and the project name\

1088+ \ needs to follow these rules:"

1089+ , D.indent 4 $ D.vcat $

1090+ [ "+--------------------------------------+-----------+-----------+"

1091+ , "| RULE | BAD | GOOD |"

1092+ , "+--------------------------------------+-----------+-----------+"

1093+ , "| only lower case, digits, and hyphens | elm-HTTP | elm-http |"

1094+ , "| no leading digits | 3D | elm-3d |"

1095+ , "| no non-ASCII characters | elm-bjørn | elm-bear |"

1096+ , "| no underscores | elm_ui | elm-ui |"

1097+ , "| no double hyphens | elm--hash | elm-hash |"

1098+ , "| no starting or ending hyphen | -elm-tar- | elm-tar |"

1099+ , "+--------------------------------------+-----------+-----------+"

1100+ ]

1101+ , D.toSimpleNote $

1102+ "These rules only apply to the project name, so you should never need\

1103+ \ to change your GitHub name!"

1104+ ]

1105+ )

1106+

1107+ OP_BadVersion row col ->

1108+ toSnippet "PROBLEM WITH VERSION" (toHighlight row col)

1109+ ( D.reflow $

1110+ "I got stuck while reading your elm.json file. I was expecting a version number here:"

1111+ , D.fillSep

1112+ ["I","need","something","like",D.green "\"1.0.0\"","or",D.green "\"2.0.4\""

1113+ ,"that","explicitly","states","all","three","numbers!"

1114+ ]

1115+ )

1116+

1117+ OP_BadConstraint constraintError ->

1118+ case constraintError of

1119+ C.BadFormat row col ->

1120+ toSnippet "PROBLEM WITH CONSTRAINT" (toHighlight row col)

1121+ ( D.reflow $

1122+ "I got stuck while reading your elm.json file. I do not understand this version constraint:"

1123+ , D.stack

1124+ [ D.fillSep

1125+ ["I","need","something","like",D.green "\"1.0.0 <= v < 2.0.0\""

1126+ ,"that","explicitly","lists","the","lower","and","upper","bounds."

1127+ ]

1128+ , D.toSimpleNote $

1129+ "The spaces in there are required! Taking them out will confuse me. Adding\

1130+ \ extra spaces confuses me too. I recommend starting with a valid example\

1131+ \ and just changing the version numbers."

1132+ ]

1133+ )

1134+

1135+ C.InvalidRange before after ->

1136+ if before == after then

1137+ toSnippet "PROBLEM WITH CONSTRAINT" Nothing

1138+ ( D.reflow $

1139+ "I got stuck while reading your elm.json file. I ran into an invalid version constraint:"

1140+ , D.fillSep

1141+ ["Elm","checks","that","all","package","APIs","follow","semantic","versioning,"

1142+ ,"so","it","is","best","to","use","wide","constraints.","I","recommend"

1143+ ,D.green $ "\"" <> D.fromVersion before <> " <= v < " <> D.fromVersion (V.bumpMajor after) <> "\""

1144+ ,"since","it","is","guaranteed","that","breaking","API","changes","cannot"

1145+ ,"happen","in","any","of","the","versions","in","that","range."

1146+ ]

1147+ )

1148+

1149+ else

1150+ toSnippet "PROBLEM WITH CONSTRAINT" Nothing

1151+ ( D.reflow $

1152+ "I got stuck while reading your elm.json file. I ran into an invalid version constraint:"

1153+ , D.fillSep

1154+ ["Maybe","you","want","something","like"

1155+ ,D.green $ "\"" <> D.fromVersion before <> " <= v < " <> D.fromVersion (V.bumpMajor before) <> "\""

1156+ ,"instead?","Elm","checks","that","all","package","APIs","follow","semantic"

1157+ ,"versioning,","so","it","is","guaranteed","that","breaking","API","changes"

1158+ ,"cannot","happen","in","any","of","the","versions","in","that","range."

1159+ ]

1160+ )

1161+

1162+ OP_BadModuleName row col ->

1163+ toSnippet "PROBLEM WITH MODULE NAME" (toHighlight row col)

1164+ ( D.reflow $

1165+ "I got stuck while reading your elm.json file. I was expecting a module name here:"

1166+ , D.fillSep

1167+ ["I","need","something","like",D.green "\"Html.Events\""

1168+ ,"or",D.green "\"Browser.Navigation\""

1169+ ,"where","each","segment","starts","with","a","capital"

1170+ ,"letter","and","the","segments","are","separated","by","dots."

1171+ ]

1172+ )

1173+

1174+ OP_BadModuleHeaderTooLong ->

1175+ toSnippet "HEADER TOO LONG" Nothing

1176+ ( D.reflow $

1177+ "I got stuck while reading your elm.json file. This section header is too long:"

1178+ , D.stack

1179+ [ D.fillSep

1180+ ["I","need","it","to","be"

1181+ ,D.green "under",D.green "20",D.green "bytes"

1182+ ,"so","it","renders","nicely","on","the","package","website!"

1183+ ]

1184+ , D.toSimpleNote

1185+ "I count the length in bytes, so using non-ASCII characters costs extra.\

1186+ \ Please report your case at https://github.com/elm/compiler/issues if this seems\

1187+ \ overly restrictive for your needs."

1188+ ]

1189+ )

1190+

1191+ OP_BadDependencyName row col ->

1192+ toSnippet "PROBLEM WITH DEPENDENCY NAME" (toHighlight row col)

1193+ ( D.reflow $

1194+ "I got stuck while reading your elm.json file. There is something wrong with this dependency name:"

1195+ , D.stack

1196+ [ D.fillSep

1197+ ["Package","names","always","include","the","name","of","the","author,"

1198+ ,"so","I","am","expecting","to","see","dependencies","like"

1199+ ,D.dullyellow "\"mdgriffith/elm-ui\"","and"

1200+ ,D.dullyellow "\"Microsoft/elm-json-tree-view\"" <> "."

1201+ ]

1202+ , D.fillSep $

1203+ ["I","generally","recommend","finding","the","package","you","want","on"

1204+ ,"the","package","website,","and","installing","it","with","the"

1205+ ,D.green "elm install","command!"

1206+ ]

1207+ ]

1208+ )

1209+

1210+ OP_BadLicense _ suggestions ->

1211+ toSnippet "UNKNOWN LICENSE" Nothing

1212+ ( D.reflow $

1213+ "I got stuck while reading your elm.json file. I do not know about this type of license:"

1214+ ,

1215+ D.stack

1216+ [ D.fillSep

1217+ ["Elm","packages","generally","use"

1218+ ,D.green "\"BSD-3-Clause\"","or",D.green "\"MIT\"" <> ","

1219+ ,"but","I","accept","any","OSI","approved","SPDX","license."

1220+ ,"Here","some","that","seem","close","to","what","you","wrote:"

1221+ ]

1222+ , D.indent 4 $ D.dullyellow $ D.vcat $ map (D.fromChars . Json.toChars) suggestions

1223+ , D.reflow $

1224+ "Check out https://spdx.org/licenses/ for the full list of options."

1225+ ]

1226+ )

1227+

1228+ OP_BadSummaryTooLong ->

1229+ toSnippet "SUMMARY TOO LONG" Nothing

1230+ ( D.reflow $

1231+ "I got stuck while reading your elm.json file. Your \"summary\" is too long:"

1232+ , D.stack

1233+ [ D.fillSep

1234+ ["I","need","it","to","be"

1235+ ,D.green "under",D.green "80",D.green "bytes"

1236+ ,"so","it","renders","nicely","on","the","package","website!"

1237+ ]

1238+ , D.toSimpleNote

1239+ "I count the length in bytes, so using non-ASCII characters costs extra.\

1240+ \ Please report your case at https://github.com/elm/compiler/issues if this seems\

1241+ \ overly restrictive for your needs."

1242+ ]

1243+ )

1244+

1245+ OP_NoSrcDirs ->

1246+ toSnippet "NO SOURCE DIRECTORIES" Nothing

1247+ ( D.reflow $

1248+ "I got stuck while reading your elm.json file. You do not have any \"source-directories\" listed here:"

1249+ , D.fillSep

1250+ ["I","need","something","like",D.green "[\"src\"]"

1251+ ,"so","I","know","where","to","look","for","your","modules!"

1252+ ]

1253+ )

1254+

1255+

1256+

1257+-- DETAILS

1258+

1259+

1260+data Details

1261+ = DetailsNoSolution

1262+ | DetailsNoOfflineSolution

1263+ | DetailsSolverProblem Solver

1264+ | DetailsBadElmInPkg C.Constraint

1265+ | DetailsBadElmInAppOutline V.Version

1266+ | DetailsHandEditedDependencies

1267+ | DetailsBadOutline Outline

1268+ | DetailsCannotGetRegistry RegistryProblem

1269+ | DetailsBadDeps FilePath [DetailsBadDep]

1270+

1271+

1272+data DetailsBadDep

1273+ = BD_BadDownload Pkg.Name V.Version PackageProblem

1274+ | BD_BadBuild Pkg.Name V.Version (Map.Map Pkg.Name V.Version)

1275+

1276+

1277+toDetailsReport :: Details -> Help.Report

1278+toDetailsReport details =

1279+ case details of

1280+ DetailsNoSolution ->

1281+ Help.report "INCOMPATIBLE DEPENDENCIES" (Just "elm.json")

1282+ "The dependencies in your elm.json are not compatible."

1283+ [ D.fillSep

1284+ ["Did","you","change","them","by","hand?","Try","to","change","it","back!"

1285+ ,"It","is","much","more","reliable","to","add","dependencies","with",D.green "elm install" <> "."

1286+ ]

1287+ , D.reflow $

1288+ "Please ask for help on the community forums if you try those paths and are still\

1289+ \ having problems!"

1290+ ]

1291+

1292+ DetailsNoOfflineSolution ->

1293+ Help.report "TROUBLE VERIFYING DEPENDENCIES" (Just "elm.json")

1294+ "I could not connect to https://package.elm-lang.org to get the latest list of\

1295+ \ packages, and I was unable to verify your dependencies with the information I\

1296+ \ have cached locally."

1297+ [ D.reflow $

1298+ "Are you able to connect to the internet? These dependencies may work once you\

1299+ \ get access to the registry!"

1300+ , D.toFancyNote

1301+ ["If","you","changed","your","dependencies","by","hand,","try","to","change","them","back!"

1302+ ,"It","is","much","more","reliable","to","add","dependencies","with",D.green "elm install" <> "."

1303+ ]

1304+ ]

1305+

1306+ DetailsSolverProblem solver ->

1307+ toSolverReport solver

1308+

1309+ DetailsBadElmInPkg constraint ->

1310+ Help.report "ELM VERSION MISMATCH" (Just "elm.json")

1311+ "Your elm.json says this package needs a version of Elm in this range:"

1312+ [ D.indent 4 $ D.dullyellow $ D.fromChars $ C.toChars constraint

1313+ , D.fillSep

1314+ [ "But", "you", "are", "using", "Elm"

1315+ , D.red (D.fromVersion V.compiler)

1316+ , "right", "now."

1317+ ]

1318+ ]

1319+

1320+ DetailsBadElmInAppOutline version ->

1321+ Help.report "ELM VERSION MISMATCH" (Just "elm.json")

1322+ "Your elm.json says this application needs a different version of Elm."

1323+ [ D.fillSep

1324+ [ "It", "requires"

1325+ , D.green (D.fromVersion version) <> ","

1326+ , "but", "you", "are", "using"

1327+ , D.red (D.fromVersion V.compiler)

1328+ , "right", "now."

1329+ ]

1330+ ]

1331+

1332+ DetailsHandEditedDependencies ->

1333+ Help.report "ERROR IN DEPENDENCIES" (Just "elm.json")

1334+ "It looks like the dependencies elm.json in were edited by hand (or by a 3rd\

1335+ \ party tool) leaving them in an invalid state."

1336+ [ D.fillSep

1337+ ["Try","to","change","them","back","to","what","they","were","before!"

1338+ ,"It","is","much","more","reliable","to","add","dependencies","with",D.green "elm install" <> "."

1339+ ]

1340+ , D.reflow $

1341+ "Please ask for help on the community forums if you try those paths and are still\

1342+ \ having problems!"

1343+ ]

1344+

1345+ DetailsBadOutline outline ->

1346+ toOutlineReport outline

1347+

1348+ DetailsCannotGetRegistry problem ->

1349+ toRegistryProblemReport "PROBLEM LOADING PACKAGE LIST" problem $

1350+ "I need the list of published packages to verify your dependencies"

1351+

1352+ DetailsBadDeps cacheDir deps ->

1353+ case List.sortOn toBadDepRank deps of

1354+ [] ->

1355+ Help.report "PROBLEM BUILDING DEPENDENCIES" Nothing

1356+ "I am not sure what is going wrong though."

1357+ [ D.reflow $

1358+ "I would try deleting the " ++ cacheDir ++ " and elm-stuff/ directories, then\

1359+ \ trying to build again. That will work if some cached files got corrupted\

1360+ \ somehow."

1361+ , D.reflow $

1362+ "If that does not work, go to https://elm-lang.org/community and ask for\

1363+ \ help. This is a weird case!"

1364+ ]

1365+

1366+ d:_ ->

1367+ case d of

1368+ BD_BadDownload pkg vsn packageProblem ->

1369+ toPackageProblemReport pkg vsn packageProblem

1370+

1371+ BD_BadBuild pkg vsn fingerprint ->

1372+ Help.report "PROBLEM BUILDING DEPENDENCIES" Nothing

1373+ "I ran into a compilation error when trying to build the following package:"

1374+ [ D.indent 4 $ D.red $ D.fromChars $ Pkg.toChars pkg ++ " " ++ V.toChars vsn

1375+ , D.reflow $

1376+ "This probably means it has package constraints that are too wide. It may be\

1377+ \ possible to tweak your elm.json to avoid the root problem as a stopgap. Head\

1378+ \ over to https://elm-lang.org/community to get help figuring out how to take\

1379+ \ this path!"

1380+ , D.toSimpleNote $

1381+ "To help with the root problem, please report this to the package author along\

1382+ \ with the following information:"

1383+ , D.indent 4 $ D.vcat $

1384+ map (\(p,v) -> D.fromChars $ Pkg.toChars p ++ " " ++ V.toChars v) $

1385+ Map.toList fingerprint

1386+ , D.reflow $

1387+ "If you want to help out even more, try building the package locally. That should\

1388+ \ give you much more specific information about why this package is failing to\

1389+ \ build, which will in turn make it easier for the package author to fix it!"

1390+ ]

1391+

1392+

1393+toBadDepRank :: DetailsBadDep -> Int -- lower is better

1394+toBadDepRank badDep =

1395+ case badDep of

1396+ BD_BadDownload _ _ _ -> 0

1397+ BD_BadBuild _ _ _ -> 1

1398+

1399+

1400+

1401+-- PACKAGE PROBLEM

1402+

1403+

1404+data PackageProblem

1405+ = PP_BadEndpointRequest Http.Error

1406+ | PP_BadEndpointContent String

1407+ | PP_BadArchiveRequest Http.Error

1408+ | PP_BadArchiveContent String

1409+ | PP_BadArchiveHash String String String

1410+

1411+

1412+toPackageProblemReport :: Pkg.Name -> V.Version -> PackageProblem -> Help.Report

1413+toPackageProblemReport pkg vsn problem =

1414+ let

1415+ thePackage =

1416+ Pkg.toChars pkg ++ " " ++ V.toChars vsn

1417+ in

1418+ case problem of

1419+ PP_BadEndpointRequest httpError ->

1420+ toHttpErrorReport "PROBLEM DOWNLOADING PACKAGE" httpError $

1421+ "I need to find the latest download link for " ++ thePackage

1422+

1423+ PP_BadEndpointContent url ->

1424+ Help.report "PROBLEM DOWNLOADING PACKAGE" Nothing

1425+ (

1426+ "I need to find the latest download link for " ++ thePackage ++ ", but I ran into corrupted information from:"

1427+ )

1428+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

1429+ , D.reflow $

1430+ "Is something weird with your internet connection. We have gotten reports that\

1431+ \ schools, businesses, airports, etc. sometimes intercept requests and add things\

1432+ \ to the body or change its contents entirely. Could that be the problem?"

1433+ ]

1434+

1435+ PP_BadArchiveRequest httpError ->

1436+ toHttpErrorReport "PROBLEM DOWNLOADING PACKAGE" httpError $

1437+ "I was trying to download the source code for " ++ thePackage

1438+

1439+ PP_BadArchiveContent url ->

1440+ Help.report "PROBLEM DOWNLOADING PACKAGE" Nothing

1441+ (

1442+ "I downloaded the source code for " ++ thePackage ++ " from:"

1443+ )

1444+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

1445+ , D.reflow $

1446+ "But I was unable to unzip the data. Maybe there is something weird with\

1447+ \ your internet connection. We have gotten reports that schools, businesses,\

1448+ \ airports, etc. sometimes intercept requests and add things to the body or\

1449+ \ change its contents entirely. Could that be the problem?"

1450+ ]

1451+

1452+ PP_BadArchiveHash url expectedHash actualHash ->

1453+ Help.report "CORRUPT PACKAGE DATA" Nothing

1454+ (

1455+ "I downloaded the source code for " ++ thePackage ++ " from:"

1456+ )

1457+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

1458+ , D.reflow "But it looks like the hash of the archive has changed since publication:"

1459+ , D.vcat $ map D.fromChars $

1460+ [ " Expected: " ++ expectedHash

1461+ , " Actual: " ++ actualHash

1462+ ]

1463+ , D.reflow $

1464+ "This usually means that the package author moved the version\

1465+ \ tag, so report it to them and see if that is the issue. Folks\

1466+ \ on Elm slack can probably help as well."

1467+ ]

1468+

1469+

1470+

1471+-- REGISTRY PROBLEM

1472+

1473+

1474+data RegistryProblem

1475+ = RP_Http Http.Error

1476+ | RP_Data String BS.ByteString

1477+

1478+

1479+toRegistryProblemReport :: String -> RegistryProblem -> String -> Help.Report

1480+toRegistryProblemReport title problem context =

1481+ case problem of

1482+ RP_Http err ->

1483+ toHttpErrorReport title err context

1484+

1485+ RP_Data url body ->

1486+ Help.report title Nothing (context ++ ", so I fetched:")

1487+ [ D.indent 4 $ D.dullyellow $ D.fromChars url

1488+ , D.reflow $

1489+ "I got the data back, but it was not what I was expecting. The response\

1490+ \ body contains " ++ show (BS.length body) ++ " bytes. Here is the "

1491+ ++ if BS.length body <= 76 then "whole thing:" else "beginning:"

1492+ , D.indent 4 $ D.dullyellow $ D.fromChars $

1493+ if BS.length body <= 76

1494+ then BS_UTF8.toString body

1495+ else take 73 (BS_UTF8.toString body) ++ "..."

1496+ , D.reflow $

1497+ "Does this error keep showing up? Maybe there is something weird with your\

1498+ \ internet connection. We have gotten reports that schools, businesses,\

1499+ \ airports, etc. sometimes intercept requests and add things to the body\

1500+ \ or change its contents entirely. Could that be the problem?"

1501+ ]

1502+

1503+

1504+toHttpErrorReport :: String -> Http.Error -> String -> Help.Report

1505+toHttpErrorReport title err context =

1506+ let

1507+ toHttpReport intro url details =

1508+ Help.report title Nothing intro $

1509+ D.indent 4 (D.dullyellow (D.fromChars url)) : details

1510+ in

1511+ case err of

1512+ Http.BadUrl url reason ->

1513+ toHttpReport (context ++ ", so I wanted to fetch:") url

1514+ [ D.reflow $ "But my HTTP library is saying this is not a valid URL. It is saying:"

1515+ , D.indent 4 $ D.fromChars reason

1516+ , D.reflow $

1517+ "This may indicate that there is some problem in the compiler, so please open an\

1518+ \ issue at https://github.com/elm/compiler/issues listing your operating system, Elm\

1519+ \ version, the command you ran, the terminal output, and any additional information\

1520+ \ that might help others reproduce the error."

1521+ ]

1522+

1523+ Http.BadHttp url httpExceptionContent ->

1524+ case httpExceptionContent of

1525+ HTTP.StatusCodeException response body ->

1526+ let

1527+ (HTTP.Status code message) = HTTP.responseStatus response

1528+ in

1529+ toHttpReport (context ++ ", so I tried to fetch:") url

1530+ [ D.fillSep $

1531+ ["But","it","came","back","as",D.red (D.fromInt code)]

1532+ ++ map D.fromChars (words (BS_UTF8.toString message))

1533+ , D.indent 4 $ D.reflow $ BS_UTF8.toString body

1534+ , D.reflow $

1535+ "This may mean some online endpoint changed in an unexpected way, so if does not\

1536+ \ seem like something on your side is causing this (e.g. firewall) please report\

1537+ \ this to https://github.com/elm/compiler/issues with your operating system, Elm\

1538+ \ version, the command you ran, the terminal output, and any additional information\

1539+ \ that can help others reproduce the error!"

1540+ ]

1541+

1542+ HTTP.TooManyRedirects responses ->

1543+ toHttpReport (context ++ ", so I tried to fetch:") url

1544+ [ D.reflow $ "But I gave up after following these " ++ show (length responses) ++ " redirects:"

1545+ , D.indent 4 $ D.vcat $ map toRedirectDoc responses

1546+ , D.reflow $

1547+ "Is it possible that your internet connection intercepts certain requests? That\

1548+ \ sometimes causes problems for folks in schools, businesses, airports, hotels,\

1549+ \ and certain countries. Try asking for help locally or in a community forum!"

1550+ ]

1551+

1552+ otherException ->

1553+ toHttpReport (context ++ ", so I tried to fetch:") url

1554+ [ D.reflow $ "But my HTTP library is giving me the following error message:"

1555+ , D.indent 4 $ D.fromChars (show otherException)

1556+ , D.reflow $

1557+ "Are you somewhere with a slow internet connection? Or no internet?\

1558+ \ Does the link I am trying to fetch work in your browser? Maybe the\

1559+ \ site is down? Does your internet connection have a firewall that\

1560+ \ blocks certain domains? It is usually something like that!"

1561+ ]

1562+

1563+ Http.BadMystery url someException ->

1564+ toHttpReport (context ++ ", so I tried to fetch:") url

1565+ [ D.reflow $ "But I ran into something weird! I was able to extract this error message:"

1566+ , D.indent 4 $ D.fromChars (show someException)

1567+ , D.reflow $

1568+ "Is it possible that your internet connection intercepts certain requests? That\

1569+ \ sometimes causes problems for folks in schools, businesses, airports, hotels,\

1570+ \ and certain countries. Try asking for help locally or in a community forum!"

1571+ ]

1572+

1573+

1574+toRedirectDoc :: HTTP.Response body -> D.Doc

1575+toRedirectDoc response =

1576+ let

1577+ (HTTP.Status code message) = HTTP.responseStatus response

1578+ in

1579+ case List.lookup HTTP.hLocation (HTTP.responseHeaders response) of

1580+ Just loc -> D.red (D.fromInt code) <> " - " <> D.fromChars (BS_UTF8.toString loc)

1581+ Nothing -> D.red (D.fromInt code) <> " - " <> D.fromChars (BS_UTF8.toString message)

1582+

1583+

1584+

1585+-- MAKE

1586+

1587+

1588+data Make

1589+ = MakeNoOutline

1590+ | MakeCannotOptimizeAndDebug

1591+ | MakeBadDetails Details

1592+ | MakeAppNeedsFileNames

1593+ | MakePkgNeedsExposing

1594+ | MakeMultipleFilesIntoHtml

1595+ | MakeNoMain

1596+ | MakeNonMainFilesIntoJavaScript ModuleName.Raw [ModuleName.Raw]

1597+ | MakeCannotBuild BuildProblem

1598+ | MakeBadGenerate Generate

1599+

1600+

1601+makeToReport :: Make -> Help.Report

1602+makeToReport make =

1603+ case make of

1604+ MakeNoOutline ->

1605+ Help.report "NO elm.json FILE" Nothing

1606+ "It looks like you are starting a new Elm project. Very exciting! Try running:"

1607+ [ D.indent 4 $ D.green $ "elm init"

1608+ , D.reflow $

1609+ "It will help you get set up. It is really simple!"

1610+ ]

1611+

1612+ MakeCannotOptimizeAndDebug ->

1613+ Help.docReport "CLASHING FLAGS" Nothing

1614+ ( D.fillSep

1615+ ["I","cannot","compile","with",D.red "--optimize","and"

1616+ ,D.red "--debug","at","the","same","time."

1617+ ]

1618+ )

1619+ [ D.reflow

1620+ "I need to take away information to optimize things, and I need to\

1621+ \ add information to add the debugger. It is impossible to do both\

1622+ \ at once though! Pick just one of those flags and it should work!"

1623+ ]

1624+

1625+ MakeBadDetails detailsProblem ->

1626+ toDetailsReport detailsProblem

1627+

1628+ MakeAppNeedsFileNames ->

1629+ Help.report "NO INPUT" Nothing

1630+ "What should I make though? I need specific files like:"

1631+ [ D.vcat

1632+ [ D.indent 4 $ D.green "elm make src/Main.elm"

1633+ , D.indent 4 $ D.green "elm make src/This.elm src/That.elm"

1634+ ]

1635+ , D.reflow $

1636+ "I recommend reading through https://guide.elm-lang.org for guidance on what to\

1637+ \ actually put in those files!"

1638+ ]

1639+

1640+ MakePkgNeedsExposing ->

1641+ Help.report "NO INPUT" Nothing

1642+ "What should I make though? I need specific files like:"

1643+ [ D.vcat

1644+ [ D.indent 4 $ D.green "elm make src/Main.elm"

1645+ , D.indent 4 $ D.green "elm make src/This.elm src/That.elm"

1646+ ]

1647+ , D.reflow $

1648+ "You can also entries to the \"exposed-modules\" list in your elm.json file, and\

1649+ \ I will try to compile the relevant files."

1650+ ]

1651+

1652+ MakeMultipleFilesIntoHtml ->

1653+ Help.report "TOO MANY FILES" Nothing

1654+ (

1655+ "When producing an HTML file, I can only handle one file."

1656+ )

1657+ [ D.fillSep

1658+ ["Switch","to",D.dullyellow "--output=/dev/null","if","you","just","want"

1659+ ,"to","get","compile","errors.","This","skips","the","code","gen","phase,"

1660+ ,"so","it","can","be","a","bit","faster","than","other","options","sometimes."

1661+ ]

1662+ , D.fillSep

1663+ ["Switch","to",D.dullyellow "--output=elm.js","if","you","want","multiple"

1664+ ,"`main`","values","available","in","a","single","JavaScript","file.","Then"

1665+ ,"you","can","make","your","own","customized","HTML","file","that","embeds"

1666+ ,"multiple","Elm","nodes.","The","generated","JavaScript","also","shares"

1667+ ,"dependencies","between","modules,","so","it","should","be","smaller","than"

1668+ ,"compiling","each","module","separately."

1669+ ]

1670+ ]

1671+

1672+ MakeNoMain ->

1673+ Help.report "NO MAIN" Nothing

1674+ (

1675+ "When producing an HTML file, I require that the given file has a `main` value.\

1676+ \ That way I have something to show on screen!"

1677+ )

1678+ [ D.reflow $

1679+ "Try adding a `main` value to your file? Or if you just want to verify that this\

1680+ \ module compiles, switch to --output=/dev/null to skip the code gen phase\

1681+ \ altogether."

1682+ , D.toSimpleNote $

1683+ "Adding a `main` value can be as brief as adding something like this:"

1684+ , D.vcat

1685+ [ D.fillSep [D.cyan "import","Html"]

1686+ , ""

1687+ , D.fillSep [D.green "main","="]

1688+ , D.indent 2 $ D.fillSep [D.cyan "Html" <> ".text",D.dullyellow "\"Hello!\""]

1689+ ]

1690+ , D.reflow $

1691+ "From there I can create an HTML file that says \"Hello!\" on screen. I recommend\

1692+ \ looking through https://guide.elm-lang.org for more guidance on how to fill in\

1693+ \ the `main` value."

1694+ ]

1695+

1696+ MakeNonMainFilesIntoJavaScript m ms ->

1697+ case ms of

1698+ [] ->

1699+ Help.report "NO MAIN" Nothing

1700+ (

1701+ "When producing a JS file, I require that the given file has a `main` value. That\

1702+ \ way Elm." ++ ModuleName.toChars m ++ ".init() is definitely defined in the\

1703+ \ resulting file!"

1704+ )

1705+ [ D.reflow $

1706+ "Try adding a `main` value to your file? Or if you just want to verify that this\

1707+ \ module compiles, switch to --output=/dev/null to skip the code gen phase\

1708+ \ altogether."

1709+ , D.toSimpleNote $

1710+ "Adding a `main` value can be as brief as adding something like this:"

1711+ , D.vcat

1712+ [ D.fillSep [D.cyan "import","Html"]

1713+ , ""

1714+ , D.fillSep [D.green "main","="]

1715+ , D.indent 2 $ D.fillSep [D.cyan "Html" <> ".text",D.dullyellow "\"Hello!\""]

1716+ ]

1717+ , D.reflow $

1718+ "Or use https://package.elm-lang.org/packages/elm/core/latest/Platform#worker to\

1719+ \ make a `main` with no user interface."

1720+ ]

1721+

1722+ _:_ ->

1723+ Help.report "NO MAIN" Nothing

1724+ (

1725+ "When producing a JS file, I require that given files all have `main` values.\

1726+ \ That way functions like Elm." ++ ModuleName.toChars m ++ ".init() are\

1727+ \ definitely defined in the resulting file. I am missing `main` values in:"

1728+ )

1729+ [ D.indent 4 $ D.red $ D.vcat $ map D.fromName (m:ms)

1730+ , D.reflow $

1731+ "Try adding a `main` value to them? Or if you just want to verify that these\

1732+ \ modules compile, switch to --output=/dev/null to skip the code gen phase\

1733+ \ altogether."

1734+ , D.toSimpleNote $

1735+ "Adding a `main` value can be as brief as adding something like this:"

1736+ , D.vcat

1737+ [ D.fillSep [D.cyan "import","Html"]

1738+ , ""

1739+ , D.fillSep [D.green "main","="]

1740+ , D.indent 2 $ D.fillSep [D.cyan "Html" <> ".text",D.dullyellow "\"Hello!\""]

1741+ ]

1742+ , D.reflow $

1743+ "Or use https://package.elm-lang.org/packages/elm/core/latest/Platform#worker to\

1744+ \ make a `main` with no user interface."

1745+ ]

1746+

1747+ MakeCannotBuild buildProblem ->

1748+ toBuildProblemReport buildProblem

1749+

1750+ MakeBadGenerate generateProblem ->

1751+ toGenerateReport generateProblem

1752+

1753+

1754+

1755+-- BUILD PROBLEM

1756+

1757+

1758+data BuildProblem

1759+ = BuildBadModules FilePath Error.Module [Error.Module]

1760+ | BuildProjectProblem BuildProjectProblem

1761+

1762+

1763+data BuildProjectProblem

1764+ = BP_PathUnknown FilePath

1765+ | BP_WithBadExtension FilePath

1766+ | BP_WithAmbiguousSrcDir FilePath FilePath FilePath

1767+ | BP_MainPathDuplicate FilePath FilePath

1768+ | BP_RootNameDuplicate ModuleName.Raw FilePath FilePath

1769+ | BP_RootNameInvalid FilePath FilePath [String]

1770+ | BP_CannotLoadDependencies

1771+ | BP_Cycle ModuleName.Raw [ModuleName.Raw]

1772+ | BP_MissingExposed (NE.List (ModuleName.Raw, Import.Problem))

1773+

1774+

1775+toBuildProblemReport :: BuildProblem -> Help.Report

1776+toBuildProblemReport problem =

1777+ case problem of

1778+ BuildBadModules root e es ->

1779+ Help.compilerReport root e es

1780+

1781+ BuildProjectProblem projectProblem ->

1782+ toProjectProblemReport projectProblem

1783+

1784+

1785+toProjectProblemReport :: BuildProjectProblem -> Help.Report

1786+toProjectProblemReport projectProblem =

1787+ case projectProblem of

1788+ BP_PathUnknown path ->

1789+ Help.report "FILE NOT FOUND" Nothing

1790+ "I cannot find this file:"

1791+ [ D.indent 4 $ D.red $ D.fromChars path

1792+ , D.reflow $ "Is there a typo?"

1793+ , D.toSimpleNote $

1794+ "If you are just getting started, try working through the examples in the\

1795+ \ official guide https://guide.elm-lang.org to get an idea of the kinds of things\

1796+ \ that typically go in a src/Main.elm file."

1797+ ]

1798+

1799+ BP_WithBadExtension path ->

1800+ Help.report "UNEXPECTED FILE EXTENSION" Nothing

1801+ "I can only compile Elm files (with a .elm extension) but you want me to compile:"

1802+ [ D.indent 4 $ D.red $ D.fromChars path

1803+ , D.reflow $ "Is there a typo? Can the file extension be changed?"

1804+ ]

1805+

1806+ BP_WithAmbiguousSrcDir path srcDir1 srcDir2 ->

1807+ Help.report "CONFUSING FILE" Nothing

1808+ "I am getting confused when I try to compile this file:"

1809+ [ D.indent 4 $ D.red $ D.fromChars path

1810+ , D.reflow $

1811+ "I always check if files appear in any of the \"source-directories\" listed in\

1812+ \ your elm.json to see if there might be some cached information about them. That\

1813+ \ can help me compile faster! But in this case, it looks like this file may be in\

1814+ \ either of these directories:"

1815+ , D.indent 4 $ D.red $ D.vcat $ map D.fromChars [srcDir1,srcDir2]

1816+ , D.reflow $

1817+ "Try to make it so no source directory contains another source directory!"

1818+ ]

1819+

1820+ BP_MainPathDuplicate path1 path2 ->

1821+ Help.report "CONFUSING FILES" Nothing

1822+ "You are telling me to compile these two files:"

1823+ [ D.indent 4 $ D.red $ D.vcat $ map D.fromChars [ path1, path2 ]

1824+ , D.reflow $

1825+ if path1 == path2 then

1826+ "Why are you telling me twice? Is something weird going on with a script?\

1827+ \ I figured I would let you know about it just in case something is wrong.\

1828+ \ Only list it once and you should be all set!"

1829+ else

1830+ "But seem to be the same file though... It makes me think something tricky is\

1831+ \ going on with symlinks in your project, so I figured I would let you know\

1832+ \ about it just in case. Remove one of these files from your command to get\

1833+ \ unstuck!"

1834+ ]

1835+

1836+ BP_RootNameDuplicate name outsidePath otherPath ->

1837+ Help.report "MODULE NAME CLASH" Nothing

1838+ "These two files are causing a module name clash:"

1839+ [ D.indent 4 $ D.red $ D.vcat $ map D.fromChars [ outsidePath, otherPath ]

1840+ , D.reflow $

1841+ "They both say `module " ++ ModuleName.toChars name ++ " exposing (..)` up\

1842+ \ at the top, but they cannot have the same name!"

1843+ , D.reflow $

1844+ "Try changing to a different module name in one of them!"

1845+ ]

1846+

1847+ BP_RootNameInvalid givenPath srcDir _ ->

1848+ Help.report "UNEXPECTED FILE NAME" Nothing

1849+ "I am having trouble with this file name:"

1850+ [ D.indent 4 $ D.red $ D.fromChars givenPath

1851+ , D.reflow $

1852+ "I found it in your " ++ FP.addTrailingPathSeparator srcDir ++ " directory\

1853+ \ which is good, but I expect all of the files in there to use the following\

1854+ \ module naming convention:"

1855+ , toModuleNameConventionTable srcDir [ "Main", "HomePage", "Http.Helpers" ]

1856+ , D.reflow $

1857+ "Notice that the names always start with capital letters! Can you make your file\

1858+ \ use this naming convention?"

1859+ , D.toSimpleNote $

1860+ "Having a strict naming convention like this makes it a lot easier to find\

1861+ \ things in large projects. If you see a module imported, you know where to look\

1862+ \ for the corresponding file every time!"

1863+ ]

1864+

1865+ BP_CannotLoadDependencies ->

1866+ corruptCacheReport

1867+

1868+ BP_Cycle name names ->

1869+ Help.report "IMPORT CYCLE" Nothing

1870+ "Your module imports form a cycle:"

1871+ [ D.cycle 4 name names

1872+ , D.reflow $

1873+ "Learn more about why this is disallowed and how to break cycles here:"

1874+ ++ D.makeLink "import-cycles"

1875+ ]

1876+

1877+ BP_MissingExposed (NE.List (name, problem) _) ->

1878+ case problem of

1879+ Import.NotFound ->

1880+ Help.report "MISSING MODULE" (Just "elm.json")

1881+ "The \"exposed-modules\" of your elm.json lists the following module:"

1882+ [ D.indent 4 $ D.red $ D.fromName name

1883+ , D.reflow $

1884+ "But I cannot find it in your src/ directory. Is there a typo? Was it renamed?"

1885+ ]

1886+

1887+ Import.Ambiguous _ _ pkg _ ->

1888+ Help.report "AMBIGUOUS MODULE NAME" (Just "elm.json")

1889+ "The \"exposed-modules\" of your elm.json lists the following module:"

1890+ [ D.indent 4 $ D.red $ D.fromName name

1891+ , D.reflow $

1892+ "But a module from " ++ Pkg.toChars pkg ++ " already uses that name. Try\

1893+ \ choosing a different name for your local file."

1894+ ]

1895+

1896+ Import.AmbiguousLocal path1 path2 paths ->

1897+ Help.report "AMBIGUOUS MODULE NAME" (Just "elm.json")

1898+ "The \"exposed-modules\" of your elm.json lists the following module:"

1899+ [ D.indent 4 $ D.red $ D.fromName name

1900+ , D.reflow $

1901+ "But I found multiple files with that name:"

1902+ , D.dullyellow $ D.indent 4 $ D.vcat $

1903+ map D.fromChars (path1:path2:paths)

1904+ , D.reflow $

1905+ "Change the module names to be distinct!"

1906+ ]

1907+

1908+ Import.AmbiguousForeign _ _ _ ->

1909+ Help.report "MISSING MODULE" (Just "elm.json")

1910+ "The \"exposed-modules\" of your elm.json lists the following module:"

1911+ [ D.indent 4 $ D.red $ D.fromName name

1912+ , D.reflow $

1913+ "But I cannot find it in your src/ directory. Is there a typo? Was it renamed?"

1914+ , D.toSimpleNote $

1915+ "It is not possible to \"re-export\" modules from other packages. You can only\

1916+ \ expose modules that you define in your own code."

1917+ ]

1918+

1919+

1920+toModuleNameConventionTable :: FilePath -> [String] -> D.Doc

1921+toModuleNameConventionTable srcDir names =

1922+ let

1923+ toPair name =

1924+ ( name

1925+ , srcDir </> map (\c -> if c == '.' then FP.pathSeparator else c) name <.> "elm"

1926+ )

1927+

1928+ namePairs = map toPair names

1929+ nameWidth = maximum (11 : map (length . fst) namePairs)

1930+ pathWidth = maximum ( 9 : map (length . snd) namePairs)

1931+

1932+ padded width str =

1933+ str ++ replicate (width - length str) ' '

1934+

1935+ toRow (name, path) =

1936+ D.fromChars $

1937+ "| " ++ padded nameWidth name ++ " | " ++ padded pathWidth path ++ " |"

1938+

1939+ bar =

1940+ D.fromChars $

1941+ "+-" ++ replicate nameWidth '-' ++ "-+-" ++ replicate pathWidth '-' ++ "-+"

1942+ in

1943+ D.indent 4 $ D.vcat $

1944+ [ bar, toRow ("Module Name", "File Path"), bar ] ++ map toRow namePairs ++ [ bar ]

1945+

1946+

1947+

1948+-- GENERATE

1949+

1950+

1951+data Generate

1952+ = GenerateCannotLoadArtifacts

1953+ | GenerateCannotOptimizeDebugValues ModuleName.Raw [ModuleName.Raw]

1954+

1955+

1956+toGenerateReport :: Generate -> Help.Report

1957+toGenerateReport problem =

1958+ case problem of

1959+ GenerateCannotLoadArtifacts ->

1960+ corruptCacheReport

1961+

1962+ GenerateCannotOptimizeDebugValues m ms ->

1963+ Help.report "DEBUG REMNANTS" Nothing

1964+ "There are uses of the `Debug` module in the following modules:"

1965+ [ D.indent 4 $ D.red $ D.vcat $ map (D.fromChars . ModuleName.toChars) (m:ms)

1966+ , D.reflow "But the --optimize flag only works if all `Debug` functions are removed!"

1967+ , D.toSimpleNote $

1968+ "The issue is that --optimize strips out info needed by `Debug` functions.\

1969+ \ Here are two examples:"

1970+ , D.indent 4 $ D.reflow $

1971+ "(1) It shortens record field names. This makes the generated JavaScript\

1972+ \ smaller, but `Debug.toString` cannot know the real field names anymore."

1973+ , D.indent 4 $ D.reflow $

1974+ "(2) Values like `type Height = Height Float` are unboxed. This reduces\

1975+ \ allocation, but it also means that `Debug.toString` cannot tell if it is\

1976+ \ looking at a `Height` or `Float` value."

1977+ , D.reflow $

1978+ "There are a few other cases like that, and it will be much worse once we start\

1979+ \ inlining code. That optimization could move `Debug.log` and `Debug.todo` calls,\

1980+ \ resulting in unpredictable behavior. I hope that clarifies why this restriction\

1981+ \ exists!"

1982+ ]

1983+

1984+

1985+

1986+-- CORRUPT CACHE

1987+

1988+

1989+corruptCacheReport :: Help.Report

1990+corruptCacheReport =

1991+ Help.report "CORRUPT CACHE" Nothing

1992+ "It looks like some of the information cached in elm-stuff/ has been corrupted."

1993+ [ D.reflow $

1994+ "Try deleting your elm-stuff/ directory to get unstuck."

1995+ , D.toSimpleNote $

1996+ "This almost certainly means that a 3rd party tool (or editor plugin) is\

1997+ \ causing problems your the elm-stuff/ directory. Try disabling 3rd party tools\

1998+ \ one by one until you figure out which it is!"

1999+ ]

2000+

2001+

2002+

2003+-- REACTOR

2004+

2005+

2006+data Reactor

2007+ = ReactorNoOutline

2008+ | ReactorBadDetails Details

2009+ | ReactorBadBuild BuildProblem

2010+ | ReactorBadGenerate Generate

2011+

2012+

2013+reactorToReport :: Reactor -> Help.Report

2014+reactorToReport problem =

2015+ case problem of

2016+ ReactorNoOutline ->

2017+ Help.report "NEW PROJECT?" Nothing

2018+ "Are you trying to start a new project? Try this command in the terminal:"

2019+ [ D.indent 4 $ D.green "elm init"

2020+ , D.reflow "It will help you get started!"

2021+ ]

2022+

2023+ ReactorBadDetails details ->

2024+ toDetailsReport details

2025+

2026+ ReactorBadBuild buildProblem ->

2027+ toBuildProblemReport buildProblem

2028+

2029+ ReactorBadGenerate generate ->

2030+ toGenerateReport generate

2031+

2032+

2033+

2034+-- REPL

2035+

2036+

2037+data Repl

2038+ = ReplBadDetails Details

2039+ | ReplBadInput BS.ByteString Error.Error

2040+ | ReplBadLocalDeps FilePath Error.Module [Error.Module]

2041+ | ReplProjectProblem BuildProjectProblem

2042+ | ReplBadGenerate Generate

2043+ | ReplBadCache

2044+ | ReplBlocked

2045+

2046+

2047+replToReport :: Repl -> Help.Report

2048+replToReport problem =

2049+ case problem of

2050+ ReplBadDetails details ->

2051+ toDetailsReport details

2052+

2053+ ReplBadInput source err ->

2054+ Help.compilerReport "/" (Error.Module N.replModule "REPL" File.zeroTime source err) []

2055+

2056+ ReplBadLocalDeps root e es ->

2057+ Help.compilerReport root e es

2058+

2059+ ReplProjectProblem projectProblem ->

2060+ toProjectProblemReport projectProblem

2061+

2062+ ReplBadGenerate generate ->

2063+ toGenerateReport generate

2064+

2065+ ReplBadCache ->

2066+ corruptCacheReport

2067+

2068+ ReplBlocked ->

2069+ corruptCacheReport

builder/src/Reporting/Exit/Help.hsnew file+136

@@ -0,0 +1,136 @@

1+{-# LANGUAGE OverloadedStrings #-}

2+module Reporting.Exit.Help

3+ ( Report

4+ , report

5+ , docReport

6+ , jsonReport

7+ , compilerReport

8+ , reportToDoc

9+ , reportToJson

10+ , toString

11+ , toStdout

12+ , toStderr

13+ )

14+ where

15+

16+

17+import GHC.IO.Handle (hIsTerminalDevice)

18+import System.IO (Handle, hPutStr, stderr, stdout)

19+

20+import qualified Json.Encode as E

21+import Json.Encode ((==>))

22+import Reporting.Doc ((<+>))

23+import qualified Reporting.Doc as D

24+import qualified Reporting.Error as Error

25+

26+

27+

28+-- REPORT

29+

30+

31+data Report

32+ = CompilerReport FilePath Error.Module [Error.Module]

33+ | Report

34+ { _title :: String

35+ , _path :: Maybe FilePath

36+ , _message :: D.Doc

37+ }

38+

39+

40+report :: String -> Maybe FilePath -> String -> [D.Doc] -> Report

41+report title path startString others =

42+ Report title path $ D.stack (D.reflow startString:others)

43+

44+

45+docReport :: String -> Maybe FilePath -> D.Doc -> [D.Doc] -> Report

46+docReport title path startDoc others =

47+ Report title path $ D.stack (startDoc:others)

48+

49+

50+jsonReport :: String -> Maybe FilePath -> D.Doc -> Report

51+jsonReport =

52+ Report

53+

54+

55+compilerReport :: FilePath -> Error.Module -> [Error.Module] -> Report

56+compilerReport =

57+ CompilerReport

58+

59+

60+

61+-- TO DOC

62+

63+

64+reportToDoc :: Report -> D.Doc

65+reportToDoc report_ =

66+ case report_ of

67+ CompilerReport root e es ->

68+ Error.toDoc root e es

69+

70+ Report title maybePath message ->

71+ let

72+ makeDashes n =

73+ replicate (max 1 (80 - n)) '-'

74+

75+ errorBarEnd =

76+ case maybePath of

77+ Nothing ->

78+ makeDashes (4 + length title)

79+

80+ Just path ->

81+ makeDashes (5 + length title + length path) ++ " " ++ path

82+

83+ errorBar =

84+ D.dullcyan $

85+ "--" <+> D.fromChars title <+> D.fromChars errorBarEnd

86+ in

87+ D.stack [errorBar, message, ""]

88+

89+

90+

91+-- TO JSON

92+

93+

94+reportToJson :: Report -> E.Value

95+reportToJson report_ =

96+ case report_ of

97+ CompilerReport _ e es ->

98+ E.object

99+ [ "type" ==> E.chars "compile-errors"

100+ , "errors" ==> E.list Error.toJson (e:es)

101+ ]

102+

103+ Report title maybePath message ->

104+ E.object

105+ [ "type" ==> E.chars "error"

106+ , "path" ==> maybe E.null E.chars maybePath

107+ , "title" ==> E.chars title

108+ , "message" ==> D.encode message

109+ ]

110+

111+

112+

113+-- OUTPUT

114+

115+

116+toString :: D.Doc -> String

117+toString =

118+ D.toString

119+

120+

121+toStdout :: D.Doc -> IO ()

122+toStdout doc =

123+ toHandle stdout doc

124+

125+

126+toStderr :: D.Doc -> IO ()

127+toStderr doc =

128+ toHandle stderr doc

129+

130+

131+toHandle :: Handle -> D.Doc -> IO ()

132+toHandle handle doc =

133+ do isTerminal <- hIsTerminalDevice handle

134+ if isTerminal

135+ then D.toAnsi handle doc

136+ else hPutStr handle (toString doc)

builder/src/Reporting/Task.hsnew file+114

@@ -0,0 +1,114 @@

1+{-# LANGUAGE Rank2Types #-}

2+module Reporting.Task

3+ ( Task

4+ , run

5+ , throw

6+ , mapError

7+ --

8+ , io

9+ , mio

10+ , eio

11+ )

12+ where

13+

14+

15+

16+-- TASKS

17+

18+

19+newtype Task x a =

20+ Task

21+ (

22+ forall result. (a -> IO result) -> (x -> IO result) -> IO result

23+ )

24+

25+

26+run :: Task x a -> IO (Either x a)

27+run (Task task) =

28+ task (return . Right) (return . Left)

29+

30+

31+throw :: x -> Task x a

32+throw x =

33+ Task $ \_ err -> err x

34+

35+

36+mapError :: (x -> y) -> Task x a -> Task y a

37+mapError func (Task task) =

38+ Task $ \ok err ->

39+ task ok (err . func)

40+

41+

42+

43+-- IO

44+

45+

46+{-# INLINE io #-}

47+io :: IO a -> Task x a

48+io work =

49+ Task $ \ok _ -> work >>= ok

50+

51+

52+mio :: x -> IO (Maybe a) -> Task x a

53+mio x work =

54+ Task $ \ok err ->

55+ do result <- work

56+ case result of

57+ Just a -> ok a

58+ Nothing -> err x

59+

60+

61+eio :: (x -> y) -> IO (Either x a) -> Task y a

62+eio func work =

63+ Task $ \ok err ->

64+ do result <- work

65+ case result of

66+ Right a -> ok a

67+ Left x -> err (func x)

68+

69+

70+

71+-- INSTANCES

72+

73+

74+instance Functor (Task x) where

75+ {-# INLINE fmap #-}

76+ fmap func (Task taskA) =

77+ Task $ \ok err ->

78+ let

79+ okA arg = ok (func arg)

80+ in

81+ taskA okA err

82+

83+

84+instance Applicative (Task x) where

85+ {-# INLINE pure #-}

86+ pure a =

87+ Task $ \ok _ -> ok a

88+

89+ {-# INLINE (<*>) #-}

90+ (<*>) (Task taskFunc) (Task taskArg) =

91+ Task $ \ok err ->

92+ let

93+ okFunc func =

94+ let

95+ okArg arg = ok (func arg)

96+ in

97+ taskArg okArg err

98+ in

99+ taskFunc okFunc err

100+

101+

102+instance Monad (Task x) where

103+ {-# INLINE return #-}

104+ return = pure

105+

106+ {-# INLINE (>>=) #-}

107+ (>>=) (Task taskA) callback =

108+ Task $ \ok err ->

109+ let

110+ okA a =

111+ case callback a of

112+ Task taskB -> taskB ok err

113+ in

114+ taskA okA err

builder/src/Stuff.hsnew file+179

@@ -0,0 +1,179 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module Stuff

3+ ( details

4+ , interfaces

5+ , objects

6+ , prepublishDir

7+ , elmi

8+ , elmo

9+ , temp

10+ , findRoot

11+ , withRootLock

12+ , withRegistryLock

13+ , PackageCache

14+ , getPackageCache

15+ , registry

16+ , package

17+ , getReplCache

18+ , getElmHome

19+ )

20+ where

21+

22+

23+import qualified System.Directory as Dir

24+import qualified System.Environment as Env

25+import qualified System.FileLock as Lock

26+import qualified System.FilePath as FP

27+import System.FilePath ((</>), (<.>))

28+

29+import qualified Elm.ModuleName as ModuleName

30+import qualified Elm.Package as Pkg

31+import qualified Elm.Version as V

32+

33+

34+

35+-- PATHS

36+

37+

38+stuff :: FilePath -> FilePath

39+stuff root =

40+ root </> "elm-stuff" </> compilerVersion

41+

42+

43+details :: FilePath -> FilePath

44+details root =

45+ stuff root </> "d.dat"

46+

47+

48+interfaces :: FilePath -> FilePath

49+interfaces root =

50+ stuff root </> "i.dat"

51+

52+

53+objects :: FilePath -> FilePath

54+objects root =

55+ stuff root </> "o.dat"

56+

57+

58+prepublishDir :: FilePath -> FilePath

59+prepublishDir root =

60+ stuff root </> "prepublish"

61+

62+

63+compilerVersion :: FilePath

64+compilerVersion =

65+ V.toChars V.compiler

66+

67+

68+

69+-- ELMI and ELMO

70+

71+

72+elmi :: FilePath -> ModuleName.Raw -> FilePath

73+elmi root name =

74+ toArtifactPath root name "elmi"

75+

76+

77+elmo :: FilePath -> ModuleName.Raw -> FilePath

78+elmo root name =

79+ toArtifactPath root name "elmo"

80+

81+

82+toArtifactPath :: FilePath -> ModuleName.Raw -> String -> FilePath

83+toArtifactPath root name ext =

84+ stuff root </> ModuleName.toHyphenPath name <.> ext

85+

86+

87+

88+-- TEMP

89+

90+

91+temp :: FilePath -> String -> FilePath

92+temp root ext =

93+ stuff root </> "temp" <.> ext

94+

95+

96+

97+-- ROOT

98+

99+

100+findRoot :: IO (Maybe FilePath)

101+findRoot =

102+ do dir <- Dir.getCurrentDirectory

103+ findRootHelp (FP.splitDirectories dir)

104+

105+

106+findRootHelp :: [String] -> IO (Maybe FilePath)

107+findRootHelp dirs =

108+ case dirs of

109+ [] ->

110+ return Nothing

111+

112+ _:_ ->

113+ do exists <- Dir.doesFileExist (FP.joinPath dirs </> "elm.json")

114+ if exists

115+ then return (Just (FP.joinPath dirs))

116+ else findRootHelp (init dirs)

117+

118+

119+

120+-- LOCKS

121+

122+

123+withRootLock :: FilePath -> IO a -> IO a

124+withRootLock root work =

125+ do let dir = stuff root

126+ Dir.createDirectoryIfMissing True dir

127+ Lock.withFileLock (dir </> "lock") Lock.Exclusive (\_ -> work)

128+

129+

130+withRegistryLock :: PackageCache -> IO a -> IO a

131+withRegistryLock (PackageCache dir) work =

132+ Lock.withFileLock (dir </> "lock") Lock.Exclusive (\_ -> work)

133+

134+

135+

136+-- PACKAGE CACHES

137+

138+

139+newtype PackageCache = PackageCache FilePath

140+

141+

142+getPackageCache :: IO PackageCache

143+getPackageCache =

144+ PackageCache <$> getCacheDir "packages"

145+

146+

147+registry :: PackageCache -> FilePath

148+registry (PackageCache dir) =

149+ dir </> "registry.dat"

150+

151+

152+package :: PackageCache -> Pkg.Name -> V.Version -> FilePath

153+package (PackageCache dir) name version =

154+ dir </> Pkg.toFilePath name </> V.toChars version

155+

156+

157+

158+-- CACHE

159+

160+

161+getReplCache :: IO FilePath

162+getReplCache =

163+ getCacheDir "repl"

164+

165+

166+getCacheDir :: FilePath -> IO FilePath

167+getCacheDir projectName =

168+ do home <- getElmHome

169+ let root = home </> compilerVersion </> projectName

170+ Dir.createDirectoryIfMissing True root

171+ return root

172+

173+

174+getElmHome :: IO FilePath

175+getElmHome =

176+ do maybeCustomHome <- Env.lookupEnv "ELM_HOME"

177+ case maybeCustomHome of

178+ Just customHome -> return customHome

179+ Nothing -> Dir.getAppUserDataDirectory "elm"

cabal.confignew file+2

@@ -0,0 +1,2 @@

1+profiling: False

2+library-profiling: True

compiler/Build/Dependencies.hsdeleted−133

@@ -1,133 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Build.Dependencies (getSortedDependencies, readDeps) where

3−

4−import Control.Applicative

5−import Control.Monad.Error

6−import qualified Control.Monad.State as State

7−import qualified Data.Aeson as Json

8−import qualified Data.ByteString.Lazy.Char8 as BSC

9−import qualified Data.Graph as Graph

10−import qualified Data.List as List

11−import qualified Data.Map as Map

12−import qualified Data.Maybe as Maybe

13−import qualified Data.Set as Set

14−import System.Directory

15−import System.FilePath as FP

16−

17−import Build.Print (failure)

18−

19−import qualified SourceSyntax.Module as Module

20−import qualified Parse.Parse as Parse

21−import qualified Elm.Internal.Paths as Path

22−import qualified Elm.Internal.Name as N

23−import qualified Elm.Internal.Dependencies as Deps

24−

25−getSortedDependencies :: [FilePath] -> Module.Interfaces -> FilePath -> IO [String]

26−getSortedDependencies srcDirs builtIns root =

27− do extras <- extraDependencies

28− let allSrcDirs = srcDirs ++ Maybe.fromMaybe [] extras

29− result <- runErrorT $ readAllDeps allSrcDirs builtIns root

30− case result of

31− Right deps -> sortDeps deps

32− Left err -> failure err

33−

34−extraDependencies :: IO (Maybe [FilePath])

35−extraDependencies =

36− do exists <- doesFileExist Path.dependencyFile

37− if not exists then return Nothing else Just <$> getPaths

38− where

39− getPaths = do

40− raw <- BSC.readFile Path.dependencyFile

41− case Json.eitherDecode raw of

42− Right (Deps.Mini deps) -> mapM validate deps

43− Left err ->

44− failure $ "Error reading the " ++ Path.dependencyFile ++ " file:\n" ++ err

45−

46− validate (name,version) = do

47− let path = Path.dependencyDirectory </> toPath name version

48− exists <- doesDirectoryExist path

49− if exists then return path else failure (notFound name version)

50−

51− toPath name version = N.toFilePath name </> show version

52−

53− notFound name version =

54− unlines

55− [ "Your " ++ Path.dependencyFile ++ " file says you depend on library"

56− , show name ++ " " ++ show version ++ " but it was not found."

57− , "You may need to install it with:"

58− , ""

59− , " elm-get install " ++ show name ++ " " ++ show version ]

60−

61−type Deps = (FilePath, String, [String])

62−

63−sortDeps :: [Deps] -> IO [String]

64−sortDeps depends =

65− if null mistakes

66− then return (concat sccs)

67− else failure $ msg ++ unlines (map show mistakes)

68− where

69− sccs = map Graph.flattenSCC $ Graph.stronglyConnComp depends

70−

71− mistakes = filter (\scc -> length scc > 1) sccs

72− msg = "A cyclical module dependency or was detected in:\n"

73−

74−readAllDeps :: [FilePath] -> Module.Interfaces -> FilePath -> ErrorT String IO [Deps]

75−readAllDeps srcDirs rawBuiltIns filePath =

76− State.evalStateT (go Nothing filePath) Set.empty

77− where

78− builtIns :: Set.Set String

79− builtIns = Set.fromList $ Map.keys rawBuiltIns

80−

81− go :: Maybe String -> FilePath -> State.StateT (Set.Set String) (ErrorT String IO) [Deps]

82− go parentModuleName filePath = do

83− filePath' <- lift $ findSrcFile parentModuleName srcDirs filePath

84− (moduleName, deps) <- lift $ readDeps filePath'

85− seen <- State.get

86− let realDeps = Set.difference (Set.fromList deps) builtIns

87− newDeps = Set.difference (Set.filter (not . isNative) realDeps) seen

88− State.put (Set.insert moduleName (Set.union newDeps seen))

89− rest <- mapM (go (Just moduleName) . toFilePath) (Set.toList newDeps)

90− return ((makeRelative "." filePath', moduleName, Set.toList realDeps) : concat rest)

91−

92−readDeps :: FilePath -> ErrorT String IO (String, [String])

93−readDeps path = do

94− txt <- lift $ readFile path

95− case Parse.dependencies txt of

96− Left err -> throwError $ msg ++ show err

97− where msg = "Error resolving dependencies in " ++ path ++ ":\n"

98− Right o -> return o

99−

100−findSrcFile :: Maybe String -> [FilePath] -> FilePath -> ErrorT String IO FilePath

101−findSrcFile parentModuleName dirs path =

102− foldr tryDir notFound dirs

103− where

104− tryDir dir next = do

105− let path' = dir </> path

106− exists <- liftIO $ doesFileExist path'

107− if exists

108− then return path'

109− else next

110−

111− parentModuleName' =

112− case parentModuleName of

113− Just name -> "module '" ++ name ++ "'"

114− Nothing -> "the main module"

115−

116− notFound = throwError $ unlines

117− [ "When finding the imports declared in " ++ parentModuleName' ++ ", could not find file: " ++ path

118− , " If you created this module, but it is in a subdirectory that does not"

119− , " exactly match the module name, you may need to use the --src-dir flag."

120− , ""

121− , " If it is part of a 3rd party library, it needs to be declared"

122− , " as a dependency in your project's " ++ Path.dependencyFile ++ " file."

123− ]

124−

125−isNative :: String -> Bool

126−isNative name = List.isPrefixOf "Native." name

127−

128−toFilePath :: String -> FilePath

129−toFilePath name = map swapDots name ++ ext

130− where

131− swapDots '.' = '/'

132− swapDots c = c

133− ext = if isNative name then ".js" else ".elm"

compiler/Build/File.hsdeleted−178

@@ -1,178 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Build.File (build) where

3−

4−import Control.Applicative ((<$>))

5−import Control.Monad.Error (runErrorT)

6−import Control.Monad.RWS.Strict

7−import System.Directory

8−import System.Exit

9−import System.FilePath

10−import System.IO

11−

12−import qualified Data.Binary as Binary

13−import qualified Data.List as List

14−import qualified Data.Maybe as Maybe

15−import qualified Data.Map as Map

16−import qualified Data.ByteString.Lazy as L

17−

18−import qualified Build.Dependencies as Deps

19−import qualified Build.Flags as Flag

20−import qualified Build.Interface as Interface

21−import qualified Build.Print as Print

22−import qualified Build.Source as Source

23−import qualified Build.Utils as Utils

24−import qualified Generate.JavaScript as JS

25−import qualified Parse.Module as Parser

26−import qualified SourceSyntax.Module as M

27−import qualified Transform.Canonicalize as Canonical

28−

29−-- Reader: Runtime flags, always accessible

30−-- Writer: Remember the last module to be accessed

31−-- State: Build up a map of the module interfaces

32−type BuildT m a = RWST Flag.Flags (Last String) BInterfaces m a

33−type Build a = BuildT IO a

34−

35−-- Interfaces, remembering if something was recompiled

36−type BInterfaces = Map.Map String (Bool, M.ModuleInterface)

37−

38−evalBuild :: Flag.Flags -> M.Interfaces -> Build ()

39− -> IO (Map.Map String M.ModuleInterface, Maybe String)

40−evalBuild flags interfaces build =

41− do (ifaces, moduleNames) <- execRWST build flags (fmap notUpdated interfaces)

42− return (fmap snd ifaces, getLast moduleNames)

43− where

44− notUpdated iface = (False, iface)

45−

46−-- | Builds a list of files, returning the moduleName of the last one.

47−-- Returns \"\" if the list is empty

48−build :: Flag.Flags -> M.Interfaces -> [FilePath] -> IO String

49−build flags interfaces files =

50− do (ifaces, topName) <- evalBuild flags interfaces (buildAll files)

51− let removeTopName = Maybe.maybe id Map.delete topName

52− mapM_ (checkPorts topName) (Map.toList $ removeTopName ifaces)

53− return $ Maybe.fromMaybe "" topName

54− where

55− checkPorts topName (name,iface)

56− | null ports = return ()

57− | otherwise = Print.failure msg

58− where

59− ports = M.iPorts iface

60− msg = concat

61− [ "Port Error: ports may only appear in the main module, but\n"

62− , " sub-module ", name, " declares the following port"

63− , if length ports == 1 then "" else "s", ": "

64− , List.intercalate ", " ports

65− , case topName of

66− Nothing -> ""

67− Just tname -> "\n All ports must appear in module " ++ tname

68− ]

69−

70−buildAll :: [FilePath] -> Build ()

71−buildAll fs = mapM_ (uncurry build1) (zip [1..] fs)

72− where build1 :: Integer -> FilePath -> Build ()

73− build1 num fname = do

74− shouldCompile <- shouldBeCompiled fname

75− if shouldCompile

76− then compile number fname

77− else retrieve fname

78−

79− where number = join ["[", show num, " of ", show total, "]"]

80−

81− total = length fs

82−

83−shouldBeCompiled :: FilePath -> Build Bool

84−shouldBeCompiled filePath = do

85− flags <- ask

86− let alreadyCompiled = liftIO $ do

87− existsi <- doesFileExist (Utils.elmi flags filePath)

88− existso <- doesFileExist (Utils.elmo flags filePath)

89− return $ existsi && existso

90−

91− outDated = liftIO $ do

92− tsrc <- getModificationTime filePath

93− tint <- getModificationTime (Utils.elmo flags filePath)

94− return (tsrc > tint)

95−

96− dependenciesUpdated = do

97− eDeps <- liftIO . runErrorT $ Deps.readDeps filePath

98− case eDeps of

99− -- Should never actually reach here

100− Left err -> liftIO $ Print.failure err

101− Right (_, deps) -> anyM wasCompiled deps

102−

103−

104− in (not <$> alreadyCompiled) `orM` outDated `orM` dependenciesUpdated

105−

106−wasCompiled :: String -> Build Bool

107−wasCompiled modul = maybe False fst . Map.lookup modul <$> get

108−

109−-- Short-circuiting monadic (||)

110−infixr 2 `orM`

111−orM :: (Monad m) => m Bool -> m Bool -> m Bool

112−orM m1 m2 = do b1 <- m1

113− if b1

114− then return b1

115− else m2

116−

117−anyM :: (Monad m) => (a -> m Bool) -> [a] -> m Bool

118−anyM f = foldr (orM . f) (return False)

119−

120−retrieve :: FilePath -> Build ()

121−retrieve filePath = do

122− flags <- ask

123− iface <- liftIO $ Interface.load (Utils.elmi flags filePath)

124− case Interface.isValid filePath iface of

125− Right (name, interface) ->

126− do binterfaces <- get

127− let interfaces = snd <$> binterfaces

128− liftIO $ when (Flag.print_types flags) (Print.interfaceTypes interfaces interface)

129− update name interface False

130−

131− Left err -> liftIO $ Print.failure err

132−

133−compile :: String -> FilePath -> Build ()

134−compile number filePath =

135− do flags <- ask

136− binterfaces <- get

137− source <- liftIO $ readFile filePath

138− let interfaces = snd <$> binterfaces

139− name = getName source

140− liftIO $ do

141− printStatus name

142− createDirectoryIfMissing True (Flag.cache_dir flags)

143− createDirectoryIfMissing True (Flag.build_dir flags)

144−

145− metaModule <-

146− liftIO $ case Source.build (Flag.no_prelude flags) interfaces source of

147− Right modul -> return modul

148− Left errors -> do Print.errors errors

149− exitFailure

150−

151− liftIO $ when (Flag.print_types flags) $ Print.metaTypes interfaces metaModule

152−

153− let newInters = Canonical.interface name $ M.metaToInterface metaModule

154− generateCache name newInters metaModule

155− update name newInters True

156−

157− where

158− getName source = case Parser.getModuleName source of

159− Just n -> n

160− Nothing -> "Main"

161−

162− printStatus name =

163− hPutStrLn stdout $ concat [ number, " Compiling ", name

164− , replicate (max 1 (20 - length name)) ' '

165− , "( " ++ filePath ++ " )" ]

166−

167− generateCache name interfs metaModule = do

168− flags <- ask

169− liftIO $ do

170− createDirectoryIfMissing True . dropFileName $ Utils.elmi flags filePath

171− writeFile (Utils.elmo flags filePath) (JS.generate metaModule)

172− withBinaryFile (Utils.elmi flags filePath) WriteMode $ \handle ->

173− L.hPut handle (Binary.encode (name, interfs))

174−

175−update :: String -> M.ModuleInterface -> Bool -> Build ()

176−update name inter wasUpdated =

177− do modify (Map.insert name (wasUpdated, inter))

178− tell (Last . Just $ name)

compiler/Build/Flags.hsdeleted−44

@@ -1,44 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module Build.Flags where

3−

4−import qualified Elm.Internal.Version as Version

5−import System.Console.CmdArgs

6−

7−data Flags = Flags

8− { make :: Bool

9− , files :: [FilePath]

10− , runtime :: Maybe FilePath

11− , only_js :: Bool

12− , print_types :: Bool

13− , scripts :: [FilePath]

14− , no_prelude :: Bool

15− , cache_dir :: FilePath

16− , build_dir :: FilePath

17− , src_dir :: [FilePath]

18− }

19− deriving (Data,Typeable,Show,Eq)

20−

21−flags = Flags

22− { files = def &= args &= typ "FILES"

23− , make = False

24− &= help "automatically compile dependencies."

25− , only_js = False

26− &= help "Compile only to JavaScript."

27− , no_prelude = False

28− &= help "Do not import Prelude by default, used only when compiling standard libraries."

29− , scripts = [] &= typFile

30− &= help "Load JavaScript files in generated HTML. Files will be included in the given order."

31− , runtime = Nothing &= typFile

32− &= help "Specify a custom location for Elm's runtime system."

33− , cache_dir = "cache" &= typFile

34− &= help "Directory for files cached to make builds faster. Defaults to cache/ directory."

35− , build_dir = "build" &= typFile

36− &= help "Directory for generated HTML and JS files. Defaults to build/ directory."

37− , src_dir = ["."] &= typFile

38− &= help "Additional source directories besides project root. Searched when using --make"

39− , print_types = False

40− &= help "Print out infered types of top-level definitions."

41− } &= help "Compile Elm programs to HTML, CSS, and JavaScript."

42− &= helpArg [explicit, name "help", name "h"]

43− &= versionArg [explicit, name "version", name "v", summary (show Version.elmVersion)]

44− &= summary ("The Elm Compiler " ++ show Version.elmVersion ++ ", (c) Evan Czaplicki 2011-2014")

compiler/Build/Interface.hsdeleted−41

@@ -1,41 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Build.Interface (load,isValid) where

3−

4−import qualified Data.ByteString.Lazy as L

5−import qualified Data.Binary as Binary

6−

7−import qualified Build.Print as Print

8−import qualified Elm.Internal.Version as Version

9−import System.Directory (doesFileExist)

10−import SourceSyntax.Module

11−

12−load :: Binary.Binary a => FilePath -> IO a

13−load filePath =

14− do exists <- doesFileExist filePath

15− case exists of

16− False -> Print.failure $ "Unable to find file " ++ filePath ++ " for deserialization!"

17− True -> do

18− bytes <- L.readFile filePath

19− case Binary.decodeOrFail bytes of

20− Right (_, _, binaryInfo) -> return binaryInfo

21− Left (_, offset, err) -> Print.failure $ msg offset err

22−

23− where

24− msg offset err = concat

25− [ "Error reading build artifact: ", filePath, "\n"

26− , " '", err, "' at offset ", show offset, "\n"

27− , " The file was generated by a previous build and may be outdated or corrupt.\n"

28− , " Please remove the file and try again."

29− ]

30−

31−isValid :: FilePath -> (String, ModuleInterface) -> Either String (String, ModuleInterface)

32−isValid filePath (name, interface) =

33− let version = iVersion interface in

34− if version == Version.elmVersion

35− then Right (name, interface)

36− else Left $ concat

37− [ "Error reading build artifact: ", filePath, "\n"

38− , " It was generated by version ", show version, " of the compiler,\n"

39− , " but you are using version ", show Version.elmVersion, "\n"

40− , " Please remove the file and try again.\n"

41− ]

compiler/Build/Print.hsdeleted−38

@@ -1,38 +0,0 @@

1−module Build.Print where

2−

3−import System.IO (hPutStrLn, stderr)

4−import System.Exit (exitFailure)

5−

6−import qualified Data.Map as Map

7−import qualified Data.List as List

8−import qualified SourceSyntax.Module as M

9−import qualified SourceSyntax.PrettyPrint as Pretty

10−import qualified Type.Alias as Alias

11−import qualified Text.PrettyPrint as P

12−

13−metaTypes :: Map.Map String M.ModuleInterface -> M.MetadataModule -> IO ()

14−metaTypes interfaces meta =

15− types interfaces (M.types meta) (M.aliases meta) (M.imports meta)

16−

17−interfaceTypes :: Map.Map String M.ModuleInterface -> M.ModuleInterface -> IO ()

18−interfaceTypes interfaces iface =

19− types interfaces (M.iTypes iface) (M.iAliases iface) (M.iImports iface)

20−

21−types interfaces types' aliases imports =

22− do putStrLn ""

23− mapM_ printType (Map.toList types')

24− putStrLn ""

25− where

26− rules = Alias.rules interfaces aliases imports

27−

28− printType (n,t) = do

29− print $ P.hsep [ Pretty.variable n

30− , P.text ":"

31− , Pretty.pretty (Alias.realias rules t) ]

32−

33−errors :: [P.Doc] -> IO ()

34−errors errs =

35− mapM_ print (List.intersperse (P.text " ") errs)

36−

37−failure :: String -> IO a

38−failure msg = hPutStrLn stderr msg >> exitFailure

compiler/Build/Source.hsdeleted−58

@@ -1,58 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Build.Source (build) where

3−

4−import qualified Data.Map as Map

5−import System.FilePath as FP

6−import Text.PrettyPrint (Doc)

7−

8−import SourceSyntax.Declaration

9−import SourceSyntax.Module

10−import qualified SourceSyntax.Expression as Expr

11−import qualified SourceSyntax.Pattern as Pattern

12−import qualified SourceSyntax.Type as Type

13−import qualified Parse.Parse as Parse

14−import qualified Metadata.Prelude as Prelude

15−import qualified Transform.Check as Check

16−import qualified Transform.SortDefinitions as SD

17−import qualified Type.Inference as TI

18−import qualified Type.Constrain.Declaration as TcDecl

19−import qualified Transform.Canonicalize as Canonical

20−

21−build :: Bool -> Interfaces -> String -> Either [Doc] MetadataModule

22−build noPrelude interfaces source =

23− do let add = Prelude.add noPrelude

24− infixes = Map.fromList . map (\(assoc,lvl,op) -> (op,(lvl,assoc)))

25− . concatMap iFixities $ Map.elems interfaces

26−

27− Module names exs ims decls <- do

28− modul@(Module _ _ _ decls) <- add `fmap` Parse.program infixes source

29− case Check.mistakes decls of

30− [] -> return modul

31− ms -> Left ms

32−

33− let exports'

34− | null exs =

35− let get = Pattern.boundVarList in

36− concat [ get pattern | Definition (Expr.Definition pattern _ _) <- decls ] ++

37− concat [ map fst ctors | Datatype _ _ ctors <- decls ] ++

38− [ name | TypeAlias name _ (Type.Record _ _) <- decls ]

39− | otherwise = exs

40−

41− metaModule <- Canonical.metadataModule interfaces $

42− MetadataModule

43− { names = names

44− , path = FP.joinPath names

45− , exports = exports'

46− , imports = ims

47− -- reorder AST into strongly connected components

48− , program = SD.sortDefs . Expr.dummyLet $ TcDecl.toExpr decls

49− , types = Map.empty

50− , datatypes = [ (name,vars,ctors) | Datatype name vars ctors <- decls ]

51− , fixities = [ (assoc,level,op) | Fixity assoc level op <- decls ]

52− , aliases = [ (name,tvs,tipe) | TypeAlias name tvs tipe <- decls ]

53− , ports = [ portName port | Port port <- decls ]

54− }

55−

56− types <- TI.infer interfaces metaModule

57−

58− return $ metaModule { types = types }

compiler/Build/Utils.hsdeleted−35

@@ -1,35 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Build.Utils where

3−

4−import System.Directory (doesFileExist)

5−import System.Environment (getEnv)

6−import System.FilePath ((</>), replaceExtension)

7−import qualified Build.Flags as Flag

8−import qualified Paths_Elm as This

9−

10−buildPath :: Flag.Flags -> FilePath -> String -> FilePath

11−buildPath flags filePath ext =

12− Flag.build_dir flags </> replaceExtension filePath ext

13−

14−cachePath :: Flag.Flags -> FilePath -> String -> FilePath

15−cachePath flags filePath ext =

16− Flag.cache_dir flags </> replaceExtension filePath ext

17−

18−elmo :: Flag.Flags -> FilePath -> FilePath

19−elmo flags filePath =

20− cachePath flags filePath "elmo"

21−

22−elmi :: Flag.Flags -> FilePath -> FilePath

23−elmi flags filePath =

24− cachePath flags filePath "elmi"

25−

26−-- |The absolute path to a data file

27−getDataFile :: FilePath -> IO FilePath

28−getDataFile name = do

29− path <- This.getDataFileName name

30− exists <- doesFileExist path

31− if exists

32− then return path

33− else do

34− env <- getEnv "ELM_HOME"

35− return (env </> name)

compiler/Compiler.hsdeleted−67

@@ -1,67 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Main where

3−

4−import Control.Monad (foldM)

5−import qualified Data.Maybe as Maybe

6−import Text.Blaze.Html.Renderer.String (renderHtml)

7−import qualified Data.ByteString.Lazy.Char8 as BS

8−import qualified System.Console.CmdArgs as CmdArgs

9−import System.Directory

10−import System.FilePath

11−import GHC.Conc

12−

13−import Build.Dependencies (getSortedDependencies)

14−import qualified Generate.Html as Html

15−import qualified Metadata.Prelude as Prelude

16−import qualified Build.Utils as Utils

17−import qualified Build.Flags as Flag

18−import qualified Build.File as File

19−import qualified Elm.Internal.Paths as Path

20−

21−main :: IO ()

22−main = do setNumCapabilities =<< getNumProcessors

23− compileArgs =<< CmdArgs.cmdArgs Flag.flags

24−

25−compileArgs :: Flag.Flags -> IO ()

26−compileArgs flags =

27− case Flag.files flags of

28− [] -> putStrLn "Usage: elm [OPTIONS] [FILES]\nFor more help: elm --help"

29− fs -> mapM_ (build flags) fs

30−

31−build :: Flag.Flags -> FilePath -> IO ()

32−build flags rootFile =

33− do let noPrelude = Flag.no_prelude flags

34− builtIns <- Prelude.interfaces noPrelude

35−

36− files <- if Flag.make flags

37− then getSortedDependencies (Flag.src_dir flags) builtIns rootFile

38− else return [rootFile]

39−

40− moduleName <- File.build flags builtIns files

41−

42− js <- foldM appendToOutput BS.empty files

43−

44− (extension, code) <-

45− if Flag.only_js flags

46− then do putStr "Generating JavaScript ... "

47− return ("js", js)

48− else do putStr "Generating HTML ... "

49− return (makeHtml js moduleName)

50−

51− let targetFile = Utils.buildPath flags rootFile extension

52− createDirectoryIfMissing True (takeDirectory targetFile)

53− BS.writeFile targetFile code

54− putStrLn "Done"

55−

56− where

57− appendToOutput :: BS.ByteString -> FilePath -> IO BS.ByteString

58− appendToOutput js filePath = do

59− src <- BS.readFile (Utils.elmo flags filePath)

60− return (BS.append src js)

61−

62− sources js = map Html.Link (Flag.scripts flags) ++ [ Html.Source js ]

63−

64− makeHtml js moduleName = ("html", BS.pack $ renderHtml html)

65− where

66− rtsPath = Maybe.fromMaybe Path.runtime (Flag.runtime flags)

67− html = Html.generate rtsPath (takeBaseName rootFile) (sources js) moduleName ""

compiler/Docs.hsdeleted−187

@@ -1,187 +0,0 @@

1−{-# LANGUAGE OverloadedStrings, DeriveDataTypeable #-}

2−module Main where

3−

4−import System.Console.CmdArgs

5−import System.Directory

6−import System.FilePath

7−import System.Exit

8−import System.IO

9−

10−import Control.Applicative ((<$>))

11−import Control.Arrow (second)

12−import Data.Aeson

13−import Data.Aeson.Encode.Pretty

14−import qualified Data.List as List

15−import qualified Data.Map as Map

16−import qualified Data.ByteString.Lazy as BS

17−import qualified Data.Text as Text

18−

19−import qualified SourceSyntax.Helpers as Help

20−import qualified SourceSyntax.Type as T

21−import qualified SourceSyntax.Expression as E

22−import qualified SourceSyntax.Declaration as D

23−

24−import Text.Parsec hiding (newline,spaces)

25−import Parse.Declaration (alias,datatype,infixDecl)

26−import Parse.Expression (typeAnnotation)

27−import Parse.Helpers

28−import Parse.Module (moduleDef)

29−

30−data Flags = Flags

31− { files :: [FilePath] }

32− deriving (Data,Typeable,Show,Eq)

33−

34−defaultFlags :: Flags

35−defaultFlags = Flags

36− { files = def &= args &= typ "FILES"

37− } &= help "Generate documentation for Elm"

38− &= summary ("Generate documentation for Elm, (c) Evan Czaplicki")

39−

40−main :: IO ()

41−main = do

42− flags <- cmdArgs defaultFlags

43− mapM_ parseFile (files flags)

44−

45−config :: Config

46−config = Config { confIndent = 2, confCompare = keyOrder keys }

47− where

48− keys = ["tag","name","document","comment","raw","aliases","datatypes"

49− ,"values","typeVariables","type","constructors"]

50−

51−parseFile :: FilePath -> IO ()

52−parseFile path = do

53− source <- readFile path

54− case iParse docs source of

55− Right json -> do

56− putStrLn $ "Documenting " ++ path

57− let docPath = "docs" </> replaceExtension path ".json"

58− createDirectoryIfMissing True (dropFileName docPath)

59− BS.writeFile docPath (encodePretty' config json)

60− Left err -> do

61− hPutStrLn stderr $ "Parse error in " ++ path ++ " at " ++ show err

62− exitFailure

63−

64−docs :: IParser Value

65−docs = do

66− (name, exports, structure) <- moduleDocs

67− things <- document

68− return $ documentToJson name exports structure things

69−

70−docComment :: IParser String

71−docComment = do

72− try (string "{-|")

73− contents <- closeComment

74− let reversed = dropWhile (`elem` " \n\r") . drop 2 $ reverse contents

75− return $ dropWhile (==' ') (reverse reversed)

76−

77−moduleDocs :: IParser (String, [String], String)

78−moduleDocs = do

79− optional freshLine

80− (names,exports) <- moduleDef

81− manyTill (string " " <|> newline <?> "more whitespace")

82− (lookAhead (string "{-|") <?> "module documentation comment")

83− structure <- docComment

84− return (List.intercalate "." names, exports, structure)

85−

86−document :: IParser [(String, D.ParseDeclaration, String)]

87−document = onFreshLines (\t ts -> ts ++ [t]) [] docThing

88−

89−docThing :: IParser (String, D.ParseDeclaration, String)

90−docThing = uncommentable <|> commented <|> uncommented ""

91− where

92− uncommentable = do

93− ifx <- infixDecl

94− return ("", ifx, "")

95−

96− commented = do

97− comment <- docComment

98− freshLine

99− uncommented comment

100−

101− uncommented comment = do

102− (src,def) <- withSource $ choice [ alias, datatype, D.Definition <$> typeAnnotation ]

103− return (comment, def, src)

104−

105−

106−documentToJson name exports structure things =

107− object $ [ "name" .= name

108− , "document" .= structure

109− , "values" .= toList values

110− , "aliases" .= toList aliases

111− , "datatypes" .= toList adts

112− ]

113− where

114− (values, aliases, adts) = collect Map.empty Map.empty Map.empty Map.empty things

115−

116− toList dict = map object . Map.elems $ filterPublics dict

117−

118− exportMap = Map.fromList (zip exports exports)

119− filterPublics dict =

120− case Map.null exportMap of

121− True -> dict

122− False -> Map.filterWithKey (\k _ -> Map.member k exportMap) dict

123−

124−collect infixes types aliases adts things =

125− case things of

126− [] -> (Map.union customOps nonCustomOps, aliases, adts)

127− where

128− nonCustomOps = Map.mapWithKey addDefaultInfix $ Map.difference types infixes

129− addDefaultInfix name pairs

130− | all Help.isSymbol name = addInfix (D.L, 9 :: Int) pairs

131− | otherwise = pairs

132−

133− customOps = Map.intersectionWith addInfix infixes types

134− addInfix (assoc,prec) pairs =

135− [ "associativity" .= show assoc, "precedence" .= prec ] ++ pairs

136−

137− (comment, decl, source) : rest ->

138− case decl of

139− D.Fixity assoc prec name ->

140− collect (Map.insert name (assoc,prec) infixes) types aliases adts rest

141− D.Definition (E.TypeAnnotation name tipe) ->

142− collect infixes (insert name [ "type" .= tipe ] types) aliases adts rest

143− D.TypeAlias name vars tipe ->

144− let fields = ["typeVariables" .= vars, "type" .= tipe ]

145− in collect infixes types (insert name fields aliases) adts rest

146− D.Datatype name vars ctors ->

147− let tipe = T.Data name (map T.Var vars)

148− fields = ["typeVariables" .= vars

149− , "constructors" .= map (ctorToJson tipe) ctors ]

150− in collect infixes types aliases (insert name fields adts) rest

151− where

152− insert name fields dict = Map.insert name (obj name fields) dict

153− obj name fields =

154− [ "name" .= name, "raw" .= source, "comment" .= comment ] ++ fields

155−

156−instance ToJSON T.Type where

157− toJSON tipe =

158− object $

159− case tipe of

160− T.Lambda _ _ ->

161− let tipes = T.collectLambdas tipe in

162− [ "tag" .= ("function" :: Text.Text)

163− , "args" .= toJSON (init tipes)

164− , "result" .= toJSON (last tipes)

165− ]

166−

167− T.Var x ->

168− [ "tag" .= ("var" :: Text.Text)

169− , "name" .= toJSON x

170− ]

171−

172− T.Data name ts ->

173− [ "tag" .= ("adt" :: Text.Text)

174− , "name" .= toJSON name

175− , "args" .= map toJSON ts

176− ]

177−

178− T.Record fields ext ->

179− [ "tag" .= ("record" :: Text.Text)

180− , "fields" .= toJSON (map (toJSON . second toJSON) fields)

181− , "extension" .= toJSON ext

182− ]

183−

184−ctorToJson :: T.Type -> (String, [T.Type]) -> Value

185−ctorToJson tipe (ctor, tipes) =

186− object [ "name" .= ctor

187− , "type" .= foldr T.Lambda tipe tipes ]

compiler/Dummy.cabaldeleted−170

@@ -1,170 +0,0 @@

1−-- This is a dummy .cabal file that makes it possible to build the

2−-- compiler with GHCi from within emacs. Do not actually use this

3−-- file to install things.

4−

5−Name: Elm

6−Version: 0.8.0.3

7−Synopsis: The Elm language module.

8−Description: Elm aims to make client-side web-development more pleasant.

9− It is a statically/strongly typed, functional reactive

10− language to HTML, CSS, and JS. This package provides a

11− library for Elm compilation in Haskell and a compiler

12− executable.

13−

14−Homepage: http://elm-lang.org

15−

16−License: BSD3

17−License-file: LICENSE

18−

19−Author: Evan Czaplicki

20−Maintainer: info@elm-lang.org

22−

23−Category: Compiler, Language

24−

25−Build-type: Custom

26−

27−Extra-source-files: changelog.txt

28−Data-dir: dist/data

29−Data-files: elm-runtime.js docs.json

30−Cabal-version: >=1.8

31−

32−source-repository head

33− type: git

34− location: git://github.com/evancz/Elm.git

35−

36−Library

37− exposed-modules: Language.Elm,

38− Language.Elm.Quasi

39− Hs-Source-Dirs: compiler

40− other-modules: Unique,

41− SourceSyntax.Helpers,

42− SourceSyntax.Location,

43− SourceSyntax.Literal,

44− SourceSyntax.Pattern,

45− SourceSyntax.Expression,

46− SourceSyntax.Declaration,

47− SourceSyntax.Module,

48− Generate.JavaScript,

49− Generate.Noscript,

50− Generate.Html,

51− Generate.Cases,

52− Transform.Substitute,

53− Transform.Optimize,

54− Metadata.Libraries,

55− Metadata.LoadLibraries,

56− Initialize,

57− Parse.Binop,

58− Parse.Expression,

59− Parse.Foreign,

60− Parse.Helpers,

61− Parse.Module,

62− Parse.Parser,

63− Parse.Pattern,

64− Parse.Type,

65− Types.Alias,

66− Types.Types,

67− Types.Constrain,

68− Types.Hints,

69− Types.Solver,

70− Types.Substitutions,

71− Types.Unify,

72− Paths_Elm

73−

74− Build-depends: base >=4.2 && <5,

75− containers >= 0.3,

76− transformers >= 0.2,

77− mtl >= 2,

78− deepseq,

79− parsec >= 3.1.1,

80− blaze-html == 0.5.* || == 0.6.*,

81− blaze-markup == 0.5.1.*,

82− text,

83− shakespeare >= 1,

84− template-haskell,

85− pandoc >= 1.10,

86− bytestring,

87− uniplate,

88− hjsmin,

89− indents,

90− filepath,

91− json,

92− directory

93−

94−Executable elm

95− Main-is: Compiler.hs

96− Hs-Source-Dirs: compiler

97− other-modules: Unique,

98− SourceSyntax.Helpers,

99− SourceSyntax.Location,

100− SourceSyntax.Literal,

101− SourceSyntax.Pattern,

102− SourceSyntax.Expression,

103− SourceSyntax.Declaration,

104− SourceSyntax.Module,

105− Generate.JavaScript,

106− Generate.Noscript,

107− Generate.Html,

108− Generate.Cases,

109− Transform.Substitute,

110− Transform.Optimize,

111− Metadata.Libraries,

112− Metadata.LoadLibraries,

113− Initialize,

114− Parse.Binop,

115− Parse.Expression,

116− Parse.Foreign,

117− Parse.Helpers,

118− Parse.Module,

119− Parse.Parser,

120− Parse.Pattern,

121− Parse.Type,

122− Types.Alias,

123− Types.Types,

124− Types.Constrain,

125− Types.Hints,

126− Types.Solver,

127− Types.Substitutions,

128− Types.Unify,

129− Paths_Elm

130−

131− Build-depends: base >=4.2 && <5,

132− containers >= 0.3,

133− transformers >= 0.2,

134− mtl >= 2,

135− deepseq,

136− parsec >= 3.1.1,

137− blaze-html == 0.5.* || == 0.6.*,

138− blaze-markup == 0.5.1.*,

139− cmdargs,

140− pandoc >= 1.10,

141− bytestring,

142− uniplate,

143− hjsmin,

144− indents,

145− filepath,

146− json,

147− directory

148−

149−Executable elm-doc

150− Main-is: Docs.hs

151− Hs-Source-Dirs: compiler

152− other-modules: SourceSyntax.Helpers,

153− SourceSyntax.Location,

154− SourceSyntax.Literal,

155− SourceSyntax.Pattern,

156− SourceSyntax.Expression,

157− SourceSyntax.Declaration,

158− SourceSyntax.Module,

159− Parse.Helpers,

160− Parse.Module

161−

162− Build-depends: base >=4.2 && <5,

163− containers >= 0.3,

164− transformers >= 0.2,

165− mtl >= 2,

166− parsec >= 3.1.1,

167− pandoc >= 1.10,

168− cmdargs,

169− filepath,

170− indents

compiler/Elm/Internal/Dependencies.hsdeleted−117

@@ -1,117 +0,0 @@

1−{-# LANGUAGE OverloadedStrings #-}

2−module Elm.Internal.Dependencies where

3−

4−import Control.Applicative

5−import Control.Monad.Error

6−import qualified Control.Exception as E

7−import Data.Aeson

8−import qualified Data.List as List

9−import qualified Data.ByteString.Lazy as BS

10−import qualified Data.HashMap.Strict as Map

11−import qualified Elm.Internal.Name as N

12−import qualified Elm.Internal.Version as V

13−import qualified Elm.Internal.Paths as Path

14−

15−data Deps = Deps

16− { name :: N.Name

17− , version :: V.Version

18− , summary :: String

19− , description :: String

20− , license :: String

21− , repo :: String

22− , exposed :: [String]

23− , elmVersion :: V.Version

24− , dependencies :: [(N.Name,V.Version)]

25− } deriving Show

26−

27−data MiniDeps = Mini [(N.Name,V.Version)]

28−

29−instance FromJSON MiniDeps where

30− parseJSON (Object obj) = Mini <$> getDependencies obj

31− parseJSON _ = mzero

32−

33−instance FromJSON Deps where

34− parseJSON (Object obj) =

35− do version <- get obj "version" "your projects version number"

36−

37− summary <- get obj "summary" "a short summary of your project"

38− when (length summary >= 80) $

39− fail "'summary' must be less than 80 characters"

40−

41− desc <- get obj "description" "an extended description of your project \

42− \and how to get started with it."

43− license <- get obj "license" "license information (BSD3 is recommended)"

44−

45− repo <- get obj "repository" "a link to the project's GitHub repo"

46− name <- case repoToName repo of

47− Left err -> fail err

48− Right nm -> return nm

49−

50− exposed <- get obj "exposed-modules" "a list of modules exposed to users"

51−

52− elmVersion <- get obj "elm-version" "the version of the Elm compiler you are using"

53−

54− deps <- getDependencies obj

55−

56− return $ Deps name version summary desc license repo exposed elmVersion deps

57−

58− parseJSON _ = mzero

59−

60−getDependencies obj =

61− toDeps =<< get obj "dependencies" "a listing of your project's dependencies"

62− where

63− toDeps deps =

64− forM (Map.toList deps) $ \(f,v) ->

65− case (N.fromString f, V.fromString v) of

66− (Just name, Just version) -> return (name,version)

67− (Nothing, _) -> fail $ N.errorMsg f

68− (_, Nothing) -> fail $ "invalid version number " ++ v

69−

70−

71−get obj field desc =

72− do maybe <- obj .:? field

73− case maybe of

74− Just value -> return value

75− Nothing -> fail $ "Missing field " ++ show field ++ ", " ++ desc ++ ".\n" ++

76− " Check out an example " ++ Path.dependencyFile ++ " file here:" ++

77− " <https://github.com/evancz/automaton/blob/master/elm_dependencies.json>"

78−

79−repoToName :: String -> Either String N.Name

80−repoToName repo

81− | not (end `List.isSuffixOf` repo) = Left msg

82− | otherwise =

83− do path <- getPath

84− let raw = take (length path - length end) path

85− case N.fromString raw of

86− Nothing -> Left msg

87− Just name -> Right name

88− where

89− getPath | http `List.isPrefixOf` repo = Right $ drop (length http ) repo

90− | https `List.isPrefixOf` repo = Right $ drop (length https) repo

91− | otherwise = Left msg

92− http = "http://github.com/"

93− https = "https://github.com/"

94− end = ".git"

95− msg = "the 'repository' field must point to a GitHub project for now, something\n\

96− \like <https://github.com/USER/PROJECT.git> where USER is your GitHub name\n\

97− \and PROJECT is the repo you want to upload."

98−

99−withDeps :: (Deps -> a) -> FilePath -> ErrorT String IO a

100−withDeps handle path =

101− do json <- readPath

102− case eitherDecode json of

103− Left err -> throwError $ "Error reading file " ++ path ++ ":\n " ++ err

104− Right ds -> return (handle ds)

105− where

106− readPath :: ErrorT String IO BS.ByteString

107− readPath = do

108− result <- liftIO $ E.catch (Right <$> BS.readFile path)

109− (\err -> return $ Left (err :: IOError))

110− case result of

111− Right bytes -> return bytes

112− Left _ -> throwError $

113− "could not find file " ++ path ++

114− "\n You may need to create a dependency file for your project."

115−

116−depsAt :: FilePath -> ErrorT String IO Deps

117−depsAt = withDeps id

compiler/Elm/Internal/Documentation.hsdeleted−41

@@ -1,41 +0,0 @@

1−{-# LANGUAGE OverloadedStrings #-}

2−module Elm.Internal.Documentation where

3−

4−import Control.Applicative ((<$>),(<*>))

5−import Control.Monad

6−import Data.Aeson

7−

8−data Document = Doc

9− { moduleName :: String

10− , structure :: String

11− , entries :: [Entry]

12− } deriving (Show)

13−

14−data Entry = Entry

15− { name :: String

16− , comment :: String

17− , raw :: String

18− , assocPrec :: Maybe (String,Int)

19− } deriving (Show)

20−

21−instance FromJSON Document where

22− parseJSON (Object v) =

23− Doc <$> v .: "name"

24− <*> v .: "document"

25− <*> (concat <$> sequence [ v .: "aliases", v .: "datatypes", v .: "values" ])

26−

27− parseJSON _ = fail "Conversion to Document was expecting an object"

28−

29−instance FromJSON Entry where

30− parseJSON (Object v) =

31− Entry <$> v .: "name"

32− <*> v .: "comment"

33− <*> v .: "raw"

34− <*> (liftM2 (,) <$> v .:? "associativity"

35− <*> v .:? "precedence")

36−

37− parseJSON _ = fail "Conversion to Entry was expecting an object"

38−

39−data Content = Markdown String | Value String

40− deriving Show

41−

compiler/Elm/Internal/Name.hsdeleted−51

@@ -1,51 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module Elm.Internal.Name where

3−

4−import Control.Applicative

5−import Control.Monad.Error

6−import Data.Aeson

7−import Data.Binary

8−import qualified Data.Text as T

9−import qualified Data.Maybe as Maybe

10−import Data.Typeable

11−

12−data Name = Name { user :: String, project :: String }

13− deriving (Typeable,Eq)

14−

15−instance Binary Name where

16− get = Name <$> get <*> get

17− put (Name user project) =

18− put user >> put project

19−

20−instance Show Name where

21− show name = user name ++ "/" ++ project name

22−

23−toFilePath :: Name -> FilePath

24−toFilePath name = user name ++ "-" ++ project name

25−

26−fromString :: String -> Maybe Name

27−fromString string =

28− case break (=='/') string of

29− ( user@(_:_), '/' : project@(_:_) )

30− | all (/='/') project -> Just (Name user project)

31− _ -> Nothing

32−

33−fromString' :: String -> ErrorT String IO Name

34−fromString' string =

35− Maybe.maybe (throwError $ errorMsg string) return (fromString string)

36−

37−instance FromJSON Name where

38− parseJSON (String text) =

39− let string = T.unpack text in

40− Maybe.maybe (fail $ errorMsg string) return (fromString string)

41−

42− parseJSON _ = fail "Project name must be a string."

43−

44−instance ToJSON Name where

45− toJSON name = toJSON (show name)

46−

47−errorMsg string =

48− unlines

49− [ "Dependency file has an invalid name: " ++ string

50− , "Must have format user/project and match a public github project."

51− ]

compiler/Elm/Internal/Paths.hsdeleted−24

@@ -1,24 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Elm.Internal.Paths where

3−

4−import Build.Utils (getDataFile)

5−import System.IO.Unsafe (unsafePerformIO)

6−

7−-- |Name of directory for all of a project's dependencies.

8−dependencyDirectory :: FilePath

9−dependencyDirectory = "elm_dependencies"

10−

11−-- |Name of the dependency file, specifying dependencies and

12−-- other metadata for building and sharing projects.

13−dependencyFile :: FilePath

14−dependencyFile = "elm_dependencies.json"

15−

16−{-# NOINLINE runtime #-}

17−-- |The absolute path to Elm's runtime system.

18−runtime :: FilePath

19−runtime = unsafePerformIO $ getDataFile "elm-runtime.js"

20−

21−{-# NOINLINE docs #-}

22−-- |The absolute path to Elm's core library documentation.

23−docs :: FilePath

24−docs = unsafePerformIO $ getDataFile "docs.json"

compiler/Elm/Internal/Utils.hsdeleted−28

@@ -1,28 +0,0 @@

1−{- | This module exports functions for compiling Elm to JS.

2−-}

3−module Elm.Internal.Utils (compile, moduleName) where

4−

5−import qualified Data.List as List

6−import qualified Generate.JavaScript as JS

7−import qualified Build.Source as Source

8−import qualified Parse.Module as Parser

9−import qualified SourceSyntax.Module as M

10−import qualified Text.PrettyPrint as P

11−import qualified Metadata.Prelude as Prelude

12−import System.IO.Unsafe

13−

14−-- |This function compiles Elm code to JavaScript. It will return either

15−-- an error message or the compiled JS code.

16−compile :: String -> Either String String

17−compile source =

18− case Source.build False interfaces source of

19− Left docs -> Left . unlines . List.intersperse "" $ map P.render docs

20− Right modul -> Right $ JS.generate modul

21−

22−{-# NOINLINE interfaces #-}

23−interfaces :: M.Interfaces

24−interfaces = unsafePerformIO $ Prelude.interfaces False

25−

26−-- |This function extracts the module name of a given source program.

27−moduleName :: String -> Maybe String

28−moduleName = Parser.getModuleName

compiler/Elm/Internal/Version.hsdeleted−73

@@ -1,73 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable, TemplateHaskell #-}

2−module Elm.Internal.Version where

3−

4−import Control.Applicative

5−import Data.Aeson

6−import Data.Binary

7−import Data.Char (isDigit)

8−import qualified Data.List as List

9−import Data.Typeable

10−import qualified Data.Text as T

11−import qualified Paths_Elm as This

12−import qualified Data.Version as Version

13−

14−elmVersion :: Version

15−elmVersion = V ns ""

16− where (Version.Version ns _) = This.version

17−

18−-- Data representation

19−

20−data Version = V [Int] String

21− deriving (Typeable,Eq)

22−

23−instance Ord Version where

24− compare (V ns tag) (V ns' tag') =

25− case compare ns ns' of

26− EQ -> compare tag' tag -- reverse comparison to favor ""

27− cmp -> cmp

28−

29−instance Show Version where

30− show (V ns tag) =

31− List.intercalate "." (map show ns) ++ if null tag then "" else "-" ++ tag

32−

33−instance Binary Version where

34− get = V <$> get <*> get

35− put (V ns tag) = do put ns

36− put tag

37−

38−tagless :: Version -> Bool

39−tagless (V _ tag) = null tag

40−

41−fromString :: String -> Maybe Version

42−fromString version = V <$> splitNumbers possibleNumbers <*> tag

43− where

44− (possibleNumbers, possibleTag) = break (=='-') version

45−

46− tag = case possibleTag of

47− "" -> Just ""

48− '-':rest -> Just rest

49− _ -> Nothing

50−

51− splitNumbers :: String -> Maybe [Int]

52− splitNumbers ns =

53− case span isDigit ns of

54− ("", _) -> Nothing

55− (number, []) -> Just [read number]

56− (number, '.':rest) -> (read number :) <$> splitNumbers rest

57− _ -> Nothing

58−

59−instance FromJSON Version where

60− parseJSON (String text) =

61− let string = T.unpack text in

62− case fromString string of

63− Just v -> return v

64− Nothing -> fail $ unlines

65− [ "Dependency file has an invalid version number: " ++ string

66− , "Must have format 0.1.2 or 0.1.2-tag"

67− ]

68−

69− parseJSON _ = fail "Version number must be stored as a string."

70−

71−instance ToJSON Version where

72− toJSON version = toJSON (show version)

73−

compiler/Generate/Cases.hsdeleted−133

@@ -1,133 +0,0 @@

1−module Generate.Cases (toMatch, Match (..), Clause (..), matchSubst, newVar) where

2−

3−import Control.Applicative ((<$>))

4−import Control.Arrow (first)

5−import Control.Monad.State

6−import Data.List (groupBy,sortBy)

7−import Data.Maybe (fromMaybe)

8−

9−import SourceSyntax.Annotation

10−import SourceSyntax.Expression

11−import SourceSyntax.Literal

12−import qualified SourceSyntax.Pattern as P

13−import qualified SourceSyntax.Variable as V

14−import Transform.Substitute

15−

16−toMatch :: [(P.Pattern, Expr)] -> State Int (String, Match)

17−toMatch patterns = do

18− v <- newVar

19− (,) v <$> match [v] (map (first (:[])) patterns) Fail

20−

21−newVar :: State Int String

22−newVar = do n <- get

23− modify (+1)

24− return $ "_v" ++ show n

25−

26−data Match

27− = Match String [Clause] Match

28− | Break

29− | Fail

30− | Other Expr

31− | Seq [Match]

32− deriving Show

33−

34−data Clause =

35− Clause (Either String Literal) [String] Match

36− deriving Show

37−

38−matchSubst :: [(String,String)] -> Match -> Match

39−matchSubst pairs match =

40− case match of

41− Break -> Break

42− Fail -> Fail

43− Seq ms -> Seq (map (matchSubst pairs) ms)

44− Other (A a e) ->

45− Other . A a $ foldr ($) e $ map (\(x,y) -> subst x (rawVar y)) pairs

46− Match n cs m ->

47− Match (varSubst n) (map clauseSubst cs) (matchSubst pairs m)

48− where

49− varSubst v = fromMaybe v (lookup v pairs)

50− clauseSubst (Clause c vs m) =

51− Clause c (map varSubst vs) (matchSubst pairs m)

52−

53−isCon (p:_, _) =

54− case p of

55− P.Data _ _ -> True

56− P.Literal _ -> True

57− _ -> False

58−

59−isVar p = not (isCon p)

60−

61−match :: [String] -> [([P.Pattern],Expr)] -> Match -> State Int Match

62−match [] [] def = return def

63−match [] [([],e)] Fail = return $ Other e

64−match [] [([],e)] Break = return $ Other e

65−match [] cs def = return $ Seq (map (Other . snd) cs ++ [def])

66−match vs@(v:_) cs def

67− | all isVar cs' = matchVar vs cs' def

68− | all isCon cs' = matchCon vs cs' def

69− | otherwise = matchMix vs cs' def

70− where

71− cs' = map (dealias v) cs

72−

73−dealias :: String -> ([P.Pattern],Expr) -> ([P.Pattern],Expr)

74−dealias v c@(p:ps, A a e) =

75− case p of

76− P.Alias x pattern -> (pattern:ps, A a $ subst x (rawVar v) e)

77− _ -> c

78−

79−matchVar :: [String] -> [([P.Pattern],Expr)] -> Match -> State Int Match

80−matchVar (v:vs) cs def = match vs (map subVar cs) def

81− where

82− subVar (p:ps, (A a e)) = (ps, A a $ subOnePattern p e)

83− where

84− subOnePattern pattern e =

85− case pattern of

86− P.Var x -> subst x (rawVar v) e

87− P.Anything -> e

88− P.Record fs ->

89− foldr (\x -> subst x (Access (A a (rawVar v)) x)) e fs

90−

91−matchCon :: [String] -> [([P.Pattern],Expr)] -> Match -> State Int Match

92−matchCon (v:vs) cs def = (flip (Match v) def) <$> mapM toClause css

93− where

94− css = groupBy eq (sortBy cmp cs)

95−

96− cmp (p1:_,_) (p2:_,_) =

97− case (p1,p2) of

98− (P.Data n1 _, P.Data n2 _) -> compare n1 n2

99− _ -> compare p1 p2

100−

101− eq (p1:_,_) (p2:_,_) =

102− case (p1,p2) of

103− (P.Data n1 _, P.Data n2 _) -> n1 == n2

104− _ -> p1 == p2

105−

106− toClause cs =

107− case head cs of

108− (P.Data name _ : _, _) -> matchClause (Left name) (v:vs) cs Break

109− (P.Literal lit : _, _) -> matchClause (Right lit) (v:vs) cs Break

110−

111−matchClause :: Either String Literal

112− -> [String]

113− -> [([P.Pattern],Expr)]

114− -> Match

115− -> State Int Clause

116−matchClause c (_:vs) cs def =

117− do vs' <- getVars

118− Clause c vs' <$> match (vs' ++ vs) (map flatten cs) def

119− where

120−

121− flatten (p:ps, e) =

122− case p of

123− P.Data _ ps' -> (ps' ++ ps, e)

124− P.Literal _ -> (ps, e)

125−

126− getVars =

127− case head cs of

128− (P.Data _ ps : _, _) -> forM ps (const newVar)

129− (P.Literal _ : _, _) -> return []

130−

131−matchMix :: [String] -> [([P.Pattern],Expr)] -> Match -> State Int Match

132−matchMix vs cs def = foldM (flip $ match vs) def (reverse css)

133− where css = groupBy (\p1 p2 -> isCon p1 == isCon p2) cs

compiler/Generate/Html.hsdeleted−31

@@ -1,31 +0,0 @@

1−{-# LANGUAGE OverloadedStrings #-}

2−module Generate.Html (generate, JSSource(..)) where

3−

4−import Text.Blaze (preEscapedToMarkup)

5−import qualified Text.Blaze.Html5 as H

6−import Text.Blaze.Html5 ((!))

7−import qualified Text.Blaze.Html5.Attributes as A

8−import qualified Data.ByteString.Lazy.Char8 as BS

9−

10−data JSSource = Link String | Source BS.ByteString

11−

12−makeScript :: JSSource -> H.Html

13−makeScript source =

14− case source of

15− Link src -> H.script ! A.type_ "text/javascript" ! A.src (H.toValue src) $ ""

16− Source src ->

17− H.script ! A.type_ "text/javascript" $

18− preEscapedToMarkup $ BS.unpack src

19−

20−generate :: FilePath -> String -> [JSSource] -> String -> String -> H.Html

21−generate libLoc title scripts moduleName noscript =

22− H.docTypeHtml $ do

23− H.head $ do

24− H.meta ! A.charset "UTF-8"

25− H.title . H.toHtml $ title

26− makeScript (Link libLoc)

27− mapM_ makeScript scripts

28− H.body $ do

29− H.script ! A.type_ "text/javascript" $

30− preEscapedToMarkup ("Elm.fullscreen(Elm." ++ moduleName ++ ")")

31− H.noscript $ preEscapedToMarkup noscript

compiler/Generate/JavaScript.hsdeleted−394

@@ -1,394 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Generate.JavaScript (generate) where

3−

4−import Control.Applicative ((<$>),(<*>))

5−import Control.Arrow (first,(***))

6−import Control.Monad.State

7−import qualified Data.List as List

8−import qualified Data.Map as Map

9−import qualified Data.Set as Set

10−import Language.ECMAScript3.PrettyPrint

11−import Language.ECMAScript3.Syntax

12−

13−import Generate.JavaScript.Helpers

14−import qualified Generate.Cases as Case

15−import qualified Generate.JavaScript.Ports as Port

16−import qualified Generate.Markdown as MD

17−import SourceSyntax.Annotation

18−import SourceSyntax.Expression

19−import qualified SourceSyntax.Helpers as Help

20−import SourceSyntax.Literal

21−import SourceSyntax.Module

22−import qualified SourceSyntax.Pattern as P

23−import SourceSyntax.PrettyPrint (renderPretty)

24−import qualified SourceSyntax.Variable as V

25−import qualified Transform.SafeNames as MakeSafe

26−

27−varDecl :: String -> Expression () -> VarDecl ()

28−varDecl x expr =

29− VarDecl () (var x) (Just expr)

30−

31−include :: String -> String -> VarDecl ()

32−include alias moduleName =

33− varDecl alias (obj (moduleName ++ ".make") <| ref "_elm")

34−

35−internalImports :: String -> Statement ()

36−internalImports name =

37− VarDeclStmt ()

38− [ varDecl "_N" (obj "Elm.Native")

39− , include "_U" "_N.Utils"

40− , include "_L" "_N.List"

41− , include "_E" "_N.Error"

42− , include "_J" "_N.JavaScript"

43− , varDecl "$moduleName" (string name)

44− ]

45−

46−literal :: Literal -> Expression ()

47−literal lit =

48− case lit of

49− Chr c -> obj "_U.chr" <| string [c]

50− Str s -> string s

51− IntNum n -> IntLit () n

52− FloatNum n -> NumLit () n

53− Boolean b -> BoolLit () b

54−

55−expression :: Expr -> State Int (Expression ())

56−expression (A region expr) =

57− case expr of

58− Var (V.Raw x) -> return $ obj x

59− Literal lit -> return $ literal lit

60−

61− Range lo hi ->

62− do lo' <- expression lo

63− hi' <- expression hi

64− return $ obj "_L.range" `call` [lo',hi']

65−

66− Access e x ->

67− do e' <- expression e

68− return $ DotRef () e' (var x)

69−

70− Remove e x ->

71− do e' <- expression e

72− return $ obj "_U.remove" `call` [string x, e']

73−

74− Insert e x v ->

75− do v' <- expression v

76− e' <- expression e

77− return $ obj "_U.insert" `call` [string x, v', e']

78−

79− Modify e fs ->

80− do e' <- expression e

81− fs' <- forM fs $ \(f,v) -> do

82− v' <- expression v

83− return $ ArrayLit () [string f, v']

84− return $ obj "_U.replace" `call` [ArrayLit () fs', e']

85−

86− Record fields ->

87− do fields' <- forM fields $ \(f,e) -> do

88− (,) f <$> expression e

89− let fieldMap = List.foldl' combine Map.empty fields'

90− return $ ObjectLit () $ (prop "_", hidden fieldMap) : visible fieldMap

91− where

92− combine r (k,v) = Map.insertWith (++) k [v] r

93− hidden fs = ObjectLit () . map (prop *** ArrayLit ()) .

94− Map.toList . Map.filter (not . null) $ Map.map tail fs

95− visible fs = map (first prop) . Map.toList $ Map.map head fs

96−

97− Binop op e1 e2 -> binop region op e1 e2

98−

99− Lambda p e@(A ann _) ->

100− do (args, body) <- foldM depattern ([], innerBody) (reverse patterns)

101− body' <- expression body

102− return $ case length args < 2 || length args > 9 of

103− True -> foldr (==>) body' (map (:[]) args)

104− False -> ref ("F" ++ show (length args)) <| (args ==> body')

105− where

106− depattern (args, body) pattern =

107− case pattern of

108− P.Var x -> return (args ++ [x], body)

109− _ -> do arg <- Case.newVar

110− return ( args ++ [arg]

111− , A ann (Case (A ann (rawVar arg)) [(pattern, body)]))

112−

113− (patterns, innerBody) = collect [p] e

114−

115− collect patterns lexpr@(A _ expr) =

116− case expr of

117− Lambda p e -> collect (p:patterns) e

118− _ -> (patterns, lexpr)

119−

120− App e1 e2 ->

121− do func' <- expression func

122− args' <- mapM expression args

123− return $ case args' of

124− [arg] -> func' <| arg

125− _ | length args' <= 9 -> ref aN `call` (func':args')

126− | otherwise -> foldl1 (<|) (func':args')

127− where

128− aN = "A" ++ show (length args)

129− (func, args) = getArgs e1 [e2]

130− getArgs func args =

131− case func of

132− (A _ (App f arg)) -> getArgs f (arg : args)

133− _ -> (func, args)

134−

135− Let defs e ->

136− do let (defs',e') = flattenLets defs e

137− stmts <- concat <$> mapM definition defs'

138− exp <- expression e'

139− return $ function [] (stmts ++ [ ret exp ]) `call` []

140−

141− MultiIf branches ->

142− do branches' <- forM branches $ \(b,e) -> (,) <$> expression b <*> expression e

143− return $ case last branches of

144− (A _ (Var (V.Raw "Basics.otherwise")), _) -> safeIfs branches'

145− (A _ (Literal (Boolean True)), _) -> safeIfs branches'

146− _ -> ifs branches' (obj "_E.If" `call` [ ref "$moduleName", string (renderPretty region) ])

147− where

148− safeIfs branches = ifs (init branches) (snd (last branches))

149− ifs branches finally = foldr iff finally branches

150− iff (if', then') else' = CondExpr () if' then' else'

151−

152− Case e cases ->

153− do (tempVar,initialMatch) <- Case.toMatch cases

154− (revisedMatch, stmt) <-

155− case e of

156− A _ (Var (V.Raw x)) ->

157− return (Case.matchSubst [(tempVar,x)] initialMatch, [])

158− _ ->

159− do e' <- expression e

160− return (initialMatch, [VarDeclStmt () [varDecl tempVar e']])

161− match' <- match region revisedMatch

162− return (function [] (stmt ++ match') `call` [])

163−

164− ExplicitList es ->

165− do es' <- mapM expression es

166− return $ obj "_J.toList" <| ArrayLit () es'

167−

168− Data name es ->

169− do es' <- mapM expression es

170− return $ ObjectLit () (ctor : fields es')

171− where

172− ctor = (prop "ctor", string name)

173− fields = zipWith (\n e -> (prop ("_" ++ show n), e)) [0..]

174−

175− Markdown uid doc es ->

176− do es' <- mapM expression es

177− return $ obj "Text.markdown" `call` (string md : string uid : es')

178− where

179− pad = "<div style=\"height:0;width:0;\"> </div>"

180− md = pad ++ MD.toHtml doc ++ pad

181−

182− PortIn name tipe ->

183− return $ obj "Native.Ports.portIn" `call` [ string name, Port.incoming tipe ]

184−

185− PortOut name tipe value ->

186− do value' <- expression value

187− return $ obj "Native.Ports.portOut" `call`

188− [ string name, Port.outgoing tipe, value' ]

189−

190−definition :: Def -> State Int [Statement ()]

191−definition (Definition pattern expr@(A region _) _) = do

192− expr' <- expression expr

193− let assign x = varDecl x expr'

194− case pattern of

195− P.Var x

196− | Help.isOp x ->

197− let op = LBracket () (ref "_op") (string x) in

198− return [ ExprStmt () $ AssignExpr () OpAssign op expr' ]

199− | otherwise ->

200− return [ VarDeclStmt () [ assign x ] ]

201−

202− P.Record fields ->

203− let setField f = varDecl f (dotSep ["$",f]) in

204− return [ VarDeclStmt () (assign "$" : map setField fields) ]

205−

206− P.Data name patterns | vars /= Nothing ->

207− return [ VarDeclStmt () (setup (zipWith decl (maybe [] id vars) [0..])) ]

208− where

209− vars = getVars patterns

210− getVars patterns =

211− case patterns of

212− P.Var x : rest -> (x:) `fmap` getVars rest

213− [] -> Just []

214− _ -> Nothing

215−

216− decl x n = varDecl x (dotSep ["$","_" ++ show n])

217− setup vars

218− | Help.isTuple name = assign "$" : vars

219− | otherwise = assign "$raw" : safeAssign : vars

220−

221− safeAssign = varDecl "$" (CondExpr () if' (obj "$raw") exception)

222− if' = InfixExpr () OpStrictEq (obj "$raw.ctor") (string name)

223− exception = obj "_E.Case" `call` [ref "$moduleName", string (renderPretty region)]

224−

225− _ ->

226− do defs' <- concat <$> mapM toDef vars

227− return (VarDeclStmt () [assign "$"] : defs')

228− where

229− vars = P.boundVarList pattern

230− mkVar = A region . rawVar

231− toDef y = let expr = A region $ Case (mkVar "$") [(pattern, mkVar y)]

232− in definition $ Definition (P.Var y) expr Nothing

233−

234−match :: Region -> Case.Match -> State Int [Statement ()]

235−match region mtch =

236− case mtch of

237− Case.Match name clauses mtch' ->

238− do (isChars, clauses') <- unzip <$> mapM (clause region name) clauses

239− mtch'' <- match region mtch'

240− return (SwitchStmt () (format isChars (access name)) clauses' : mtch'')

241− where

242− isLiteral p = case p of

243− Case.Clause (Right _) _ _ -> True

244− _ -> False

245−

246− access name

247− | any isLiteral clauses = obj name

248− | otherwise = dotSep (split name ++ ["ctor"])

249−

250− format isChars e

251− | or isChars = InfixExpr () OpAdd e (string "")

252− | otherwise = e

253−

254− Case.Fail ->

255− return [ ExprStmt () (obj "_E.Case" `call` [ref "$moduleName", string (renderPretty region)]) ]

256−

257− Case.Break -> return [BreakStmt () Nothing]

258−

259− Case.Other e ->

260− do e' <- expression e

261− return [ ret e' ]

262−

263− Case.Seq ms -> concat <$> mapM (match region) (dropEnd [] ms)

264− where

265− dropEnd acc [] = acc

266− dropEnd acc (m:ms) =

267− case m of

268− Case.Other _ -> acc ++ [m]

269− _ -> dropEnd (acc ++ [m]) ms

270−

271−clause :: Region -> String -> Case.Clause -> State Int (Bool, CaseClause ())

272−clause region variable (Case.Clause value vars mtch) =

273− (,) isChar . CaseClause () pattern <$> match region (Case.matchSubst (zip vars vars') mtch)

274− where

275− vars' = map (\n -> variable ++ "._" ++ show n) [0..]

276− (isChar, pattern) =

277− case value of

278− Right (Chr c) -> (True, string [c])

279− _ -> (,) False $ case value of

280− Right (Boolean b) -> BoolLit () b

281− Right lit -> literal lit

282− Left name -> string $ case List.elemIndices '.' name of

283− [] -> name

284− is -> drop (last is + 1) name

285−

286−flattenLets :: [Def] -> Expr -> ([Def], Expr)

287−flattenLets defs lexpr@(A _ expr) =

288− case expr of

289− Let ds body -> flattenLets (defs ++ ds) body

290− _ -> (defs, lexpr)

291−

292−generate :: MetadataModule -> String

293−generate unsafeModule =

294− show . prettyPrint $ setup (Just "Elm") (names modul ++ ["make"]) ++

295− [ assign ("Elm" : names modul ++ ["make"]) (function ["_elm"] programStmts) ]

296− where

297− modul = MakeSafe.metadataModule unsafeModule

298− thisModule = dotSep ("_elm" : names modul ++ ["values"])

299− programStmts =

300− concat

301− [ [ ExprStmt () $ string "use strict" ]

302− , setup (Just "_elm") (names modul ++ ["values"])

303− , [ IfSingleStmt () thisModule (ret thisModule) ]

304− , [ internalImports (List.intercalate "." (names modul)) ]

305− , concatMap jsImport . Set.toList . Set.fromList . map fst $ imports modul

306− , [ assign ["_op"] (ObjectLit () []) ]

307− , concat $ evalState (mapM definition . fst . flattenLets [] $ program modul) 0

308− , [ jsExports ]

309− , [ ret thisModule ]

310− ]

311−

312− jsExports = assign ("_elm" : names modul ++ ["values"]) (ObjectLit () exs)

313− where

314− exs = map entry . filter (not . Help.isOp) $ "_op" : exports modul

315− entry x = (prop x, ref x)

316−

317− assign path expr =

318− case path of

319− [x] -> VarDeclStmt () [ varDecl x expr ]

320− _ -> ExprStmt () $

321− AssignExpr () OpAssign (LDot () (dotSep (init path)) (last path)) expr

322−

323− jsImport modul = setup Nothing path ++ [ include ]

324− where

325− path = Help.splitDots modul

326− include = assign path $ dotSep ("Elm" : path ++ ["make"]) <| ref "_elm"

327−

328− setup namespace path = map create paths

329− where

330− create name = assign name (InfixExpr () OpLOr (dotSep name) (ObjectLit () []))

331− paths = case namespace of

332− Nothing -> tail . init $ List.inits path

333− Just nmspc -> drop 2 . init . List.inits $ nmspc : path

334−

335−binop :: Region -> String -> Expr -> Expr -> State Int (Expression ())

336−binop region op e1 e2 =

337− case op of

338− "Basics.." ->

339− do es <- mapM expression (e1 : collect [] e2)

340− return $ ["$"] ==> foldr (<|) (ref "$") es

341− "Basics.<|" ->

342− do e2' <- expression e2

343− es <- mapM expression (collect [] e1)

344− return $ foldr (<|) e2' es

345− "List.++" ->

346− do e1' <- expression e1

347− e2' <- expression e2

348− return $ obj "_L.append" `call` [e1', e2']

349− "::" -> expression (A region (Data "::" [e1,e2]))

350− _ ->

351− do e1' <- expression e1

352− e2' <- expression e2

353− return $ case Map.lookup op opDict of

354− Just f -> f e1' e2'

355− Nothing -> ref "A2" `call` [ func, e1', e2' ]

356− where

357− collect es e =

358− case e of

359− A _ (Binop op e1 e2) | op == "Basics.." -> collect (es ++ [e1]) e2

360− _ -> es ++ [e]

361−

362− func | Help.isOp operator = BracketRef () (dotSep (init parts ++ ["_op"])) (string operator)

363− | otherwise = dotSep parts

364− where

365− parts = Help.splitDots op

366− operator = last parts

367−

368− opDict = Map.fromList (infixOps ++ specialOps)

369−

370− specialOp str func = [ (str, func), ("Basics." ++ str, func) ]

371− infixOp str op = specialOp str (InfixExpr () op)

372−

373− infixOps = concat

374− [ infixOp "+" OpAdd

375− , infixOp "-" OpSub

376− , infixOp "*" OpMul

377− , infixOp "/" OpDiv

378− , infixOp "&&" OpLAnd

379− , infixOp "||" OpLOr

380− ]

381−

382− specialOps = concat

383− [ specialOp "^" $ \a b -> obj "Math.pow" `call` [a,b]

384− , specialOp "|>" $ flip (<|)

385− , specialOp "==" $ \a b -> obj "_U.eq" `call` [a,b]

386− , specialOp "/=" $ \a b -> PrefixExpr () PrefixLNot (obj "_U.eq" `call` [a,b])

387− , specialOp "<" $ cmp OpLT 0

388− , specialOp ">" $ cmp OpGT 0

389− , specialOp "<=" $ cmp OpLT 1

390− , specialOp ">=" $ cmp OpGT (-1)

391− , specialOp "div" $ \a b -> InfixExpr () OpBOr (InfixExpr () OpDiv a b) (IntLit () 0)

392− ]

393−

394− cmp op n a b = InfixExpr () op (obj "_U.cmp" `call` [a,b]) (IntLit () n)

compiler/Generate/JavaScript/Helpers.hsdeleted−37

@@ -1,37 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Generate.JavaScript.Helpers where

3−

4−import qualified SourceSyntax.Helpers as Help

5−import Language.ECMAScript3.Syntax

6−

7−split :: String -> [String]

8−split = go []

9− where

10− go vars str =

11− case break (=='.') str of

12− (x,_:rest) | Help.isOp x -> vars ++ [x ++ '.' : rest]

13− | otherwise -> go (vars ++ [x]) rest

14− (x,[]) -> vars ++ [x]

15−

16−var name = Id () name

17−ref name = VarRef () (var name)

18−prop name = PropId () (var name)

19−f <| x = CallExpr () f [x]

20−ret e = ReturnStmt () (Just e)

21−args ==> e = FuncExpr () Nothing (map var args) [ ret e ]

22−function args stmts = FuncExpr () Nothing (map var args) stmts

23−call = CallExpr ()

24−string = StringLit ()

25−

26−dotSep vars =

27− case vars of

28− x:xs -> foldl (DotRef ()) (ref x) (map var xs)

29− [] -> error "dotSep must be called on a non-empty list of variables"

30−

31−obj = dotSep . split

32−

33−equal a b = InfixExpr () OpStrictEq a b

34−instanceof tipe x =

35− InfixExpr () OpLAnd (typeof "object" x) (InfixExpr () OpInstanceof x (ref tipe))

36−typeof tipe x = equal (PrefixExpr () PrefixTypeof x) (string tipe)

37−member field x = InfixExpr () OpIn (string field) x

compiler/Generate/JavaScript/Ports.hsdeleted−136

@@ -1,136 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Generate.JavaScript.Ports (incoming, outgoing) where

3−

4−import Generate.JavaScript.Helpers

5−import qualified SourceSyntax.Helpers as Help

6−import SourceSyntax.Type as T

7−import Language.ECMAScript3.Syntax

8−

9−data JSType = JSNumber | JSBoolean | JSString | JSArray | JSObject [String]

10− deriving Show

11−

12−check :: Expression () -> JSType -> Expression () -> Expression ()

13−check x jsType continue =

14− CondExpr () (jsFold OpLOr checks x) continue throw

15− where

16− jsFold op checks value = foldl1 (InfixExpr () op) (map ($value) checks)

17− throw = obj "_E.raise" <| InfixExpr () OpAdd msg x

18− msg = string ("invalid input, expecting " ++ show jsType ++ " but got ")

19− checks = case jsType of

20− JSNumber -> [typeof "number"]

21− JSBoolean -> [typeof "boolean"]

22− JSString -> [typeof "string", instanceof "String"]

23− JSArray -> [instanceof "Array"]

24− JSObject fields -> [jsFold OpLAnd (typeof "object" : map member fields)]

25−

26−incoming :: Type -> Expression ()

27−incoming tipe =

28− case tipe of

29− Data "Signal.Signal" [t] ->

30− obj "Native.Ports.incomingSignal" <| incoming t

31− _ -> ["v"] ==> inc tipe (ref "v")

32−

33−inc :: Type -> Expression () -> Expression ()

34−inc tipe x =

35− case tipe of

36− Lambda _ _ -> error "functions should not be allowed through input ports"

37− Var _ -> error "type variables should not be allowed through input ports"

38− Data ctor []

39− | ctor == "Int" -> elm JSNumber

40− | ctor == "Float" -> elm JSNumber

41− | ctor == "Bool" -> elm JSBoolean

42− | ctor == "String" -> elm JSString

43− | ctor == "JavaScript.JSNumber" -> js JSNumber

44− | ctor == "JavaScript.JSBool" -> js JSBoolean

45− | ctor == "JavaScript.JSString" -> js JSString

46− where

47− elm checks = check x checks (obj ("_J.to" ++ ctor) <| x)

48− js checks = check x checks x

49−

50− Data ctor [t]

51− | ctor == "Maybe.Maybe" ->

52− CondExpr () (equal x (NullLit ()))

53− (obj "Maybe.Nothing")

54− (obj "Maybe.Just" <| inc t x)

55−

56− | ctor == "_List" ->

57− check x JSArray (obj "_J.toList" <| array)

58− where

59− array = DotRef () x (var "map") <| incoming t

60−

61− Data ctor ts

62− | Help.isTuple ctor -> check x JSArray tuple

63− where

64− tuple = ObjectLit () $ (prop "ctor", string ctor) : values

65− values = zipWith convert [0..] ts

66− convert n t = ( prop ('_':show n)

67− , inc t (BracketRef () x (IntLit () n)))

68−

69− Data _ _ ->

70− error "bad ADT got to port generation code"

71−

72− Record _ (Just _) ->

73− error "bad record got to port generation code"

74−

75− Record fields Nothing ->

76− check x (JSObject (map fst fields)) object

77− where

78− object = ObjectLit () $ (prop "_", ObjectLit () []) : keys

79− keys = map convert fields

80− convert (f,t) = (prop f, inc t (DotRef () x (var f)))

81−

82−outgoing tipe =

83− case tipe of

84− Data "Signal.Signal" [t] ->

85− obj "Native.Ports.outgoingSignal" <| outgoing t

86− _ -> ["v"] ==> out tipe (ref "v")

87−

88−out :: Type -> Expression () -> Expression ()

89−out tipe x =

90− case tipe of

91− Lambda _ _

92− | numArgs > 1 && numArgs < 10 ->

93− func (ref ('A':show numArgs) `call` (x:values))

94− | otherwise -> func (foldl (<|) x values)

95− where

96− ts = T.collectLambdas tipe

97− numArgs = length ts - 1

98− args = map (\n -> '_' : show n) [0..]

99− values = zipWith inc (init ts) (map ref args)

100− func body = function (take numArgs args)

101− [ VarDeclStmt () [VarDecl () (var "_r") (Just body)]

102− , ret (out (last ts) (ref "_r"))

103− ]

104−

105− Var _ -> error "type variables should not be allowed through input ports"

106− Data ctor []

107− | ctor `elem` ["Int","Float","Bool","String"] -> obj ("_J.from" ++ ctor) <| x

108− | ctor `elem` jsPrims -> x

109− where

110− jsPrims = map ("JavaScript.JS"++) ["Number","Bool","String"]

111−

112− Data ctor [t]

113− | ctor == "Maybe.Maybe" ->

114− CondExpr () (equal (DotRef () x (var "ctor")) (string "Nothing"))

115− (NullLit ())

116− (out t (DotRef () x (var "_0")))

117−

118− | ctor == "_List" ->

119− DotRef () (obj "_J.fromList" <| x) (var "map") <| outgoing t

120−

121− Data ctor ts

122− | Help.isTuple ctor ->

123− let convert n t = out t $ DotRef () x $ var ('_':show n)

124− in ArrayLit () $ zipWith convert [0..] ts

125−

126− Data _ _ ->

127− error "bad ADT got to port generation code"

128−

129− Record _ (Just _) ->

130− error "bad record got to port generation code"

131−

132− Record fields Nothing ->

133− ObjectLit () keys

134− where

135− keys = map convert fields

136− convert (f,t) = (PropId () (var f), out t (DotRef () x (var f)))

compiler/Generate/Markdown.hsdeleted−39

@@ -1,39 +0,0 @@

1−module Generate.Markdown where

2−

3−import Text.Pandoc

4−import qualified Data.Set as Set

5−

6−toHtml :: String -> String

7−toHtml = writeHtmlString writeOptions . readMarkdown readOptions

8−

9−readOptions =

10− def { readerExtensions = elmExtensions

11− , readerApplyMacros = False

12− }

13−

14−writeOptions =

15− def { writerExtensions = elmExtensions

16− , writerHighlight = True

17− }

18−

19−elmExtensions :: Set.Set Extension

20−elmExtensions = Set.fromList

21− [ Ext_raw_html

22− , Ext_fenced_code_blocks

23− , Ext_fenced_code_attributes

24− , Ext_backtick_code_blocks

25− , Ext_inline_code_attributes

26− , Ext_markdown_in_html_blocks

27− , Ext_escaped_line_breaks

28− , Ext_fancy_lists

29− , Ext_startnum

30− , Ext_definition_lists

31− , Ext_example_lists

32− , Ext_all_symbols_escapable

33− , Ext_intraword_underscores

34− , Ext_blank_before_blockquote

35− , Ext_blank_before_header

36− , Ext_auto_identifiers

37− , Ext_header_attributes

38− , Ext_implicit_header_references

39− ]

compiler/Language/Elm/DevTools.hsdeleted−46

@@ -1,46 +0,0 @@

1−{- | This module aims to make it easier to create dev tools for Elm.

2−

3− It provides the ability to:

4−

5− * Detect problems in a program

6− * Figure out types of particular expressions

7− * Canonicalize variables

8− * Convert expressions to JS and HTML

9−

10− This module gives limeted access to the structure of an Elm Program.

11− Giving full access would expose many internal details that are likely to

12− change as Elm progresses. These details have been hidden to avoid breaking

13− changes.

14−-}

15−module Language.Elm.DevTools where

16−

17−data Program

18−

19−-- | Parse an Elm program into an AST.

20−parse :: String -> Either [Problem] Program

21−

22−-- | Get the type of a region of the program. Lets you look

23−-- up the type of particular values and expressions.

24−typeOf :: Program -> Region -> Either [Problem] String

25−

26−-- | Canonicalize a variable. So in a normal module `map` would be canonicalized

27−-- to `List.map`.

28−canonicalize :: Program -> Region -> [String]

29−

30−-- | Any problem that may come up while parsing or typing a program.

31−-- All problems come with a region that is causing the problem.

32−data Problem = Problem { message :: String, region :: Region }

33−

34−type Row = Int

35−type Column = Int

36−

37−-- | Represents a region, spanning two points in the source code.

38−data Region = Region { start :: (Row,Column), end :: (Row,Column) }

39−

40−-- | Takes a specific point in the source code, such as the cursor position.

41−-- It then determines the region that best represents that point. When the

42−-- cursor is within a variable, it chooses the variable. When the cursor is

43−-- on parentheses, it selects the region within the parentheses. When the

44−-- cursor is on keywords like let, it chooses the whole let-expression.

45−region :: (Row,Column) -> Region

46−region pos = Region pos pos

compiler/Metadata/Prelude.hsdeleted−59

@@ -1,59 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Metadata.Prelude (interfaces, add) where

3−

4−import qualified Data.Map as Map

5−import qualified Control.Exception as E

6−import System.Exit

7−import System.IO

8−import SourceSyntax.Module

9−import qualified Build.Interface as Interface

10−import Build.Utils (getDataFile)

11−

12−add :: Bool -> Module def -> Module def

13−add noPrelude (Module name exs ims decls) = Module name exs (customIms ++ ims) decls

14− where

15− customIms = if noPrelude then [] else concatMap addModule prelude

16−

17− addModule (n, method) = case lookup n ims of

18− Nothing -> [(n, method)]

19− Just (As _) -> [(n, method)]

20− Just _ -> []

21−

22−prelude :: [(String, ImportMethod)]

23−prelude = string ++ text ++ map (\n -> (n, Hiding [])) modules

24− where

25− text = map ((,) "Text") [ As "Text", Hiding ["link", "color", "height"] ]

26− string = map ((,) "String") [ As "String", Importing ["show"] ]

27− modules = [ "Basics", "Signal", "List", "Maybe", "Time", "Color"

28− , "Graphics.Element", "Graphics.Collage", "Native.Ports" ]

29−

30−interfaces :: Bool -> IO Interfaces

31−interfaces noPrelude =

32− if noPrelude

33− then return Map.empty

34− else safeReadDocs =<< getDataFile "interfaces.data"

35−

36−safeReadDocs :: FilePath -> IO Interfaces

37−safeReadDocs name =

38− E.catch (readDocs name) $ \err -> do

39− let _ = err :: IOError

40− hPutStrLn stderr $ unlines $

41− [ "Error reading types for standard library from file " ++ name

42− , " If you are using a stable version of Elm, please report an issue at"

43− , " <http://github.com/evancz/Elm/issues> specifying version numbers for"

44− , " Elm and your OS." ]

45− exitFailure

46−

47−readDocs :: FilePath -> IO Interfaces

48−readDocs filePath = do

49− interfaces <- Interface.load filePath

50− case mapM (Interface.isValid filePath) (interfaces :: [(String, ModuleInterface)]) of

51− Left err -> do

52− hPutStrLn stderr err

53− exitFailure

54−

55− Right [] -> do

56− hPutStrLn stderr "No interfaces found in serialized Prelude!"

57− exitFailure

58−

59− Right ifaces -> return $ Map.fromList ifaces

compiler/Parse/Binop.hsdeleted−84

@@ -1,84 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Parse.Binop (binops, OpTable) where

3−

4−import Control.Applicative ((<$>))

5−import qualified Data.List as List

6−import qualified Data.Map as Map

7−

8−import SourceSyntax.Annotation (merge)

9−import qualified SourceSyntax.Expression as E

10−import SourceSyntax.Declaration (Assoc(..))

11−import Text.Parsec

12−import Parse.Helpers

13−

14−opLevel :: OpTable -> String -> Int

15−opLevel table op = fst $ Map.findWithDefault (9,L) op table

16−

17−opAssoc :: OpTable -> String -> Assoc

18−opAssoc table op = snd $ Map.findWithDefault (9,L) op table

19−

20−hasLevel :: OpTable -> Int -> (String, E.ParseExpr) -> Bool

21−hasLevel table n (op,_) = opLevel table op == n

22−

23−binops :: IParser E.ParseExpr

24− -> IParser E.ParseExpr

25− -> IParser String

26− -> IParser E.ParseExpr

27−binops term last anyOp =

28− do e <- term

29− table <- getState

30− split table 0 e =<< nextOps

31− where

32− nextOps = choice [ commitIf (whitespace >> anyOp) $ do

33− whitespace ; op <- anyOp ; whitespace

34− expr <- Left <$> try term <|> Right <$> last

35− case expr of

36− Left t -> (:) (op,t) <$> nextOps

37− Right e -> return [(op,e)]

38− , return [] ]

39−

40−split :: OpTable

41− -> Int

42− -> E.ParseExpr

43− -> [(String, E.ParseExpr)]

44− -> IParser E.ParseExpr

45−split _ _ e [] = return e

46−split table n e eops = do

47− assoc <- getAssoc table n eops

48− es <- sequence (splitLevel table n e eops)

49− let ops = map fst (filter (hasLevel table n) eops)

50− case assoc of R -> joinR es ops

51− _ -> joinL es ops

52−

53−splitLevel :: OpTable -> Int -> E.ParseExpr -> [(String, E.ParseExpr)]

54− -> [IParser E.ParseExpr]

55−splitLevel table n e eops =

56− case break (hasLevel table n) eops of

57− (lops, (_op,e'):rops) ->

58− split table (n+1) e lops : splitLevel table n e' rops

59− (lops, []) -> [ split table (n+1) e lops ]

60−

61−joinL :: [E.ParseExpr] -> [String] -> IParser E.ParseExpr

62−joinL [e] [] = return e

63−joinL (a:b:es) (op:ops) = joinL (merge a b (E.Binop op a b) : es) ops

64−joinL _ _ = failure "Ill-formed binary expression. Report a compiler bug."

65−

66−joinR :: [E.ParseExpr] -> [String] -> IParser E.ParseExpr

67−joinR [e] [] = return e

68−joinR (a:b:es) (op:ops) = do e <- joinR (b:es) ops

69− return (merge a e (E.Binop op a e))

70−joinR _ _ = failure "Ill-formed binary expression. Report a compiler bug."

71−

72−getAssoc :: OpTable -> Int -> [(String,E.ParseExpr)] -> IParser Assoc

73−getAssoc table n eops

74− | all (==L) assocs = return L

75− | all (==R) assocs = return R

76− | all (==N) assocs = case assocs of [_] -> return N

77− _ -> failure (msg "precedence")

78− | otherwise = failure (msg "associativity")

79− where levelOps = filter (hasLevel table n) eops

80− assocs = map (opAssoc table . fst) levelOps

81− msg problem =

82− concat [ "Conflicting " ++ problem ++ " for binary operators ("

83− , List.intercalate ", " (map fst eops), "). "

84− , "Consider adding parentheses to disambiguate." ]

compiler/Parse/Declaration.hsdeleted−59

@@ -1,59 +0,0 @@

1−{-# OPTIONS_GHC -Wall -fno-warn-unused-do-bind #-}

2−module Parse.Declaration where

3−

4−import Control.Applicative ((<$>))

5−import Text.Parsec hiding (newline,spaces)

6−

7−import Parse.Helpers

8−import qualified Parse.Expression as Expr

9−import qualified Parse.Type as Type

10−import qualified SourceSyntax.Declaration as D

11−

12−

13−declaration :: IParser D.ParseDeclaration

14−declaration = alias <|> datatype <|> infixDecl <|> port <|> definition

15−

16−definition :: IParser D.ParseDeclaration

17−definition = D.Definition <$> Expr.def

18−

19−alias :: IParser D.ParseDeclaration

20−alias = do

21− reserved "type" <?> "type alias (type Point = {x:Int, y:Int})"

22− forcedWS

23− name <- capVar

24− args <- spacePrefix lowVar

25− padded equals

26− tipe <- Type.expr

27− return (D.TypeAlias name args tipe)

28−

29−datatype :: IParser D.ParseDeclaration

30−datatype = do

31− reserved "data" <?> "datatype definition (data T = A | B | ...)"

32− forcedWS

33− name <- capVar <?> "name of data-type"

34− args <- spacePrefix lowVar

35− padded equals

36− tcs <- pipeSep1 Type.constructor

37− return $ D.Datatype name args tcs

38−

39−

40−infixDecl :: IParser D.ParseDeclaration

41−infixDecl = do

42− assoc <- choice [ reserved "infixl" >> return D.L

43− , reserved "infix" >> return D.N

44− , reserved "infixr" >> return D.R ]

45− forcedWS

46− n <- digit

47− forcedWS

48− D.Fixity assoc (read [n]) <$> anyOp

49−

50−

51−port :: IParser D.ParseDeclaration

52−port =

53− do try (reserved "port")

54− whitespace

55− name <- lowVar

56− whitespace

57− let port' op ctor expr = do { try op ; whitespace ; ctor name <$> expr }

58− D.Port <$> choice [ port' hasType D.PPAnnotation Type.expr

59− , port' equals D.PPDef Expr.expr ]

compiler/Parse/Expression.hsdeleted−239

@@ -1,239 +0,0 @@

1−module Parse.Expression (def,term,typeAnnotation,expr) where

2−

3−import Control.Applicative ((<$>), (<*>))

4−import Data.List (foldl')

5−import Text.Parsec hiding (newline,spaces)

6−import Text.Parsec.Indent

7−

8−import Parse.Binop

9−import Parse.Helpers

10−import Parse.Literal

11−import qualified Parse.Pattern as Pattern

12−import qualified Parse.Type as Type

13−

14−import SourceSyntax.Annotation as Annotation

15−import qualified SourceSyntax.Pattern as P

16−import qualified SourceSyntax.Literal as L

17−import SourceSyntax.Expression

18−

19−

20−-------- Basic Terms --------

21−

22−varTerm :: IParser ParseExpr'

23−varTerm = toVar <$> var <?> "variable"

24−

25−toVar :: String -> ParseExpr'

26−toVar v = case v of "True" -> Literal (L.Boolean True)

27− "False" -> Literal (L.Boolean False)

28− _ -> rawVar v

29−

30−accessor :: IParser ParseExpr'

31−accessor = do

32− (start, lbl, end) <- located (try (string "." >> rLabel))

33− let loc e = Annotation.at start end e

34− return (Lambda (P.Var "_") (loc $ Access (loc $ rawVar "_") lbl))

35−

36−negative :: IParser ParseExpr'

37−negative = do

38− (start, nTerm, end) <-

39− located (try (char '-' >> notFollowedBy (char '.' <|> char '-')) >> term)

40− let loc e = Annotation.at start end e

41− return (Binop "-" (loc $ Literal (L.IntNum 0)) nTerm)

42−

43−

44−-------- Complex Terms --------

45−

46−listTerm :: IParser ParseExpr'

47−listTerm = markdown' <|> braces (try range <|> ExplicitList <$> commaSep expr)

48− where

49− range = do

50− lo <- expr

51− padded (string "..")

52− Range lo <$> expr

53−

54− markdown' = do

55− pos <- getPosition

56− let uid = show (sourceLine pos) ++ ":" ++ show (sourceColumn pos)

57− (rawText, exprs) <- markdown (interpolation uid)

58− return (Markdown uid (filter (/='\r') rawText) exprs)

59−

60− span uid index =

61− "<span id=\"md-" ++ uid ++ "-" ++ show index ++ "\">{{ markdown interpolation is in the pipeline, but still needs more testing }}</span>"

62−

63− interpolation uid exprs = do

64− try (string "{{")

65− e <- padded expr

66− string "}}"

67− return (span uid (length exprs), exprs ++ [e])

68−

69−parensTerm :: IParser ParseExpr

70−parensTerm = try (parens opFn) <|> parens (tupleFn <|> parened)

71− where

72− opFn = do

73− (start, op, end) <- located anyOp

74− let loc = Annotation.at start end

75− return . loc . Lambda (P.Var "x") . loc . Lambda (P.Var "y") . loc $

76− Binop op (loc $ rawVar "x") (loc $ rawVar "y")

77−

78− tupleFn = do

79− let comma = char ',' <?> "comma ','"

80− (start, commas, end) <- located (comma >> many (whitespace >> comma))

81− let vars = map (('v':) . show) [ 0 .. length commas + 1 ]

82− loc = Annotation.at start end

83− return $ foldr (\x e -> loc $ Lambda x e)

84− (loc . tuple $ map (loc . rawVar) vars) (map P.Var vars)

85−

86− parened = do

87− (start, es, end) <- located (commaSep expr)

88− return $ case es of

89− [e] -> e

90− _ -> Annotation.at start end (tuple es)

91−

92−recordTerm :: IParser ParseExpr

93−recordTerm = brackets $ choice [ misc, addLocation record ]

94− where

95− field = do

96− label <- rLabel

97− patterns <- spacePrefix Pattern.term

98− padded equals

99− body <- expr

100− return (label, makeFunction patterns body)

101−

102− record = Record <$> commaSep field

103−

104− change = do

105− lbl <- rLabel

106− padded (string "<-")

107− (,) lbl <$> expr

108−

109− remove r = addLocation (string "-" >> whitespace >> Remove r <$> rLabel)

110−

111− insert r = addLocation $ do

112− string "|" >> whitespace

113− Insert r <$> rLabel <*> (padded equals >> expr)

114−

115− modify r =

116− addLocation (string "|" >> whitespace >> Modify r <$> commaSep1 change)

117−

118− misc = try $ do

119− record <- addLocation (rawVar <$> rLabel)

120− opt <- padded (optionMaybe (remove record))

121− case opt of

122− Just e -> try (insert e) <|> return e

123− Nothing -> try (insert record) <|> try (modify record)

124−

125−

126−term :: IParser ParseExpr

127−term = addLocation (choice [ Literal <$> literal, listTerm, accessor, negative ])

128− <|> accessible (addLocation varTerm <|> parensTerm <|> recordTerm)

129− <?> "basic term (4, x, 'c', etc.)"

130−

131−-------- Applications --------

132−

133−appExpr :: IParser ParseExpr

134−appExpr = do

135− t <- term

136− ts <- constrainedSpacePrefix term $ \str ->

137− if null str then notFollowedBy (char '-') else return ()

138− return $ case ts of

139− [] -> t

140− _ -> foldl' (\f x -> Annotation.merge f x $ App f x) t ts

141−

142−-------- Normal Expressions --------

143−

144−binaryExpr :: IParser ParseExpr

145−binaryExpr = binops appExpr lastExpr anyOp

146− where lastExpr = addLocation (choice [ ifExpr, letExpr, caseExpr ])

147− <|> lambdaExpr

148−

149−ifExpr :: IParser ParseExpr'

150−ifExpr = reserved "if" >> whitespace >> (normal <|> multiIf)

151− where

152− normal = do

153− bool <- expr

154− padded (reserved "then")

155− thenBranch <- expr

156− whitespace <?> "an 'else' branch" ; reserved "else" <?> "an 'else' branch" ; whitespace

157− elseBranch <- expr

158− return $ MultiIf [(bool, thenBranch),

159− (Annotation.sameAs elseBranch (Literal . L.Boolean $ True), elseBranch)]

160− multiIf = MultiIf <$> spaceSep1 iff

161− where iff = do string "|" ; whitespace

162− b <- expr ; padded arrow

163− (,) b <$> expr

164−

165−lambdaExpr :: IParser ParseExpr

166−lambdaExpr = do char '\\' <|> char '\x03BB' <?> "anonymous function"

167− whitespace

168− args <- spaceSep1 Pattern.term

169− padded arrow

170− body <- expr

171− return (makeFunction args body)

172−

173−defSet :: IParser [ParseDef]

174−defSet = block (do d <- def ; whitespace ; return d)

175−

176−letExpr :: IParser ParseExpr'

177−letExpr = do

178− reserved "let" ; whitespace

179− defs <- defSet

180− padded (reserved "in")

181− Let defs <$> expr

182−

183−caseExpr :: IParser ParseExpr'

184−caseExpr = do

185− reserved "case"; e <- padded expr; reserved "of"; whitespace

186− Case e <$> (with <|> without)

187− where case_ = do p <- Pattern.expr

188− padded arrow

189− (,) p <$> expr

190− with = brackets (semiSep1 (case_ <?> "cases { x -> ... }"))

191− without = block (do c <- case_ ; whitespace ; return c)

192−

193−expr :: IParser ParseExpr

194−expr = addLocation (choice [ ifExpr, letExpr, caseExpr ])

195− <|> lambdaExpr

196− <|> binaryExpr

197− <?> "an expression"

198−

199−defStart :: IParser [P.Pattern]

200−defStart =

201− choice [ do p1 <- try Pattern.term

202− infics p1 <|> func p1

203− , func =<< (P.Var <$> parens symOp)

204− , (:[]) <$> Pattern.expr

205− ] <?> "the definition of a variable (x = ...)"

206− where

207− func pattern =

208− case pattern of

209− P.Var _ -> (pattern:) <$> spacePrefix Pattern.term

210− _ -> do try (lookAhead (whitespace >> string "="))

211− return [pattern]

212−

213− infics p1 = do

214− o:p <- try (whitespace >> anyOp)

215− p2 <- (whitespace >> Pattern.term)

216− return $ if o == '`' then [ P.Var $ takeWhile (/='`') p, p1, p2 ]

217− else [ P.Var (o:p), p1, p2 ]

218−

219−makeFunction :: [P.Pattern] -> ParseExpr -> ParseExpr

220−makeFunction args body@(A ann _) =

221− foldr (\arg body' -> A ann $ Lambda arg body') body args

222−

223−definition :: IParser ParseDef

224−definition = withPos $ do

225− (name:args) <- defStart

226− padded equals

227− body <- expr

228− return . Def name $ makeFunction args body

229−

230−typeAnnotation :: IParser ParseDef

231−typeAnnotation = TypeAnnotation <$> try start <*> Type.expr

232− where

233− start = do

234− v <- lowVar <|> parens symOp

235− padded hasType

236− return v

237−

238−def :: IParser ParseDef

239−def = typeAnnotation <|> definition

compiler/Parse/Helpers.hsdeleted−388

@@ -1,388 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Parse.Helpers where

3−

4−import Prelude hiding (until)

5−import Control.Applicative ((<$>),(<*>))

6−import Control.Monad

7−import Control.Monad.State

8−import Data.Char (isUpper)

9−import qualified Data.Set as Set

10−import qualified Data.Map as Map

11−import Text.Parsec hiding (newline,spaces,State)

12−import Text.Parsec.Indent

13−import qualified Text.Parsec.Token as T

14−

15−import SourceSyntax.Annotation as Annotation

16−import SourceSyntax.Declaration (Assoc)

17−import SourceSyntax.Expression

18−import SourceSyntax.Helpers as Help

19−import SourceSyntax.PrettyPrint

20−import SourceSyntax.Variable as Variable

21−

22−reserveds = [ "if", "then", "else"

23− , "case", "of"

24− , "let", "in"

25− , "data", "type"

26− , "module", "where"

27− , "import", "as", "hiding", "open"

28− , "export", "foreign"

29− , "deriving", "port" ]

30−

31−jsReserveds :: Set.Set String

32−jsReserveds = Set.fromList

33− [ "null", "undefined", "Nan", "Infinity", "true", "false", "eval"

34− , "arguments", "int", "byte", "char", "goto", "long", "final", "float"

35− , "short", "double", "native", "throws", "boolean", "abstract", "volatile"

36− , "transient", "synchronized", "function", "break", "case", "catch"

37− , "continue", "debugger", "default", "delete", "do", "else", "finally"

38− , "for", "function", "if", "in", "instanceof", "new", "return", "switch"

39− , "this", "throw", "try", "typeof", "var", "void", "while", "with", "class"

40− , "const", "enum", "export", "extends", "import", "super", "implements"

41− , "interface", "let", "package", "private", "protected", "public"

42− , "static", "yield"

43− -- reserved by the Elm runtime system

44− , "Elm", "ElmRuntime"

45− , "F2", "F3", "F4", "F5", "F6", "F7", "F8", "F9"

46− , "A2", "A3", "A4", "A5", "A6", "A7", "A8", "A9"

47− ]

48−

49−expecting = flip (<?>)

50−

51−type OpTable = Map.Map String (Int, Assoc)

52−type SourceM = State SourcePos

53−type IParser a = ParsecT String OpTable SourceM a

54−

55−iParse :: IParser a -> String -> Either ParseError a

56−iParse = iParseWithTable "" Map.empty

57−

58−iParseWithTable :: SourceName -> OpTable -> IParser a -> String -> Either ParseError a

59−iParseWithTable sourceName table aParser input =

60− runIndent sourceName $ runParserT aParser table sourceName input

61−

62−var :: IParser String

63−var = makeVar (letter <|> char '_' <?> "variable")

64−

65−lowVar :: IParser String

66−lowVar = makeVar (lower <?> "lower case variable")

67−capVar :: IParser String

68−capVar = makeVar (upper <?> "upper case variable")

69−

70−qualifiedVar :: IParser String

71−qualifiedVar = do

72− vars <- many ((++) <$> capVar <*> string ".")

73− (++) (concat vars) <$> lowVar

74−

75−rLabel :: IParser String

76−rLabel = lowVar

77−

78−innerVarChar :: IParser Char

79−innerVarChar = alphaNum <|> char '_' <|> char '\'' <?> ""

80−

81−makeVar :: IParser Char -> IParser String

82−makeVar p = do v <- (:) <$> p <*> many innerVarChar

83− guard (v `notElem` reserveds)

84− return v

85−

86−reserved :: String -> IParser String

87−reserved word =

88− try (string word >> notFollowedBy innerVarChar) >> return word

89− <?> "reserved word '" ++ word ++ "'"

90−

91−anyOp :: IParser String

92−anyOp = betwixt '`' '`' qualifiedVar <|> symOp <?> "infix operator (e.g. +, *, ||)"

93−

94−symOp :: IParser String

95−symOp = do op <- many1 (satisfy Help.isSymbol)

96− guard (op `notElem` [ "=", "..", "->", "--", "|", "\8594", ":" ])

97− case op of

98− "." -> notFollowedBy lower >> return op

99− "\8728" -> return "."

100− _ -> return op

101−

102−padded :: IParser a -> IParser a

103−padded p = do whitespace

104− out <- p

105− whitespace

106− return out

107−

108−equals :: IParser String

109−equals = string "="

110−

111−arrow :: IParser String

112−arrow = string "->" <|> string "\8594" <?> "arrow (->)"

113−

114−hasType :: IParser String

115−hasType = string ":" <?> "':' (a type annotation)'"

116−

117−

118−commitIf check p = commit <|> try p

119− where commit = do (try $ lookAhead check) >> p

120−

121−spaceySepBy1 :: IParser b -> IParser a -> IParser [a]

122−spaceySepBy1 sep p = do

123− a <- p

124− (a:) <$> many (commitIf (whitespace >> sep) (padded sep >> p))

125−

126−

127−commaSep1 :: IParser a -> IParser [a]

128−commaSep1 = spaceySepBy1 (char ',' <?> "comma ','")

129−

130−commaSep :: IParser a -> IParser [a]

131−commaSep = option [] . commaSep1

132−

133−semiSep1 :: IParser a -> IParser [a]

134−semiSep1 = spaceySepBy1 (char ';' <?> "semicolon ';'")

135−

136−pipeSep1 :: IParser a -> IParser [a]

137−pipeSep1 = spaceySepBy1 (char '|' <?> "type divider '|'")

138−

139−consSep1 :: IParser a -> IParser [a]

140−consSep1 = spaceySepBy1 (string "::" <?> "cons operator '::'")

141−

142−dotSep1 :: IParser a -> IParser [a]

143−dotSep1 p = (:) <$> p <*> many (try (char '.') >> p)

144−

145−spaceSep1 :: IParser a -> IParser [a]

146−spaceSep1 p = (:) <$> p <*> spacePrefix p

147−

148−spacePrefix p = constrainedSpacePrefix p (\_ -> return ())

149−

150−constrainedSpacePrefix p constraint =

151− many $ choice [ try (spacing >> lookAhead (oneOf "[({")) >> p

152− , try (spacing >> p)

153− ]

154− where

155− spacing = do

156− n <- whitespace

157− constraint n

158− indented

159−

160−failure msg = do

161− inp <- getInput

162− setInput ('x':inp)

163− anyToken

164− fail msg

165−

166−followedBy a b = do x <- a ; b ; return x

167−

168−betwixt a b c = do char a ; out <- c

169− char b <?> "closing '" ++ [b] ++ "'" ; return out

170−

171−surround a z name p = do

172− char a

173− v <- padded p

174− char z <?> unwords ["closing", name, show z]

175− return v

176−

177−braces :: IParser a -> IParser a

178−braces = surround '[' ']' "brace"

179−

180−parens :: IParser a -> IParser a

181−parens = surround '(' ')' "paren"

182−

183−brackets :: IParser a -> IParser a

184−brackets = surround '{' '}' "bracket"

185−

186−addLocation :: (Pretty a) => IParser a -> IParser (Annotation.Located a)

187−addLocation expr = do

188− (start, e, end) <- located expr

189− return (Annotation.at start end e)

190−

191−located :: IParser a -> IParser (SourcePos, a, SourcePos)

192−located p = do

193− start <- getPosition

194− e <- p

195− end <- getPosition

196− return (start, e, end)

197−

198−accessible :: IParser ParseExpr -> IParser ParseExpr

199−accessible expr = do

200− start <- getPosition

201− ce@(A _ e) <- expr

202− let rest f = do

203− let dot = char '.' >> notFollowedBy (char '.')

204− access <- optionMaybe (try dot <?> "field access (e.g. List.map)")

205− case access of

206− Nothing -> return ce

207− Just _ -> accessible $ do

208− v <- var <?> "field access (e.g. List.map)"

209− end <- getPosition

210− return (Annotation.at start end (f v))

211− case e of

212− Var (Variable.Raw (c:cs))

213− | isUpper c -> rest (\v -> rawVar (c:cs ++ '.':v))

214− | otherwise -> rest (Access ce)

215− _ -> rest (Access ce)

216−

217−

218−spaces :: IParser String

219−spaces = concat <$> many1 (multiComment <|> string " ") <?> "spaces"

220−

221−forcedWS :: IParser String

222−forcedWS = choice [ try $ (++) <$> spaces <*> (concat <$> many nl_space)

223− , try $ concat <$> many1 nl_space ]

224− where nl_space = try ((++) <$> (concat <$> many1 newline) <*> spaces)

225−

226−-- Just eats whitespace until the next meaningful character.

227−dumbWhitespace :: IParser String

228−dumbWhitespace = concat <$> many (spaces <|> newline)

229−

230−whitespace :: IParser String

231−whitespace = option "" forcedWS <?> "whitespace"

232−

233−freshLine :: IParser [[String]]

234−freshLine = try (many1 newline >> many space_nl) <|> try (many1 space_nl) <?> ""

235− where space_nl = try $ spaces >> many1 newline

236−

237−newline :: IParser String

238−newline = simpleNewline <|> lineComment <?> "newline"

239−

240−simpleNewline :: IParser String

241−simpleNewline = try (string "\r\n") <|> string "\n"

242−

243−lineComment :: IParser String

244−lineComment = do

245− try (string "--")

246− comment <- anyUntil $ simpleNewline <|> (eof >> return "\n")

247− return ("--" ++ comment)

248−

249−multiComment :: IParser String

250−multiComment = (++) <$> try (string "{-") <*> closeComment

251−

252−closeComment :: IParser String

253−closeComment =

254− anyUntil . choice $

255− [ try (string "-}") <?> "close comment"

256− , concat <$> sequence [ try (string "{-"), closeComment, closeComment ]

257− ]

258−

259−until :: IParser a -> IParser b -> IParser b

260−until p end = go

261− where

262− go = end <|> (p >> go)

263−

264−anyUntil :: IParser String -> IParser String

265−anyUntil end = go

266− where

267− go = end <|> (:) <$> anyChar <*> go

268−

269−ignoreUntil :: IParser a -> IParser (Maybe a)

270−ignoreUntil end = go

271− where

272− ignore p = const () <$> p

273− filler = choice [ try (ignore chr) <|> ignore str

274− , ignore multiComment

275− , ignore (markdown (\_ -> mzero))

276− , ignore anyChar

277− ]

278− go = choice [ Just <$> end

279− , filler `until` choice [ const Nothing <$> eof, newline >> go ]

280− ]

281−

282−onFreshLines :: (a -> b -> b) -> b -> IParser a -> IParser b

283−onFreshLines insert init thing = go init

284− where

285− go values = do

286− optionValue <- ignoreUntil thing

287− case optionValue of

288− Nothing -> return values

289− Just v -> go (insert v values)

290−

291−withSource :: IParser a -> IParser (String, a)

292−withSource p = do

293− start <- getParserState

294− result <- p

295− endPos <- getPosition

296− setParserState start

297− raw <- anyUntilPos endPos

298− return (raw, result)

299−

300−anyUntilPos :: SourcePos -> IParser String

301−anyUntilPos pos = go

302− where

303− go = do currentPos <- getPosition

304− case currentPos == pos of

305− True -> return []

306− False -> (:) <$> anyChar <*> go

307−

308−markdown :: ([a] -> IParser (String, [a])) -> IParser (String, [a])

309−markdown interpolation = try (string "[markdown|") >> closeMarkdown (++ "") []

310− where

311− closeMarkdown md stuff =

312− choice [ do try (string "|]")

313− return (md "", stuff)

314− , (\(m,s) -> closeMarkdown (md . (m ++)) s) =<< interpolation stuff

315− , do c <- anyChar

316− closeMarkdown (md . ([c]++)) stuff

317− ]

318−

319−--str :: IParser String

320−str = expecting "String" $ do

321− s <- choice [ multiStr, singleStr ]

322− processAs T.stringLiteral . sandwich '\"' $ concat s

323− where

324− rawString quote insides =

325− quote >> manyTill insides quote

326−

327− multiStr = rawString (try (string "\"\"\"")) multilineStringChar

328− singleStr = rawString (char '"') stringChar

329−

330− stringChar :: IParser String

331− stringChar = choice [ newlineChar, escaped '\"', (:[]) <$> satisfy (/= '\"') ]

332−

333− multilineStringChar :: IParser String

334− multilineStringChar =

335− do noEnd

336− choice [ newlineChar, escaped '\"', expandQuote <$> anyChar ]

337− where

338− noEnd = notFollowedBy (string "\"\"\"")

339− expandQuote c = if c == '\"' then "\\\"" else [c]

340−

341− newlineChar :: IParser String

342− newlineChar =

343− choice [ char '\n' >> return "\\n"

344− , char '\r' >> return "\\r" ]

345−

346−sandwich :: Char -> String -> String

347−sandwich delim s = delim : s ++ [delim]

348−

349−escaped :: Char -> IParser String

350−escaped delim = try $ do

351− char '\\'

352− c <- char '\\' <|> char delim

353− return ['\\', c]

354−

355−chr :: IParser Char

356−chr = betwixt '\'' '\'' character <?> "character"

357− where

358− nonQuote = satisfy (/='\'')

359− character = do

360− c <- choice [ escaped '\''

361− , (:) <$> char '\\' <*> many1 nonQuote

362− , (:[]) <$> nonQuote ]

363− processAs T.charLiteral $ sandwich '\'' c

364−

365−processAs :: (T.GenTokenParser String u SourceM -> IParser a) -> String -> IParser a

366−processAs processor s = calloutParser s (processor lexer)

367− where

368− calloutParser :: String -> IParser a -> IParser a

369− calloutParser inp p = either (fail . show) return (iParse p inp)

370−

371− lexer :: T.GenTokenParser String u SourceM

372− lexer = T.makeTokenParser elmDef

373−

374− -- I don't know how many of these are necessary for charLiteral/stringLiteral

375− elmDef :: T.GenLanguageDef String u SourceM

376− elmDef = T.LanguageDef

377− { T.commentStart = "{-"

378− , T.commentEnd = "-}"

379− , T.commentLine = "--"

380− , T.nestedComments = True

381− , T.identStart = undefined

382− , T.identLetter = undefined

383− , T.opStart = undefined

384− , T.opLetter = undefined

385− , T.reservedNames = reserveds

386− , T.reservedOpNames = [":", "->", "<-", "|"]

387− , T.caseSensitive = True

388− }

compiler/Parse/Literal.hsdeleted−40

@@ -1,40 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Parse.Literal (literal) where

3−

4−import Control.Applicative ((<$>))

5−import Text.Parsec hiding (newline,spaces)

6−import Parse.Helpers

7−import SourceSyntax.Literal

8−

9−literal :: IParser Literal

10−literal = num <|> (Str <$> str) <|> (Chr <$> chr) <?> "literal"

11−

12−num :: IParser Literal

13−num = toLit <$> (number <?> "number")

14− where

15− toLit n

16− | any (`elem` ".eE") n = FloatNum (read n)

17− | otherwise = IntNum (read n)

18−

19− number = concat <$> sequence

20− [ option "" minus

21− , many1 digit

22− , option "" decimals

23− , option "" exponent ]

24−

25− minus = try $ do

26− string "-"

27− lookAhead digit

28− return "-"

29−

30− decimals = do

31− try $ lookAhead (string "." >> digit)

32− string "."

33− n <- many1 digit

34− return ('.' : n)

35−

36− exponent = do

37− string "e" <|> string "E"

38− op <- option "" (string "+" <|> string "-")

39− n <- many1 digit

40− return ('e' : op ++ n)

compiler/Parse/Module.hsdeleted−59

@@ -1,59 +0,0 @@

1−module Parse.Module (moduleDef, getModuleName, imports) where

2−

3−import Control.Applicative ((<$>), (<*>))

4−import Data.List (intercalate)

5−import Text.Parsec hiding (newline,spaces)

6−

7−import Parse.Helpers

8−import SourceSyntax.Module (ImportMethod(..), Imports)

9−

10−varList :: IParser [String]

11−varList = commaSep1 (var <|> parens symOp)

12−

13−getModuleName :: String -> Maybe String

14−getModuleName source =

15− case iParse getModuleName source of

16− Right name -> Just name

17− Left _ -> Nothing

18− where

19− getModuleName = do

20− optional freshLine

21− (names, _) <- moduleDef

22− return (intercalate "." names)

23−

24−moduleDef :: IParser ([String], [String])

25−moduleDef = do

26− try (reserved "module")

27− whitespace

28− names <- dotSep1 capVar <?> "name of module"

29− whitespace

30− exports <- option [] (parens varList)

31− whitespace <?> "reserved word 'where'"

32− reserved "where"

33− return (names, exports)

34−

35−imports :: IParser Imports

36−imports = option [] ((:) <$> import' <*> many (try (freshLine >> import')))

37−

38−import' :: IParser (String, ImportMethod)

39−import' =

40− do reserved "import"

41− whitespace

42− name <- intercalate "." <$> dotSep1 capVar

43− (,) name <$> option (As name) method

44− where

45− method :: IParser ImportMethod

46− method = try $ do whitespace

47− as' <|> importing'

48−

49− as' :: IParser ImportMethod

50− as' = do

51− reserved "as"

52− whitespace

53− As <$> capVar <?> "alias for module"

54−

55− importing' :: IParser ImportMethod

56− importing' =

57− parens (choice [ const (Hiding []) <$> string ".."

58− , Importing <$> varList

59− ] <?> "listing of imported values (x,y,z)")

compiler/Parse/Parse.hsdeleted−73

@@ -1,73 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Parse.Parse (program, dependencies) where

3−

4−import Control.Applicative ((<$>), (<*>))

5−import qualified Data.List as List

6−import qualified Data.Map as Map

7−import Text.Parsec hiding (newline,spaces)

8−import qualified Text.PrettyPrint as P

9−

10−import qualified SourceSyntax.Declaration as D

11−import qualified SourceSyntax.Module as M

12−import Parse.Helpers

13−import Parse.Declaration (infixDecl)

14−import Parse.Module

15−import qualified Parse.Declaration as Decl

16−import Transform.Declaration (combineAnnotations)

17−

18−freshDef = commitIf (freshLine >> (letter <|> char '_')) $ do

19− freshLine

20− Decl.declaration <?> "another datatype or variable definition"

21−

22−decls = do d <- Decl.declaration <?> "at least one datatype or variable definition"

23− (d:) <$> many freshDef

24−

25−program :: OpTable -> String -> Either [P.Doc] (M.Module D.Declaration)

26−program table src =

27− do (M.Module names exs ims parseDecls) <- setupParserWithTable table programParser src

28− decls <- either (\err -> Left [P.text err]) Right (combineAnnotations parseDecls)

29− return $ M.Module names exs ims decls

30−

31−programParser :: IParser (M.Module D.ParseDeclaration)

32−programParser =

33− do optional freshLine

34− (names,exports) <- option (["Main"],[]) (moduleDef `followedBy` freshLine)

35− is <- (do try (lookAhead $ reserved "import")

36− imports `followedBy` freshLine) <|> return []

37− declarations <- decls

38− optional freshLine ; optional spaces ; eof

39− return $ M.Module names exports is declarations

40−

41−dependencies :: String -> Either [P.Doc] (String, [String])

42−dependencies =

43− let getName = List.intercalate "." . fst in

44− setupParser $ do

45− optional freshLine

46− (,) <$> option "Main" (getName <$> moduleDef `followedBy` freshLine)

47− <*> option [] (map fst <$> imports `followedBy` freshLine)

48−

49−setupParserWithTable :: OpTable -> IParser a -> String -> Either [P.Doc] a

50−setupParserWithTable table p source =

51− do localTable <- setupParser parseFixities source

52− case Map.intersection table localTable of

53− overlap | not (Map.null overlap) -> Left [ msg overlap ]

54− | otherwise ->

55− flip setupParser source $ do

56− putState (Map.union table localTable)

57− p

58− where

59− msg overlap =

60− P.vcat [ P.text "Parse error:"

61− , P.text $ "Overlapping definitions for infix operators: " ++

62− List.intercalate " " (Map.keys overlap)

63− ]

64−

65−parseFixities = do

66− decls <- onFreshLines (:) [] infixDecl

67− return $ Map.fromList [ (op,(lvl,assoc)) | D.Fixity assoc lvl op <- decls ]

68−

69−setupParser :: IParser a -> String -> Either [P.Doc] a

70−setupParser p source =

71− case iParse p source of

72− Right result -> Right result

73− Left err -> Left [ P.text $ "Parse error at " ++ show err ]

compiler/Parse/Pattern.hsdeleted−61

@@ -1,61 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Parse.Pattern (term, expr) where

3−

4−import Control.Applicative ((<$>))

5−import Data.Char (isUpper)

6−import qualified Data.List as List

7−import Text.Parsec hiding (newline,spaces,State)

8−

9−import Parse.Helpers

10−import Parse.Literal

11−import SourceSyntax.Literal

12−import qualified SourceSyntax.Pattern as P

13−

14−basic :: IParser P.Pattern

15−basic = choice

16− [ char '_' >> return P.Anything

17− , do v <- var

18− return $ case v of

19− "True" -> P.Literal (Boolean True)

20− "False" -> P.Literal (Boolean False)

21− c:_ | isUpper c -> P.Data v []

22− _ -> P.Var v

23− , P.Literal <$> literal

24− ]

25−

26−asPattern :: P.Pattern -> IParser P.Pattern

27−asPattern pattern = do

28− var <- optionMaybe (try (whitespace >> reserved "as" >> whitespace >> lowVar))

29− return $ case var of

30− Just v -> P.Alias v pattern

31− Nothing -> pattern

32−

33−record :: IParser P.Pattern

34−record = P.Record <$> brackets (commaSep1 lowVar)

35−

36−tuple :: IParser P.Pattern

37−tuple = do

38− ps <- parens (commaSep expr)

39− return $ case ps of

40− [p] -> p

41− _ -> P.tuple ps

42−

43−list :: IParser P.Pattern

44−list = P.list <$> braces (commaSep expr)

45−

46−term :: IParser P.Pattern

47−term =

48− (choice [ record, tuple, list, basic ]) <?> "pattern"

49−

50−patternConstructor :: IParser P.Pattern

51−patternConstructor = do

52− v <- List.intercalate "." <$> dotSep1 capVar

53− case v of

54− "True" -> return $ P.Literal (Boolean True)

55− "False" -> return $ P.Literal (Boolean False)

56− _ -> P.Data v <$> spacePrefix term

57−

58−expr :: IParser P.Pattern

59−expr = do

60− patterns <- consSep1 (patternConstructor <|> term)

61− asPattern (foldr1 P.cons patterns) <?> "pattern"

compiler/Parse/Type.hsdeleted−74

@@ -1,74 +0,0 @@

1−{-# OPTIONS_GHC -Wall -fno-warn-unused-do-bind #-}

2−module Parse.Type where

3−

4−import Control.Applicative ((<$>),(<*>),(<*))

5−import Data.List (intercalate)

6−import Text.Parsec

7−

8−import SourceSyntax.Type as T

9−import Parse.Helpers

10−

11−tvar :: IParser T.Type

12−tvar = T.Var <$> lowVar <?> "type variable"

13−

14−list :: IParser T.Type

15−list = listOf <$> braces expr

16−

17−tuple :: IParser T.Type

18−tuple = do ts <- parens (commaSep expr)

19− return $ case ts of

20− [t] -> t

21− _ -> tupleOf ts

22−

23−record :: IParser T.Type

24−record =

25− do char '{' ; whitespace

26− rcrd <- extended <|> normal

27− dumbWhitespace ; char '}'

28− return rcrd

29− where

30− normal = flip T.Record Nothing <$> commaSep field

31−

32− -- extended record types require at least one field

33− extended = do

34− ext <- try (lowVar <* (whitespace >> string "|"))

35− whitespace

36− flip T.Record (Just ext) <$> commaSep1 field

37−

38− field = do

39− lbl <- rLabel

40− whitespace >> hasType >> whitespace

41− (,) lbl <$> expr

42−

43−capTypeVar :: IParser String

44−capTypeVar = intercalate "." <$> dotSep1 capVar

45−

46−constructor0 :: IParser T.Type

47−constructor0 =

48− do name <- capTypeVar

49− return (T.Data name [])

50−

51−term :: IParser T.Type

52−term = list <|> tuple <|> record <|> tvar <|> constructor0

53−

54−app :: IParser T.Type

55−app =

56− do name <- capTypeVar <|> try tupleCtor <?> "type constructor"

57− args <- spacePrefix term

58− return (T.Data name args)

59− where

60− tupleCtor = do

61− n <- length <$> parens (many (char ','))

62− return $ "_Tuple" ++ show (if n == 0 then 0 else n+1)

63−

64−expr :: IParser T.Type

65−expr =

66− do t1 <- app <|> term

67− arr <- optionMaybe $ try (whitespace >> arrow)

68− case arr of

69− Just _ -> T.Lambda t1 <$> (whitespace >> expr)

70− Nothing -> return t1

71−

72−constructor :: IParser (String, [T.Type])

73−constructor = (,) <$> (capTypeVar <?> "another type constructor")

74− <*> spacePrefix term

compiler/Paths_Elmdeleted−15

@@ -1,15 +0,0 @@

1−-- This is a dummy file, but it should not be removed.

2−-- It makes it possible to build the compiler in GHCi, so you

3−-- can do some testing from within emacs (or whatever inferior

4−-- editor you use instead).

5−

6−module Paths_Elm where

7−

8−import Data.Version

9−import System.FilePath

10−

11−getDataFileName :: FilePath -> IO FilePath

12−getDataFileName path = return ("dist" </> "data" </> path)

13−

14−version :: Version

15−version = Version [0,8,0,3] []

compiler/SourceSyntax/Annotation.hsdeleted−74

@@ -1,74 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module SourceSyntax.Annotation where

3−

4−import qualified Text.Parsec.Pos as Parsec

5−import qualified Text.PrettyPrint as P

6−import SourceSyntax.PrettyPrint

7−

8−data Annotated annotation expr = A annotation expr

9− deriving (Show)

10−

11−data Region

12− = Span Position Position P.Doc

13− | None P.Doc

14− deriving (Show)

15−

16−data Position = Position

17− { line :: Int

18− , column :: Int

19− } deriving (Show)

20−

21−type Located expr = Annotated Region expr

22−

23−none e = A (None (pretty e)) e

24−noneNoDocs e = A (None P.empty) e

25−

26−at :: (Pretty expr) => Parsec.SourcePos -> Parsec.SourcePos -> expr

27− -> Annotated Region expr

28−at start end e =

29− A (Span (position start) (position end) (pretty e)) e

30− where

31− position loc = Position (Parsec.sourceLine loc) (Parsec.sourceColumn loc)

32−

33−merge (A s1 _) (A s2 _) e =

34− A (span (pretty e)) e

35− where

36− span = case (s1,s2) of

37− (Span start _ _, Span _ end _) -> Span start end

38− (Span start end _, _) -> Span start end

39− (_, Span start end _) -> Span start end

40− (_, _) -> None

41−

42−mergeOldDocs (A s1 _) (A s2 _) e =

43− A span e

44− where

45− span = case (s1,s2) of

46− (Span start _ d1, Span _ end d2) ->

47− Span start end (P.vcat [d1, P.text "\n", d2])

48−

49− (Span _ _ _, _) -> s1

50− (_, Span _ _ _) -> s2

51− (_, _) -> None P.empty

52−

53−sameAs :: Annotated a expr -> expr' -> Annotated a expr'

54−sameAs (A annotation _) expr = A annotation expr

55−

56−getRegionDocs region =

57− case region of

58− Span _ _ doc -> doc

59− None doc -> doc

60−

61−instance Pretty Region where

62− pretty span =

63− case span of

64− None _ -> P.empty

65− Span start end _ ->

66− P.text $

67− case line start == line end of

68− False -> "between lines " ++ show (line start) ++ " and " ++ show (line end)

69− True -> "on line " ++ show (line end) ++ ", column " ++

70− show (column start) ++ " to " ++ show (column end)

71−

72−instance Pretty e => Pretty (Annotated a e) where

73− pretty (A _ e) = pretty e

74−

compiler/SourceSyntax/Declaration.hsdeleted−99

@@ -1,99 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module SourceSyntax.Declaration where

3−

4−import Data.Binary

5−import qualified SourceSyntax.Expression as Expr

6−import qualified SourceSyntax.Type as T

7−import SourceSyntax.PrettyPrint

8−import Text.PrettyPrint as P

9−

10−data Declaration' port def

11− = Definition def

12− | Datatype String [String] [(String,[T.Type])]

13− | TypeAlias String [String] T.Type

14− | Port port

15− | Fixity Assoc Int String

16− deriving (Show)

17−

18−data Assoc = L | N | R

19− deriving (Eq)

20−

21−data ParsePort

22− = PPAnnotation String T.Type

23− | PPDef String Expr.ParseExpr

24− deriving (Show)

25−

26−data Port

27− = Out String Expr.Expr T.Type

28− | In String T.Type

29− deriving (Show)

30−

31−portName :: Port -> String

32−portName port =

33− case port of

34− Out name _ _ -> name

35− In name _ -> name

36−

37−type ParseDeclaration = Declaration' ParsePort Expr.ParseDef

38−type Declaration = Declaration' Port Expr.Def

39−

40−instance Show Assoc where

41− show assoc =

42− case assoc of

43− L -> "left"

44− N -> "non"

45− R -> "right"

46−

47−instance Binary Assoc where

48− get = do n <- getWord8

49− return $ case n of

50− 0 -> L

51− 1 -> N

52− 2 -> R

53− _ -> error "Error reading valid associativity from serialized string"

54−

55− put assoc = putWord8 $ case assoc of { L -> 0 ; N -> 1 ; R -> 2 }

56−

57−instance (Pretty port, Pretty def) => Pretty (Declaration' port def) where

58− pretty decl =

59− case decl of

60− Definition def -> pretty def

61−

62− Datatype tipe tvars ctors ->

63− P.hang (P.text "data" <+> P.text tipe <+> P.hsep (map P.text tvars)) 4

64− (P.sep $ zipWith join ("=" : repeat "|") ctors)

65− where

66− join c ctor = P.text c <+> prettyCtor ctor

67− prettyCtor (name, tipes) =

68− P.hang (P.text name) 2 (P.sep (map T.prettyParens tipes))

69−

70− TypeAlias name tvars tipe ->

71− P.hang (P.text "type" <+> name' <+> P.equals) 4 (pretty tipe)

72− where

73− name' = P.text name <+> P.hsep (map P.text tvars)

74−

75− Port port -> pretty port

76−

77− Fixity assoc prec op -> P.text "infix" <> assoc' <+> P.int prec <+> P.text op

78− where

79− assoc' = case assoc of

80− L -> P.text "l"

81− N -> P.empty

82− R -> P.text "r"

83−

84−instance Pretty ParsePort where

85− pretty port =

86− case port of

87− PPAnnotation name tipe -> prettyPort name ":" tipe

88− PPDef name expr -> prettyPort name "=" expr

89−

90−instance Pretty Port where

91− pretty port =

92− case port of

93− In name tipe -> prettyPort name ":" tipe

94− Out name expr tipe -> P.vcat [ prettyPort name ":" tipe

95− , prettyPort name "=" expr ]

96−

97−

98−prettyPort :: (Pretty a) => String -> String -> a -> Doc

99−prettyPort name op e = P.text "port" <+> P.text name <+> P.text op <+> pretty e

compiler/SourceSyntax/Expression.hsdeleted−229

@@ -1,229 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−

3−{-| The Abstract Syntax Tree (AST) for expressions comes in a couple formats.

4−The first is the fully general version and is labeled with a prime (Expr').

5−The others are specialized versions of the AST that represent specific phases

6−of the compilation process. I expect there to be more phases as we begin to

7−enrich the AST with more information.

8−-}

9−module SourceSyntax.Expression where

10−

11−import SourceSyntax.PrettyPrint

12−import Text.PrettyPrint as P

13−import qualified SourceSyntax.Helpers as Help

14−import qualified SourceSyntax.Annotation as Annotation

15−import qualified SourceSyntax.Pattern as Pattern

16−import qualified SourceSyntax.Type as SrcType

17−import qualified SourceSyntax.Literal as Literal

18−import qualified SourceSyntax.Variable as Variable

19−

20−---- GENERAL AST ----

21−

22−{-| This is a fully general Abstract Syntax Tree (AST) for expressions. It has

23−"type holes" that allow us to enrich the AST with additional information as we

24−move through the compilation process. The type holes are used to represent:

25−

26− ann: Annotations for arbitrary expressions. Allows you to add information

27− to the AST like position in source code or inferred types.

28−

29− def: Definition style. The source syntax separates type annotations and

30− definitions, but after parsing we check that they are well formed and

31− collapse them.

32−

33− var: Representation of variables. Starts as strings, but is later enriched

34− with information about what module a variable came from.

35−

36−-}

37−type GeneralExpr annotation definition variable =

38− Annotation.Annotated annotation (GeneralExpr' annotation definition variable)

39−

40−data GeneralExpr' ann def var

41− = Literal Literal.Literal

42− | Var var

43− | Range (GeneralExpr ann def var) (GeneralExpr ann def var)

44− | ExplicitList [GeneralExpr ann def var]

45− | Binop String (GeneralExpr ann def var) (GeneralExpr ann def var)

46− | Lambda Pattern.Pattern (GeneralExpr ann def var)

47− | App (GeneralExpr ann def var) (GeneralExpr ann def var)

48− | MultiIf [(GeneralExpr ann def var,GeneralExpr ann def var)]

49− | Let [def] (GeneralExpr ann def var)

50− | Case (GeneralExpr ann def var) [(Pattern.Pattern, GeneralExpr ann def var)]

51− | Data String [GeneralExpr ann def var]

52− | Access (GeneralExpr ann def var) String

53− | Remove (GeneralExpr ann def var) String

54− | Insert (GeneralExpr ann def var) String (GeneralExpr ann def var)

55− | Modify (GeneralExpr ann def var) [(String, GeneralExpr ann def var)]

56− | Record [(String, GeneralExpr ann def var)]

57− | Markdown String String [GeneralExpr ann def var]

58− -- for type checking and code gen only

59− | PortIn String SrcType.Type

60− | PortOut String SrcType.Type (GeneralExpr ann def var)

61− deriving (Show)

62−

63−

64−---- SPECIALIZED ASTs ----

65−

66−{-| Expressions created by the parser. These use a split representation of type

67−annotations and definitions, which is how they appear in source code and how

68−they are parsed.

69−-}

70−type ParseExpr = GeneralExpr Annotation.Region ParseDef Variable.Raw

71−type ParseExpr' = GeneralExpr' Annotation.Region ParseDef Variable.Raw

72−

73−data ParseDef

74− = Def Pattern.Pattern ParseExpr

75− | TypeAnnotation String SrcType.Type

76− deriving (Show)

77−

78−{-| "Normal" expressions. When the compiler checks that type annotations and

79−ports are all paired with definitions in the appropriate order, it collapses

80−them into a Def that is easier to work with in later phases of compilation.

81−-}

82−type Expr = GeneralExpr Annotation.Region Def Variable.Raw

83−type Expr' = GeneralExpr' Annotation.Region Def Variable.Raw

84−

85−data Def = Definition Pattern.Pattern Expr (Maybe SrcType.Type)

86− deriving (Show)

87−

88−

89−

90−---- UTILITIES ----

91−

92−rawVar :: String -> GeneralExpr' ann def Variable.Raw

93−rawVar x = Var (Variable.Raw x)

94−

95−tuple :: [GeneralExpr ann def var] -> GeneralExpr' ann def var

96−tuple es = Data ("_Tuple" ++ show (length es)) es

97−

98−delist :: GeneralExpr ann def var -> [GeneralExpr ann def var]

99−delist (Annotation.A _ (Data "::" [h,t])) = h : delist t

100−delist _ = []

101−

102−saveEnvName :: String

103−saveEnvName = "_save_the_environment!!!"

104−

105−dummyLet :: (Pretty def) => [def] -> GeneralExpr Annotation.Region def Variable.Raw

106−dummyLet defs =

107− Annotation.none $ Let defs (Annotation.none $ rawVar saveEnvName)

108−

109−instance (Pretty def, Pretty var) => Pretty (GeneralExpr' ann def var) where

110− pretty expr =

111− case expr of

112− Literal lit -> pretty lit

113−

114− Var x -> pretty x

115−

116− Range e1 e2 -> P.brackets (pretty e1 <> P.text ".." <> pretty e2)

117−

118− ExplicitList es -> P.brackets (commaCat (map pretty es))

119−

120− Binop "-" (Annotation.A _ (Literal (Literal.IntNum 0))) e ->

121− P.text "-" <> prettyParens e

122−

123− Binop op e1 e2 -> P.sep [ prettyParens e1 <+> P.text op', prettyParens e2 ]

124− where

125− op' = if Help.isOp op then op else "`" ++ op ++ "`"

126−

127− Lambda p e -> P.text "\\" <> args <+> P.text "->" <+> pretty body

128− where

129− (ps,body) = collectLambdas (Annotation.A undefined $ Lambda p e)

130− args = P.sep (map Pattern.prettyParens ps)

131−

132− App _ _ -> P.hang func 2 (P.sep args)

133− where

134− func:args = map prettyParens (collectApps (Annotation.A undefined expr))

135−

136− MultiIf branches -> P.text "if" $$ nest 3 (vcat $ map iff branches)

137− where

138− iff (b,e) = P.text "|" <+> P.hang (pretty b <+> P.text "->") 2 (pretty e)

139−

140− Let defs e ->

141− P.sep [ P.hang (P.text "let") 4 (P.vcat (map pretty defs))

142− , P.text "in" <+> pretty e ]

143−

144− Case e pats ->

145− P.hang pexpr 2 (P.vcat (map pretty' pats))

146− where

147− pexpr = P.sep [ P.text "case" <+> pretty e, P.text "of" ]

148− pretty' (p,b) = pretty p <+> P.text "->" <+> pretty b

149−

150− Data "::" [hd,tl] -> pretty hd <+> P.text "::" <+> pretty tl

151− Data "[]" [] -> P.text "[]"

152− Data name es

153− | Help.isTuple name -> P.parens (commaCat (map pretty es))

154− | otherwise -> P.hang (P.text name) 2 (P.sep (map prettyParens es))

155−

156− Access e x -> prettyParens e <> P.text "." <> variable x

157−

158− Remove e x -> P.braces (pretty e <+> P.text "-" <+> variable x)

159−

160− Insert (Annotation.A _ (Remove e y)) x v ->

161− P.braces $ P.hsep [ pretty e, P.text "-", variable y, P.text "|"

162− , variable x, P.equals, pretty v ]

163−

164− Insert e x v ->

165− P.braces (pretty e <+> P.text "|" <+> variable x <+> P.equals <+> pretty v)

166−

167− Modify e fs ->

168− P.braces $ P.hang (pretty e <+> P.text "|")

169− 4

170− (commaSep $ map field fs)

171− where

172− field (k,v) = variable k <+> P.text "<-" <+> pretty v

173−

174− Record fs ->

175− P.braces $ P.nest 2 (commaSep $ map field fs)

176− where

177− field (x,e) = variable x <+> P.equals <+> pretty e

178−

179− Markdown _ _ _ -> P.text "[markdown| ... |]"

180−

181− PortIn name _ -> P.text $ "<port:" ++ name ++ ">"

182−

183− PortOut _ _ signal -> pretty signal

184−

185−instance Pretty ParseDef where

186− pretty def =

187− case def of

188− TypeAnnotation name tipe ->

189− variable name <+> P.colon <+> pretty tipe

190− Def pattern expr ->

191− pretty pattern <+> P.equals <+> pretty expr

192−

193−instance Pretty Def where

194− pretty (Definition pattern expr maybeTipe) =

195− P.vcat [ annotation, definition ]

196− where

197− definition = pretty pattern <+> P.equals <+> pretty expr

198− annotation = case maybeTipe of

199− Nothing -> P.empty

200− Just tipe -> pretty pattern <+> P.colon <+> pretty tipe

201−

202−collectApps :: GeneralExpr ann def var -> [GeneralExpr ann def var]

203−collectApps annExpr@(Annotation.A _ expr) =

204− case expr of

205− App a b -> collectApps a ++ [b]

206− _ -> [annExpr]

207−

208−collectLambdas :: GeneralExpr ann def var -> ([Pattern.Pattern], GeneralExpr ann def var)

209−collectLambdas lexpr@(Annotation.A _ expr) =

210− case expr of

211− Lambda pattern body ->

212− let (ps, body') = collectLambdas body

213− in (pattern : ps, body')

214−

215− _ -> ([], lexpr)

216−

217−prettyParens :: (Pretty def, Pretty var) => GeneralExpr ann def var -> Doc

218−prettyParens (Annotation.A _ expr) = parensIf needed (pretty expr)

219− where

220− needed =

221− case expr of

222− Binop _ _ _ -> True

223− Lambda _ _ -> True

224− App _ _ -> True

225− MultiIf _ -> True

226− Let _ _ -> True

227− Case _ _ -> True

228− Data name (_:_) -> name /= "::"

229− _ -> False

compiler/SourceSyntax/Helpers.hsdeleted−27

@@ -1,27 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module SourceSyntax.Helpers where

3−

4−import qualified Data.Char as Char

5−

6−splitDots :: String -> [String]

7−splitDots = go []

8− where

9− go vars str =

10− case break (=='.') str of

11− (x,_:rest) | isOp x -> vars ++ [x ++ '.' : rest]

12− | otherwise -> go (vars ++ [x]) rest

13− (x,[]) -> vars ++ [x]

14−

15−brkt :: String -> String

16−brkt s = "{ " ++ s ++ " }"

17−

18−isTuple :: String -> Bool

19−isTuple name =

20− take 6 name == "_Tuple" && all Char.isDigit (drop 6 name)

21−

22−isOp :: String -> Bool

23−isOp = all isSymbol

24−

25−isSymbol :: Char -> Bool

26−isSymbol c =

27− Char.isSymbol c || elem c "+-/*=.$<>:&|^?%#@~!"

compiler/SourceSyntax/Literal.hsdeleted−21

@@ -1,21 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module SourceSyntax.Literal where

3−

4−import SourceSyntax.PrettyPrint

5−import qualified Text.PrettyPrint as PP

6−

7−data Literal = IntNum Int

8− | FloatNum Double

9− | Chr Char

10− | Str String

11− | Boolean Bool

12− deriving (Eq, Ord, Show)

13−

14−instance Pretty Literal where

15− pretty literal =

16− case literal of

17− IntNum n -> PP.int n

18− FloatNum n -> PP.double n

19− Chr c -> PP.text . show $ c

20− Str s -> PP.text . show $ s

21− Boolean bool -> PP.text (show bool)

compiler/SourceSyntax/Module.hsdeleted−119

@@ -1,119 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module SourceSyntax.Module where

3−

4−import Data.Binary

5−import qualified Data.List as List

6−import qualified Data.Map as Map

7−import Control.Applicative ((<$>), (<*>))

8−import Text.PrettyPrint as P

9−

10−import SourceSyntax.Expression (Expr)

11−import SourceSyntax.Declaration

12−import SourceSyntax.PrettyPrint

13−import SourceSyntax.Type

14−

15−import qualified Elm.Internal.Version as Version

16−

17−data Module def =

18− Module [String] Exports Imports [def]

19− deriving (Show)

20−

21−type Exports = [String]

22−

23−type Imports = [(String, ImportMethod)]

24−data ImportMethod = As String | Importing [String] | Hiding [String]

25− deriving (Eq, Ord, Show)

26−

27−instance (Pretty def) => Pretty (Module def) where

28− pretty (Module modNames exports imports decls) =

29− P.vcat [modul, P.text "", prettyImports, P.text "", prettyDecls]

30− where

31− prettyDecls = P.sep $ map pretty decls

32−

33− modul = P.text "module" <+> moduleName <+> prettyExports <+> P.text "where"

34− moduleName = P.text $ List.intercalate "." modNames

35− prettyExports =

36− case exports of

37− [] -> P.empty

38− _ -> P.parens . commaCat $ map P.text exports

39−

40− prettyImports = P.vcat $ map prettyImport imports

41−

42− prettyImport (name, method) =

43− P.text "import" <+>

44− case method of

45− As alias ->

46− P.text $ name ++ (if name == alias then "" else " as " ++ alias)

47−

48− Importing values ->

49− P.text name <+> P.parens (commaCat (map P.text values))

50−

51− Hiding [] -> P.text ("open " ++ name)

52− Hiding _ -> error "invalid import declaration"

53−

54−instance Binary ImportMethod where

55− put method =

56− let put' n info = putWord8 n >> put info in

57− case method of

58− As s -> put' 0 s

59− Importing ss -> put' 1 ss

60− Hiding ss -> put' 2 ss

61−

62− get = do tag <- getWord8

63− case tag of

64− 0 -> As <$> get

65− 1 -> Importing <$> get

66− 2 -> Hiding <$> get

67− _ -> error "Error reading valid ImportMethod type from serialized string"

68−

69−data MetadataModule =

70− MetadataModule

71− { names :: [String]

72− , path :: FilePath

73− , exports :: [String]

74− , imports :: [(String, ImportMethod)]

75− , program :: Expr

76− , types :: Map.Map String Type

77− , fixities :: [(Assoc, Int, String)]

78− , aliases :: [Alias]

79− , datatypes :: [ADT]

80− , ports :: [String]

81− } deriving Show

82−

83−type Interfaces = Map.Map String ModuleInterface

84−type ADT = (String, [String], [(String,[Type])])

85−type Alias = (String, [String], Type)

86−

87−data ModuleInterface =

88− ModuleInterface

89− { iVersion :: Version.Version

90− , iTypes :: Map.Map String Type

91− , iImports :: [(String, ImportMethod)]

92− , iAdts :: [ADT]

93− , iAliases :: [Alias]

94− , iFixities :: [(Assoc, Int, String)]

95− , iPorts :: [String]

96− } deriving Show

97−

98−metaToInterface :: MetadataModule -> ModuleInterface

99−metaToInterface metaModule =

100− ModuleInterface

101− { iVersion = Version.elmVersion

102− , iTypes = types metaModule

103− , iImports = imports metaModule

104− , iAdts = datatypes metaModule

105− , iAliases = aliases metaModule

106− , iFixities = fixities metaModule

107− , iPorts = ports metaModule

108− }

109−

110−instance Binary ModuleInterface where

111− get = ModuleInterface <$> get <*> get <*> get <*> get <*> get <*> get <*> get

112− put modul = do

113− put (iVersion modul)

114− put (iTypes modul)

115− put (iImports modul)

116− put (iAdts modul)

117− put (iAliases modul)

118− put (iFixities modul)

119− put (iPorts modul)

compiler/SourceSyntax/Pattern.hsdeleted−69

@@ -1,69 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module SourceSyntax.Pattern where

3−

4−import qualified SourceSyntax.Helpers as Help

5−import SourceSyntax.PrettyPrint

6−import Text.PrettyPrint as PP

7−import qualified Data.Set as Set

8−import SourceSyntax.Literal as Literal

9−

10−data Pattern

11− = Data String [Pattern]

12− | Record [String]

13− | Alias String Pattern

14− | Var String

15− | Anything

16− | Literal Literal.Literal

17− deriving (Eq, Ord, Show)

18−

19−cons :: Pattern -> Pattern -> Pattern

20−cons h t = Data "::" [h,t]

21−

22−nil :: Pattern

23−nil = Data "[]" []

24−

25−list :: [Pattern] -> Pattern

26−list = foldr cons nil

27−

28−tuple :: [Pattern] -> Pattern

29−tuple es = Data ("_Tuple" ++ show (length es)) es

30−

31−boundVarList :: Pattern -> [String]

32−boundVarList = Set.toList . boundVars

33−

34−boundVars :: Pattern -> Set.Set String

35−boundVars pattern =

36− case pattern of

37− Var x -> Set.singleton x

38− Alias x p -> Set.insert x (boundVars p)

39− Data _ ps -> Set.unions (map boundVars ps)

40− Record fields -> Set.fromList fields

41− Anything -> Set.empty

42− Literal _ -> Set.empty

43−

44−

45−instance Pretty Pattern where

46− pretty pattern =

47− case pattern of

48− Var x -> variable x

49− Literal lit -> pretty lit

50− Record fs -> PP.braces (commaCat $ map variable fs)

51− Alias x p -> prettyParens p <+> PP.text "as" <+> variable x

52− Anything -> PP.text "_"

53− Data "::" [hd,tl] -> parensIf isCons (pretty hd) <+> PP.text "::" <+> pretty tl

54− where isCons = case hd of

55− Data "::" _ -> True

56− _ -> False

57− Data name ps ->

58− if Help.isTuple name then

59− PP.parens . commaCat $ map pretty ps

60− else hsep (PP.text name : map prettyParens ps)

61−

62−prettyParens :: Pattern -> Doc

63−prettyParens pattern = parensIf needsThem (pretty pattern)

64− where

65− needsThem =

66− case pattern of

67− Data name (_:_) | not (Help.isTuple name) -> True

68− Alias _ _ -> True

69− _ -> False

compiler/SourceSyntax/PrettyPrint.hsdeleted−39

@@ -1,39 +0,0 @@

1−

2−module SourceSyntax.PrettyPrint where

3−

4−import Text.PrettyPrint

5−import qualified SourceSyntax.Helpers as Help

6−

7−class Pretty a where

8− pretty :: a -> Doc

9−

10−instance Pretty () where

11− pretty () = empty

12−

13−renderPretty :: (Pretty a) => a -> String

14−renderPretty e = render (pretty e)

15−

16−commaCat docs = cat (punctuate comma docs)

17−commaSep docs = sep (punctuate comma docs)

18−

19−parensIf :: Bool -> Doc -> Doc

20−parensIf bool doc = if bool then parens doc else doc

21−

22−variable :: String -> Doc

23−variable x =

24− if Help.isOp x then parens (text x)

25− else text (reprime x)

26−

27−reprime :: String -> String

28−reprime = map (\c -> if c == '$' then '\'' else c)

29−

30−eightyCharLines :: Int -> String -> String

31−eightyCharLines indent message = answer

32− where

33− (answer,_,_) = foldl step (spaces, indent-1, "") chunks

34−

35− chunks = map (\w -> (w, length w)) (words message)

36− spaces = replicate indent ' '

37− step (sentence, slen, space) (word, wlen)

38− | slen + wlen > 79 = (sentence ++ "\n" ++ spaces ++ word, indent + wlen, " ")

39− | otherwise = (sentence ++ space ++ word, slen + wlen + length space, " ")

compiler/SourceSyntax/Type.hsdeleted−89

@@ -1,89 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module SourceSyntax.Type where

3−

4−import Control.Applicative ((<$>), (<*>))

5−import Data.Binary

6−import qualified Data.Map as Map

7−import SourceSyntax.PrettyPrint

8−import qualified SourceSyntax.Helpers as Help

9−import Text.PrettyPrint as P

10−

11−data Type = Lambda Type Type

12− | Var String

13− | Data String [Type]

14− | Record [(String,Type)] (Maybe String)

15− deriving (Eq,Show)

16−

17−fieldMap :: [(String,a)] -> Map.Map String [a]

18−fieldMap fields =

19− foldl (\r (x,t) -> Map.insertWith (++) x [t] r) Map.empty fields

20−

21−recordOf :: [(String,Type)] -> Type

22−recordOf fields = Record fields Nothing

23−

24−listOf :: Type -> Type

25−listOf t = Data "_List" [t]

26−

27−tupleOf :: [Type] -> Type

28−tupleOf ts = Data ("_Tuple" ++ show (length ts)) ts

29−

30−instance Pretty Type where

31− pretty tipe =

32− case tipe of

33− Lambda _ _ -> P.sep [ t, P.sep (map (P.text "->" <+>) ts) ]

34− where

35− t:ts = map prettyLambda (collectLambdas tipe)

36− prettyLambda t = case t of

37− Lambda _ _ -> P.parens (pretty t)

38− _ -> pretty t

39−

40− Var x -> P.text x

41− Data "_List" [t] -> P.brackets (pretty t)

42− Data name tipes

43− | Help.isTuple name -> P.parens . P.sep . P.punctuate P.comma $ map pretty tipes

44− | otherwise -> P.hang (P.text name) 2 (P.sep $ map prettyParens tipes)

45− Record fields ext ->

46− P.braces $ case ext of

47− Nothing -> prettyFields

48− Just x -> P.hang (P.text x <+> P.text "|") 4 prettyFields

49− where

50− prettyField (f,t) = P.text f <+> P.text ":" <+> pretty t

51− prettyFields = commaSep . map prettyField $ fields

52−

53−collectLambdas :: Type -> [Type]

54−collectLambdas tipe =

55− case tipe of

56− Lambda arg body -> arg : collectLambdas body

57− _ -> [tipe]

58−

59−prettyParens :: Type -> Doc

60−prettyParens tipe = parensIf needed (pretty tipe)

61− where

62− needed =

63− case tipe of

64− Lambda _ _ -> True

65− Data "_List" [_] -> False

66− Data _ [] -> False

67− Data _ _ -> True

68− _ -> False

69−

70−instance Binary Type where

71− put tipe =

72− case tipe of

73− Lambda t1 t2 ->

74− putWord8 0 >> put t1 >> put t2

75− Var x ->

76− putWord8 1 >> put x

77− Data ctor tipes ->

78− putWord8 2 >> put ctor >> put tipes

79− Record fs ext ->

80− putWord8 3 >> put fs >> put ext

81−

82− get = do

83− n <- getWord8

84− case n of

85− 0 -> Lambda <$> get <*> get

86− 1 -> Var <$> get

87− 2 -> Data <$> get <*> get

88− 3 -> Record <$> get <*> get

89− _ -> error "Error reading a valid type from serialized string"

compiler/SourceSyntax/Variable.hsdeleted−11

@@ -1,11 +0,0 @@

1−

2−module SourceSyntax.Variable where

3−

4−import qualified Text.PrettyPrint as P

5−import SourceSyntax.PrettyPrint

6−

7−newtype Raw = Raw String

8− deriving (Eq,Ord,Show)

9−

10−instance Pretty Raw where

11− pretty (Raw var) = variable var

compiler/Transform/Canonicalize.hsdeleted−191

@@ -1,191 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Canonicalize (interface, metadataModule) where

3−

4−import Control.Arrow ((***))

5−import Control.Applicative (Applicative,(<$>),(<*>))

6−import Control.Monad.Identity

7−import qualified Data.Either as Either

8−import qualified Data.List as List

9−import qualified Data.Map as Map

10−import qualified Data.Set as Set

11−import qualified Data.Traversable as T

12−import SourceSyntax.Annotation as A

13−import SourceSyntax.Expression

14−import SourceSyntax.Module

15−import SourceSyntax.PrettyPrint (pretty)

16−import qualified SourceSyntax.Pattern as P

17−import qualified SourceSyntax.Type as Type

18−import qualified SourceSyntax.Variable as Var

19−import Text.PrettyPrint as P

20−

21−interface :: String -> ModuleInterface -> ModuleInterface

22−interface moduleName iface =

23− ModuleInterface

24− { iVersion = iVersion iface

25− , iTypes = Map.mapKeys prefix (Map.map renameType' (iTypes iface))

26− , iImports = iImports iface

27− , iAdts = map (both prefix renameCtors) (iAdts iface)

28− , iAliases = map (both prefix renameType') (iAliases iface)

29− , iFixities = iFixities iface -- cannot have canonicalized operators while parsing

30− , iPorts = iPorts iface

31− }

32− where

33− both f g (a,b,c) = (f a, b, g c)

34− prefix name = moduleName ++ "." ++ name

35−

36− pair name = (name, moduleName ++ "." ++ name)

37− canon (name,_,_) = pair name

38− canons = Map.fromList $ concat

39− [ map canon (iAdts iface), map canon (iAliases iface) ]

40−

41− renameCtors ctors =

42− map (prefix *** map renameType') ctors

43− renameType' =

44− runIdentity . renameType (\name -> return $ Map.findWithDefault name name canons)

45−

46−renameType :: (Applicative m, Monad m) => (String -> m String) -> Type.Type -> m Type.Type

47−renameType renamer tipe =

48− let rnm = renameType renamer in

49− case tipe of

50− Type.Lambda a b -> Type.Lambda <$> rnm a <*> rnm b

51− Type.Var _ -> return tipe

52− Type.Data name ts -> Type.Data <$> renamer name <*> mapM rnm ts

53− Type.Record fields ext -> Type.Record <$> mapM rnm' fields <*> return ext

54− where rnm' (f,t) = (,) f <$> rnm t

55−

56−metadataModule :: Interfaces -> MetadataModule -> Either [Doc] MetadataModule

57−metadataModule ifaces modul =

58− do case filter (\m -> Map.notMember m ifaces) (map fst realImports) of

59− [] -> Right ()

60− missings -> Left [ P.text $ "The following imports were not found: " ++ List.intercalate ", " missings ++

61− "\n You may need to compile with the --make flag to detect modules you have written."

62− ]

63− program' <- rename initialEnv (program modul)

64− aliases' <- mapM (three3 renameType') (aliases modul)

65− datatypes' <- mapM (three3 (mapM (two2 (mapM renameType')))) (datatypes modul)

66− return $ modul { program = program'

67− , aliases = aliases'

68− , datatypes = datatypes' }

69− where

70− two2 f (a,b) = (,) a <$> f b

71− three3 f (a,b,c) = (,,) a b <$> f c

72− renameType' =

73− Either.either (\err -> Left [P.text err]) return . renameType (replace "type" initialEnv)

74−

75− get1 (a,_,_) = a

76− canon (name, importMethod) =

77− let pair pre var = (pre ++ drop (length name + 1) var, var)

78− iface = ifaces Map.! name

79− allNames = concat [ Map.keys (iTypes iface)

80− , map get1 (iAliases iface)

81− , concat [ n : map fst ctors | (n,_,ctors) <- iAdts iface ] ]

82− in case importMethod of

83− As alias -> map (pair (alias ++ ".")) allNames

84− Hiding vars -> map (pair "") $ filter (flip Set.notMember vs) allNames

85− where vs = Set.fromList vars

86− Importing vars -> map (pair "") $ filter (flip Set.member vs) allNames

87− where vs = Set.fromList $ map (\v -> name ++ "." ++ v) vars

88−

89− two n = (n,n)

90− localEnv = map two (map get1 (aliases modul) ++ map get1 (datatypes modul))

91− globalEnv =

92− map two $ ["_List",saveEnvName,"::","[]","Int","Float","Char","Bool","String"] ++

93− map (\n -> "_Tuple" ++ show (n :: Int)) [0..9]

94− realImports = filter (not . List.isPrefixOf "Native." . fst) (imports modul)

95− initialEnv = Map.fromList (concatMap canon realImports ++ localEnv ++ globalEnv)

96−

97−type Env = Map.Map String String

98−

99−extend :: Env -> P.Pattern -> Env

100−extend env pattern = Map.union (Map.fromList (zip xs xs)) env

101− where xs = P.boundVarList pattern

102−

103−replace :: String -> Env -> String -> Either String String

104−replace variable env v =

105− if List.isPrefixOf "Native." v then return v else

106− case Map.lookup v env of

107− Just v' -> return v'

108− Nothing -> Left $ "Could not find " ++ variable ++ " '" ++ v ++ "'." ++ msg

109− where

110− matches = filter (List.isInfixOf v) (Map.keys env)

111− msg = if null matches then "" else

112− "\nClose matches include: " ++ List.intercalate ", " matches

113−

114−-- TODO: Var.Raw -> Var.Canonical

115−rename :: Env -> Expr -> Either [Doc] Expr

116−rename env (A ann expr) =

117− let rnm = rename env

118− throw err = Left [ P.vcat [ P.text "Error" <+> pretty ann <> P.colon

119− , P.text err

120− ]

121− ]

122− format = Either.either throw return

123− renameType' environ = renameType (format . replace "variable" environ)

124− in

125− A ann <$>

126− case expr of

127− Literal _ -> return expr

128−

129− Range e1 e2 -> Range <$> rnm e1 <*> rnm e2

130−

131− Access e x -> Access <$> rnm e <*> return x

132−

133− Remove e x -> flip Remove x <$> rnm e

134−

135− Insert e x v -> flip Insert x <$> rnm e <*> rnm v

136−

137− Modify e fs ->

138− Modify <$> rnm e <*> mapM (\(k,v) -> (,) k <$> rnm v) fs

139−

140− Record fs -> Record <$> mapM (\(k,v) -> (,) k <$> rnm v) fs

141−

142− Binop op e1 e2 ->

143− do op' <- format (replace "variable" env op)

144− Binop op' <$> rnm e1 <*> rnm e2

145−

146− Lambda pattern e ->

147− let env' = extend env pattern in

148− Lambda <$> format (renamePattern env' pattern) <*> rename env' e

149−

150− App e1 e2 -> App <$> rnm e1 <*> rnm e2

151−

152− MultiIf ps -> MultiIf <$> mapM grnm ps

153− where grnm (b,e) = (,) <$> rnm b <*> rnm e

154−

155− Let defs e -> Let <$> mapM rename' defs <*> rename env' e

156− where

157− env' = foldl extend env $ map (\(Definition p _ _) -> p) defs

158− rename' (Definition p body mtipe) =

159− Definition <$> format (renamePattern env' p)

160− <*> rename env' body

161− <*> T.traverse (renameType' env') mtipe

162−

163− -- TODO: Raw -> Canonical

164− Var (Var.Raw x) -> rawVar <$> format (replace "variable" env x)

165−

166− Data name es -> Data name <$> mapM rnm es

167−

168− ExplicitList es -> ExplicitList <$> mapM rnm es

169−

170− Case e cases -> Case <$> rnm e <*> mapM branch cases

171− where

172− branch (pattern,b) = (,) <$> format (renamePattern env pattern)

173− <*> rename (extend env pattern) b

174−

175− Markdown uid md es -> Markdown uid md <$> mapM rnm es

176−

177− PortIn name st -> PortIn name <$> renameType' env st

178−

179− PortOut name st signal -> PortOut name <$> renameType' env st <*> rnm signal

180−

181−

182−renamePattern :: Env -> P.Pattern -> Either String P.Pattern

183−renamePattern env pattern =

184− case pattern of

185− P.Var _ -> return pattern

186− P.Literal _ -> return pattern

187− P.Record _ -> return pattern

188− P.Anything -> return pattern

189− P.Alias x p -> P.Alias x <$> renamePattern env p

190− P.Data name ps -> P.Data <$> replace "pattern" env name

191− <*> mapM (renamePattern env) ps

compiler/Transform/Check.hsdeleted−147

@@ -1,147 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Check (mistakes) where

3−

4−import qualified Control.Arrow as Arrow

5−import qualified Data.List as List

6−import qualified Data.Maybe as Maybe

7−import qualified Data.Set as Set

8−

9−import qualified SourceSyntax.Expression as E

10−import qualified SourceSyntax.Declaration as D

11−import qualified SourceSyntax.Pattern as Pattern

12−import qualified SourceSyntax.Type as T

13−import qualified Transform.Expression as Expr

14−

15−import SourceSyntax.PrettyPrint

16−import Text.PrettyPrint as P

17−

18−

19−mistakes :: [D.Declaration] -> [Doc]

20−mistakes decls =

21− concat [ infiniteTypeAliases decls

22− , illFormedTypes decls

23− , map P.text (duplicateConstructors decls)

24− , map P.text (duplicates decls) ]

25−

26−dups :: Ord a => [a] -> [a]

27−dups = map head . filter ((>1) . length) . List.group . List.sort

28−

29−dupErr :: String -> String -> String

30−dupErr err x =

31− "Syntax Error: There can only be one " ++ err ++ " '" ++ x ++ "'."

32−

33−duplicates :: [D.Declaration] -> [String]

34−duplicates decls =

35− map msg (dups (portNames ++ concatMap Pattern.boundVarList defPatterns)) ++

36− case mapM exprDups (portExprs ++ defExprs) of

37− Left name -> [msg name]

38− Right _ -> []

39−

40− where

41− msg = dupErr "definition of"

42−

43− (defPatterns, defExprs) =

44− unzip [ (pat,expr) | D.Definition (E.Definition pat expr _) <- decls ]

45−

46− (portNames, portExprs) =

47− Arrow.second concat $ unzip $

48− flip map [ port | D.Port port <- decls ] $ \port ->

49− case port of

50− D.Out name expr _ -> (name, [expr])

51− D.In name _ -> (name, [])

52−

53− exprDups :: E.Expr -> Either String E.Expr

54− exprDups expr = Expr.crawlLet defsDups expr

55−

56− defsDups :: [E.Def] -> Either String [E.Def]

57− defsDups defs =

58− let varsIn (E.Definition pattern _ _) = Pattern.boundVarList pattern in

59− case dups $ concatMap varsIn defs of

60− [] -> Right defs

61− name:_ -> Left name

62−

63−duplicateConstructors :: [D.Declaration] -> [String]

64−duplicateConstructors decls =

65− map (dupErr "definition of type constructor") (dups typeCtors) ++

66− map (dupErr "definition of data constructor") (dups dataCtors)

67− where

68− typeCtors = [ name | D.Datatype name _ _ <- decls ]

69− dataCtors = concat [ map fst patterns | D.Datatype _ _ patterns <- decls ]

70−

71−illFormedTypes :: [D.Declaration] -> [Doc]

72−illFormedTypes decls = map report (Maybe.mapMaybe isIllFormed (aliases ++ adts))

73− where

74− aliases = [ (decl, tvars, [tipe]) | decl@(D.TypeAlias _ tvars tipe) <- decls ]

75− adts = [ (decl, tvars, concatMap snd ctors) | decl@(D.Datatype _ tvars ctors) <- decls ]

76−

77− freeVars tipe =

78− case tipe of

79− T.Lambda t1 t2 -> Set.union (freeVars t1) (freeVars t2)

80− T.Var x -> Set.singleton x

81− T.Data _ ts -> Set.unions (map freeVars ts)

82− T.Record fields ext -> Set.unions (ext' : map (freeVars . snd) fields)

83− where ext' = maybe Set.empty Set.singleton ext

84−

85− undeclared tvars tipes = Set.difference used declared

86− where

87− used = Set.unions (map freeVars tipes)

88− declared = Set.fromList tvars

89−

90− isIllFormed (decl, tvars, tipes) =

91− let unbound = undeclared tvars tipes in

92− if Set.null unbound then Nothing

93− else Just (decl, Set.toList unbound)

94−

95− report (decl, tvars) =

96− P.vcat [ P.text $ "Error: type variable" ++ listing ++ " unbound in:"

97− , P.text "\n"

98− , nest 4 (pretty decl) ]

99− where

100− listing =

101− case tvars of

102− [tvar] -> " " ++ quote tvar ++ " is"

103− _ -> "s" ++ addCommas (map ((++) " ") (addAnd (map quote tvars))) ++ " are"

104−

105− addCommas xs

106− | length xs < 3 = concat xs

107− | otherwise = List.intercalate "," xs

108−

109− addAnd xs

110− | length xs < 2 = xs

111− | otherwise = zipWith (++) (replicate (length xs - 1) "" ++ ["and "]) xs

112−

113− quote tvar = "'" ++ tvar ++ "'"

114−

115−

116−infiniteTypeAliases :: [D.Declaration] -> [Doc]

117−infiniteTypeAliases decls =

118− [ report name tvars tipe | D.TypeAlias name tvars tipe <- decls

119− , infiniteType name tipe ]

120− where

121− infiniteType name tipe =

122− let infinite = infiniteType name in

123− case tipe of

124− T.Lambda a b -> infinite a || infinite b

125− T.Var _ -> False

126− T.Data name' ts -> name == name' || any infinite ts

127− T.Record fields _ -> any (infinite . snd) fields

128−

129− indented :: D.Declaration -> Doc

130− indented decl = P.text "\n " <> pretty decl <> P.text "\n"

131−

132− report name args tipe =

133− P.vcat [ P.text $ eightyCharLines 0 msg1

134− , indented $ D.TypeAlias name args tipe

135− , P.text $ eightyCharLines 0 msg2

136− , indented $ D.Datatype name args [(name,[tipe])]

137− , P.text $ eightyCharLines 0 msg3 ++ "\n"

138− ]

139− where

140− msg1 = "Type alias '" ++ name ++ "' is an infinite type. " ++

141− "Notice that it appears in its own definition, so when \

142− \you expand it, it just keeps getting bigger:"

143− msg2 = "Try this instead:"

144− msg3 = "It looks very similar, but an algebraic data type (ADT) \

145− \actually creates a new type. Unlike with a type alias, this \

146− \freshly created type is meaningful on its own, so an ADT \

147− \does not need to be expanded."

compiler/Transform/Declaration.hsdeleted−63

@@ -1,63 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Declaration where

3−

4−import Control.Applicative ((<$>))

5−import qualified SourceSyntax.Pattern as P

6−import SourceSyntax.Expression as E

7−import SourceSyntax.Declaration as D

8−

9−import qualified Transform.Expression as Expr

10−import qualified Transform.Definition as Def

11−

12−

13−combineAnnotations :: [ParseDeclaration] -> Either String [Declaration]

14−combineAnnotations = go

15− where

16− msg x = "Syntax Error: The type annotation for '" ++ x ++

17− "' must be directly above its definition."

18−

19− exprCombineAnnotations = Expr.crawlLet Def.combineAnnotations

20−

21− go decls =

22− case decls of

23− -- simple cases, pass them through with no changes

24− [] -> return []

25−

26− Datatype name tvars ctors : rest ->

27− (:) (Datatype name tvars ctors) <$> go rest

28−

29− TypeAlias name tvars alias : rest ->

30− (:) (TypeAlias name tvars alias) <$> go rest

31−

32− Fixity assoc prec op : rest ->

33− (:) (Fixity assoc prec op) <$> go rest

34−

35− -- combine definitions

36− D.Definition def : defRest ->

37− case def of

38− Def pat expr ->

39− do expr' <- exprCombineAnnotations expr

40− let def' = E.Definition pat expr' Nothing

41− (:) (D.Definition def') <$> go defRest

42−

43− TypeAnnotation name tipe ->

44− case defRest of

45− D.Definition (Def pat@(P.Var name') expr) : rest | name == name' ->

46− do expr' <- exprCombineAnnotations expr

47− let def' = E.Definition pat expr' (Just tipe)

48− (:) (D.Definition def') <$> go rest

49−

50− _ -> Left (msg name)

51−

52− -- combine ports

53− Port port : portRest ->

54− case port of

55− PPDef name _ -> Left (msg name)

56− PPAnnotation name tipe ->

57− case portRest of

58− Port (PPDef name' expr) : rest | name == name' ->

59− do expr' <- exprCombineAnnotations expr

60− (:) (Port (Out name expr' tipe)) <$> go rest

61−

62− _ -> (:) (Port (In name tipe)) <$> go portRest

63−

compiler/Transform/Definition.hsdeleted−31

@@ -1,31 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Definition where

3−

4−import Control.Applicative ((<$>))

5−import qualified SourceSyntax.Pattern as P

6−import SourceSyntax.Expression

7−import qualified Transform.Expression as Expr

8−

9−combineAnnotations :: [ParseDef] -> Either String [Def]

10−combineAnnotations = go

11− where

12− msg x = "Syntax Error: The type annotation for '" ++ x ++

13− "' must be directly above its definition."

14−

15− exprCombineAnnotations = Expr.crawlLet combineAnnotations

16−

17− go defs =

18− case defs of

19− TypeAnnotation name tipe : Def pat@(P.Var name') expr : rest | name == name' ->

20− do expr' <- exprCombineAnnotations expr

21− let def = Definition pat expr' (Just tipe)

22− (:) def <$> go rest

23−

24− TypeAnnotation name _ : _ -> Left (msg name)

25−

26− Def pat expr : rest ->

27− do expr' <- exprCombineAnnotations expr

28− let def = Definition pat expr' Nothing

29− (:) def <$> go rest

30−

31− [] -> return []

compiler/Transform/Expression.hsdeleted−57

@@ -1,57 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Expression (crawlLet, checkPorts) where

3−

4−import Control.Applicative ((<$>),(<*>))

5−import SourceSyntax.Annotation ( Annotated(A) )

6−import SourceSyntax.Expression

7−import SourceSyntax.Type (Type)

8−

9−crawlLet :: ([def] -> Either a [def'])

10− -> GeneralExpr ann def var

11− -> Either a (GeneralExpr ann def' var)

12−crawlLet = crawl (\_ _ -> return ()) (\_ _ -> return ())

13−

14−checkPorts :: (String -> Type -> Either a ())

15− -> (String -> Type -> Either a ())

16− -> Expr

17− -> Either a Expr

18−checkPorts inCheck outCheck expr =

19− crawl inCheck outCheck (mapM checkDef) expr

20− where

21− checkDef def@(Definition _ body _) =

22− do _ <- checkPorts inCheck outCheck body

23− return def

24−

25−crawl :: (String -> Type -> Either a ())

26− -> (String -> Type -> Either a ())

27− -> ([def] -> Either a [def'])

28− -> GeneralExpr ann def var

29− -> Either a (GeneralExpr ann def' var)

30−crawl portInCheck portOutCheck defsTransform = go

31− where

32− go (A srcSpan expr) =

33− A srcSpan <$>

34− case expr of

35− Var x -> return (Var x)

36− Lambda p e -> Lambda p <$> go e

37− Binop op e1 e2 -> Binop op <$> go e1 <*> go e2

38− Case e cases -> Case <$> go e <*> mapM (\(p,b) -> (,) p <$> go b) cases

39− Data name es -> Data name <$> mapM go es

40− Literal lit -> return (Literal lit)

41− Range e1 e2 -> Range <$> go e1 <*> go e2

42− ExplicitList es -> ExplicitList <$> mapM go es

43− App e1 e2 -> App <$> go e1 <*> go e2

44− MultiIf branches -> MultiIf <$> mapM (\(b,e) -> (,) <$> go b <*> go e) branches

45− Access e lbl -> Access <$> go e <*> return lbl

46− Remove e lbl -> Remove <$> go e <*> return lbl

47− Insert e lbl v -> Insert <$> go e <*> return lbl <*> go v

48− Modify e fields -> Modify <$> go e <*> mapM (\(k,v) -> (,) k <$> go v) fields

49− Record fields -> Record <$> mapM (\(k,v) -> (,) k <$> go v) fields

50− Markdown uid md es -> Markdown uid md <$> mapM go es

51− Let defs body -> Let <$> defsTransform defs <*> go body

52− PortIn name st ->

53− do portInCheck name st

54− return $ PortIn name st

55− PortOut name st signal ->

56− do portOutCheck name st

57− PortOut name st <$> go signal

compiler/Transform/SafeNames.hsdeleted−77

@@ -1,77 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.SafeNames (metadataModule) where

3−

4−import Control.Arrow (first, (***))

5−import qualified Data.List as List

6−import qualified Data.Set as Set

7−

8−import qualified Parse.Helpers as PHelp

9−import SourceSyntax.Annotation

10−import SourceSyntax.Expression

11−import qualified SourceSyntax.Helpers as SHelp

12−import SourceSyntax.Module

13−import qualified SourceSyntax.Pattern as P

14−import qualified SourceSyntax.Variable as Variable

15−

16−var :: String -> String

17−var = List.intercalate "." . map (dereserve . deprime) . SHelp.splitDots

18− where

19− deprime = map (\c -> if c == '\'' then '$' else c)

20− dereserve x = case Set.member x PHelp.jsReserveds of

21− False -> x

22− True -> "$" ++ x

23−

24−pattern :: P.Pattern -> P.Pattern

25−pattern pat =

26− case pat of

27− P.Var x -> P.Var (var x)

28− P.Literal _ -> pat

29− P.Record fs -> P.Record (map var fs)

30− P.Anything -> pat

31− P.Alias x p -> P.Alias (var x) (pattern p)

32− P.Data name ps -> P.Data name (map pattern ps)

33−

34−-- TODO: should be "normal expression" -> "expression for JS generation"

35−expression :: Expr -> Expr

36−expression (A ann expr) =

37− let f = expression in

38− A ann $

39− case expr of

40− Literal _ -> expr

41− Var (Variable.Raw x) -> rawVar (var x)

42− Range e1 e2 -> Range (f e1) (f e2)

43− ExplicitList es -> ExplicitList (map f es)

44− Binop op e1 e2 -> Binop op (f e1) (f e2)

45− Lambda p e -> Lambda (pattern p) (f e)

46− App e1 e2 -> App (f e1) (f e2)

47− MultiIf ps -> MultiIf (map (f *** f) ps)

48− Let defs body -> Let (map definition defs) (f body)

49− Case e cases -> Case (f e) $ map (pattern *** f) cases

50− Data name es -> Data name (map f es)

51− Access e x -> Access (f e) (var x)

52− Remove e x -> Remove (f e) (var x)

53− Insert e x v -> Insert (f e) (var x) (f v)

54− Modify r fs -> Modify (f r) (map (var *** f) fs)

55− Record fs -> Record (map (var *** f) fs)

56− Markdown uid md es -> Markdown uid md (map f es)

57− PortIn name st -> PortIn name st

58− PortOut name st signal -> PortOut name st (f signal)

59−

60−definition :: Def -> Def

61−definition (Definition p e t) =

62− Definition (pattern p) (expression e) t

63−

64−metadataModule :: MetadataModule -> MetadataModule

65−metadataModule modul =

66− modul

67− { names = map var (names modul)

68− , exports = map var (exports modul)

69− , imports = map (first var) (imports modul)

70− , program = expression (program modul)

71− , aliases =

72− let makeSafe (name,tvars,tipe) = (var name, tvars, tipe)

73− in map makeSafe (aliases modul)

74− , datatypes =

75− let makeSafe (name,tvars,ctors) = (var name, tvars, map (first var) ctors)

76− in map makeSafe (datatypes modul)

77− }

compiler/Transform/SortDefinitions.hsdeleted−154

@@ -1,154 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.SortDefinitions (sortDefs) where

3−

4−import Control.Monad.State

5−import Control.Applicative ((<$>),(<*>))

6−import qualified Data.Graph as Graph

7−import qualified Data.Map as Map

8−import qualified Data.Maybe as Maybe

9−import qualified Data.Set as Set

10−import SourceSyntax.Annotation

11−import SourceSyntax.Expression

12−import qualified SourceSyntax.Pattern as P

13−import qualified SourceSyntax.Variable as V

14−

15−ctors :: P.Pattern -> [String]

16−ctors pattern =

17− case pattern of

18− P.Var _ -> []

19− P.Alias _ p -> ctors p

20− P.Data ctor ps -> ctor : concatMap ctors ps

21− P.Record _ -> []

22− P.Anything -> []

23− P.Literal _ -> []

24−

25−free :: String -> State (Set.Set String) ()

26−free x = modify (Set.insert x)

27−

28−bound :: Set.Set String -> State (Set.Set String) ()

29−bound boundVars = modify (\freeVars -> Set.difference freeVars boundVars)

30−

31−sortDefs :: Expr -> Expr

32−sortDefs expr = evalState (reorder expr) Set.empty

33−

34−reorder :: Expr -> State (Set.Set String) Expr

35−reorder (A ann expr) =

36− A ann <$>

37− case expr of

38− -- Be careful adding and restricting freeVars

39− Var (V.Raw x) -> free x >> return expr

40−

41− Lambda p e ->

42− uncurry Lambda <$> bindingReorder (p,e)

43−

44− Binop op e1 e2 ->

45− do free op

46− Binop op <$> reorder e1 <*> reorder e2

47−

48− Case e cases ->

49− Case <$> reorder e <*> mapM bindingReorder cases

50−

51− Data name es ->

52− do free name

53− Data name <$> mapM reorder es

54−

55− -- Just pipe the reorder though

56− Literal _ -> return expr

57−

58− Range e1 e2 ->

59− Range <$> reorder e1 <*> reorder e2

60−

61− ExplicitList es ->

62− ExplicitList <$> mapM reorder es

63−

64− App e1 e2 ->

65− App <$> reorder e1 <*> reorder e2

66−

67− MultiIf branches ->

68− MultiIf <$> mapM (\(e1,e2) -> (,) <$> reorder e1 <*> reorder e2) branches

69−

70− Access e lbl ->

71− Access <$> reorder e <*> return lbl

72−

73− Remove e lbl ->

74− Remove <$> reorder e <*> return lbl

75−

76− Insert e lbl v ->

77− Insert <$> reorder e <*> return lbl <*> reorder v

78−

79− Modify e fields ->

80− Modify <$> reorder e <*> mapM (\(k,v) -> (,) k <$> reorder v) fields

81−

82− Record fields ->

83− Record <$> mapM (\(k,v) -> (,) k <$> reorder v) fields

84−

85− Markdown uid md es -> Markdown uid md <$> mapM reorder es

86−

87− PortOut name st signal -> PortOut name st <$> reorder signal

88−

89− PortIn name st -> return $ PortIn name st

90−

91− -- Actually do some reordering

92− Let defs body ->

93− do body' <- reorder body

94−

95− -- Sort defs into strongly connected components.This

96− -- allows the programmer to write definitions in whatever

97− -- order they please, we can still define things in order

98− -- and generalize polymorphic functions when appropriate.

99− sccs <- Graph.stronglyConnComp <$> buildDefDict defs

100− let defss = map Graph.flattenSCC sccs

101−

102− -- remove let-bound variables from the context

103− forM_ defs $ \(Definition pattern _ _) -> do

104− bound (P.boundVars pattern)

105− mapM free (ctors pattern)

106−

107− let A _ let' = foldr (\ds bod -> A ann (Let ds bod)) body' defss

108−

109− return let'

110−

111−bindingReorder :: (P.Pattern, Expr) -> State (Set.Set String) (P.Pattern, Expr)

112−bindingReorder (pattern,expr) =

113− do expr' <- reorder expr

114− bound (P.boundVars pattern)

115− mapM_ free (ctors pattern)

116− return (pattern, expr')

117−

118−

119−reorderAndGetDependencies :: Def -> State (Set.Set String) (Def, [String])

120−reorderAndGetDependencies (Definition pattern expr mType) =

121− do globalFrees <- get

122− -- work in a fresh environment

123− put Set.empty

124− expr' <- reorder expr

125− localFrees <- get

126− -- merge with global frees

127− modify (Set.union globalFrees)

128− return (Definition pattern expr' mType, Set.toList localFrees)

129−

130−

131−-- This also reorders the all of the sub-expressions in the Def list.

132−buildDefDict :: [Def] -> State (Set.Set String) [(Def, Int, [Int])]

133−buildDefDict defs =

134− do pdefsDeps <- mapM reorderAndGetDependencies defs

135− return $ realDeps (addKey pdefsDeps)

136−

137− where

138− addKey :: [(Def, [String])] -> [(Def, Int, [String])]

139− addKey = zipWith (\n (pdef,deps) -> (pdef,n,deps)) [0..]

140−

141− variableToKey :: (Def, Int, [String]) -> [(String, Int)]

142− variableToKey (Definition pattern _ _, key, _) =

143− [ (var, key) | var <- Set.toList (P.boundVars pattern) ]

144−

145− variableToKeyMap :: [(Def, Int, [String])] -> Map.Map String Int

146− variableToKeyMap pdefsDeps =

147− Map.fromList (concatMap variableToKey pdefsDeps)

148−

149− realDeps :: [(Def, Int, [String])] -> [(Def, Int, [Int])]

150− realDeps pdefsDeps = map convert pdefsDeps

151− where

152− varDict = variableToKeyMap pdefsDeps

153− convert (pdef, key, deps) =

154− (pdef, key, Maybe.mapMaybe (flip Map.lookup varDict) deps)

compiler/Transform/Substitute.hsdeleted−44

@@ -1,44 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Substitute (subst) where

3−

4−import Control.Arrow (second, (***))

5−import qualified Data.Set as Set

6−

7−import SourceSyntax.Annotation

8−import SourceSyntax.Expression

9−import qualified SourceSyntax.Pattern as Pattern

10−import qualified SourceSyntax.Variable as V

11−

12−subst :: String -> Expr' -> Expr' -> Expr'

13−subst old new expr =

14− let f (A a e) = A a (subst old new e) in

15− case expr of

16− Range e1 e2 -> Range (f e1) (f e2)

17− ExplicitList es -> ExplicitList (map f es)

18− Binop op e1 e2 -> Binop op (f e1) (f e2)

19− Lambda p e

20− | Set.member old (Pattern.boundVars p) -> expr

21− | otherwise -> Lambda p (f e)

22− App e1 e2 -> App (f e1) (f e2)

23− MultiIf ps -> MultiIf (map (f *** f) ps)

24−

25− Let defs body

26− | anyShadow -> expr

27− | otherwise -> Let (map substDef defs) (f body)

28− where

29− substDef (Definition p e t) = Definition p (f e) t

30− anyShadow =

31− any (Set.member old . Pattern.boundVars) [ p | Definition p _ _ <- defs ]

32−

33− Var (V.Raw x) -> if x == old then new else expr

34− Case e cases -> Case (f e) $ map (second f) cases

35− Data name es -> Data name (map f es)

36− Access e x -> Access (f e) x

37− Remove e x -> Remove (f e) x

38− Insert e x v -> Insert (f e) x (f v)

39− Modify r fs -> Modify (f r) (map (second f) fs)

40− Record fs -> Record (map (second f) fs)

41− Literal _ -> expr

42− Markdown uid md es -> Markdown uid md (map f es)

43− PortIn name st -> PortIn name st

44− PortOut name st signal -> PortOut name st (f signal)

compiler/Type/Alias.hsdeleted−139

@@ -1,139 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Alias (realias, rules, canonicalRealias, Rules) where

3−

4−import Control.Applicative ((<$>),(<*>))

5−import Control.Monad

6−import Control.Arrow (second)

7−import Data.Map ((!))

8−import qualified Data.Map as Map

9−import qualified Data.List as List

10−import SourceSyntax.Type

11−import SourceSyntax.Module

12−

13−type Rules = ([Alias], Type -> Type)

14−

15−rules interfaces moduleAliases moduleImports =

16− (collect interfaces moduleAliases, localizer moduleImports)

17−

18−collect interfaces moduleAliases =

19− filter (not . isPrimitive) rawAliases

20− where

21− rawAliases =

22− moduleAliases ++ concatMap iAliases (Map.elems interfaces)

23−

24− isPrimitive (_,_,tipe) =

25− case tipe of

26− Data _ [] -> True

27− _ -> False

28−

29−localizer moduleImports = go

30− where

31− go tipe =

32− case tipe of

33− Var _ -> tipe

34− Lambda t1 t2 -> Lambda (go t1) (go t2)

35− Data name ts -> Data (localize name) (map go ts)

36− Record fs ext -> Record (map (second go) fs) ext

37−

38− byMethod = foldr (\(n,m) d -> Map.insertWith (++) n [m] d)

39− Map.empty moduleImports

40−

41− separate name =

42− case List.elemIndices '.' name of

43− [] -> ("",name)

44− is -> let i = last is in

45− (take i name, drop (i+1) name)

46−

47− shortest = List.minimumBy (\a b -> compare (length a) (length b))

48−

49− localize name = shortest (name : concatMap (localize' value) methods)

50− where (modul, value) = separate name

51− methods = Map.findWithDefault [] modul byMethod

52−

53− localize' name method =

54− case method of

55− As modul -> [modul ++ "." ++ name]

56− Hiding xs | name `notElem` xs -> [name]

57− Importing xs | name `elem` xs -> [name]

58− _ -> []

59−

60−realias :: Rules -> Type -> Type

61−realias (aliases,localize) tipe = localize (canonicalRealias aliases tipe)

62−

63−-- Realias using canonical aliases, so results will have aliases

64−-- that are fully qualified and possible to compare.

65−canonicalRealias :: [Alias] -> Type -> Type

66−canonicalRealias aliases tipe =

67− case concatMap tryRealias aliases of

68− [] -> if tipe == tipe' then tipe else f tipe'

69− tipes -> f (bestType tipes)

70− where

71− tryRealias (name, args, aliasTipe) =

72− case diff aliasTipe tipe of

73− Nothing -> []

74− Just kvs ->

75− let holes = collectFields kvs

76− hasArgs = List.sort args == Map.keys holes

77− isConsistent = all allEqual (Map.elems holes)

78− in case hasArgs && isConsistent of

79− False -> []

80− True -> [Data name $ map (\arg -> head (holes ! arg)) args]

81−

82− f = canonicalRealias aliases

83− tipe' =

84− case tipe of

85− Var _ -> tipe

86− Lambda t1 t2 -> Lambda (f t1) (f t2)

87− Data name ts -> Data name (map f ts)

88− Record fs ext -> Record (map (second f) fs) ext

89−

90−allEqual [] = True

91−allEqual (x:xs) = all (==x) xs

92−

93−bestType tipes = fst $ List.minimumBy (\a b -> compare (snd a) (snd b)) pairs

94− where

95− pairs :: [(Type,Int)]

96− pairs = zip tipes (map numFields tipes)

97−

98− numFields :: Type -> Int

99− numFields tipe =

100− case tipe of

101− Lambda t1 t2 -> numFields t1 + numFields t2

102− Var _ -> 0

103− Data _ ts -> sum (map numFields ts)

104− Record fields _ -> length fields + sum (map (numFields . snd) fields)

105−

106−diff :: Type -> Type -> Maybe [(String,Type)]

107−diff general specific =

108− case (general, specific) of

109− (Lambda g1 g2, Lambda s1 s2) -> (++) <$> diff g1 s1 <*> diff g2 s2

110− (Var x, t) -> Just [(x,t)]

111− (Data gname gts, Data sname sts)

112− | gname == sname && length gts == length sts ->

113− concat <$> zipWithM diff gts sts

114− (Record [] Nothing, Record [] Nothing) -> Just []

115− (Record _ _, Record [] Nothing) -> Nothing

116− (Record [] Nothing, Record _ _) -> Nothing

117− (Record gfs gext, Record sfs sext) ->

118− let gfields = collectFields gfs

119− sfields = collectFields sfs

120−

121− overlap = Map.intersectionWith (\gs ss -> length gs == length ss) sfields gfields

122− isAligned = Map.size gfields == Map.size overlap && and (Map.elems overlap)

123− in

124− case isAligned of

125− False -> Nothing

126− True -> let remaining = Map.difference sfields gfields

127− sext' = case sext of

128− Just x | Map.null remaining -> Var x

129− _ -> Record (flattenFields remaining) sext

130− gext' = maybe (Record [] Nothing) Var gext

131− matchMap = Map.intersectionWith (zipWith diff) gfields sfields

132− in concat <$> sequence (diff gext' sext' : concat (Map.elems matchMap))

133− (_,_) -> Nothing

134−

135−collectFields fields =

136− foldr (\(f,t) fs -> Map.insertWith (++) f [t] fs) Map.empty fields

137−

138−flattenFields fields =

139− concatMap (\(f,ts) -> map ((,) f) ts) (Map.toList fields)

compiler/Type/Constrain/Declaration.hsdeleted−62

@@ -1,62 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Type.Constrain.Declaration where

3−

4−import qualified SourceSyntax.Annotation as A

5−import qualified SourceSyntax.Declaration as D

6−import qualified SourceSyntax.Expression as E

7−import qualified SourceSyntax.Pattern as P

8−import qualified SourceSyntax.Type as T

9−

10−toExpr :: [D.Declaration] -> [E.Def]

11−toExpr = concatMap toDefs

12−

13−toDefs :: D.Declaration -> [E.Def]

14−toDefs decl =

15− case decl of

16− D.Definition def -> [def]

17−

18− D.Datatype name tvars constructors -> concatMap toDefs' constructors

19− where

20− toDefs' (ctor, tipes) =

21− let vars = take (length tipes) arguments

22− tbody = T.Data name $ map T.Var tvars

23− body = A.none . E.Data ctor $ map (A.none . E.rawVar) vars

24− in [ definition ctor (buildFunction body vars) (foldr T.Lambda tbody tipes) ]

25−

26− D.TypeAlias name _ tipe@(T.Record fields ext) ->

27− [ definition name (buildFunction record vars) (foldr T.Lambda tipe args) ]

28− where

29− args = map snd fields ++ maybe [] (\x -> [T.Var x]) ext

30−

31− var = A.none . E.rawVar

32− vars = take (length args) arguments

33−

34− efields = zip (map fst fields) (map var vars)

35− record = case ext of

36− Nothing -> A.none $ E.Record efields

37− Just _ -> foldl (\r (f,v) -> A.none $ E.Insert r f v) (var $ last vars) efields

38−

39− -- Type aliases must be added to an extended equality dictionary,

40− -- but they do not require any basic constraints.

41− D.TypeAlias _ _ _ -> []

42−

43− D.Port port ->

44− case port of

45− D.Out name expr@(A.A s _) tipe ->

46− [ definition name (A.A s $ E.PortOut name tipe expr) tipe ]

47− D.In name tipe ->

48− [ definition name (A.none $ E.PortIn name tipe) tipe ]

49−

50− -- no constraints are needed for fixity declarations

51− D.Fixity _ _ _ -> []

52−

53−

54−arguments :: [String]

55−arguments = map (:[]) ['a'..'z'] ++ map (\n -> "_" ++ show (n :: Int)) [1..]

56−

57−buildFunction :: E.Expr -> [String] -> E.Expr

58−buildFunction body@(A.A s _) vars =

59− foldr (\p e -> A.A s (E.Lambda p e)) body (map P.Var vars)

60−

61−definition :: String -> E.Expr -> T.Type -> E.Def

62−definition name expr tipe = E.Definition (P.Var name) expr (Just tipe)

compiler/Type/Constrain/Expression.hsdeleted−210

@@ -1,210 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Constrain.Expression where

3−

4−import Control.Applicative ((<$>))

5−import qualified Control.Monad as Monad

6−import Control.Monad.Error

7−import qualified Data.List as List

8−import qualified Data.Map as Map

9−import qualified Text.PrettyPrint as PP

10−

11−import SourceSyntax.Annotation as Ann

12−import SourceSyntax.Expression

13−import qualified SourceSyntax.Pattern as P

14−import qualified SourceSyntax.Type as ST

15−import qualified SourceSyntax.Variable as V

16−import Type.Type hiding (Descriptor(..))

17−import Type.Fragment

18−import qualified Type.Environment as Env

19−import qualified Type.Constrain.Literal as Literal

20−import qualified Type.Constrain.Pattern as Pattern

21−

22−constrain :: Env.Environment -> Expr -> Type -> ErrorT [PP.Doc] IO TypeConstraint

23−constrain env (A region expr) tipe =

24− let list t = Env.get env Env.types "_List" <| t

25− and = A region . CAnd

26− true = A region CTrue

27− t1 === t2 = A region (CEqual t1 t2)

28− x <? t = A region (CInstance x t)

29− clet schemes c = A region (CLet schemes c)

30− in

31− case expr of

32− Literal lit -> liftIO $ Literal.constrain env region lit tipe

33−

34− Var (V.Raw name)

35− | name == saveEnvName -> return (A region CSaveEnv)

36− | otherwise -> return (name <? tipe)

37−

38− Range lo hi ->

39− existsNumber $ \n -> do

40− clo <- constrain env lo n

41− chi <- constrain env hi n

42− return $ and [clo, chi, list n === tipe]

43−

44− ExplicitList exprs ->

45− exists $ \x -> do

46− cs <- mapM (\e -> constrain env e x) exprs

47− return . and $ list x === tipe : cs

48−

49− Binop op e1 e2 ->

50− exists $ \t1 ->

51− exists $ \t2 -> do

52− c1 <- constrain env e1 t1

53− c2 <- constrain env e2 t2

54− return $ and [ c1, c2, op <? (t1 ==> t2 ==> tipe) ]

55−

56− Lambda p e ->

57− exists $ \t1 ->

58− exists $ \t2 -> do

59− fragment <- try region $ Pattern.constrain env p t1

60− c2 <- constrain env e t2

61− let c = ex (vars fragment) (clet [monoscheme (typeEnv fragment)]

62− (typeConstraint fragment /\ c2 ))

63− return $ c /\ tipe === (t1 ==> t2)

64−

65− App e1 e2 ->

66− exists $ \t -> do

67− c1 <- constrain env e1 (t ==> tipe)

68− c2 <- constrain env e2 t

69− return $ c1 /\ c2

70−

71− MultiIf branches -> and <$> mapM constrain' branches

72− where

73− bool = Env.get env Env.types "Bool"

74− constrain' (b,e) = do

75− cb <- constrain env b bool

76− ce <- constrain env e tipe

77− return (cb /\ ce)

78−

79− Case exp branches ->

80− exists $ \t -> do

81− ce <- constrain env exp t

82− let branch (p,e) = do

83− fragment <- try region $ Pattern.constrain env p t

84− clet [toScheme fragment] <$> constrain env e tipe

85− and . (:) ce <$> mapM branch branches

86−

87− Data name exprs ->

88− do vars <- forM exprs $ \_ -> liftIO (var Flexible)

89− let pairs = zip exprs (map VarN vars)

90− (ctipe, cs) <- Monad.foldM step (tipe,true) (reverse pairs)

91− return $ ex vars (cs /\ name <? ctipe)

92− where

93− step (t,c) (e,x) = do

94− c' <- constrain env e x

95− return (x ==> t, c /\ c')

96−

97− Access e label ->

98− exists $ \t ->

99− constrain env e (record (Map.singleton label [tipe]) t)

100−

101− Remove e label ->

102− exists $ \t ->

103− constrain env e (record (Map.singleton label [t]) tipe)

104−

105− Insert e label value ->

106− exists $ \tVal ->

107− exists $ \tRec -> do

108− cVal <- constrain env value tVal

109− cRec <- constrain env e tRec

110− let c = tipe === record (Map.singleton label [tVal]) tRec

111− return (and [cVal, cRec, c])

112−

113− Modify e fields ->

114− exists $ \t -> do

115− oldVars <- forM fields $ \_ -> liftIO (var Flexible)

116− let oldFields = ST.fieldMap (zip (map fst fields) (map VarN oldVars))

117− cOld <- ex oldVars <$> constrain env e (record oldFields t)

118−

119− newVars <- forM fields $ \_ -> liftIO (var Flexible)

120− let newFields = ST.fieldMap (zip (map fst fields) (map VarN newVars))

121− let cNew = tipe === record newFields t

122−

123− cs <- zipWithM (constrain env) (map snd fields) (map VarN newVars)

124−

125− return $ cOld /\ ex newVars (and (cNew : cs))

126−

127− Record fields ->

128− do vars <- forM fields $ \_ -> liftIO (var Flexible)

129− cs <- zipWithM (constrain env) (map snd fields) (map VarN vars)

130− let fields' = ST.fieldMap (zip (map fst fields) (map VarN vars))

131− recordType = record fields' (TermN EmptyRecord1)

132− return . ex vars . and $ tipe === recordType : cs

133−

134− Markdown _ _ es ->

135− do vars <- forM es $ \_ -> liftIO (var Flexible)

136− let tvars = map VarN vars

137− cs <- zipWithM (constrain env) es tvars

138− return . ex vars $ and ("Text.markdown" <? tipe : cs)

139−

140− Let defs body ->

141− do c <- constrain env body tipe

142− (schemes, rqs, fqs, header, c2, c1) <-

143− Monad.foldM (constrainDef env)

144− ([], [], [], Map.empty, true, true)

145− (concatMap expandPattern defs)

146− return $ clet schemes

147− (clet [Scheme rqs fqs (clet [monoscheme header] c2) header ]

148− (c1 /\ c))

149−

150− PortIn _ _ -> return true

151−

152− PortOut _ _ signal ->

153− constrain env signal tipe

154−

155−constrainDef env info (Definition pattern expr maybeTipe) =

156− let qs = [] -- should come from the def, but I'm not sure what would live there...

157− (schemes, rigidQuantifiers, flexibleQuantifiers, headers, c2, c1) = info

158− in

159− do rigidVars <- forM qs (\_ -> liftIO $ var Rigid) -- Some mistake may be happening here.

160− -- Currently, qs is always [].

161− case (pattern, maybeTipe) of

162− (P.Var name, Just tipe) -> do

163− flexiVars <- forM qs (\_ -> liftIO $ var Flexible)

164− let inserts = zipWith (\arg typ -> Map.insert arg (VarN typ)) qs flexiVars

165− env' = env { Env.value = List.foldl' (\x f -> f x) (Env.value env) inserts }

166− (vars, typ) <- Env.instantiateType env tipe Map.empty

167− let scheme = Scheme { rigidQuantifiers = [],

168− flexibleQuantifiers = flexiVars ++ vars,

169− constraint = Ann.noneNoDocs CTrue,

170− header = Map.singleton name typ }

171− c <- constrain env' expr typ

172− return ( scheme : schemes

173− , rigidQuantifiers

174− , flexibleQuantifiers

175− , headers

176− , c2

177− , fl rigidVars c /\ c1 )

178−

179− (P.Var name, Nothing) -> do

180− v <- liftIO $ var Flexible

181− let tipe = VarN v

182− inserts = zipWith (\arg typ -> Map.insert arg (VarN typ)) qs rigidVars

183− env' = env { Env.value = List.foldl' (\x f -> f x) (Env.value env) inserts }

184− c <- constrain env' expr tipe

185− return ( schemes

186− , rigidVars ++ rigidQuantifiers

187− , v : flexibleQuantifiers

188− , Map.insert name tipe headers

189− , c /\ c2

190− , c1 )

191−

192− _ -> error (show pattern)

193−

194−expandPattern :: Def -> [Def]

195−expandPattern def@(Definition pattern lexpr@(A r _) maybeType) =

196− case pattern of

197− P.Var _ -> [def]

198− _ -> Definition (P.Var x) lexpr maybeType : map toDef vars

199− where

200− vars = P.boundVarList pattern

201− x = "$" ++ concat vars

202− mkVar = A r . rawVar

203− toDef y = Definition (P.Var y) (A r $ Case (mkVar x) [(pattern, mkVar y)]) Nothing

204−

205−try :: Region -> ErrorT (Region -> PP.Doc) IO a -> ErrorT [PP.Doc] IO a

206−try region computation = do

207− result <- liftIO $ runErrorT computation

208− case result of

209− Left err -> throwError [err region]

210− Right value -> return value

compiler/Type/Constrain/Literal.hsdeleted−22

@@ -1,22 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Constrain.Literal where

3−

4−import SourceSyntax.Annotation

5−import SourceSyntax.Literal

6−import Type.Type

7−import Type.Environment as Env

8−

9−constrain :: Environment -> Region -> Literal -> Type -> IO TypeConstraint

10−constrain env region literal tipe =

11− do tipe' <- litType

12− return . A region $ CEqual tipe tipe'

13− where

14− prim name = return (Env.get env Env.types name)

15−

16− litType =

17− case literal of

18− IntNum _ -> VarN `fmap` var (Is Number)

19− FloatNum _ -> prim "Float"

20− Chr _ -> prim "Char"

21− Str _ -> prim "String"

22− Boolean _ -> prim "Bool"

compiler/Type/Constrain/Pattern.hsdeleted−79

@@ -1,79 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−{-# LANGUAGE FlexibleInstances #-}

3−module Type.Constrain.Pattern where

4−

5−import Control.Arrow (second)

6−import Control.Applicative ((<$>))

7−import qualified Control.Monad as Monad

8−import Control.Monad.Error

9−import qualified Data.Map as Map

10−import qualified Text.PrettyPrint as PP

11−

12−import qualified SourceSyntax.Annotation as A

13−import qualified SourceSyntax.Pattern as P

14−import SourceSyntax.PrettyPrint (pretty)

15−import Type.Type

16−import Type.Fragment

17−import Type.Environment as Env

18−import qualified Type.Constrain.Literal as Literal

19−

20−

21−constrain :: Environment -> P.Pattern -> Type -> ErrorT (A.Region -> PP.Doc) IO Fragment

22−constrain env pattern tipe =

23− let region = A.None (pretty pattern)

24− t1 === t2 = A.A region (CEqual t1 t2)

25− x <? t = A.A region (CInstance x t)

26− in

27− case pattern of

28− P.Anything -> return emptyFragment

29−

30− P.Literal lit -> do

31− c <- liftIO $ Literal.constrain env region lit tipe

32− return $ emptyFragment { typeConstraint = c }

33−

34− P.Var name -> do

35− v <- liftIO $ var Flexible

36− return $ Fragment {

37− typeEnv = Map.singleton name (VarN v),

38− vars = [v],

39− typeConstraint = VarN v === tipe

40− }

41−

42− P.Alias name p -> do

43− fragment <- constrain env p tipe

44− return $ fragment {

45− typeEnv = Map.insert name tipe (typeEnv fragment),

46− typeConstraint = name <? tipe /\ typeConstraint fragment

47− }

48−

49− P.Data name patterns -> do

50− (kind, cvars, args, result) <- liftIO $ freshDataScheme env name

51− let msg = concat [ "Constructor '", name, "' expects ", show kind

52− , " argument", if kind == 1 then "" else "s"

53− , " but was given ", show (length patterns), "." ]

54− err span = PP.vcat [ PP.text $ "Type error " ++ show span

55− , PP.text msg ]

56− case length patterns == kind of

57− False -> throwError err

58− True -> do

59− fragment <- Monad.liftM joinFragments (Monad.zipWithM (constrain env) patterns args)

60− return $ fragment {

61− typeConstraint = typeConstraint fragment /\ tipe === result,

62− vars = cvars ++ vars fragment

63− }

64−

65− P.Record fields -> do

66− pairs <- liftIO $ mapM (\name -> (,) name <$> var Flexible) fields

67− let tenv = Map.fromList (map (second VarN) pairs)

68− c <- exists $ \t -> return (tipe === record (Map.map (:[]) tenv) t)

69− return $ Fragment {

70− typeEnv = tenv,

71− vars = map snd pairs,

72− typeConstraint = c

73− }

74−

75−instance Error (A.Region -> PP.Doc) where

76− noMsg _ = PP.empty

77− strMsg str span =

78− PP.vcat [ PP.text $ "Type error " ++ show span

79− , PP.text str ]

compiler/Type/Environment.hsdeleted−170

@@ -1,170 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Environment where

3−

4−import Control.Applicative ((<$>), (<*>))

5−import Control.Exception (try, SomeException)

6−import Control.Monad

7−import Control.Monad.Trans.Error (ErrorList(..))

8−import Control.Monad.Error (ErrorT, throwError, liftIO)

9−import qualified Control.Monad.State as State

10−import qualified Data.Traversable as Traverse

11−import qualified Data.Map as Map

12−import Data.List (isPrefixOf)

13−import qualified Text.PrettyPrint as PP

14−

15−import qualified SourceSyntax.Type as Src

16−import SourceSyntax.Module (ADT, Alias)

17−import Type.Type

18−

19−type TypeDict = Map.Map String Type

20−type VarDict = Map.Map String Variable

21−

22−data Environment = Environment {

23− constructor :: Map.Map String (IO (Int, [Variable], [Type], Type)),

24− aliases :: Map.Map String ([String], Src.Type),

25− types :: TypeDict,

26− value :: TypeDict

27−}

28−

29−initialEnvironment :: [ADT] -> [Alias] -> IO Environment

30−initialEnvironment datatypes aliases = do

31− types <- makeTypes datatypes

32− let aliases' = Map.fromList $ map (\(a,b,c) -> (a,(b,c))) aliases

33− env = Environment {

34− constructor = Map.empty,

35− value = Map.empty,

36− types = types,

37− aliases = aliases' }

38−

39− return $ env { constructor = makeConstructors env datatypes }

40−

41−makeTypes :: [ADT] -> IO TypeDict

42−makeTypes datatypes =

43− Map.fromList <$> mapM makeCtor (builtins ++ map nameAndKind datatypes)

44− where

45− nameAndKind (name, tvars, _) = (name, length tvars)

46−

47− makeCtor (name, _) = do

48− ctor <- VarN <$> namedVar Constant name

49− return (name, ctor)

50−

51− tuple n = ("_Tuple" ++ show n, n)

52−

53− kind n names = map (\name -> (name, n)) names

54−

55− builtins :: [(String,Int)]

56− builtins = concat [ map tuple [0..9]

57− , kind 1 ["_List"]

58− , kind 0 ["Int","Float","Char","String","Bool"]

59− ]

60−

61−

62−makeConstructors :: Environment

63− -> [ADT]

64− -> Map.Map String (IO (Int, [Variable], [Type], Type))

65−makeConstructors env datatypes = Map.fromList builtins

66− where

67− list t = (types env Map.! "_List") <| t

68−

69− inst :: Int -> ([Type] -> ([Type], Type)) -> IO (Int, [Variable], [Type], Type)

70− inst numTVars tipe = do

71− vars <- forM [1..numTVars] $ \_ -> var Flexible

72− let (args, result) = tipe (map VarN vars)

73− return (length args, vars, args, result)

74−

75− tupleCtor n =

76− let name = "_Tuple" ++ show n

77− in (name, inst n $ \vs -> (vs, foldl (<|) (types env Map.! name) vs))

78−

79− builtins :: [ (String, IO (Int, [Variable], [Type], Type)) ]

80− builtins = [ ("[]", inst 1 $ \ [t] -> ([], list t))

81− , ("::", inst 1 $ \ [t] -> ([t, list t], list t))

82− ] ++ map tupleCtor [0..9]

83− ++ concatMap (ctorToType env) datatypes

84−

85−

86−ctorToType :: Environment -> ADT -> [ (String, IO (Int, [Variable], [Type], Type)) ]

87−ctorToType env (name, tvars, ctors) =

88− zip (map fst ctors) (map inst ctors)

89− where

90− inst :: (String, [Src.Type]) -> IO (Int, [Variable], [Type], Type)

91− inst ctor = do

92− ((args, tipe), (dict,_)) <- State.runStateT (go ctor) (Map.empty, Map.empty)

93− return (length args, Map.elems dict, args, tipe)

94−

95−

96− go :: (String, [Src.Type]) -> State.StateT (VarDict, TypeDict) IO ([Type], Type)

97− go (_, args) = do

98− types <- mapM (instantiator env) args

99− returnType <- instantiator env (Src.Data name (map Src.Var tvars))

100− return (types, returnType)

101−

102−

103−get :: Environment -> (Environment -> Map.Map String a) -> String -> a

104−get env subDict key = Map.findWithDefault err key (subDict env)

105− where

106− err = error $ "\nCould not find type constructor '" ++ key ++ "' while checking types."

107−

108−

109−freshDataScheme :: Environment -> String -> IO (Int, [Variable], [Type], Type)

110−freshDataScheme env name = get env constructor name

111−

112−instance ErrorList PP.Doc where

113− listMsg str = [PP.text str]

114−

115−instantiateType :: Environment -> Src.Type -> VarDict -> ErrorT [PP.Doc] IO ([Variable], Type)

116−instantiateType env sourceType dict =

117− do result <- liftIO $ try (State.runStateT (instantiator env sourceType) (dict, Map.empty))

118− case result :: Either SomeException (Type, (VarDict, TypeDict)) of

119− Left someError -> throwError [ PP.text $ show someError ]

120− Right (tipe, (dict',_)) -> return (Map.elems dict', tipe)

121−

122−instantiator :: Environment -> Src.Type

123− -> State.StateT (VarDict, TypeDict) IO Type

124−instantiator env sourceType = go sourceType

125− where

126− go :: Src.Type -> State.StateT (VarDict, TypeDict) IO Type

127− go sourceType =

128− case sourceType of

129− Src.Lambda t1 t2 -> (==>) <$> go t1 <*> go t2

130−

131− Src.Var x -> do

132− (dict, aliases) <- State.get

133− case (Map.lookup x dict, Map.lookup x aliases) of

134− (_, Just t) -> return t

135− (Just v, _) -> return (VarN v)

136− _ ->

137− do var <- State.liftIO $ namedVar flex x

138− State.put (Map.insert x var dict, aliases)

139− return (VarN var)

140− where

141− flex | "number" `isPrefixOf` x = Is Number

142− | "comparable" `isPrefixOf` x = Is Comparable

143− | "appendable" `isPrefixOf` x = Is Appendable

144− | otherwise = Flexible

145−

146− Src.Data name ts -> do

147− ts' <- mapM go ts

148− case (Map.lookup name (types env), Map.lookup name (aliases env)) of

149− (Just t, _) -> return $ foldl (<|) t ts'

150− (_, Just (tvars, t)) ->

151− let tvarLen = length tvars

152− msg = "\nType alias '" ++ name ++ "' expects " ++ show tvarLen ++

153− " type argument" ++ (if tvarLen == 1 then "" else "s") ++

154− " but was given " ++ show (length ts')

155− in if length ts' /= length tvars then error msg else

156− do (dict, aliases) <- State.get

157− let aliases' = Map.union (Map.fromList $ zip tvars ts') aliases

158− State.put (dict, aliases')

159− t' <- go t

160− State.put (dict, aliases)

161− return t'

162− _ -> error $ "\nCould not find type constructor '" ++

163− name ++ "' while checking types."

164−

165− Src.Record fields ext -> do

166− fields' <- Traverse.traverse (mapM go) (Src.fieldMap fields)

167− ext' <- case ext of

168− Nothing -> return $ TermN EmptyRecord1

169− Just x -> go (Src.Var x)

170− return $ TermN (Record1 fields' ext')

compiler/Type/ExtraChecks.hsdeleted−151

@@ -1,151 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−

3−{-| This module contains checks to be run *after* type inference has completed

4−successfully. At that point we still need to do occurs checks and ensure that

5−`main` has an acceptable type.

6−-}

7−module Type.ExtraChecks (mainType, occurs, portTypes) where

8−

9−import Control.Applicative ((<$>),(<*>))

10−import Control.Monad.State

11−import qualified Data.List as List

12−import qualified Data.Map as Map

13−import qualified Data.Traversable as Traverse

14−import qualified Data.UnionFind.IO as UF

15−import Text.PrettyPrint as P

16−

17−import qualified SourceSyntax.Annotation as A

18−import qualified SourceSyntax.Expression as E

19−import qualified SourceSyntax.Helpers as Help

20−import qualified SourceSyntax.PrettyPrint as SPP

21−import qualified SourceSyntax.Type as ST

22−import qualified Transform.Expression as Expr

23−import qualified Type.Type as TT

24−import qualified Type.State as TS

25−import qualified Type.Alias as Alias

26−

27−throw err = Left [ P.vcat err ]

28−

29−mainType :: Alias.Rules -> TS.Env -> IO (Either [P.Doc] (Map.Map String ST.Type))

30−mainType rules env = mainCheck rules <$> Traverse.traverse TT.toSrcType env

31− where

32− mainCheck :: Alias.Rules -> Map.Map String ST.Type -> Either [P.Doc] (Map.Map String ST.Type)

33− mainCheck rules env =

34− case Map.lookup "main" env of

35− Nothing -> Right env

36− Just mainType

37− | tipe `elem` acceptable -> Right env

38− | otherwise -> throw err

39− where

40− acceptable = [ "Graphics.Element.Element"

41− , "Signal.Signal Graphics.Element.Element" ]

42−

43− tipe = SPP.renderPretty $ Alias.canonicalRealias (fst rules) mainType

44− err = [ P.text "Type Error: 'main' must have type Element or (Signal Element)."

45− , P.text "Instead 'main' has type:\n"

46− , P.nest 4 . SPP.pretty $ Alias.realias rules mainType

47− , P.text " " ]

48−

49−data Direction = In | Out

50−

51−portTypes :: Alias.Rules -> E.Expr -> Either [P.Doc] ()

52−portTypes rules expr =

53− const () <$> Expr.checkPorts (check In) (check Out) expr

54− where

55− check = isValid True False False

56− isValid isTopLevel seenFunc seenSignal direction name tipe =

57− case tipe of

58− ST.Data ctor ts

59− | isJs ctor || isElm ctor -> mapM_ valid ts

60− | ctor == "Signal.Signal" -> handleSignal ts

61− | otherwise -> err' True "an unsupported type"

62−

63− ST.Var _ -> err "free type variables"

64−

65− ST.Lambda _ _ ->

66− case direction of

67− In -> err "functions"

68− Out | seenFunc -> err "higher-order functions"

69− | seenSignal -> err "signals that contain functions"

70− | otherwise ->

71− forM_ (ST.collectLambdas tipe)

72− (isValid' True seenSignal direction name)

73−

74− ST.Record _ (Just _) -> err "extended records with free type variables"

75−

76− ST.Record fields Nothing ->

77− mapM_ (\(k,v) -> (,) k <$> valid v) fields

78−

79− where

80− isValid' = isValid False

81− valid = isValid' seenFunc seenSignal direction name

82−

83− isJs ctor =

84− List.isPrefixOf "JavaScript." ctor

85− && length (filter (=='.') ctor) == 1

86−

87− isElm ctor =

88− ctor `elem` ["Int","Float","String","Bool","Maybe.Maybe","_List"]

89− || Help.isTuple ctor

90−

91− handleSignal ts

92− | seenFunc = err "functions that involve signals"

93− | seenSignal = err "signals-of-signals"

94− | isTopLevel = mapM_ (isValid' seenFunc True direction name) ts

95− | otherwise = err "a signal within a data stucture"

96−

97− dir inMsg outMsg = case direction of { In -> inMsg ; Out -> outMsg }

98− txt = P.text . concat

99−

100− err = err' False

101− err' couldBeAlias kind =

102− throw $

103− [ txt [ "Type Error: the value ", dir "coming in" "sent out"

104− , " through port '", name, "' is invalid." ]

105− , txt [ "It contains ", kind, ":\n" ]

106− , (P.nest 4 . SPP.pretty $ Alias.realias rules tipe) <> P.text "\n"

107− , txt [ "Acceptable values for ", dir "incoming" "outgoing"

108− , " ports include JavaScript values and" ]

109− , txt [ "the following Elm values: Ints, Floats, Bools, Strings, Maybes," ]

110− , txt [ "Lists, Tuples, ", dir "" "first-order functions, ", "and concrete records." ]

111− ] ++ if couldBeAlias then aliasWarning else []

112−

113− aliasWarning =

114− [ txt [ "\nType aliases are not expanded for this check (yet) so you need to do that" ]

115− , txt [ "manually for now (e.g. {x:Int,y:Int} instead of a type alias of that type)." ]

116− ]

117−

118−occurs :: (String, TT.Variable) -> StateT TS.SolverState IO ()

119−occurs (name, variable) =

120− do vars <- liftIO $ infiniteVars [] variable

121− case vars of

122− [] -> return ()

123− var:_ -> do

124− desc <- liftIO $ UF.descriptor var

125− case TT.structure desc of

126− Nothing ->

127− modify $ \state -> state { TS.sErrors = fallback : TS.sErrors state }

128− Just _ ->

129− do liftIO $ UF.setDescriptor var (desc { TT.structure = Nothing })

130− var' <- liftIO $ UF.fresh desc

131− TS.addError (A.None (P.text name)) (Just msg) var var'

132− where

133− msg = "Infinite types are not allowed"

134− fallback _ = return $ P.text msg

135−

136− infiniteVars :: [TT.Variable] -> TT.Variable -> IO [TT.Variable]

137− infiniteVars seen var =

138− let go = infiniteVars (var:seen) in

139− if var `elem` seen

140− then return [var]

141− else do

142− desc <- UF.descriptor var

143− case TT.structure desc of

144− Nothing -> return []

145− Just struct ->

146− case struct of

147− TT.App1 a b -> (++) <$> go a <*> go b

148− TT.Fun1 a b -> (++) <$> go a <*> go b

149− TT.Var1 a -> go a

150− TT.EmptyRecord1 -> return []

151− TT.Record1 fields ext -> concat <$> mapM go (ext : concat (Map.elems fields))

compiler/Type/Fragment.hsdeleted−27

@@ -1,27 +0,0 @@

1−module Type.Fragment where

2−

3−import qualified Data.List as List

4−import qualified Data.Map as Map

5−

6−import Type.Type

7−import SourceSyntax.Pattern

8−import SourceSyntax.Annotation (noneNoDocs)

9−

10−data Fragment = Fragment

11− { typeEnv :: Map.Map String Type

12− , vars :: [Variable]

13− , typeConstraint :: TypeConstraint

14− } deriving Show

15−

16−emptyFragment = Fragment Map.empty [] (noneNoDocs CTrue)

17−

18−joinFragment f1 f2 = Fragment

19− { typeEnv = Map.union (typeEnv f1) (typeEnv f2)

20− , vars = vars f1 ++ vars f2

21− , typeConstraint = typeConstraint f1 /\ typeConstraint f2

22− }

23−

24−joinFragments = List.foldl' (flip joinFragment) emptyFragment

25−

26−toScheme fragment =

27− Scheme [] (vars fragment) (typeConstraint fragment) (typeEnv fragment)

compiler/Type/Inference.hsdeleted−57

@@ -1,57 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Inference where

3−

4−import qualified Data.Map as Map

5−

6−import qualified Type.Type as T

7−import qualified Type.Environment as Env

8−import qualified Type.Constrain.Expression as TcExpr

9−import qualified Type.Solve as Solve

10−

11−import SourceSyntax.Module as Module

12−import SourceSyntax.Annotation (noneNoDocs)

13−import SourceSyntax.Type (Type)

14−import Text.PrettyPrint

15−import qualified Type.State as TS

16−import qualified Type.ExtraChecks as Check

17−import Control.Monad.State (execStateT, forM)

18−import Control.Monad.Error (runErrorT, liftIO)

19−import qualified Type.Alias as Alias

20−

21−import System.IO.Unsafe -- Possible to switch over to the ST monad instead of

22− -- the IO monad. I don't think that'd be worthwhile.

23−

24−

25−infer :: Interfaces -> MetadataModule -> Either [Doc] (Map.Map String Type)

26−infer interfaces modul = unsafePerformIO $ do

27− env <- Env.initialEnvironment

28− (datatypes modul ++ concatMap iAdts (Map.elems interfaces))

29− (aliases modul ++ concatMap iAliases (Map.elems interfaces))

30− ctors <- forM (Map.keys (Env.constructor env)) $ \name ->

31− do (_, vars, args, result) <- Env.freshDataScheme env name

32− return (name, (vars, foldr (T.==>) result args))

33−

34− attemptConstraint <- runErrorT $ do

35− importedVars <-

36− forM (concatMap (Map.toList . iTypes) $ Map.elems interfaces) $ \(name,tipe) ->

37− (,) name `fmap` Env.instantiateType env tipe Map.empty

38−

39− let allTypes = ctors ++ importedVars

40− vars = concatMap (fst . snd) allTypes

41− header = Map.map snd (Map.fromList allTypes)

42− environ = noneNoDocs . T.CLet [ T.Scheme vars [] (noneNoDocs T.CTrue) header ]

43−

44− fvar <- liftIO $ T.var T.Flexible

45− c <- TcExpr.constrain env (program modul) (T.VarN fvar)

46− return (header, environ c)

47−

48− case attemptConstraint of

49− Left err -> return $ Left err

50− Right (header, constraint) -> do

51− state <- execStateT (Solve.solve constraint) TS.initialState

52− let rules = Alias.rules interfaces (aliases modul) (imports modul)

53− case TS.sErrors state of

54− errors@(_:_) -> Left `fmap` sequence (map ($ rules) (reverse errors))

55− [] -> case Check.portTypes rules (program modul) of

56− Right () -> Check.mainType rules (Map.difference (TS.sSavedEnv state) header)

57− Left err -> return (Left err)

compiler/Type/PrettyPrint.hsdeleted−16

@@ -1,16 +0,0 @@

1−

2−module Type.PrettyPrint where

3−

4−import Text.PrettyPrint

5−import qualified SourceSyntax.PrettyPrint as Src

6−

7−data ParensWhen = Fn | App | Never

8−

9−class PrettyType a where

10− pretty :: ParensWhen -> a -> Doc

11−

12−commaSep docs = sep (punctuate comma docs)

13−

14−parensIf bool doc = if bool then parens doc else doc

15−

16−reprime = Src.reprime

compiler/Type/Solve.hsdeleted−192

@@ -1,192 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Solve (solve) where

3−

4−import Control.Monad

5−import Control.Monad.State

6−import qualified Data.List as List

7−import qualified Data.Map as Map

8−import qualified Data.Traversable as Traversable

9−import qualified Data.UnionFind.IO as UF

10−import Type.Type

11−import Type.Unify

12−import qualified Type.ExtraChecks as Check

13−import qualified Type.State as TS

14−import qualified SourceSyntax.Annotation as A

15−

16−

17−-- | Every variable has rank less than or equal to the maxRank of the pool.

18−-- This sorts variables into the young and old pools accordingly.

19−generalize :: TS.Pool -> StateT TS.SolverState IO ()

20−generalize youngPool = do

21− youngMark <- TS.uniqueMark

22− let youngRank = TS.maxRank youngPool

23− insert dict var = do

24− desc <- liftIO $ UF.descriptor var

25− liftIO $ UF.modifyDescriptor var (\desc -> desc { mark = youngMark })

26− return $ Map.insertWith (++) (rank desc) [var] dict

27−

28− -- Sort the youngPool variables by rank.

29− rankDict <- foldM insert Map.empty (TS.inhabitants youngPool)

30−

31− -- get the ranks right for each entry.

32− -- start at low ranks so that we only have to pass

33− -- over the information once.

34− visitedMark <- TS.uniqueMark

35− mapM (\(poolRank, vars) -> mapM (adjustRank youngMark visitedMark poolRank) vars) (Map.toList rankDict)

36−

37− -- For variables that have rank lowerer than youngRank, register them in

38− -- the old pool if they are not redundant.

39− let registerIfNotRedundant var = do

40− isRedundant <- liftIO $ UF.redundant var

41− if isRedundant then return var else TS.register var

42−

43− let rankDict' = Map.delete youngRank rankDict

44− Traversable.traverse (mapM registerIfNotRedundant) rankDict'

45−

46− -- For variables with rank youngRank

47− -- If rank < youngRank: register in oldPool

48− -- otherwise generalize

49− let registerIfLowerRank var = do

50− isRedundant <- liftIO $ UF.redundant var

51− case isRedundant of

52− True -> return ()

53− False -> do

54− desc <- liftIO $ UF.descriptor var

55− case rank desc < youngRank of

56− True -> TS.register var >> return ()

57− False -> do

58− let flex' = case flex desc of { Flexible -> Rigid ; other -> other }

59− liftIO $ UF.setDescriptor var (desc { rank = noRank, flex = flex' })

60−

61− mapM_ registerIfLowerRank (Map.findWithDefault [] youngRank rankDict)

62−

63−

64−-- adjust the ranks of variables such that ranks never increase as you

65−-- move deeper into a variable.

66−adjustRank :: Int -> Int -> Int -> Variable -> StateT TS.SolverState IO Int

67−adjustRank youngMark visitedMark groupRank variable =

68− let adjust = adjustRank youngMark visitedMark groupRank in

69− do desc <- liftIO $ UF.descriptor variable

70− case () of

71− () | mark desc == youngMark ->

72− do -- Set the variable as marked first because it may be cyclic.

73− liftIO $ UF.modifyDescriptor variable $ \desc -> desc { mark = visitedMark }

74− rank' <- case structure desc of

75− Nothing -> return groupRank

76− Just term ->

77− case term of

78− App1 a b -> max `liftM` adjust a `ap` adjust b

79− Fun1 a b -> max `liftM` adjust a `ap` adjust b

80− Var1 x -> adjust x

81− EmptyRecord1 -> return outermostRank

82− Record1 fields extension ->

83− do ranks <- mapM adjust (concat (Map.elems fields))

84− rnk <- adjust extension

85− return . maximum $ rnk : ranks

86− liftIO $ UF.modifyDescriptor variable $ \desc -> desc { rank = rank' }

87− return rank'

88−

89− | mark desc /= visitedMark ->

90− do let rank' = min groupRank (rank desc)

91− liftIO $ UF.setDescriptor variable (desc { mark = visitedMark, rank = rank' })

92− return rank'

93−

94− | otherwise -> return (rank desc)

95−

96−

97−

98−solve :: TypeConstraint -> StateT TS.SolverState IO ()

99−solve (A.A region constraint) =

100− case constraint of

101− CTrue -> return ()

102−

103− CSaveEnv -> TS.saveLocalEnv

104−

105− CEqual term1 term2 -> do

106− t1 <- TS.flatten term1

107− t2 <- TS.flatten term2

108− unify region t1 t2

109−

110− CAnd cs -> mapM_ solve cs

111−

112− CLet [Scheme [] fqs constraint' _] (A.A _ CTrue) -> do

113− oldEnv <- TS.getEnv

114− mapM TS.introduce fqs

115− solve constraint'

116− TS.modifyEnv (\_ -> oldEnv)

117−

118− CLet schemes constraint' -> do

119− oldEnv <- TS.getEnv

120− headers <- Map.unions `fmap` mapM (solveScheme region) schemes

121− TS.modifyEnv $ \env -> Map.union headers env

122− solve constraint'

123− mapM Check.occurs $ Map.toList headers

124− TS.modifyEnv (\_ -> oldEnv)

125−

126− CInstance name term -> do

127− env <- TS.getEnv

128− freshCopy <-

129− case Map.lookup name env of

130− Just tipe -> TS.makeInstance tipe

131− Nothing

132− | List.isPrefixOf "Native." name -> liftIO (var Flexible)

133− | otherwise ->

134− error ("Could not find '" ++ name ++ "' when solving type constraints.")

135−

136− t <- TS.flatten term

137− unify region freshCopy t

138−

139−solveScheme :: A.Region -> TypeScheme -> StateT TS.SolverState IO (Map.Map String Variable)

140−solveScheme region scheme =

141− case scheme of

142− Scheme [] [] constraint header -> do

143− solve constraint

144− Traversable.traverse TS.flatten header

145−

146− Scheme rigidQuantifiers flexibleQuantifiers constraint header -> do

147− let quantifiers = rigidQuantifiers ++ flexibleQuantifiers

148− oldPool <- TS.getPool

149−

150− -- fill in a new pool when working on this scheme's constraints

151− freshPool <- TS.nextRankPool

152− TS.switchToPool freshPool

153− mapM TS.introduce quantifiers

154− header' <- Traversable.traverse TS.flatten header

155− solve constraint

156−

157− allDistinct region rigidQuantifiers

158− youngPool <- TS.getPool

159− TS.switchToPool oldPool

160− generalize youngPool

161− mapM (isGeneric region) rigidQuantifiers

162− return header'

163−

164−

165−-- Checks that all of the given variables belong to distinct equivalence classes.

166−-- Also checks that their structure is Nothing, so they represent a variable, not

167−-- a more complex term.

168−allDistinct :: A.Region -> [Variable] -> StateT TS.SolverState IO ()

169−allDistinct region vars = do

170− seen <- TS.uniqueMark

171− let check var = do

172− desc <- liftIO $ UF.descriptor var

173− case structure desc of

174− Just _ -> TS.addError region (Just msg) var var

175− where msg = "Cannot generalize something that is not a type variable."

176−

177− Nothing -> do

178− if mark desc == seen

179− then let msg = "Duplicate variable during generalization."

180− in TS.addError region (Just msg) var var

181− else return ()

182− liftIO $ UF.setDescriptor var (desc { mark = seen })

183− mapM_ check vars

184−

185−-- Check that a variable has rank == noRank, meaning that it can be generalized.

186−isGeneric :: A.Region -> Variable -> StateT TS.SolverState IO ()

187−isGeneric region var = do

188− desc <- liftIO $ UF.descriptor var

189− if rank desc == noRank

190− then return ()

191− else let msg = "Unable to generalize a type variable. It is not unranked."

192− in TS.addError region (Just msg) var var

compiler/Type/State.hsdeleted−196

@@ -1,196 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.State where

3−

4−import Control.Applicative ((<$>),(<*>), Applicative)

5−import Control.Monad.State

6−import qualified Data.Map as Map

7−import qualified Data.Traversable as Traversable

8−import qualified Data.UnionFind.IO as UF

9−

10−import qualified SourceSyntax.Annotation as A

11−import SourceSyntax.PrettyPrint

12−import Text.PrettyPrint as P

13−import qualified Type.Alias as Alias

14−import Type.Type

15−

16−-- Pool

17−-- Holds a bunch of variables

18−-- The rank of each variable is less than or equal to the pool's "maxRank"

19−-- The young pool exists to make it possible to identify these vars in constant time.

20−

21−data Pool = Pool {

22− maxRank :: Int,

23− inhabitants :: [Variable]

24−} deriving Show

25−

26−emptyPool = Pool { maxRank = outermostRank, inhabitants = [] }

27−

28−type Env = Map.Map String Variable

29−

30−-- Keeps track of the environment, type variable pool, and a list of errors

31−data SolverState = SS {

32− sEnv :: Env,

33− sSavedEnv :: Env,

34− sPool :: Pool,

35− sMark :: Int,

36− sErrors :: [Alias.Rules -> IO P.Doc]

37−}

38−

39−initialState = SS {

40− sEnv = Map.empty,

41− sSavedEnv = Map.empty,

42− sPool = emptyPool,

43− sMark = noMark + 1, -- The mark must never be equal to noMark!

44− sErrors = []

45−}

46−

47−modifyEnv f = modify $ \state -> state { sEnv = f (sEnv state) }

48−modifyPool f = modify $ \state -> state { sPool = f (sPool state) }

49−

50−addError region hint t1 t2 =

51− modify $ \state -> state { sErrors = makeError : sErrors state }

52− where

53− makeError rules = do

54− let prettiest = pretty . Alias.realias rules

55− t1' <- prettiest <$> toSrcType t1

56− t2' <- prettiest <$> toSrcType t2

57− return . P.vcat $

58− [ P.text "Type error" <+> pretty region <> P.colon

59− , maybe P.empty P.text hint

60− , P.text ""

61− , P.nest 8 $ A.getRegionDocs region

62− , P.text ""

63− , P.text " Expected Type:" <+> t1'

64− , P.text " Actual Type:" <+> t2'

65− ]

66−

67−switchToPool pool = modifyPool (\_ -> pool)

68−

69−getPool :: StateT SolverState IO Pool

70−getPool = sPool <$> get

71−

72−getEnv :: StateT SolverState IO Env

73−getEnv = sEnv <$> get

74−

75−saveLocalEnv :: StateT SolverState IO ()

76−saveLocalEnv = do

77− env <- sEnv <$> get

78− modify $ \state -> state { sSavedEnv = env }

79−

80−uniqueMark :: StateT SolverState IO Int

81−uniqueMark = do

82− state <- get

83− let mark = sMark state

84− put $ state { sMark = mark + 1 }

85− return mark

86−

87−nextRankPool :: StateT SolverState IO Pool

88−nextRankPool = do

89− pool <- getPool

90− return $ Pool { maxRank = maxRank pool + 1, inhabitants = [] }

91−

92−register :: Variable -> StateT SolverState IO Variable

93−register variable = do

94− modifyPool $ \pool -> pool { inhabitants = variable : inhabitants pool }

95− return variable

96−

97−introduce :: Variable -> StateT SolverState IO Variable

98−introduce variable = do

99− pool <- getPool

100− liftIO $ UF.modifyDescriptor variable (\desc -> desc { rank = maxRank pool })

101− register variable

102−

103−flatten :: Type -> StateT SolverState IO Variable

104−flatten term =

105− case term of

106− VarN v -> return v

107− TermN t -> do

108− flatStructure <- traverseTerm flatten t

109− pool <- getPool

110− var <- liftIO . UF.fresh $ Descriptor {

111− structure = Just flatStructure,

112− rank = maxRank pool,

113− flex = Flexible,

114− name = Nothing,

115− copy = Nothing,

116− mark = noMark

117− }

118− register var

119−

120−makeInstance :: Variable -> StateT SolverState IO Variable

121−makeInstance var = do

122− alreadyCopied <- uniqueMark

123− freshVar <- makeCopy alreadyCopied var

124− restore alreadyCopied var

125− return freshVar

126−

127−makeCopy :: Int -> Variable -> StateT SolverState IO Variable

128−makeCopy alreadyCopied variable = do

129− desc <- liftIO $ UF.descriptor variable

130− case () of

131− () | mark desc == alreadyCopied ->

132− case copy desc of

133− Just v -> return v

134− Nothing -> error $ "Error copying type variable. This should be impossible." ++

135− " Please report an error to the github repo!"

136−

137− | rank desc /= noRank || flex desc == Constant ->

138− return variable

139−

140− | otherwise -> do

141− pool <- getPool

142− newVar <- liftIO $ UF.fresh $ Descriptor {

143− structure = Nothing,

144− rank = maxRank pool,

145− mark = noMark,

146− flex = case flex desc of

147− Is s -> Is s

148− _ -> Flexible,

149− copy = Nothing,

150− name = case flex desc of

151− Rigid -> Nothing

152− _ -> name desc

153− }

154− register newVar

155−

156− -- Link the original variable to the new variable. This lets us

157− -- avoid making multiple copies of the variable we are instantiating.

158− --

159− -- Need to do this before recursively copying the structure of

160− -- the variable to avoid looping on cyclic terms.

161− liftIO $ UF.modifyDescriptor variable $ \desc ->

162− desc { mark = alreadyCopied, copy = Just newVar }

163−

164− -- Now we recursively copy the structure of the variable.

165− -- We have already marked the variable as copied, so we

166− -- will not repeat this work or crawl this variable again.

167− case structure desc of

168− Nothing -> return newVar

169− Just term -> do

170− newTerm <- traverseTerm (makeCopy alreadyCopied) term

171− liftIO $ UF.modifyDescriptor newVar $ \desc ->

172− desc { structure = Just newTerm }

173− return newVar

174−

175−restore :: Int -> Variable -> StateT SolverState IO Variable

176−restore alreadyCopied variable = do

177− desc <- liftIO $ UF.descriptor variable

178− if mark desc /= alreadyCopied

179− then return variable

180− else do

181− restoredStructure <-

182− Traversable.traverse (traverseTerm (restore alreadyCopied)) (structure desc)

183− liftIO $ UF.modifyDescriptor variable $ \desc ->

184− desc { mark = noMark, rank = noRank, structure = restoredStructure }

185− return variable

186−

187−traverseTerm :: (Monad f, Applicative f) => (a -> f b) -> Term1 a -> f (Term1 b)

188−traverseTerm f term =

189− case term of

190− App1 a b -> App1 <$> f a <*> f b

191− Fun1 a b -> Fun1 <$> f a <*> f b

192− Var1 x -> Var1 <$> f x

193− EmptyRecord1 -> return EmptyRecord1

194− Record1 fields ext ->

195− Record1 <$> Traversable.traverse (mapM f) fields <*> f ext

196−

compiler/Type/Type.hsdeleted−408

@@ -1,408 +0,0 @@

1−module Type.Type where

2−

3−import qualified Data.Char as Char

4−import qualified Data.List as List

5−import qualified Data.Map as Map

6−import qualified Data.UnionFind.IO as UF

7−import Type.PrettyPrint

8−import Text.PrettyPrint as P

9−import System.IO.Unsafe

10−import Control.Applicative ((<$>),(<*>))

11−import Control.Monad.State

12−import Control.Monad.Error

13−import Data.Traversable (traverse)

14−import SourceSyntax.Annotation

15−import SourceSyntax.Helpers (isTuple)

16−import qualified SourceSyntax.Type as Src

17−

18−data Term1 a

19− = App1 a a

20− | Fun1 a a

21− | Var1 a

22− | EmptyRecord1

23− | Record1 (Map.Map String [a]) a

24− deriving Show

25−

26−data TermN a

27− = VarN a

28− | TermN (Term1 (TermN a))

29− deriving Show

30−

31−record :: Map.Map String [TermN a] -> TermN a -> TermN a

32−record fs rec = TermN (Record1 fs rec)

33−

34−type Type = TermN Variable

35−type Variable = UF.Point Descriptor

36−

37−type SchemeName = String

38−type TypeName = String

39−

40−type Constraint a b = Located (BasicConstraint a b)

41−data BasicConstraint a b

42− = CTrue

43− | CSaveEnv

44− | CEqual a a

45− | CAnd [Constraint a b]

46− | CLet [Scheme a b] (Constraint a b)

47− | CInstance SchemeName a

48− deriving Show

49−

50−data Scheme a b = Scheme {

51− rigidQuantifiers :: [b],

52− flexibleQuantifiers :: [b],

53− constraint :: Constraint a b,

54− header :: Map.Map String a

55−} deriving Show

56−

57−type TypeConstraint = Constraint Type Variable

58−type TypeScheme = Scheme Type Variable

59−

60−monoscheme headers = Scheme [] [] (noneNoDocs CTrue) headers

61−

62−infixl 8 /\

63−

64−(/\) :: Constraint a b -> Constraint a b -> Constraint a b

65−a@(A _ c1) /\ b@(A _ c2) =

66− case (c1, c2) of

67− (CTrue, _) -> b

68− (_, CTrue) -> a

69− _ -> mergeOldDocs a b (CAnd [a,b])

70−

71−infixr 9 ==>

72−(==>) :: Type -> Type -> Type

73−a ==> b = TermN (Fun1 a b)

74−

75−f <| a = TermN (App1 f a)

76−

77−data Descriptor = Descriptor {

78− structure :: Maybe (Term1 Variable),

79− rank :: Int,

80− flex :: Flex,

81− name :: Maybe TypeName,

82− copy :: Maybe Variable,

83− mark :: Int

84−} deriving Show

85−

86−noRank = -1

87−outermostRank = 0 :: Int

88−

89−noMark = 0

90−initialMark = 1

91−

92−data Flex = Rigid | Flexible | Constant | Is SuperType

93− deriving (Show, Eq)

94−

95−data SuperType = Number | Comparable | Appendable

96− deriving (Show, Eq)

97−

98−namedVar :: Flex -> String -> IO Variable

99−namedVar flex name = UF.fresh $ Descriptor {

100− structure = Nothing,

101− rank = noRank,

102− flex = flex,

103− name = Just name,

104− copy = Nothing,

105− mark = noMark

106− }

107−

108−var :: Flex -> IO Variable

109−var flex = UF.fresh $ Descriptor {

110− structure = Nothing,

111− rank = noRank,

112− flex = flex,

113− name = Nothing,

114− copy = Nothing,

115− mark = noMark

116− }

117−

118−structuredVar :: Term1 Variable -> IO Variable

119−structuredVar structure = UF.fresh $ Descriptor {

120− structure = Just structure,

121− rank = noRank,

122− flex = Flexible,

123− name = Nothing,

124− copy = Nothing,

125− mark = noMark

126− }

127−

128−

129−-- ex qs constraint == exists qs. constraint

130−ex :: [Variable] -> TypeConstraint -> TypeConstraint

131−ex fqs constraint@(A ann _) =

132− A ann $ CLet [Scheme [] fqs constraint Map.empty] (A ann CTrue)

133−

134−-- fl qs constraint == forall qs. constraint

135−fl :: [Variable] -> TypeConstraint -> TypeConstraint

136−fl rqs constraint@(A ann _) =

137− A ann $ CLet [Scheme rqs [] constraint Map.empty] (A ann CTrue)

138−

139−exists :: Error e => (Type -> ErrorT e IO TypeConstraint) -> ErrorT e IO TypeConstraint

140−exists f = do

141− v <- liftIO $ var Flexible

142− ex [v] <$> f (VarN v)

143−

144−existsNumber :: Error e => (Type -> ErrorT e IO TypeConstraint) -> ErrorT e IO TypeConstraint

145−existsNumber f = do

146− v <- liftIO $ var (Is Number)

147− ex [v] <$> f (VarN v)

148−

149−

150−instance Show a => Show (UF.Point a) where

151− show point = unsafePerformIO $ fmap show (UF.descriptor point)

152−

153−

154−instance PrettyType a => PrettyType (UF.Point a) where

155− pretty when point = unsafePerformIO $ fmap (pretty when) (UF.descriptor point)

156−

157−

158−instance PrettyType t => PrettyType (Annotated a t) where

159− pretty when (A _ e) = pretty when e

160−

161−

162−instance PrettyType a => PrettyType (Term1 a) where

163− pretty when term =

164− let prty = pretty Never in

165− case term of

166− App1 f x | P.render px == "_List" -> P.brackets (pretty Never x)

167− | otherwise -> parensIf needed (px <+> pretty App x)

168− where

169− px = prty f

170− needed = case when of

171− App -> True

172− _ -> False

173−

174− Fun1 arg body ->

175− parensIf needed (pretty Fn arg <+> P.text "->" <+> prty body)

176− where

177− needed = case when of

178− Never -> False

179− _ -> True

180−

181− Var1 x -> prty x

182−

183− EmptyRecord1 -> P.braces P.empty

184−

185− Record1 fields ext -> P.braces (extend <+> commaSep prettyFields)

186− where

187− prettyExt = prty ext

188− extend | P.render prettyExt == "{}" = P.empty

189− | otherwise = prettyExt <+> P.text "|"

190− mkPretty f t = P.text (reprime f) <+> P.text ":" <+> prty t

191− prettyFields = concatMap (\(f,ts) -> map (mkPretty f) ts) (Map.toList fields)

192−

193−

194−instance PrettyType a => PrettyType (TermN a) where

195− pretty when term =

196− case term of

197− VarN x -> pretty when x

198− TermN t1 -> pretty when t1

199−

200−

201−instance PrettyType Descriptor where

202− pretty when desc =

203− case (structure desc, name desc) of

204− (Just term, _) -> pretty when term

205− (_, Just name) -> if not (isTuple name) then P.text (reprime name) else

206− P.parens . P.text $ replicate (read (drop 6 name) - 1) ','

207− _ -> P.text "?"

208−

209−

210−instance (PrettyType a, PrettyType b) => PrettyType (BasicConstraint a b) where

211− pretty _ constraint =

212− let prty = pretty Never in

213− case constraint of

214− CTrue -> P.text "True"

215− CSaveEnv -> P.text "SaveTheEnvironment!!!"

216− CEqual a b -> prty a <+> P.text "=" <+> prty b

217− CAnd [] -> P.text "True"

218−

219− CAnd cs ->

220− P.parens . P.sep $ P.punctuate (P.text " and") (map (pretty Never) cs)

221−

222− CLet [Scheme [] fqs constraint header] (A _ CTrue) | Map.null header ->

223− P.sep [ binder, pretty Never c ]

224− where

225− mergeExists vs (A _ c) =

226− case c of

227− CLet [Scheme [] fqs' c' _] (A _ CTrue) -> mergeExists (vs ++ fqs') c'

228− _ -> (vs, c)

229−

230− (fqs', c) = mergeExists fqs constraint

231−

232− binder = if null fqs' then P.empty else

233− P.text "\x2203" <+> P.hsep (map (pretty Never) fqs') <> P.text "."

234−

235− CLet schemes constraint ->

236− P.fsep [ P.hang (P.text "let") 4 (P.brackets . commaSep $ map (pretty Never) schemes)

237− , P.text "in", pretty Never constraint ]

238−

239− CInstance name tipe ->

240− P.text name <+> P.text "<" <+> prty tipe

241−

242−instance (PrettyType a, PrettyType b) => PrettyType (Scheme a b) where

243− pretty _ (Scheme rqs fqs (A _ constraint) headers) =

244− P.sep [ forall, cs, headers' ]

245− where

246− prty = pretty Never

247−

248− forall = if null rqs && null fqs then P.empty else

249− P.text "\x2200" <+> frees <+> rigids

250−

251− frees = P.hsep $ map prty fqs

252− rigids = if null rqs then P.empty else P.braces . P.hsep $ map prty rqs

253−

254− cs = case constraint of

255− CTrue -> P.empty

256− CAnd [] -> P.empty

257− _ -> P.brackets (pretty Never constraint)

258−

259− headers' = if Map.size headers > 0 then dict else P.empty

260− dict = P.parens . commaSep . map prettyPair $ Map.toList headers

261− prettyPair (n,t) = P.text n <+> P.text ":" <+> pretty Never t

262−

263−

264−extraPretty :: (PrettyType t, Crawl t) => t -> IO Doc

265−extraPretty t = pretty Never <$> addNames t

266−

267−addNames :: (Crawl t) => t -> IO t

268−addNames value = do

269− (rawVars, _, _, _) <- execStateT (crawl getNames value) ([], 0, 0, 0)

270− let vars = map head . List.group $ List.sort rawVars

271− suffix s = map (++s) (map (:[]) ['a'..'z'])

272− allVars = concatMap suffix $ ["","'","_"] ++ map show [0..]

273− okayVars = filter (`notElem` vars) allVars

274− runStateT (crawl rename value) (okayVars, 0, 0, 0)

275− return value

276− where

277− getNames desc state@(vars, a, b, c) =

278− let name' = name desc in

279− case name' of

280− Just var -> (name', (var:vars, a, b, c))

281− Nothing -> (name', state)

282−

283− rename desc state@(vars, a, b, c) =

284− case name desc of

285− Just var -> (Just var, state)

286− Nothing ->

287− case flex desc of

288− Is Number -> (Just $ "number" ++ replicate a '\'', (vars, a+1, b, c))

289− Is Comparable -> (Just $ "comparable" ++ replicate b '\'', (vars, a, b+1, c))

290− Is Appendable -> (Just $ "appendable" ++ replicate c '\'', (vars, a, b, c+1))

291− other -> (Just $ head vars, (tail vars, a, b, c))

292− where mark = case other of

293− Flexible -> ""

294− Rigid -> "!"

295− Constant -> "#"

296−

297−

298−type CrawlState = ([String], Int, Int, Int)

299−

300−-- Code for traversing all the type data-structures and giving

301−-- names to the variables embedded deep in there.

302−class Crawl t where

303− crawl :: (Descriptor -> CrawlState -> (Maybe TypeName, CrawlState))

304− -> t

305− -> StateT CrawlState IO t

306−

307−instance Crawl e => Crawl (Annotated a e) where

308− crawl nextState (A ann e) = A ann <$> crawl nextState e

309−

310−instance (Crawl t, Crawl v) => Crawl (BasicConstraint t v) where

311− crawl nextState constraint =

312− let rnm = crawl nextState in

313− case constraint of

314− CTrue -> return CTrue

315− CSaveEnv -> return CSaveEnv

316− CEqual a b -> CEqual <$> rnm a <*> rnm b

317− CAnd cs -> CAnd <$> crawl nextState cs

318− CLet schemes c -> CLet <$> crawl nextState schemes <*> crawl nextState c

319− CInstance name tipe -> CInstance name <$> rnm tipe

320−

321−instance Crawl a => Crawl [a] where

322− crawl nextState list = mapM (crawl nextState) list

323−

324−instance (Crawl t, Crawl v) => Crawl (Scheme t v) where

325− crawl nextState (Scheme rqs fqs c headers) =

326− let rnm = crawl nextState in

327− Scheme <$> rnm rqs <*> rnm fqs <*> crawl nextState c <*> return headers

328−

329−instance Crawl t => Crawl (TermN t) where

330− crawl nextState tipe =

331− case tipe of

332− VarN x -> VarN <$> crawl nextState x

333− TermN term -> TermN <$> crawl nextState term

334−

335−instance Crawl t => Crawl (Term1 t) where

336− crawl nextState term =

337− let rnm = crawl nextState in

338− case term of

339− App1 a b -> App1 <$> rnm a <*> rnm b

340− Fun1 a b -> Fun1 <$> rnm a <*> rnm b

341− Var1 a -> Var1 <$> rnm a

342− EmptyRecord1 -> return EmptyRecord1

343− Record1 fields ext ->

344− Record1 <$> traverse (mapM rnm) fields <*> rnm ext

345−

346−instance Crawl a => Crawl (UF.Point a) where

347− crawl nextState point = do

348− desc <- liftIO $ UF.descriptor point

349− desc' <- crawl nextState desc

350− liftIO $ UF.setDescriptor point desc'

351− return point

352−

353−instance Crawl Descriptor where

354− crawl nextState desc = do

355− state <- get

356− let (name', state') = nextState desc state

357− structure' <- traverse (crawl nextState) (structure desc)

358− put state'

359− return $ desc { name = name', structure = structure' }

360−

361−

362−toSrcType :: Variable -> IO Src.Type

363−toSrcType variable = do

364− desc <- UF.descriptor =<< addNames variable

365− case structure desc of

366− Just term ->

367− case term of

368− App1 a b -> do

369− Src.Data name ts <- toSrcType a

370− b' <- toSrcType b

371− return (Src.Data name (ts ++ [b']))

372− Fun1 a b -> Src.Lambda <$> toSrcType a <*> toSrcType b

373− Var1 a -> toSrcType a

374− EmptyRecord1 -> return $ Src.Record [] Nothing

375− Record1 tfields extension -> do

376− fields' <- traverse (mapM toSrcType) tfields

377− let fields = concat [ map ((,) name) ts | (name,ts) <- Map.toList fields' ]

378− ext' <- toSrcType extension

379− return $ case ext' of

380− Src.Record fs ext -> Src.Record (fs ++ fields) ext

381− Src.Var x -> Src.Record fields (Just x)

382− _ -> error "Used toSrcType on a type that is not well-formed"

383− Nothing ->

384− case name desc of

385− Just x@(c:_) | Char.isLower c -> return (Src.Var x)

386− | otherwise -> return (Src.Data x [])

387− _ -> error $ concat

388− [ "Problem converting the following type "

389− , "from a type-checker type to a source-syntax type:"

390− , P.render (pretty Never variable) ]

391−

392−data AppStructure = List Variable | Tuple [Variable] | Other

393−

394−collectApps :: Variable -> IO AppStructure

395−collectApps variable = go [] variable

396− where

397− go vars variable = do

398− desc <- UF.descriptor variable

399− case (structure desc, vars) of

400− (Nothing, [v]) -> case name desc of

401− Just "_List" -> return (List v)

402− _ -> return Other

403− (Nothing, vs) -> case name desc of

404− Just ctor | isTuple ctor -> return (Tuple vs)

405− _ -> return Other

406− (Just term, _) -> case term of

407− App1 a b -> go (vars ++ [b]) a

408− _ -> return Other

compiler/Type/Unify.hsdeleted−200

@@ -1,200 +0,0 @@

1−{-# OPTIONS_GHC -W #-}

2−module Type.Unify (unify) where

3−

4−import Control.Monad.State

5−import qualified Data.Map as Map

6−import qualified Data.Maybe as Maybe

7−import qualified Data.UnionFind.IO as UF

8−import qualified SourceSyntax.Annotation as A

9−import qualified Type.State as TS

10−import Type.Type

11−import Type.PrettyPrint

12−import Text.PrettyPrint (render)

13−

14−unify :: A.Region -> Variable -> Variable -> StateT TS.SolverState IO ()

15−unify region variable1 variable2 = do

16− equivalent <- liftIO $ UF.equivalent variable1 variable2

17− if equivalent then return ()

18− else actuallyUnify region variable1 variable2

19−

20−actuallyUnify :: A.Region -> Variable -> Variable -> StateT TS.SolverState IO ()

21−actuallyUnify region variable1 variable2 = do

22− desc1 <- liftIO $ UF.descriptor variable1

23− desc2 <- liftIO $ UF.descriptor variable2

24− let unify' = unify region

25−

26− name' :: Maybe String

27− name' = case (name desc1, name desc2) of

28− (Just name1, Just name2) ->

29− case (flex desc1, flex desc2) of

30− (_, Flexible) -> Just name1

31− (Flexible, _) -> Just name2

32− (Is Number, Is _) -> Just name1

33− (Is _, Is Number) -> Just name2

34− (Is _, Is _) -> Just name1

35− (_, _) -> Nothing

36− (Just name1, _) -> Just name1

37− (_, Just name2) -> Just name2

38− _ -> Nothing

39−

40− flex' :: Flex

41− flex' = case (flex desc1, flex desc2) of

42− (f, Flexible) -> f

43− (Flexible, f) -> f

44− (Is Number, Is _) -> Is Number

45− (Is _, Is Number) -> Is Number

46− (Is super, Is _) -> Is super

47− (_, _) -> Flexible

48−

49− rank' :: Int

50− rank' = min (rank desc1) (rank desc2)

51−

52− merge1 :: StateT TS.SolverState IO ()

53− merge1 = liftIO $ do

54− if rank desc1 < rank desc2 then UF.union variable2 variable1

55− else UF.union variable1 variable2

56− UF.modifyDescriptor variable1 $ \desc ->

57− desc { structure = structure desc1, flex = flex', name = name' }

58−

59− merge2 :: StateT TS.SolverState IO ()

60− merge2 = liftIO $ do

61− if rank desc1 < rank desc2 then UF.union variable2 variable1

62− else UF.union variable1 variable2

63− UF.modifyDescriptor variable2 $ \desc ->

64− desc { structure = structure desc2, flex = flex', name = name' }

65−

66− merge = if rank desc1 < rank desc2 then merge1 else merge2

67−

68− fresh :: Maybe (Term1 Variable) -> StateT TS.SolverState IO Variable

69− fresh structure = do

70− var <- liftIO . UF.fresh $ Descriptor {

71− structure = structure, rank = rank', flex = flex',

72− name = name', copy = Nothing, mark = noMark

73− }

74− TS.register var

75−

76− flexAndUnify var = do

77− liftIO $ UF.modifyDescriptor var $ \desc -> desc { flex = Flexible }

78− unify' variable1 variable2

79−

80− unifyNumber svar name

81− | name `elem` ["Int","Float","number"] = flexAndUnify svar

82− | otherwise = TS.addError region (Just hint) variable1 variable2

83− where hint = "A number must be an Int or Float."

84−

85− comparableError maybe =

86− TS.addError region (Just $ Maybe.fromMaybe msg maybe) variable1 variable2

87− where msg = "A comparable must be an Int, Float, Char, String, list, or tuple."

88−

89− unifyComparable var name

90− | name `elem` ["Int","Float","Char","String","comparable"] = flexAndUnify var

91− | otherwise = comparableError Nothing

92−

93− unifyComparableStructure varSuper varFlex =

94− do struct <- liftIO $ collectApps varFlex

95− case struct of

96− Other -> comparableError Nothing

97− List v -> do flexAndUnify varSuper

98− unify' v =<< liftIO (var $ Is Comparable)

99− Tuple vs

100− | length vs > 6 ->

101− comparableError $ Just "Cannot compare a tuple with more than 6 elements."

102− | otherwise ->

103− do flexAndUnify varSuper

104− cmpVars <- liftIO $ forM [1..length vs] $ \_ -> var (Is Comparable)

105− zipWithM_ unify' vs cmpVars

106−

107− unifyAppendable varSuper varFlex =

108− do struct <- liftIO $ collectApps varFlex

109− case struct of

110− List _ -> flexAndUnify varSuper

111− _ -> comparableError Nothing

112−

113− rigidError variable = TS.addError region (Just hint) variable1 variable2

114− where

115− var = "'" ++ render (pretty Never variable) ++ "'"

116− hint = "Cannot unify rigid type variable " ++ var ++

117− ".\nThe problem probably relates to a type annotation. Note that rigid type\n\

118− \variables are not shared between a top-level and let-bound type annotations."

119−

120− superUnify =

121− case (flex desc1, flex desc2, name desc1, name desc2) of

122− (Is super1, Is super2, _, _)

123− | super1 == super2 -> merge

124− (Is Number, Is Comparable, _, _) -> merge1

125− (Is Comparable, Is Number, _, _) -> merge2

126−

127− (Is Number, _, _, Just name) -> unifyNumber variable1 name

128− (_, Is Number, Just name, _) -> unifyNumber variable2 name

129−

130− (Is Comparable, _, _, Just name) -> unifyComparable variable1 name

131− (_, Is Comparable, Just name, _) -> unifyComparable variable2 name

132− (Is Comparable, _, _, _) -> unifyComparableStructure variable1 variable2

133− (_, Is Comparable, _, _) -> unifyComparableStructure variable2 variable1

134−

135− (Is Appendable, _, _, Just ctor)

136− | ctor `elem` ["Text.Text","String"] -> flexAndUnify variable1

137− (_, Is Appendable, Just ctor, _)

138− | ctor `elem` ["Text.Text","String"] -> flexAndUnify variable2

139− (Is Appendable, _, _, _) -> unifyAppendable variable1 variable2

140− (_, Is Appendable, _, _) -> unifyAppendable variable2 variable1

141−

142− (Rigid, _, _, _) -> rigidError variable1

143− (_, Rigid, _, _) -> rigidError variable2

144− _ -> TS.addError region Nothing variable1 variable2

145−

146− case (structure desc1, structure desc2) of

147− (Nothing, Nothing) | flex desc1 == Flexible && flex desc1 == Flexible -> merge

148− (Nothing, _) | flex desc1 == Flexible -> merge2

149− (_, Nothing) | flex desc2 == Flexible -> merge1

150−

151− (Just (Var1 v), _) -> unify' v variable2

152− (_, Just (Var1 v)) -> unify' v variable1

153−

154− (Nothing, _) -> superUnify

155− (_, Nothing) -> superUnify

156−

157− (Just type1, Just type2) ->

158− case (type1,type2) of

159− (App1 term1 term2, App1 term1' term2') ->

160− do merge

161− unify' term1 term1'

162− unify' term2 term2'

163− (Fun1 term1 term2, Fun1 term1' term2') ->

164− do merge

165− unify' term1 term1'

166− unify' term2 term2'

167−

168− (EmptyRecord1, EmptyRecord1) ->

169− return ()

170−

171− (Record1 fields ext, EmptyRecord1) | Map.null fields -> unify' ext variable2

172− (EmptyRecord1, Record1 fields ext) | Map.null fields -> unify' ext variable1

173−

174− (Record1 fields1 ext1, Record1 fields2 ext2) ->

175− do sequence . concat . Map.elems $ Map.intersectionWith (zipWith unify') fields1 fields2

176− let mkRecord fs ext = fresh . Just $ Record1 fs ext

177− case (Map.null fields1', Map.null fields2') of

178− (True , True ) -> unify' ext1 ext2

179− (True , False) -> do

180− record2' <- mkRecord fields2' ext2

181− unify' ext1 record2'

182− (False, True ) -> do

183− record1' <- mkRecord fields1' ext1

184− unify' record1' ext2

185− (False, False) -> do

186− record1' <- mkRecord fields1' =<< fresh Nothing

187− record2' <- mkRecord fields2' =<< fresh Nothing

188− unify' record1' ext2

189− unify' ext1 record2'

190− where

191− fields1' = unmerged fields1 fields2

192− fields2' = unmerged fields2 fields1

193−

194− unmerged a b = Map.filter (not . null) $ Map.union (Map.intersectionWith eat a b) a

195−

196− eat (_:xs) (_:ys) = eat xs ys

197− eat xs _ = xs

198−

199− _ -> TS.addError region Nothing variable1 variable2

200−

compiler/src/AST/Canonical.hsnew file+401

@@ -0,0 +1,401 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module AST.Canonical

4+ ( Expr, Expr_(..)

5+ , CaseBranch(..)

6+ , FieldUpdate(..)

7+ , CtorOpts(..)

8+ -- definitions

9+ , Def(..)

10+ , Decls(..)

11+ -- patterns

12+ , Pattern, Pattern_(..)

13+ , PatternCtorArg(..)

14+ -- types

15+ , Annotation(..)

16+ , Type(..)

17+ , AliasType(..)

18+ , FieldType(..)

19+ , fieldsToList

20+ -- modules

21+ , Module(..)

22+ , Alias(..)

23+ , Binop(..)

24+ , Union(..)

25+ , Ctor(..)

26+ , Exports(..)

27+ , Export(..)

28+ , Effects(..)

29+ , Port(..)

30+ , Manager(..)

31+ )

32+ where

33+

34+{- Creating a canonical AST means finding the home module for all variables.

35+So if you have L.map, you need to figure out that it is from the elm/core

36+package in the List module.

37+

38+In later phases (e.g. type inference, exhaustiveness checking, optimization)

39+you need to look up additional info from these modules. What is the type?

40+What are the alternative type constructors? These lookups can be quite costly,

41+especially in type inference. To reduce costs the canonicalization phase

42+caches info needed in later phases. This means we no longer build large

43+dictionaries of metadata with O(log(n)) lookups in those phases. Instead

44+there is an O(1) read of an existing field! I have tried to mark all

45+cached data with comments like:

46+

47+-- CACHE for exhaustiveness

48+-- CACHE for inference

49+

50+So it is clear why the data is kept around.

51+-}

52+

53+

54+import Control.Monad (liftM, liftM2, liftM3, liftM4, replicateM)

55+import Data.Binary

56+import qualified Data.List as List

57+import qualified Data.Map as Map

58+import Data.Name (Name)

59+

60+import qualified AST.Source as Src

61+import qualified AST.Utils.Binop as Binop

62+import qualified AST.Utils.Shader as Shader

63+import qualified Data.Index as Index

64+import qualified Elm.Float as EF

65+import qualified Elm.ModuleName as ModuleName

66+import qualified Elm.String as ES

67+import qualified Reporting.Annotation as A

68+

69+

70+

71+-- EXPRESSIONS

72+

73+

74+type Expr =

75+ A.Located Expr_

76+

77+

78+-- CACHE Annotations for type inference

79+data Expr_

80+ = VarLocal Name

81+ | VarTopLevel ModuleName.Canonical Name

82+ | VarKernel Name Name

83+ | VarForeign ModuleName.Canonical Name Annotation

84+ | VarCtor CtorOpts ModuleName.Canonical Name Index.ZeroBased Annotation

85+ | VarDebug ModuleName.Canonical Name Annotation

86+ | VarOperator Name ModuleName.Canonical Name Annotation -- CACHE real name for optimization

87+ | Chr ES.String

88+ | Str ES.String

89+ | Int Int

90+ | Float EF.Float

91+ | List [Expr]

92+ | Negate Expr

93+ | Binop Name ModuleName.Canonical Name Annotation Expr Expr -- CACHE real name for optimization

94+ | Lambda [Pattern] Expr

95+ | Call Expr [Expr]

96+ | If [(Expr, Expr)] Expr

97+ | Let Def Expr

98+ | LetRec [Def] Expr

99+ | LetDestruct Pattern Expr Expr

100+ | Case Expr [CaseBranch]

101+ | Accessor Name

102+ | Access Expr (A.Located Name)

103+ | Update Name Expr (Map.Map Name FieldUpdate)

104+ | Record (Map.Map Name Expr)

105+ | Unit

106+ | Tuple Expr Expr (Maybe Expr)

107+ | Shader Shader.Source Shader.Types

108+

109+

110+data CaseBranch =

111+ CaseBranch Pattern Expr

112+

113+

114+data FieldUpdate =

115+ FieldUpdate A.Region Expr

116+

117+

118+

119+-- DEFS

120+

121+

122+data Def

123+ = Def (A.Located Name) [Pattern] Expr

124+ | TypedDef (A.Located Name) FreeVars [(Pattern, Type)] Expr Type

125+

126+

127+

128+-- DECLARATIONS

129+

130+

131+data Decls

132+ = Declare Def Decls

133+ | DeclareRec Def [Def] Decls

134+ | SaveTheEnvironment

135+

136+

137+

138+-- PATTERNS

139+

140+

141+type Pattern =

142+ A.Located Pattern_

143+

144+

145+data Pattern_

146+ = PAnything

147+ | PVar Name

148+ | PRecord [Name]

149+ | PAlias Pattern Name

150+ | PUnit

151+ | PTuple Pattern Pattern (Maybe Pattern)

152+ | PList [Pattern]

153+ | PCons Pattern Pattern

154+ | PBool Union Bool

155+ | PChr ES.String

156+ | PStr ES.String

157+ | PInt Int

158+ | PCtor

159+ { _p_home :: ModuleName.Canonical

160+ , _p_type :: Name

161+ , _p_union :: Union

162+ , _p_name :: Name

163+ , _p_index :: Index.ZeroBased

164+ , _p_args :: [PatternCtorArg]

165+ }

166+ -- CACHE _p_home, _p_type, and _p_vars for type inference

167+ -- CACHE _p_index to replace _p_name in PROD code gen

168+ -- CACHE _p_opts to allocate less in PROD code gen

169+ -- CACHE _p_alts and _p_numAlts for exhaustiveness checker

170+

171+

172+data PatternCtorArg =

173+ PatternCtorArg

174+ { _index :: Index.ZeroBased -- CACHE for destructors/errors

175+ , _type :: Type -- CACHE for type inference

176+ , _arg :: Pattern

177+ }

178+

179+

180+

181+-- TYPES

182+

183+

184+data Annotation = Forall FreeVars Type

185+ deriving (Eq)

186+

187+

188+type FreeVars = Map.Map Name ()

189+

190+

191+data Type

192+ = TLambda Type Type

193+ | TVar Name

194+ | TType ModuleName.Canonical Name [Type]

195+ | TRecord (Map.Map Name FieldType) (Maybe Name)

196+ | TUnit

197+ | TTuple Type Type (Maybe Type)

198+ | TAlias ModuleName.Canonical Name [(Name, Type)] AliasType

199+ deriving (Eq)

200+

201+

202+data AliasType

203+ = Holey Type

204+ | Filled Type

205+ deriving (Eq)

206+

207+

208+data FieldType = FieldType {-# UNPACK #-} !Word16 Type

209+ deriving (Eq)

210+

211+

212+-- NOTE: The Word16 marks the source order, but it may not be available

213+-- for every canonical type. For example, if the canonical type is inferred

214+-- the orders will all be zeros.

215+--

216+fieldsToList :: Map.Map Name FieldType -> [(Name, Type)]

217+fieldsToList fields =

218+ let

219+ getIndex (_, FieldType index _) =

220+ index

221+

222+ dropIndex (name, FieldType _ tipe) =

223+ (name, tipe)

224+ in

225+ map dropIndex (List.sortOn getIndex (Map.toList fields))

226+

227+

228+

229+-- MODULES

230+

231+

232+data Module =

233+ Module

234+ { _name :: ModuleName.Canonical

235+ , _exports :: Exports

236+ , _docs :: Src.Docs

237+ , _decls :: Decls

238+ , _unions :: Map.Map Name Union

239+ , _aliases :: Map.Map Name Alias

240+ , _binops :: Map.Map Name Binop

241+ , _effects :: Effects

242+ }

243+

244+

245+data Alias = Alias [Name] Type

246+ deriving (Eq)

247+

248+

249+data Binop = Binop_ Binop.Associativity Binop.Precedence Name

250+ deriving (Eq)

251+

252+

253+data Union =

254+ Union

255+ { _u_vars :: [Name]

256+ , _u_alts :: [Ctor]

257+ , _u_numAlts :: Int -- CACHE numAlts for exhaustiveness checking

258+ , _u_opts :: CtorOpts -- CACHE which optimizations are available

259+ }

260+ deriving (Eq)

261+

262+

263+data CtorOpts

264+ = Normal

265+ | Enum

266+ | Unbox

267+ deriving (Eq, Ord)

268+

269+

270+data Ctor = Ctor Name Index.ZeroBased Int [Type] -- CACHE length args

271+ deriving (Eq)

272+

273+

274+

275+-- EXPORTS

276+

277+

278+data Exports

279+ = ExportEverything A.Region

280+ | Export (Map.Map Name (A.Located Export))

281+

282+

283+data Export

284+ = ExportValue

285+ | ExportBinop

286+ | ExportAlias

287+ | ExportUnionOpen

288+ | ExportUnionClosed

289+ | ExportPort

290+

291+

292+

293+-- EFFECTS

294+

295+

296+data Effects

297+ = NoEffects

298+ | Ports (Map.Map Name Port)

299+ | Manager A.Region A.Region A.Region Manager

300+

301+

302+data Port

303+ = Incoming { _freeVars :: FreeVars, _payload :: Type, _func :: Type }

304+ | Outgoing { _freeVars :: FreeVars, _payload :: Type, _func :: Type }

305+

306+

307+data Manager

308+ = Cmd Name

309+ | Sub Name

310+ | Fx Name Name

311+

312+

313+

314+-- BINARY

315+

316+

317+instance Binary Alias where

318+ get = liftM2 Alias get get

319+ put (Alias a b) = put a >> put b

320+

321+

322+instance Binary Union where

323+ put (Union a b c d) = put a >> put b >> put c >> put d

324+ get = liftM4 Union get get get get

325+

326+

327+instance Binary Ctor where

328+ get = liftM4 Ctor get get get get

329+ put (Ctor a b c d) = put a >> put b >> put c >> put d

330+

331+

332+instance Binary CtorOpts where

333+ put opts =

334+ case opts of

335+ Normal -> putWord8 0

336+ Enum -> putWord8 1

337+ Unbox -> putWord8 2

338+

339+ get =

340+ do n <- getWord8

341+ case n of

342+ 0 -> return Normal

343+ 1 -> return Enum

344+ 2 -> return Unbox

345+ _ -> fail "binary encoding of CtorOpts was corrupted"

346+

347+

348+instance Binary Annotation where

349+ get = liftM2 Forall get get

350+ put (Forall a b) = put a >> put b

351+

352+

353+instance Binary Type where

354+ put tipe =

355+ case tipe of

356+ TLambda a b -> putWord8 0 >> put a >> put b

357+ TVar a -> putWord8 1 >> put a

358+ TRecord a b -> putWord8 2 >> put a >> put b

359+ TUnit -> putWord8 3

360+ TTuple a b c -> putWord8 4 >> put a >> put b >> put c

361+ TAlias a b c d -> putWord8 5 >> put a >> put b >> put c >> put d

362+ TType home name ts ->

363+ let potentialWord = length ts + 7 in

364+ if potentialWord <= fromIntegral (maxBound :: Word8) then

365+ do putWord8 (fromIntegral potentialWord)

366+ put home

367+ put name

368+ mapM_ put ts

369+ else

370+ putWord8 6 >> put home >> put name >> put ts

371+

372+ get =

373+ do word <- getWord8

374+ case word of

375+ 0 -> liftM2 TLambda get get

376+ 1 -> liftM TVar get

377+ 2 -> liftM2 TRecord get get

378+ 3 -> return TUnit

379+ 4 -> liftM3 TTuple get get get

380+ 5 -> liftM4 TAlias get get get get

381+ 6 -> liftM3 TType get get get

382+ n -> liftM3 TType get get (replicateM (fromIntegral (n - 7)) get)

383+

384+

385+instance Binary AliasType where

386+ put aliasType =

387+ case aliasType of

388+ Holey tipe -> putWord8 0 >> put tipe

389+ Filled tipe -> putWord8 1 >> put tipe

390+

391+ get =

392+ do n <- getWord8

393+ case n of

394+ 0 -> liftM Holey get

395+ 1 -> liftM Filled get

396+ _ -> fail "binary encoding of AliasType was corrupted"

397+

398+

399+instance Binary FieldType where

400+ get = liftM2 FieldType get get

401+ put (FieldType a b) = put a >> put b

compiler/src/AST/Optimized.hsnew file+451

@@ -0,0 +1,451 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module AST.Optimized

3+ ( Def(..)

4+ , Expr(..)

5+ , Global(..)

6+ , Path(..)

7+ , Destructor(..)

8+ , Decider(..)

9+ , Choice(..)

10+ , GlobalGraph(..)

11+ , LocalGraph(..)

12+ , Main(..)

13+ , Node(..)

14+ , EffectsType(..)

15+ , empty

16+ , addGlobalGraph

17+ , addLocalGraph

18+ , addKernel

19+ , toKernelGlobal

20+ )

21+ where

22+

23+

24+import Control.Monad (liftM, liftM2, liftM3, liftM4)

25+import Data.Binary (Binary, get, put, getWord8, putWord8)

26+import qualified Data.Map as Map

27+import qualified Data.Name as Name

28+import Data.Name (Name)

29+import qualified Data.Set as Set

30+

31+import qualified AST.Canonical as Can

32+import qualified AST.Utils.Shader as Shader

33+import qualified Data.Index as Index

34+import qualified Elm.Float as EF

35+import qualified Elm.Kernel as K

36+import qualified Elm.ModuleName as ModuleName

37+import qualified Elm.Package as Pkg

38+import qualified Elm.String as ES

39+import qualified Optimize.DecisionTree as DT

40+import qualified Reporting.Annotation as A

41+

42+

43+

44+-- EXPRESSIONS

45+

46+

47+data Expr

48+ = Bool Bool

49+ | Chr ES.String

50+ | Str ES.String

51+ | Int Int

52+ | Float EF.Float

53+ | VarLocal Name

54+ | VarGlobal Global

55+ | VarEnum Global Index.ZeroBased

56+ | VarBox Global

57+ | VarCycle ModuleName.Canonical Name

58+ | VarDebug Name ModuleName.Canonical A.Region (Maybe Name)

59+ | VarKernel Name Name

60+ | List [Expr]

61+ | Function [Name] Expr

62+ | Call Expr [Expr]

63+ | TailCall Name [(Name, Expr)]

64+ | If [(Expr, Expr)] Expr

65+ | Let Def Expr

66+ | Destruct Destructor Expr

67+ | Case Name Name (Decider Choice) [(Int, Expr)]

68+ | Accessor Name

69+ | Access Expr Name

70+ | Update Expr (Map.Map Name Expr)

71+ | Record (Map.Map Name Expr)

72+ | Unit

73+ | Tuple Expr Expr (Maybe Expr)

74+ | Shader Shader.Source (Set.Set Name) (Set.Set Name)

75+

76+

77+data Global = Global ModuleName.Canonical Name

78+

79+

80+

81+-- DEFINITIONS

82+

83+

84+data Def

85+ = Def Name Expr

86+ | TailDef Name [Name] Expr

87+

88+

89+data Destructor =

90+ Destructor Name Path

91+

92+

93+data Path

94+ = Index Index.ZeroBased Path

95+ | Field Name Path

96+ | Unbox Path

97+ | Root Name

98+

99+

100+

101+-- BRANCHING

102+

103+

104+data Decider a

105+ = Leaf a

106+ | Chain

107+ { _testChain :: [(DT.Path, DT.Test)]

108+ , _success :: Decider a

109+ , _failure :: Decider a

110+ }

111+ | FanOut

112+ { _path :: DT.Path

113+ , _tests :: [(DT.Test, Decider a)]

114+ , _fallback :: Decider a

115+ }

116+ deriving (Eq)

117+

118+

119+data Choice

120+ = Inline Expr

121+ | Jump Int

122+

123+

124+

125+-- OBJECT GRAPH

126+

127+

128+data GlobalGraph =

129+ GlobalGraph

130+ { _g_nodes :: Map.Map Global Node

131+ , _g_fields :: Map.Map Name Int

132+ }

133+

134+

135+data LocalGraph =

136+ LocalGraph

137+ { _l_main :: Maybe Main

138+ , _l_nodes :: Map.Map Global Node -- PERF profile switching Global to Name

139+ , _l_fields :: Map.Map Name Int

140+ }

141+

142+

143+data Main

144+ = Static

145+ | Dynamic

146+ { _message :: Can.Type

147+ , _decoder :: Expr

148+ }

149+

150+

151+data Node

152+ = Define Expr (Set.Set Global)

153+ | DefineTailFunc [Name] Expr (Set.Set Global)

154+ | Ctor Index.ZeroBased Int

155+ | Enum Index.ZeroBased

156+ | Box

157+ | Link Global

158+ | Cycle [Name] [(Name, Expr)] [Def] (Set.Set Global)

159+ | Manager EffectsType

160+ | Kernel [K.Chunk] (Set.Set Global)

161+ | PortIncoming Expr (Set.Set Global)

162+ | PortOutgoing Expr (Set.Set Global)

163+

164+

165+data EffectsType = Cmd | Sub | Fx

166+

167+

168+

169+-- GRAPHS

170+

171+

172+{-# NOINLINE empty #-}

173+empty :: GlobalGraph

174+empty =

175+ GlobalGraph Map.empty Map.empty

176+

177+

178+addGlobalGraph :: GlobalGraph -> GlobalGraph -> GlobalGraph

179+addGlobalGraph (GlobalGraph nodes1 fields1) (GlobalGraph nodes2 fields2) =

180+ GlobalGraph

181+ { _g_nodes = Map.union nodes1 nodes2

182+ , _g_fields = Map.union fields1 fields2

183+ }

184+

185+

186+addLocalGraph :: LocalGraph -> GlobalGraph -> GlobalGraph

187+addLocalGraph (LocalGraph _ nodes1 fields1) (GlobalGraph nodes2 fields2) =

188+ GlobalGraph

189+ { _g_nodes = Map.union nodes1 nodes2

190+ , _g_fields = Map.union fields1 fields2

191+ }

192+

193+

194+addKernel :: Name.Name -> [K.Chunk] -> GlobalGraph -> GlobalGraph

195+addKernel shortName chunks (GlobalGraph nodes fields) =

196+ let

197+ global = toKernelGlobal shortName

198+ node = Kernel chunks (foldr addKernelDep Set.empty chunks)

199+ in

200+ GlobalGraph

201+ { _g_nodes = Map.insert global node nodes

202+ , _g_fields = Map.union (K.countFields chunks) fields

203+ }

204+

205+

206+addKernelDep :: K.Chunk -> Set.Set Global -> Set.Set Global

207+addKernelDep chunk deps =

208+ case chunk of

209+ K.JS _ -> deps

210+ K.ElmVar home name -> Set.insert (Global home name) deps

211+ K.JsVar shortName _ -> Set.insert (toKernelGlobal shortName) deps

212+ K.ElmField _ -> deps

213+ K.JsField _ -> deps

214+ K.JsEnum _ -> deps

215+ K.Debug -> deps

216+ K.Prod -> deps

217+

218+

219+toKernelGlobal :: Name.Name -> Global

220+toKernelGlobal shortName =

221+ Global (ModuleName.Canonical Pkg.kernel shortName) Name.dollar

222+

223+

224+

225+-- INSTANCES

226+

227+

228+instance Eq Global where

229+ (==) (Global home1 name1) (Global home2 name2) =

230+ name1 == name2 && home1 == home2

231+

232+

233+instance Ord Global where

234+ compare (Global home1 name1) (Global home2 name2) =

235+ case compare name1 name2 of

236+ LT -> LT

237+ EQ -> compare home1 home2

238+ GT -> GT

239+

240+

241+

242+-- BINARY

243+

244+

245+instance Binary Global where

246+ get = liftM2 Global get get

247+ put (Global a b) = put a >> put b

248+

249+

250+instance Binary Expr where

251+ put expr =

252+ case expr of

253+ Bool a -> putWord8 0 >> put a

254+ Chr a -> putWord8 1 >> put a

255+ Str a -> putWord8 2 >> put a

256+ Int a -> putWord8 3 >> put a

257+ Float a -> putWord8 4 >> put a

258+ VarLocal a -> putWord8 5 >> put a

259+ VarGlobal a -> putWord8 6 >> put a

260+ VarEnum a b -> putWord8 7 >> put a >> put b

261+ VarBox a -> putWord8 8 >> put a

262+ VarCycle a b -> putWord8 9 >> put a >> put b

263+ VarDebug a b c d -> putWord8 10 >> put a >> put b >> put c >> put d

264+ VarKernel a b -> putWord8 11 >> put a >> put b

265+ List a -> putWord8 12 >> put a

266+ Function a b -> putWord8 13 >> put a >> put b

267+ Call a b -> putWord8 14 >> put a >> put b

268+ TailCall a b -> putWord8 15 >> put a >> put b

269+ If a b -> putWord8 16 >> put a >> put b

270+ Let a b -> putWord8 17 >> put a >> put b

271+ Destruct a b -> putWord8 18 >> put a >> put b

272+ Case a b c d -> putWord8 19 >> put a >> put b >> put c >> put d

273+ Accessor a -> putWord8 20 >> put a

274+ Access a b -> putWord8 21 >> put a >> put b

275+ Update a b -> putWord8 22 >> put a >> put b

276+ Record a -> putWord8 23 >> put a

277+ Unit -> putWord8 24

278+ Tuple a b c -> putWord8 25 >> put a >> put b >> put c

279+ Shader a b c -> putWord8 26 >> put a >> put b >> put c

280+

281+ get =

282+ do word <- getWord8

283+ case word of

284+ 0 -> liftM Bool get

285+ 1 -> liftM Chr get

286+ 2 -> liftM Str get

287+ 3 -> liftM Int get

288+ 4 -> liftM Float get

289+ 5 -> liftM VarLocal get

290+ 6 -> liftM VarGlobal get

291+ 7 -> liftM2 VarEnum get get

292+ 8 -> liftM VarBox get

293+ 9 -> liftM2 VarCycle get get

294+ 10 -> liftM4 VarDebug get get get get

295+ 11 -> liftM2 VarKernel get get

296+ 12 -> liftM List get

297+ 13 -> liftM2 Function get get

298+ 14 -> liftM2 Call get get

299+ 15 -> liftM2 TailCall get get

300+ 16 -> liftM2 If get get

301+ 17 -> liftM2 Let get get

302+ 18 -> liftM2 Destruct get get

303+ 19 -> liftM4 Case get get get get

304+ 20 -> liftM Accessor get

305+ 21 -> liftM2 Access get get

306+ 22 -> liftM2 Update get get

307+ 23 -> liftM Record get

308+ 24 -> pure Unit

309+ 25 -> liftM3 Tuple get get get

310+ 26 -> liftM3 Shader get get get

311+ _ -> fail "problem getting Opt.Expr binary"

312+

313+

314+instance Binary Def where

315+ put def =

316+ case def of

317+ Def a b -> putWord8 0 >> put a >> put b

318+ TailDef a b c -> putWord8 1 >> put a >> put b >> put c

319+

320+ get =

321+ do word <- getWord8

322+ case word of

323+ 0 -> liftM2 Def get get

324+ 1 -> liftM3 TailDef get get get

325+ _ -> fail "problem getting Opt.Def binary"

326+

327+

328+instance Binary Destructor where

329+ get = liftM2 Destructor get get

330+ put (Destructor a b) = put a >> put b

331+

332+

333+instance Binary Path where

334+ put destructor =

335+ case destructor of

336+ Index a b -> putWord8 0 >> put a >> put b

337+ Field a b -> putWord8 1 >> put a >> put b

338+ Unbox a -> putWord8 2 >> put a

339+ Root a -> putWord8 3 >> put a

340+

341+ get =

342+ do word <- getWord8

343+ case word of

344+ 0 -> liftM2 Index get get

345+ 1 -> liftM2 Field get get

346+ 2 -> liftM Unbox get

347+ 3 -> liftM Root get

348+ _ -> fail "problem getting Opt.Path binary"

349+

350+

351+instance (Binary a) => Binary (Decider a) where

352+ put decider =

353+ case decider of

354+ Leaf a -> putWord8 0 >> put a

355+ Chain a b c -> putWord8 1 >> put a >> put b >> put c

356+ FanOut a b c -> putWord8 2 >> put a >> put b >> put c

357+

358+ get =

359+ do word <- getWord8

360+ case word of

361+ 0 -> liftM Leaf get

362+ 1 -> liftM3 Chain get get get

363+ 2 -> liftM3 FanOut get get get

364+ _ -> fail "problem getting Opt.Decider binary"

365+

366+

367+instance Binary Choice where

368+ put choice =

369+ case choice of

370+ Inline expr -> putWord8 0 >> put expr

371+ Jump index -> putWord8 1 >> put index

372+

373+ get =

374+ do word <- getWord8

375+ case word of

376+ 0 -> liftM Inline get

377+ 1 -> liftM Jump get

378+ _ -> fail "problem getting Opt.Choice binary"

379+

380+

381+

382+instance Binary GlobalGraph where

383+ get = liftM2 GlobalGraph get get

384+ put (GlobalGraph a b) = put a >> put b

385+

386+

387+instance Binary LocalGraph where

388+ get = liftM3 LocalGraph get get get

389+ put (LocalGraph a b c) = put a >> put b >> put c

390+

391+

392+instance Binary Main where

393+ put main =

394+ case main of

395+ Static -> putWord8 0

396+ Dynamic a b -> putWord8 1 >> put a >> put b

397+

398+ get =

399+ do word <- getWord8

400+ case word of

401+ 0 -> return Static

402+ 1 -> liftM2 Dynamic get get

403+ _ -> fail "problem getting Opt.Main binary"

404+

405+

406+instance Binary Node where

407+ put node =

408+ case node of

409+ Define a b -> putWord8 0 >> put a >> put b

410+ DefineTailFunc a b c -> putWord8 1 >> put a >> put b >> put c

411+ Ctor a b -> putWord8 2 >> put a >> put b

412+ Enum a -> putWord8 3 >> put a

413+ Box -> putWord8 4

414+ Link a -> putWord8 5 >> put a

415+ Cycle a b c d -> putWord8 6 >> put a >> put b >> put c >> put d

416+ Manager a -> putWord8 7 >> put a

417+ Kernel a b -> putWord8 8 >> put a >> put b

418+ PortIncoming a b -> putWord8 9 >> put a >> put b

419+ PortOutgoing a b -> putWord8 10 >> put a >> put b

420+

421+ get =

422+ do word <- getWord8

423+ case word of

424+ 0 -> liftM2 Define get get

425+ 1 -> liftM3 DefineTailFunc get get get

426+ 2 -> liftM2 Ctor get get

427+ 3 -> liftM Enum get

428+ 4 -> return Box

429+ 5 -> liftM Link get

430+ 6 -> liftM4 Cycle get get get get

431+ 7 -> liftM Manager get

432+ 8 -> liftM2 Kernel get get

433+ 9 -> liftM2 PortIncoming get get

434+ 10 -> liftM2 PortOutgoing get get

435+ _ -> fail "problem getting Opt.Node binary"

436+

437+

438+instance Binary EffectsType where

439+ put effectsType =

440+ case effectsType of

441+ Cmd -> putWord8 0

442+ Sub -> putWord8 1

443+ Fx -> putWord8 2

444+

445+ get =

446+ do word <- getWord8

447+ case word of

448+ 0 -> return Cmd

449+ 1 -> return Sub

450+ 2 -> return Fx

451+ _ -> fail "problem getting Opt.EffectsType binary"

compiler/src/AST/Source.hsnew file+209

@@ -0,0 +1,209 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module AST.Source

3+ ( Expr, Expr_(..), VarType(..)

4+ , Def(..)

5+ , Pattern, Pattern_(..)

6+ , Type, Type_(..)

7+ , Module(..)

8+ , getName

9+ , getImportName

10+ , Import(..)

11+ , Value(..)

12+ , Union(..)

13+ , Alias(..)

14+ , Infix(..)

15+ , Port(..)

16+ , Effects(..)

17+ , Manager(..)

18+ , Docs(..)

19+ , Comment(..)

20+ , Exposing(..)

21+ , Exposed(..)

22+ , Privacy(..)

23+ )

24+ where

25+

26+

27+import Data.Name (Name)

28+import qualified Data.Name as Name

29+

30+import qualified AST.Utils.Binop as Binop

31+import qualified AST.Utils.Shader as Shader

32+import qualified Elm.Float as EF

33+import qualified Elm.String as ES

34+import qualified Parse.Primitives as P

35+import qualified Reporting.Annotation as A

36+

37+

38+

39+-- EXPRESSIONS

40+

41+

42+type Expr = A.Located Expr_

43+

44+

45+data Expr_

46+ = Chr ES.String

47+ | Str ES.String

48+ | Int Int

49+ | Float EF.Float

50+ | Var VarType Name

51+ | VarQual VarType Name Name

52+ | List [Expr]

53+ | Op Name

54+ | Negate Expr

55+ | Binops [(Expr, A.Located Name)] Expr

56+ | Lambda [Pattern] Expr

57+ | Call Expr [Expr]

58+ | If [(Expr, Expr)] Expr

59+ | Let [A.Located Def] Expr

60+ | Case Expr [(Pattern, Expr)]

61+ | Accessor Name

62+ | Access Expr (A.Located Name)

63+ | Update (A.Located Name) [(A.Located Name, Expr)]

64+ | Record [(A.Located Name, Expr)]

65+ | Unit

66+ | Tuple Expr Expr [Expr]

67+ | Shader Shader.Source Shader.Types

68+

69+

70+data VarType = LowVar | CapVar

71+

72+

73+

74+-- DEFINITIONS

75+

76+

77+data Def

78+ = Define (A.Located Name) [Pattern] Expr (Maybe Type)

79+ | Destruct Pattern Expr

80+

81+

82+

83+-- PATTERN

84+

85+

86+type Pattern = A.Located Pattern_

87+

88+

89+data Pattern_

90+ = PAnything

91+ | PVar Name

92+ | PRecord [A.Located Name]

93+ | PAlias Pattern (A.Located Name)

94+ | PUnit

95+ | PTuple Pattern Pattern [Pattern]

96+ | PCtor A.Region Name [Pattern]

97+ | PCtorQual A.Region Name Name [Pattern]

98+ | PList [Pattern]

99+ | PCons Pattern Pattern

100+ | PChr ES.String

101+ | PStr ES.String

102+ | PInt Int

103+

104+

105+

106+-- TYPE

107+

108+

109+type Type =

110+ A.Located Type_

111+

112+

113+data Type_

114+ = TLambda Type Type

115+ | TVar Name

116+ | TType A.Region Name [Type]

117+ | TTypeQual A.Region Name Name [Type]

118+ | TRecord [(A.Located Name, Type)] (Maybe (A.Located Name))

119+ | TUnit

120+ | TTuple Type Type [Type]

121+

122+

123+

124+-- MODULE

125+

126+

127+data Module =

128+ Module

129+ { _name :: Maybe (A.Located Name)

130+ , _exports :: A.Located Exposing

131+ , _docs :: Docs

132+ , _imports :: [Import]

133+ , _values :: [A.Located Value]

134+ , _unions :: [A.Located Union]

135+ , _aliases :: [A.Located Alias]

136+ , _binops :: [A.Located Infix]

137+ , _effects :: Effects

138+ }

139+

140+

141+getName :: Module -> Name

142+getName (Module maybeName _ _ _ _ _ _ _ _) =

143+ case maybeName of

144+ Just (A.At _ name) ->

145+ name

146+

147+ Nothing ->

148+ Name._Main

149+

150+

151+getImportName :: Import -> Name

152+getImportName (Import (A.At _ name) _ _) =

153+ name

154+

155+

156+data Import =

157+ Import

158+ { _import :: A.Located Name

159+ , _alias :: Maybe Name

160+ , _exposing :: Exposing

161+ }

162+

163+

164+data Value = Value (A.Located Name) [Pattern] Expr (Maybe Type)

165+data Union = Union (A.Located Name) [A.Located Name] [(A.Located Name, [Type])]

166+data Alias = Alias (A.Located Name) [A.Located Name] Type

167+data Infix = Infix Name Binop.Associativity Binop.Precedence Name

168+data Port = Port (A.Located Name) Type

169+

170+

171+data Effects

172+ = NoEffects

173+ | Ports [Port]

174+ | Manager A.Region Manager

175+

176+

177+data Manager

178+ = Cmd (A.Located Name)

179+ | Sub (A.Located Name)

180+ | Fx (A.Located Name) (A.Located Name)

181+

182+

183+data Docs

184+ = NoDocs A.Region

185+ | YesDocs Comment [(Name, Comment)]

186+

187+

188+newtype Comment =

189+ Comment P.Snippet

190+

191+

192+

193+-- EXPOSING

194+

195+

196+data Exposing

197+ = Open

198+ | Explicit [Exposed]

199+

200+

201+data Exposed

202+ = Lower (A.Located Name)

203+ | Upper (A.Located Name) Privacy

204+ | Operator A.Region Name

205+

206+

207+data Privacy

208+ = Public A.Region

209+ | Private

compiler/src/AST/Utils/Binop.hsnew file+55

@@ -0,0 +1,55 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module AST.Utils.Binop

3+ ( Precedence(..)

4+ , Associativity(..)

5+ )

6+ where

7+

8+

9+import Prelude hiding (Either(..))

10+import Control.Monad (liftM)

11+import Data.Binary

12+

13+

14+

15+-- BINOP STUFF

16+

17+

18+newtype Precedence = Precedence Int

19+ deriving (Eq, Ord)

20+

21+

22+data Associativity

23+ = Left

24+ | Non

25+ | Right

26+ deriving (Eq)

27+

28+

29+

30+-- BINARY

31+

32+

33+instance Binary Precedence where

34+ get =

35+ liftM Precedence get

36+

37+ put (Precedence n) =

38+ put n

39+

40+

41+instance Binary Associativity where

42+ get =

43+ do n <- getWord8

44+ case n of

45+ 0 -> return Left

46+ 1 -> return Non

47+ 2 -> return Right

48+ _ -> fail "Error reading valid associativity from serialized string"

49+

50+ put assoc =

51+ putWord8 $

52+ case assoc of

53+ Left -> 0

54+ Non -> 1

55+ Right -> 2

compiler/src/AST/Utils/Shader.hsnew file+91

@@ -0,0 +1,91 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE EmptyDataDecls #-}

3+module AST.Utils.Shader

4+ ( Source

5+ , Types(..)

6+ , Type(..)

7+ , fromChars

8+ , toJsStringBuilder

9+ )

10+ where

11+

12+

13+import Control.Monad (liftM)

14+import Data.Binary (Binary, get, put)

15+import qualified Data.ByteString as BS

16+import qualified Data.ByteString.Builder as B

17+import qualified Data.ByteString.UTF8 as BS_UTF8

18+import qualified Data.Map as Map

19+import qualified Data.Name as Name

20+

21+

22+

23+-- SOURCE

24+

25+

26+newtype Source =

27+ Source BS.ByteString

28+

29+

30+

31+-- TYPES

32+

33+

34+data Types =

35+ Types

36+ { _attribute :: Map.Map Name.Name Type

37+ , _uniform :: Map.Map Name.Name Type

38+ , _varying :: Map.Map Name.Name Type

39+ }

40+

41+

42+data Type

43+ = Int

44+ | Float

45+ | V2

46+ | V3

47+ | V4

48+ | M4

49+ | Texture

50+

51+

52+

53+-- TO BUILDER

54+

55+

56+toJsStringBuilder :: Source -> B.Builder

57+toJsStringBuilder (Source src) =

58+ B.byteString src

59+

60+

61+

62+-- FROM CHARS

63+

64+

65+fromChars :: [Char] -> Source

66+fromChars chars =

67+ Source (BS_UTF8.fromString (escape chars))

68+

69+

70+escape :: [Char] -> [Char]

71+escape chars =

72+ case chars of

73+ [] ->

74+ []

75+

76+ c:cs

77+ | c == '\r' -> escape cs

78+ | c == '\n' -> '\\' : 'n' : escape cs

79+ | c == '\"' -> '\\' : '"' : escape cs

80+ | c == '\'' -> '\\' : '\'' : escape cs

81+ | c == '\\' -> '\\' : '\\' : escape cs

82+ | otherwise -> c : escape cs

83+

84+

85+

86+-- BINARY

87+

88+

89+instance Binary Source where

90+ get = liftM Source get

91+ put (Source a) = put a

compiler/src/AST/Utils/Type.hsnew file+125

@@ -0,0 +1,125 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module AST.Utils.Type

3+ ( delambda

4+ , dealias

5+ , deepDealias

6+ , iteratedDealias

7+ )

8+ where

9+

10+

11+import qualified Data.Map as Map

12+import qualified Data.Name as Name

13+

14+import AST.Canonical (Type(..), AliasType(..), FieldType(..))

15+

16+

17+

18+-- DELAMBDA

19+

20+

21+delambda :: Type -> [Type]

22+delambda tipe =

23+ case tipe of

24+ TLambda arg result ->

25+ arg : delambda result

26+

27+ _ ->

28+ [tipe]

29+

30+

31+

32+-- DEALIAS

33+

34+

35+dealias :: [(Name.Name, Type)] -> AliasType -> Type

36+dealias args aliasType =

37+ case aliasType of

38+ Holey tipe ->

39+ dealiasHelp (Map.fromList args) tipe

40+

41+ Filled tipe ->

42+ tipe

43+

44+

45+dealiasHelp :: Map.Map Name.Name Type -> Type -> Type

46+dealiasHelp typeTable tipe =

47+ case tipe of

48+ TLambda a b ->

49+ TLambda

50+ (dealiasHelp typeTable a)

51+ (dealiasHelp typeTable b)

52+

53+ TVar x ->

54+ Map.findWithDefault tipe x typeTable

55+

56+ TRecord fields ext ->

57+ TRecord (Map.map (dealiasField typeTable) fields) ext

58+

59+ TAlias home name args t' ->

60+ TAlias home name (map (fmap (dealiasHelp typeTable)) args) t'

61+

62+ TType home name args ->

63+ TType home name (map (dealiasHelp typeTable) args)

64+

65+ TUnit ->

66+ TUnit

67+

68+ TTuple a b maybeC ->

69+ TTuple

70+ (dealiasHelp typeTable a)

71+ (dealiasHelp typeTable b)

72+ (fmap (dealiasHelp typeTable) maybeC)

73+

74+

75+dealiasField :: Map.Map Name.Name Type -> FieldType -> FieldType

76+dealiasField typeTable (FieldType index tipe) =

77+ FieldType index (dealiasHelp typeTable tipe)

78+

79+

80+

81+-- DEEP DEALIAS

82+

83+

84+deepDealias :: Type -> Type

85+deepDealias tipe =

86+ case tipe of

87+ TLambda a b ->

88+ TLambda (deepDealias a) (deepDealias b)

89+

90+ TVar _ ->

91+ tipe

92+

93+ TRecord fields ext ->

94+ TRecord (Map.map deepDealiasField fields) ext

95+

96+ TAlias _ _ args tipe' ->

97+ deepDealias (dealias args tipe')

98+

99+ TType home name args ->

100+ TType home name (map deepDealias args)

101+

102+ TUnit ->

103+ TUnit

104+

105+ TTuple a b c ->

106+ TTuple (deepDealias a) (deepDealias b) (fmap deepDealias c)

107+

108+

109+deepDealiasField :: FieldType -> FieldType

110+deepDealiasField (FieldType index tipe) =

111+ FieldType index (deepDealias tipe)

112+

113+

114+

115+-- ITERATED DEALIAS

116+

117+

118+iteratedDealias :: Type -> Type

119+iteratedDealias tipe =

120+ case tipe of

121+ TAlias _ _ args realType ->

122+ iteratedDealias (dealias args realType)

123+

124+ _ ->

125+ tipe

compiler/src/Canonicalize/Effects.hsnew file+251

@@ -0,0 +1,251 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Effects

4+ ( canonicalize

5+ , checkPayload

6+ )

7+ where

8+

9+import qualified Data.Foldable as F

10+import qualified Data.Map as Map

11+import qualified Data.Name as Name

12+

13+import qualified AST.Canonical as Can

14+import qualified AST.Source as Src

15+import qualified AST.Utils.Type as Type

16+import qualified Canonicalize.Environment as Env

17+import qualified Canonicalize.Type as Type

18+import qualified Elm.ModuleName as ModuleName

19+import qualified Reporting.Annotation as A

20+import qualified Reporting.Error.Canonicalize as Error

21+import qualified Reporting.Result as Result

22+

23+

24+

25+-- RESULT

26+

27+

28+type Result i w a =

29+ Result.Result i w Error.Error a

30+

31+

32+

33+-- CANONICALIZE

34+

35+

36+canonicalize

37+ :: Env.Env

38+ -> [A.Located Src.Value]

39+ -> Map.Map Name.Name union

40+ -> Src.Effects

41+ -> Result i w Can.Effects

42+canonicalize env values unions effects =

43+ case effects of

44+ Src.NoEffects ->

45+ Result.ok Can.NoEffects

46+

47+ Src.Ports ports ->

48+ do pairs <- traverse (canonicalizePort env) ports

49+ return $ Can.Ports (Map.fromList pairs)

50+

51+ Src.Manager region manager ->

52+ let dict = Map.fromList (map toNameRegion values) in

53+ Can.Manager

54+ <$> verifyManager region dict "init"

55+ <*> verifyManager region dict "onEffects"

56+ <*> verifyManager region dict "onSelfMsg"

57+ <*>

58+ case manager of

59+ Src.Cmd cmdType ->

60+ Can.Cmd

61+ <$> verifyEffectType cmdType unions

62+ <* verifyManager region dict "cmdMap"

63+

64+ Src.Sub subType ->

65+ Can.Sub

66+ <$> verifyEffectType subType unions

67+ <* verifyManager region dict "subMap"

68+

69+ Src.Fx cmdType subType ->

70+ Can.Fx

71+ <$> verifyEffectType cmdType unions

72+ <*> verifyEffectType subType unions

73+ <* verifyManager region dict "cmdMap"

74+ <* verifyManager region dict "subMap"

75+

76+

77+

78+-- CANONICALIZE PORT

79+

80+

81+canonicalizePort :: Env.Env -> Src.Port -> Result i w (Name.Name, Can.Port)

82+canonicalizePort env (Src.Port (A.At region portName) tipe) =

83+ do (Can.Forall freeVars ctipe) <- Type.toAnnotation env tipe

84+ case reverse (Type.delambda (Type.deepDealias ctipe)) of

85+ Can.TType home name [msg] : revArgs

86+ | home == ModuleName.cmd && name == Name.cmd ->

87+ case revArgs of

88+ [] ->

89+ Result.throw (Error.PortTypeInvalid region portName Error.CmdNoArg)

90+

91+ [outgoingType] ->

92+ case msg of

93+ Can.TVar _ ->

94+ case checkPayload outgoingType of

95+ Right () ->

96+ Result.ok (portName, Can.Outgoing freeVars outgoingType ctipe)

97+

98+ Left (badType, err) ->

99+ Result.throw (Error.PortPayloadInvalid region portName badType err)

100+

101+ _ ->

102+ Result.throw (Error.PortTypeInvalid region portName Error.CmdBadMsg)

103+

104+ _ ->

105+ Result.throw (Error.PortTypeInvalid region portName (Error.CmdExtraArgs (length revArgs)))

106+

107+ | home == ModuleName.sub && name == Name.sub ->

108+ case revArgs of

109+ [Can.TLambda incomingType (Can.TVar msg1)] ->

110+ case msg of

111+ Can.TVar msg2 | msg1 == msg2 ->

112+ case checkPayload incomingType of

113+ Right () ->

114+ Result.ok (portName, Can.Incoming freeVars incomingType ctipe)

115+

116+ Left (badType, err) ->

117+ Result.throw (Error.PortPayloadInvalid region portName badType err)

118+

119+ _ ->

120+ Result.throw (Error.PortTypeInvalid region portName Error.SubBad)

121+

122+ _ ->

123+ Result.throw (Error.PortTypeInvalid region portName Error.SubBad)

124+

125+ _ ->

126+ Result.throw (Error.PortTypeInvalid region portName Error.NotCmdOrSub)

127+

128+

129+

130+-- VERIFY MANAGER

131+

132+

133+verifyEffectType :: A.Located Name.Name -> Map.Map Name.Name a -> Result i w Name.Name

134+verifyEffectType (A.At region name) unions =

135+ if Map.member name unions then

136+ Result.ok name

137+ else

138+ Result.throw (Error.EffectNotFound region name)

139+

140+

141+toNameRegion :: A.Located Src.Value -> (Name.Name, A.Region)

142+toNameRegion (A.At _ (Src.Value (A.At region name) _ _ _)) =

143+ (name, region)

144+

145+

146+verifyManager :: A.Region -> Map.Map Name.Name A.Region -> Name.Name -> Result i w A.Region

147+verifyManager tagRegion values name =

148+ case Map.lookup name values of

149+ Just region ->

150+ Result.ok region

151+

152+ Nothing ->

153+ Result.throw (Error.EffectFunctionNotFound tagRegion name)

154+

155+

156+

157+-- CHECK PAYLOAD TYPES

158+

159+

160+checkPayload :: Can.Type -> Either (Can.Type, Error.InvalidPayload) ()

161+checkPayload tipe =

162+ case tipe of

163+ Can.TAlias _ _ args aliasedType ->

164+ checkPayload (Type.dealias args aliasedType)

165+

166+ Can.TType home name args ->

167+ case args of

168+ []

169+ | isJson home name -> Right ()

170+ | isString home name -> Right ()

171+ | isIntFloatBool home name -> Right ()

172+

173+ [arg]

174+ | isList home name -> checkPayload arg

175+ | isMaybe home name -> checkPayload arg

176+ | isArray home name -> checkPayload arg

177+

178+ _ ->

179+ Left (tipe, Error.UnsupportedType name)

180+

181+ Can.TUnit ->

182+ Right ()

183+

184+ Can.TTuple a b maybeC ->

185+ do checkPayload a

186+ checkPayload b

187+ case maybeC of

188+ Nothing ->

189+ Right ()

190+

191+ Just c ->

192+ checkPayload c

193+

194+ Can.TVar name ->

195+ Left (tipe, Error.TypeVariable name)

196+

197+ Can.TLambda _ _ ->

198+ Left (tipe, Error.Function)

199+

200+ Can.TRecord _ (Just _) ->

201+ Left (tipe, Error.ExtendedRecord)

202+

203+ Can.TRecord fields Nothing ->

204+ F.traverse_ checkFieldPayload fields

205+

206+

207+checkFieldPayload :: Can.FieldType -> Either (Can.Type, Error.InvalidPayload) ()

208+checkFieldPayload (Can.FieldType _ tipe) =

209+ checkPayload tipe

210+

211+

212+isIntFloatBool :: ModuleName.Canonical -> Name.Name -> Bool

213+isIntFloatBool home name =

214+ home == ModuleName.basics

215+ &&

216+ (name == Name.int || name == Name.float || name == Name.bool)

217+

218+

219+isString :: ModuleName.Canonical -> Name.Name -> Bool

220+isString home name =

221+ home == ModuleName.string

222+ &&

223+ name == Name.string

224+

225+

226+isJson :: ModuleName.Canonical -> Name.Name -> Bool

227+isJson home name =

228+ home == ModuleName.jsonEncode

229+ &&

230+ name == Name.value

231+

232+

233+isList :: ModuleName.Canonical -> Name.Name -> Bool

234+isList home name =

235+ home == ModuleName.list

236+ &&

237+ name == Name.list

238+

239+

240+isMaybe :: ModuleName.Canonical -> Name.Name -> Bool

241+isMaybe home name =

242+ home == ModuleName.maybe

243+ &&

244+ name == Name.maybe

245+

246+

247+isArray :: ModuleName.Canonical -> Name.Name -> Bool

248+isArray home name =

249+ home == ModuleName.array

250+ &&

251+ name == Name.array

compiler/src/Canonicalize/Environment.hsnew file+275

@@ -0,0 +1,275 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Environment

4+ ( Env(..)

5+ , Exposed

6+ , Qualified

7+ , Info(..)

8+ , mergeInfo

9+ , Var(..)

10+ , Type(..)

11+ , Ctor(..)

12+ , addLocals

13+ , findType

14+ , findTypeQual

15+ , findCtor

16+ , findCtorQual

17+ , findBinop

18+ , Binop(..)

19+ )

20+ where

21+

22+

23+import qualified Data.Map.Merge.Strict as Map

24+import qualified Data.Map.Strict as Map

25+import qualified Data.Name as Name

26+import qualified Data.OneOrMore as OneOrMore

27+

28+import qualified AST.Utils.Binop as Binop

29+import qualified AST.Canonical as Can

30+import qualified Data.Index as Index

31+import qualified Elm.ModuleName as ModuleName

32+import qualified Reporting.Annotation as A

33+import qualified Reporting.Error.Canonicalize as Error

34+import qualified Reporting.Result as Result

35+

36+

37+

38+-- RESULT

39+

40+

41+type Result i w a =

42+ Result.Result i w Error.Error a

43+

44+

45+

46+-- ENVIRONMENT

47+

48+

49+data Env =

50+ Env

51+ { _home :: ModuleName.Canonical

52+ , _vars :: Map.Map Name.Name Var

53+ , _types :: Exposed Type

54+ , _ctors :: Exposed Ctor

55+ , _binops :: Exposed Binop

56+ , _q_vars :: Qualified Can.Annotation

57+ , _q_types :: Qualified Type

58+ , _q_ctors :: Qualified Ctor

59+ }

60+

61+

62+type Exposed a =

63+ Map.Map Name.Name (Info a)

64+

65+

66+type Qualified a =

67+ Map.Map Name.Name (Map.Map Name.Name (Info a))

68+

69+

70+

71+-- INFO

72+

73+

74+data Info a

75+ = Specific ModuleName.Canonical a

76+ | Ambiguous ModuleName.Canonical (OneOrMore.OneOrMore ModuleName.Canonical)

77+

78+

79+mergeInfo :: Info a -> Info a -> Info a

80+mergeInfo info1 info2 =

81+ case info1 of

82+ Specific h1 _ ->

83+ case info2 of

84+ Specific h2 _ -> if h1 == h2 then info1 else Ambiguous h1 (OneOrMore.one h2)

85+ Ambiguous h2 hs2 -> Ambiguous h1 (OneOrMore.more (OneOrMore.one h2) hs2)

86+

87+ Ambiguous h1 hs1 ->

88+ case info2 of

89+ Specific h2 _ -> Ambiguous h1 (OneOrMore.more hs1 (OneOrMore.one h2))

90+ Ambiguous h2 hs2 -> Ambiguous h1 (OneOrMore.more hs1 (OneOrMore.more (OneOrMore.one h2) hs2))

91+

92+

93+

94+-- VARIABLES

95+

96+

97+data Var

98+ = Local A.Region

99+ | TopLevel A.Region

100+ | Foreign ModuleName.Canonical Can.Annotation

101+ | Foreigns ModuleName.Canonical (OneOrMore.OneOrMore ModuleName.Canonical)

102+

103+

104+

105+-- TYPES

106+

107+

108+data Type

109+ = Alias Int ModuleName.Canonical [Name.Name] Can.Type

110+ | Union Int ModuleName.Canonical

111+

112+

113+

114+-- CTORS

115+

116+

117+data Ctor

118+ = RecordCtor ModuleName.Canonical [Name.Name] Can.Type

119+ | Ctor

120+ { _c_home :: ModuleName.Canonical

121+ , _c_type :: Name.Name

122+ , _c_union :: Can.Union

123+ , _c_index :: Index.ZeroBased

124+ , _c_args :: [Can.Type]

125+ }

126+

127+

128+

129+-- BINOPS

130+

131+

132+data Binop =

133+ Binop

134+ { _op :: Name.Name

135+ , _op_home :: ModuleName.Canonical

136+ , _op_name :: Name.Name

137+ , _op_annotation :: Can.Annotation

138+ , _op_associativity :: Binop.Associativity

139+ , _op_precedence :: Binop.Precedence

140+ }

141+

142+

143+

144+-- VARIABLE -- ADD LOCALS

145+

146+

147+addLocals :: Map.Map Name.Name A.Region -> Env -> Result i w Env

148+addLocals names (Env home vars ts cs bs qvs qts qcs) =

149+ do newVars <-

150+ Map.mergeA

151+ (Map.mapMissing addLocalLeft)

152+ (Map.mapMissing (\_ homes -> homes))

153+ (Map.zipWithAMatched addLocalBoth)

154+ names

155+ vars

156+

157+ Result.ok (Env home newVars ts cs bs qvs qts qcs)

158+

159+

160+addLocalLeft :: Name.Name -> A.Region -> Var

161+addLocalLeft _ region =

162+ Local region

163+

164+

165+addLocalBoth :: Name.Name -> A.Region -> Var -> Result i w Var

166+addLocalBoth name region var =

167+ case var of

168+ Foreign _ _ ->

169+ Result.ok (Local region)

170+

171+ Foreigns _ _ ->

172+ Result.ok (Local region)

173+

174+ Local parentRegion ->

175+ Result.throw (Error.Shadowing name parentRegion region)

176+

177+ TopLevel parentRegion ->

178+ Result.throw (Error.Shadowing name parentRegion region)

179+

180+

181+

182+

183+-- FIND TYPE

184+

185+

186+findType :: A.Region -> Env -> Name.Name -> Result i w Type

187+findType region (Env _ _ ts _ _ _ qts _) name =

188+ case Map.lookup name ts of

189+ Just (Specific _ tipe) ->

190+ Result.ok tipe

191+

192+ Just (Ambiguous h hs) ->

193+ Result.throw (Error.AmbiguousType region Nothing name h hs)

194+

195+ Nothing ->

196+ Result.throw (Error.NotFoundType region Nothing name (toPossibleNames ts qts))

197+

198+

199+findTypeQual :: A.Region -> Env -> Name.Name -> Name.Name -> Result i w Type

200+findTypeQual region (Env _ _ ts _ _ _ qts _) prefix name =

201+ case Map.lookup prefix qts of

202+ Just qualified ->

203+ case Map.lookup name qualified of

204+ Just (Specific _ tipe) ->

205+ Result.ok tipe

206+

207+ Just (Ambiguous h hs) ->

208+ Result.throw (Error.AmbiguousType region (Just prefix) name h hs)

209+

210+ Nothing ->

211+ Result.throw (Error.NotFoundType region (Just prefix) name (toPossibleNames ts qts))

212+

213+ Nothing ->

214+ Result.throw (Error.NotFoundType region (Just prefix) name (toPossibleNames ts qts))

215+

216+

217+

218+-- FIND CTOR

219+

220+

221+findCtor :: A.Region -> Env -> Name.Name -> Result i w Ctor

222+findCtor region (Env _ _ _ cs _ _ _ qcs) name =

223+ case Map.lookup name cs of

224+ Just (Specific _ ctor) ->

225+ Result.ok ctor

226+

227+ Just (Ambiguous h hs) ->

228+ Result.throw (Error.AmbiguousVariant region Nothing name h hs)

229+

230+ Nothing ->

231+ Result.throw (Error.NotFoundVariant region Nothing name (toPossibleNames cs qcs))

232+

233+

234+findCtorQual :: A.Region -> Env -> Name.Name -> Name.Name -> Result i w Ctor

235+findCtorQual region (Env _ _ _ cs _ _ _ qcs) prefix name =

236+ case Map.lookup prefix qcs of

237+ Just qualified ->

238+ case Map.lookup name qualified of

239+ Just (Specific _ pattern) ->

240+ Result.ok pattern

241+

242+ Just (Ambiguous h hs) ->

243+ Result.throw (Error.AmbiguousVariant region (Just prefix) name h hs)

244+

245+ Nothing ->

246+ Result.throw (Error.NotFoundVariant region (Just prefix) name (toPossibleNames cs qcs))

247+

248+ Nothing ->

249+ Result.throw (Error.NotFoundVariant region (Just prefix) name (toPossibleNames cs qcs))

250+

251+

252+

253+-- FIND BINOP

254+

255+

256+findBinop :: A.Region -> Env -> Name.Name -> Result i w Binop

257+findBinop region (Env _ _ _ _ binops _ _ _) name =

258+ case Map.lookup name binops of

259+ Just (Specific _ binop) ->

260+ Result.ok binop

261+

262+ Just (Ambiguous h hs) ->

263+ Result.throw (Error.AmbiguousBinop region name h hs)

264+

265+ Nothing ->

266+ Result.throw (Error.NotFoundBinop region name (Map.keysSet binops))

267+

268+

269+

270+-- TO POSSIBLE NAMES

271+

272+

273+toPossibleNames :: Exposed a -> Qualified a -> Error.PossibleNames

274+toPossibleNames exposed qualified =

275+ Error.PossibleNames (Map.keysSet exposed) (Map.map Map.keysSet qualified)

compiler/src/Canonicalize/Environment/Dups.hsnew file+118

@@ -0,0 +1,118 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Environment.Dups

4+ ( detect

5+ , checkFields

6+ , checkFields'

7+ , Dict

8+ , none

9+ , one

10+ , insert

11+ , union

12+ , unions

13+ )

14+ where

15+

16+

17+import qualified Data.Map as Map

18+import qualified Data.Name as Name

19+

20+import qualified Data.OneOrMore as OneOrMore

21+import qualified Reporting.Annotation as A

22+import qualified Reporting.Error.Canonicalize as Error

23+import qualified Reporting.Result as Result

24+

25+

26+

27+-- DUPLICATE TRACKER

28+

29+

30+type Dict value =

31+ Map.Map Name.Name (OneOrMore.OneOrMore (Info value))

32+

33+

34+data Info value =

35+ Info

36+ { _region :: A.Region

37+ , _value :: value

38+ }

39+

40+

41+

42+-- DETECT

43+

44+

45+type ToError =

46+ Name.Name -> A.Region -> A.Region -> Error.Error

47+

48+

49+detect :: ToError -> Dict a -> Result.Result i w Error.Error (Map.Map Name.Name a)

50+detect toError dict =

51+ Map.traverseWithKey (detectHelp toError) dict

52+

53+

54+detectHelp :: ToError -> Name.Name -> OneOrMore.OneOrMore (Info a) -> Result.Result i w Error.Error a

55+detectHelp toError name values =

56+ case values of

57+ OneOrMore.One (Info _ value) ->

58+ return value

59+

60+ OneOrMore.More left right ->

61+ let

62+ (Info r1 _, Info r2 _) =

63+ OneOrMore.getFirstTwo left right

64+ in

65+ Result.throw (toError name r1 r2)

66+

67+

68+

69+-- CHECK FIELDS

70+

71+

72+checkFields :: [(A.Located Name.Name, a)] -> Result.Result i w Error.Error (Map.Map Name.Name a)

73+checkFields fields =

74+ detect Error.DuplicateField (foldr addField none fields)

75+

76+

77+addField :: (A.Located Name.Name, a) -> Dict a -> Dict a

78+addField (A.At region name, value) dups =

79+ Map.insertWith OneOrMore.more name (OneOrMore.one (Info region value)) dups

80+

81+

82+checkFields' :: (A.Region -> a -> b) -> [(A.Located Name.Name, a)] -> Result.Result i w Error.Error (Map.Map Name.Name b)

83+checkFields' toValue fields =

84+ detect Error.DuplicateField (foldr (addField' toValue) none fields)

85+

86+

87+addField' :: (A.Region -> a -> b) -> (A.Located Name.Name, a) -> Dict b -> Dict b

88+addField' toValue (A.At region name, value) dups =

89+ Map.insertWith OneOrMore.more name (OneOrMore.one (Info region (toValue region value))) dups

90+

91+

92+

93+-- BUILDING DICTIONARIES

94+

95+

96+none :: Dict a

97+none =

98+ Map.empty

99+

100+

101+one :: Name.Name -> A.Region -> value -> Dict value

102+one name region value =

103+ Map.singleton name (OneOrMore.one (Info region value))

104+

105+

106+insert :: Name.Name -> A.Region -> a -> Dict a -> Dict a

107+insert name region value dict =

108+ Map.insertWith (\new old -> OneOrMore.more old new) name (OneOrMore.one (Info region value)) dict

109+

110+

111+union :: Dict a -> Dict a -> Dict a

112+union a b =

113+ Map.unionWith OneOrMore.more a b

114+

115+

116+unions :: [Dict a] -> Dict a

117+unions dicts =

118+ Map.unionsWith OneOrMore.more dicts

compiler/src/Canonicalize/Environment/Foreign.hsnew file+304

@@ -0,0 +1,304 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE BangPatterns #-}

3+{-# LANGUAGE OverloadedStrings #-}

4+module Canonicalize.Environment.Foreign

5+ ( createInitialEnv

6+ )

7+ where

8+

9+

10+import Control.Monad (foldM)

11+import qualified Data.List as List

12+import qualified Data.Map.Strict as Map

13+import Data.Map.Strict ((!))

14+import qualified Data.Name as Name

15+

16+import qualified AST.Canonical as Can

17+import qualified AST.Source as Src

18+import qualified Canonicalize.Environment as Env

19+import qualified Elm.Interface as I

20+import qualified Elm.ModuleName as ModuleName

21+import qualified Elm.Package as Pkg

22+import qualified Reporting.Annotation as A

23+import qualified Reporting.Error.Canonicalize as Error

24+import qualified Reporting.Result as Result

25+

26+

27+

28+-- RESULT

29+

30+

31+type Result i w a =

32+ Result.Result i w Error.Error a

33+

34+

35+createInitialEnv :: ModuleName.Canonical -> Map.Map ModuleName.Raw I.Interface -> [Src.Import] -> Result i w Env.Env

36+createInitialEnv home ifaces imports =

37+ do (State vs ts cs bs qvs qts qcs) <- foldM (addImport ifaces) emptyState (toSafeImports home imports)

38+ Result.ok (Env.Env home (Map.map infoToVar vs) ts cs bs qvs qts qcs)

39+

40+

41+infoToVar :: Env.Info Can.Annotation -> Env.Var

42+infoToVar info =

43+ case info of

44+ Env.Specific home tipe -> Env.Foreign home tipe

45+ Env.Ambiguous h hs -> Env.Foreigns h hs

46+

47+

48+

49+-- STATE

50+

51+

52+data State =

53+ State

54+ { _vars :: Env.Exposed Can.Annotation

55+ , _types :: Env.Exposed Env.Type

56+ , _ctors :: Env.Exposed Env.Ctor

57+ , _binops :: Env.Exposed Env.Binop

58+ , _q_vars :: Env.Qualified Can.Annotation

59+ , _q_types :: Env.Qualified Env.Type

60+ , _q_ctors :: Env.Qualified Env.Ctor

61+ }

62+

63+

64+emptyState :: State

65+emptyState =

66+ State Map.empty emptyTypes Map.empty Map.empty Map.empty Map.empty Map.empty

67+

68+

69+emptyTypes :: Env.Exposed Env.Type

70+emptyTypes =

71+ Map.singleton "List" (Env.Specific ModuleName.list (Env.Union 1 ModuleName.list))

72+

73+

74+

75+-- TO SAFE IMPORTS

76+

77+

78+toSafeImports :: ModuleName.Canonical -> [Src.Import] -> [Src.Import]

79+toSafeImports (ModuleName.Canonical pkg _) imports =

80+ if Pkg.isKernel pkg

81+ then filter isNormal imports

82+ else imports

83+

84+

85+isNormal :: Src.Import -> Bool

86+isNormal (Src.Import (A.At _ name) maybeAlias _) =

87+ if Name.isKernel name

88+ then

89+ case maybeAlias of

90+ Nothing -> False

91+ Just _ -> error "kernel imports cannot use `as`"

92+ else

93+ True

94+

95+

96+

97+-- ADD IMPORTS

98+

99+

100+addImport :: Map.Map ModuleName.Raw I.Interface -> State -> Src.Import -> Result i w State

101+addImport ifaces (State vs ts cs bs qvs qts qcs) (Src.Import (A.At _ name) maybeAlias exposing) =

102+ let

103+ (I.Interface pkg defs unions aliases binops) = ifaces ! name

104+ !prefix = maybe name id maybeAlias

105+ !home = ModuleName.Canonical pkg name

106+

107+ !rawTypeInfo =

108+ Map.union

109+ (Map.mapMaybeWithKey (unionToType home) unions)

110+ (Map.mapMaybeWithKey (aliasToType home) aliases)

111+

112+ !vars = Map.map (Env.Specific home) defs

113+ !types = Map.map (Env.Specific home . fst) rawTypeInfo

114+ !ctors = Map.foldr (addExposed . snd) Map.empty rawTypeInfo

115+

116+ !qvs2 = addQualified prefix vars qvs

117+ !qts2 = addQualified prefix types qts

118+ !qcs2 = addQualified prefix ctors qcs

119+ in

120+ case exposing of

121+ Src.Open ->

122+ let

123+ !vs2 = addExposed vs vars

124+ !ts2 = addExposed ts types

125+ !cs2 = addExposed cs ctors

126+ !bs2 = addExposed bs (Map.mapWithKey (binopToBinop home) binops)

127+ in

128+ Result.ok (State vs2 ts2 cs2 bs2 qvs2 qts2 qcs2)

129+

130+ Src.Explicit exposedList ->

131+ foldM

132+ (addExposedValue home vars rawTypeInfo binops)

133+ (State vs ts cs bs qvs2 qts2 qcs2)

134+ exposedList

135+

136+

137+addExposed :: Env.Exposed a -> Env.Exposed a -> Env.Exposed a

138+addExposed =

139+ Map.unionWith Env.mergeInfo

140+

141+

142+addQualified :: Name.Name -> Env.Exposed a -> Env.Qualified a -> Env.Qualified a

143+addQualified prefix exposed qualified =

144+ Map.insertWith addExposed prefix exposed qualified

145+

146+

147+

148+-- UNION

149+

150+

151+unionToType :: ModuleName.Canonical -> Name.Name -> I.Union -> Maybe (Env.Type, Env.Exposed Env.Ctor)

152+unionToType home name union =

153+ unionToTypeHelp home name <$> I.toPublicUnion union

154+

155+

156+unionToTypeHelp :: ModuleName.Canonical -> Name.Name -> Can.Union -> (Env.Type, Env.Exposed Env.Ctor)

157+unionToTypeHelp home name union@(Can.Union vars ctors _ _) =

158+ let

159+ addCtor dict (Can.Ctor ctor index _ args) =

160+ Map.insert ctor (Env.Specific home (Env.Ctor home name union index args)) dict

161+ in

162+ ( Env.Union (length vars) home

163+ , List.foldl' addCtor Map.empty ctors

164+ )

165+

166+

167+

168+-- ALIAS

169+

170+

171+aliasToType :: ModuleName.Canonical -> Name.Name -> I.Alias -> Maybe (Env.Type, Env.Exposed Env.Ctor)

172+aliasToType home name alias =

173+ aliasToTypeHelp home name <$> I.toPublicAlias alias

174+

175+

176+aliasToTypeHelp :: ModuleName.Canonical -> Name.Name -> Can.Alias -> (Env.Type, Env.Exposed Env.Ctor)

177+aliasToTypeHelp home name (Can.Alias vars tipe) =

178+ (

179+ Env.Alias (length vars) home vars tipe

180+ ,

181+ case tipe of

182+ Can.TRecord fields Nothing ->

183+ let

184+ avars = map (\var -> (var, Can.TVar var)) vars

185+ alias =

186+ foldr

187+ (\(_,t1) t2 -> Can.TLambda t1 t2)

188+ (Can.TAlias home name avars (Can.Filled tipe))

189+ (Can.fieldsToList fields)

190+ in

191+ Map.singleton name (Env.Specific home (Env.RecordCtor home vars alias))

192+

193+ _ ->

194+ Map.empty

195+ )

196+

197+

198+

199+-- BINOP

200+

201+

202+binopToBinop :: ModuleName.Canonical -> Name.Name -> I.Binop -> Env.Info Env.Binop

203+binopToBinop home op (I.Binop name annotation associativity precedence) =

204+ Env.Specific home (Env.Binop op home name annotation associativity precedence)

205+

206+

207+

208+-- ADD EXPOSED VALUE

209+

210+

211+addExposedValue

212+ :: ModuleName.Canonical

213+ -> Env.Exposed Can.Annotation

214+ -> Map.Map Name.Name (Env.Type, Env.Exposed Env.Ctor)

215+ -> Map.Map Name.Name I.Binop

216+ -> State

217+ -> Src.Exposed

218+ -> Result i w State

219+addExposedValue home vars types binops (State vs ts cs bs qvs qts qcs) exposed =

220+ case exposed of

221+ Src.Lower (A.At region name) ->

222+ case Map.lookup name vars of

223+ Just info ->

224+ Result.ok (State (Map.insertWith Env.mergeInfo name info vs) ts cs bs qvs qts qcs)

225+

226+ Nothing ->

227+ Result.throw (Error.ImportExposingNotFound region home name (Map.keys vars))

228+

229+ Src.Upper (A.At region name) privacy ->

230+ case privacy of

231+ Src.Private ->

232+ case Map.lookup name types of

233+ Just (tipe, ctors) ->

234+ case tipe of

235+ Env.Union _ _ ->

236+ let

237+ !ts2 = Map.insert name (Env.Specific home tipe) ts

238+ in

239+ Result.ok (State vs ts2 cs bs qvs qts qcs)

240+

241+ Env.Alias _ _ _ _ ->

242+ let

243+ !ts2 = Map.insert name (Env.Specific home tipe) ts

244+ !cs2 = addExposed cs ctors

245+ in

246+ Result.ok (State vs ts2 cs2 bs qvs qts qcs)

247+

248+ Nothing ->

249+ case checkForCtorMistake name types of

250+ tipe:_ ->

251+ Result.throw $ Error.ImportCtorByName region name tipe

252+

253+ [] ->

254+ Result.throw $ Error.ImportExposingNotFound region home name (Map.keys types)

255+

256+ Src.Public dotDotRegion ->

257+ case Map.lookup name types of

258+ Just (tipe, ctors) ->

259+ case tipe of

260+ Env.Union _ _ ->

261+ let

262+ !ts2 = Map.insert name (Env.Specific home tipe) ts

263+ !cs2 = addExposed cs ctors

264+ in

265+ Result.ok (State vs ts2 cs2 bs qvs qts qcs)

266+

267+ Env.Alias _ _ _ _ ->

268+ Result.throw (Error.ImportOpenAlias dotDotRegion name)

269+

270+ Nothing ->

271+ Result.throw (Error.ImportExposingNotFound region home name (Map.keys types))

272+

273+ Src.Operator region op ->

274+ case Map.lookup op binops of

275+ Just binop ->

276+ let

277+ !bs2 = Map.insert op (binopToBinop home op binop) bs

278+ in

279+ Result.ok (State vs ts cs bs2 qvs qts qcs)

280+

281+ Nothing ->

282+ Result.throw (Error.ImportExposingNotFound region home op (Map.keys binops))

283+

284+

285+checkForCtorMistake :: Name.Name -> Map.Map Name.Name (Env.Type, Env.Exposed Env.Ctor) -> [Name.Name]

286+checkForCtorMistake givenName types =

287+ Map.foldr addMatches [] types

288+ where

289+ addMatches (_, exposedCtors) matches =

290+ Map.foldrWithKey addMatch matches exposedCtors

291+

292+ addMatch ctorName info matches =

293+ if ctorName /= givenName

294+ then matches

295+ else

296+ case info of

297+ Env.Specific _ (Env.Ctor _ tipeName _ _ _) ->

298+ tipeName : matches

299+

300+ Env.Specific _ (Env.RecordCtor _ _ _) ->

301+ matches

302+

303+ Env.Ambiguous _ _ ->

304+ matches

compiler/src/Canonicalize/Environment/Local.hsnew file+355

@@ -0,0 +1,355 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Environment.Local

4+ ( add

5+ )

6+ where

7+

8+

9+import Control.Monad (foldM)

10+import qualified Data.Graph as Graph

11+import qualified Data.List as List

12+import qualified Data.Map.Strict as Map

13+import qualified Data.Name as Name

14+

15+import qualified AST.Canonical as Can

16+import qualified AST.Source as Src

17+import qualified Canonicalize.Environment as Env

18+import qualified Canonicalize.Environment.Dups as Dups

19+import qualified Canonicalize.Type as Type

20+import qualified Data.Index as Index

21+import qualified Elm.ModuleName as ModuleName

22+import qualified Reporting.Annotation as A

23+import qualified Reporting.Error.Canonicalize as Error

24+import qualified Reporting.Result as Result

25+

26+

27+

28+-- RESULT

29+

30+

31+type Result i w a =

32+ Result.Result i w Error.Error a

33+

34+

35+type Unions = Map.Map Name.Name Can.Union

36+type Aliases = Map.Map Name.Name Can.Alias

37+

38+

39+add :: Src.Module -> Env.Env -> Result i w (Env.Env, Unions, Aliases)

40+add module_ env =

41+ addCtors module_ =<< addVars module_ =<< addTypes module_ env

42+

43+

44+

45+-- ADD VARS

46+

47+

48+addVars :: Src.Module -> Env.Env -> Result i w Env.Env

49+addVars module_ (Env.Env home vs ts cs bs qvs qts qcs) =

50+ do topLevelVars <- collectVars module_

51+ let vs2 = Map.union topLevelVars vs

52+ -- Use union to overwrite foreign stuff.

53+ Result.ok $ Env.Env home vs2 ts cs bs qvs qts qcs

54+

55+

56+collectVars :: Src.Module -> Result i w (Map.Map Name.Name Env.Var)

57+collectVars (Src.Module _ _ _ _ values _ _ _ effects) =

58+ let

59+ addDecl dict (A.At _ (Src.Value (A.At region name) _ _ _)) =

60+ Dups.insert name region (Env.TopLevel region) dict

61+ in

62+ Dups.detect Error.DuplicateDecl $

63+ List.foldl' addDecl (toEffectDups effects) values

64+

65+

66+toEffectDups :: Src.Effects -> Dups.Dict Env.Var

67+toEffectDups effects =

68+ case effects of

69+ Src.NoEffects ->

70+ Dups.none

71+

72+ Src.Ports ports ->

73+ let

74+ addPort dict (Src.Port (A.At region name) _) =

75+ Dups.insert name region (Env.TopLevel region) dict

76+ in

77+ List.foldl' addPort Dups.none ports

78+

79+ Src.Manager _ manager ->

80+ case manager of

81+ Src.Cmd (A.At region _) ->

82+ Dups.one "command" region (Env.TopLevel region)

83+

84+ Src.Sub (A.At region _) ->

85+ Dups.one "subscription" region (Env.TopLevel region)

86+

87+ Src.Fx (A.At regionCmd _) (A.At regionSub _) ->

88+ Dups.union

89+ (Dups.one "command" regionCmd (Env.TopLevel regionCmd))

90+ (Dups.one "subscription" regionSub (Env.TopLevel regionSub))

91+

92+

93+

94+-- ADD TYPES

95+

96+

97+addTypes :: Src.Module -> Env.Env -> Result i w Env.Env

98+addTypes (Src.Module _ _ _ _ _ unions aliases _ _) (Env.Env home vs ts cs bs qvs qts qcs) =

99+ let

100+ addAliasDups dups (A.At _ (Src.Alias (A.At region name) _ _)) = Dups.insert name region () dups

101+ addUnionDups dups (A.At _ (Src.Union (A.At region name) _ _)) = Dups.insert name region () dups

102+ typeNameDups =

103+ List.foldl' addUnionDups (List.foldl' addAliasDups Dups.none aliases) unions

104+ in

105+ do _ <- Dups.detect Error.DuplicateType typeNameDups

106+ ts1 <- foldM (addUnion home) ts unions

107+ addAliases aliases (Env.Env home vs ts1 cs bs qvs qts qcs)

108+

109+

110+addUnion :: ModuleName.Canonical -> Env.Exposed Env.Type -> A.Located Src.Union -> Result i w (Env.Exposed Env.Type)

111+addUnion home types union@(A.At _ (Src.Union (A.At _ name) _ _)) =

112+ do arity <- checkUnionFreeVars union

113+ let one = Env.Specific home (Env.Union arity home)

114+ Result.ok $ Map.insert name one types

115+

116+

117+

118+-- ADD TYPE ALIASES

119+

120+

121+addAliases :: [A.Located Src.Alias] -> Env.Env -> Result i w Env.Env

122+addAliases aliases env =

123+ let

124+ nodes = map toNode aliases

125+ sccs = Graph.stronglyConnComp nodes

126+ in

127+ foldM addAlias env sccs

128+

129+

130+addAlias :: Env.Env -> Graph.SCC (A.Located Src.Alias) -> Result i w Env.Env

131+addAlias env@(Env.Env home vs ts cs bs qvs qts qcs) scc =

132+ case scc of

133+ Graph.AcyclicSCC alias@(A.At _ (Src.Alias (A.At _ name) _ tipe)) ->

134+ do args <- checkAliasFreeVars alias

135+ ctype <- Type.canonicalize env tipe

136+ let one = Env.Specific home (Env.Alias (length args) home args ctype)

137+ let ts1 = Map.insert name one ts

138+ Result.ok $ Env.Env home vs ts1 cs bs qvs qts qcs

139+

140+ Graph.CyclicSCC [] ->

141+ Result.ok env

142+

143+ Graph.CyclicSCC (alias@(A.At _ (Src.Alias (A.At region name1) _ tipe)) : others) ->

144+ do args <- checkAliasFreeVars alias

145+ let toName (A.At _ (Src.Alias (A.At _ name) _ _)) = name

146+ Result.throw (Error.RecursiveAlias region name1 args tipe (map toName others))

147+

148+

149+

150+-- DETECT TYPE ALIAS CYCLES

151+

152+

153+toNode :: A.Located Src.Alias -> (A.Located Src.Alias, Name.Name, [Name.Name])

154+toNode alias@(A.At _ (Src.Alias (A.At _ name) _ tipe)) =

155+ ( alias, name, getEdges [] tipe )

156+

157+

158+getEdges :: [Name.Name] -> Src.Type -> [Name.Name]

159+getEdges edges (A.At _ tipe) =

160+ case tipe of

161+ Src.TLambda arg result ->

162+ getEdges (getEdges edges arg) result

163+

164+ Src.TVar _ ->

165+ edges

166+

167+ Src.TType _ name args ->

168+ List.foldl' getEdges (name:edges) args

169+

170+ Src.TTypeQual _ _ _ args ->

171+ List.foldl' getEdges edges args

172+

173+ Src.TRecord fields _ ->

174+ List.foldl' (\es (_,t) -> getEdges es t) edges fields

175+

176+ Src.TUnit ->

177+ edges

178+

179+ Src.TTuple a b cs ->

180+ List.foldl' getEdges (getEdges (getEdges edges a) b) cs

181+

182+

183+

184+-- CHECK FREE VARIABLES

185+

186+

187+checkUnionFreeVars :: A.Located Src.Union -> Result i w Int

188+checkUnionFreeVars (A.At unionRegion (Src.Union (A.At _ name) args ctors)) =

189+ let

190+ addArg (A.At region arg) dict =

191+ Dups.insert arg region region dict

192+

193+ addCtorFreeVars (_, tipes) freeVars =

194+ List.foldl' addFreeVars freeVars tipes

195+ in

196+ do boundVars <- Dups.detect (Error.DuplicateUnionArg name) (foldr addArg Dups.none args)

197+ let freeVars = foldr addCtorFreeVars Map.empty ctors

198+ case Map.toList (Map.difference freeVars boundVars) of

199+ [] ->

200+ Result.ok (length args)

201+

202+ unbound:unbounds ->

203+ Result.throw $

204+ Error.TypeVarsUnboundInUnion unionRegion name (map A.toValue args) unbound unbounds

205+

206+

207+checkAliasFreeVars :: A.Located Src.Alias -> Result i w [Name.Name]

208+checkAliasFreeVars (A.At aliasRegion (Src.Alias (A.At _ name) args tipe)) =

209+ let

210+ addArg (A.At region arg) dict =

211+ Dups.insert arg region region dict

212+ in

213+ do boundVars <- Dups.detect (Error.DuplicateAliasArg name) (foldr addArg Dups.none args)

214+ let freeVars = addFreeVars Map.empty tipe

215+ let overlap = Map.size (Map.intersection boundVars freeVars)

216+ if Map.size boundVars == overlap && Map.size freeVars == overlap

217+ then Result.ok (map A.toValue args)

218+ else

219+ Result.throw $

220+ Error.TypeVarsMessedUpInAlias aliasRegion name

221+ (map A.toValue args)

222+ (Map.toList (Map.difference boundVars freeVars))

223+ (Map.toList (Map.difference freeVars boundVars))

224+

225+

226+addFreeVars :: Map.Map Name.Name A.Region -> Src.Type -> Map.Map Name.Name A.Region

227+addFreeVars freeVars (A.At region tipe) =

228+ case tipe of

229+ Src.TLambda arg result ->

230+ addFreeVars (addFreeVars freeVars arg) result

231+

232+ Src.TVar name ->

233+ Map.insert name region freeVars

234+

235+ Src.TType _ _ args ->

236+ List.foldl' addFreeVars freeVars args

237+

238+ Src.TTypeQual _ _ _ args ->

239+ List.foldl' addFreeVars freeVars args

240+

241+ Src.TRecord fields maybeExt ->

242+ let

243+ extFreeVars =

244+ case maybeExt of

245+ Nothing ->

246+ freeVars

247+

248+ Just (A.At extRegion ext) ->

249+ Map.insert ext extRegion freeVars

250+ in

251+ List.foldl' (\fvs (_,t) -> addFreeVars fvs t) extFreeVars fields

252+

253+ Src.TUnit ->

254+ freeVars

255+

256+ Src.TTuple a b cs ->

257+ List.foldl' addFreeVars (addFreeVars (addFreeVars freeVars a) b) cs

258+

259+

260+

261+-- ADD CTORS

262+

263+

264+addCtors :: Src.Module -> Env.Env -> Result i w (Env.Env, Unions, Aliases)

265+addCtors (Src.Module _ _ _ _ _ unions aliases _ _) env@(Env.Env home vs ts cs bs qvs qts qcs) =

266+ do unionInfo <- traverse (canonicalizeUnion env) unions

267+ aliasInfo <- traverse (canonicalizeAlias env) aliases

268+

269+ ctors <-

270+ Dups.detect Error.DuplicateCtor $

271+ Dups.union

272+ (Dups.unions (map snd unionInfo))

273+ (Dups.unions (map snd aliasInfo))

274+

275+ let cs2 = Map.union ctors cs

276+

277+ Result.ok

278+ ( Env.Env home vs ts cs2 bs qvs qts qcs

279+ , Map.fromList (map fst unionInfo)

280+ , Map.fromList (map fst aliasInfo)

281+ )

282+

283+

284+type CtorDups = Dups.Dict (Env.Info Env.Ctor)

285+

286+

287+

288+-- CANONICALIZE ALIAS

289+

290+

291+canonicalizeAlias :: Env.Env -> A.Located Src.Alias -> Result i w ( (Name.Name, Can.Alias), CtorDups )

292+canonicalizeAlias env@(Env.Env home _ _ _ _ _ _ _) (A.At _ (Src.Alias (A.At region name) args tipe)) =

293+ do let vars = map A.toValue args

294+ ctipe <- Type.canonicalize env tipe

295+ Result.ok

296+ ( (name, Can.Alias vars ctipe)

297+ ,

298+ case ctipe of

299+ Can.TRecord fields Nothing ->

300+ Dups.one name region (Env.Specific home (toRecordCtor home name vars fields))

301+

302+ _ ->

303+ Dups.none

304+ )

305+

306+toRecordCtor :: ModuleName.Canonical -> Name.Name -> [Name.Name] -> Map.Map Name.Name Can.FieldType -> Env.Ctor

307+toRecordCtor home name vars fields =

308+ let

309+ avars = map (\var -> (var, Can.TVar var)) vars

310+ alias =

311+ foldr

312+ (\(_,t1) t2 -> Can.TLambda t1 t2)

313+ (Can.TAlias home name avars (Can.Filled (Can.TRecord fields Nothing)))

314+ (Can.fieldsToList fields)

315+ in

316+ Env.RecordCtor home vars alias

317+

318+

319+

320+-- CANONICALIZE UNION

321+

322+

323+canonicalizeUnion :: Env.Env -> A.Located Src.Union -> Result i w ( (Name.Name, Can.Union), CtorDups )

324+canonicalizeUnion env@(Env.Env home _ _ _ _ _ _ _) (A.At _ (Src.Union (A.At _ name) avars ctors)) =

325+ do cctors <- Index.indexedTraverse (canonicalizeCtor env) ctors

326+ let vars = map A.toValue avars

327+ let alts = map A.toValue cctors

328+ let union = Can.Union vars alts (length alts) (toOpts ctors)

329+ Result.ok

330+ ( (name, union)

331+ , Dups.unions $ map (toCtor home name union) cctors

332+ )

333+

334+

335+canonicalizeCtor :: Env.Env -> Index.ZeroBased -> (A.Located Name.Name, [Src.Type]) -> Result i w (A.Located Can.Ctor)

336+canonicalizeCtor env index (A.At region ctor, tipes) =

337+ do ctipes <- traverse (Type.canonicalize env) tipes

338+ Result.ok $ A.At region $

339+ Can.Ctor ctor index (length ctipes) ctipes

340+

341+

342+toOpts :: [(A.Located Name.Name, [Src.Type])] -> Can.CtorOpts

343+toOpts ctors =

344+ case ctors of

345+ [ (_,[_]) ] ->

346+ Can.Unbox

347+

348+ _ ->

349+ if all (null . snd) ctors then Can.Enum else Can.Normal

350+

351+

352+toCtor :: ModuleName.Canonical -> Name.Name -> Can.Union -> A.Located Can.Ctor -> CtorDups

353+toCtor home typeName union (A.At region (Can.Ctor name index _ args)) =

354+ Dups.one name region $ Env.Specific home $

355+ Env.Ctor home typeName union index args

compiler/src/Canonicalize/Expression.hsnew file+761

@@ -0,0 +1,761 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Expression

4+ ( canonicalize

5+ , FreeLocals

6+ , Uses(..)

7+ , verifyBindings

8+ , gatherTypedArgs

9+ )

10+ where

11+

12+

13+import Control.Monad (foldM)

14+import qualified Data.Graph as Graph

15+import qualified Data.List as List

16+import qualified Data.Map.Strict as Map

17+import qualified Data.Name as Name

18+

19+import qualified AST.Canonical as Can

20+import qualified AST.Source as Src

21+import qualified AST.Utils.Binop as Binop

22+import qualified AST.Utils.Type as Type

23+import qualified Canonicalize.Environment as Env

24+import qualified Canonicalize.Environment.Dups as Dups

25+import qualified Canonicalize.Pattern as Pattern

26+import qualified Canonicalize.Type as Type

27+import qualified Data.Index as Index

28+import qualified Elm.ModuleName as ModuleName

29+import qualified Elm.Package as Pkg

30+import qualified Reporting.Annotation as A

31+import qualified Reporting.Error.Canonicalize as Error

32+import qualified Reporting.Result as Result

33+import qualified Reporting.Warning as W

34+

35+

36+

37+-- RESULTS

38+

39+

40+type Result i w a =

41+ Result.Result i w Error.Error a

42+

43+

44+type FreeLocals =

45+ Map.Map Name.Name Uses

46+

47+

48+data Uses =

49+ Uses

50+ { _direct :: {-# UNPACK #-} !Int

51+ , _delayed :: {-# UNPACK #-} !Int

52+ }

53+

54+

55+

56+-- CANONICALIZE

57+

58+

59+canonicalize :: Env.Env -> Src.Expr -> Result FreeLocals [W.Warning] Can.Expr

60+canonicalize env (A.At region expression) =

61+ A.At region <$>

62+ case expression of

63+ Src.Str string ->

64+ Result.ok (Can.Str string)

65+

66+ Src.Chr char ->

67+ Result.ok (Can.Chr char)

68+

69+ Src.Int int ->

70+ Result.ok (Can.Int int)

71+

72+ Src.Float float ->

73+ Result.ok (Can.Float float)

74+

75+ Src.Var varType name ->

76+ case varType of

77+ Src.LowVar -> findVar region env name

78+ Src.CapVar -> toVarCtor name <$> Env.findCtor region env name

79+

80+ Src.VarQual varType prefix name ->

81+ case varType of

82+ Src.LowVar -> findVarQual region env prefix name

83+ Src.CapVar -> toVarCtor name <$> Env.findCtorQual region env prefix name

84+

85+ Src.List exprs ->

86+ Can.List <$> traverse (canonicalize env) exprs

87+

88+ Src.Op op ->

89+ do (Env.Binop _ home name annotation _ _) <- Env.findBinop region env op

90+ return (Can.VarOperator op home name annotation)

91+

92+ Src.Negate expr ->

93+ Can.Negate <$> canonicalize env expr

94+

95+ Src.Binops ops final ->

96+ A.toValue <$> canonicalizeBinops region env ops final

97+

98+ Src.Lambda srcArgs body ->

99+ delayedUsage $

100+ do (args, bindings) <-

101+ Pattern.verify Error.DPLambdaArgs $

102+ traverse (Pattern.canonicalize env) srcArgs

103+

104+ newEnv <-

105+ Env.addLocals bindings env

106+

107+ (cbody, freeLocals) <-

108+ verifyBindings W.Pattern bindings (canonicalize newEnv body)

109+

110+ return (Can.Lambda args cbody, freeLocals)

111+

112+ Src.Call func args ->

113+ Can.Call

114+ <$> canonicalize env func

115+ <*> traverse (canonicalize env) args

116+

117+ Src.If branches finally ->

118+ Can.If

119+ <$> traverse (canonicalizeIfBranch env) branches

120+ <*> canonicalize env finally

121+

122+ Src.Let defs expr ->

123+ A.toValue <$> canonicalizeLet region env defs expr

124+

125+ Src.Case expr branches ->

126+ Can.Case

127+ <$> canonicalize env expr

128+ <*> traverse (canonicalizeCaseBranch env) branches

129+

130+ Src.Accessor field ->

131+ Result.ok $ Can.Accessor field

132+

133+ Src.Access record field ->

134+ Can.Access

135+ <$> canonicalize env record

136+ <*> Result.ok field

137+

138+ Src.Update (A.At reg name) fields ->

139+ let

140+ makeCanFields =

141+ Dups.checkFields' (\r t -> Can.FieldUpdate r <$> canonicalize env t) fields

142+ in

143+ Can.Update name

144+ <$> (A.At reg <$> findVar reg env name)

145+ <*> (sequenceA =<< makeCanFields)

146+

147+ Src.Record fields ->

148+ do fieldDict <- Dups.checkFields fields

149+ Can.Record <$> traverse (canonicalize env) fieldDict

150+

151+ Src.Unit ->

152+ Result.ok Can.Unit

153+

154+ Src.Tuple a b cs ->

155+ Can.Tuple

156+ <$> canonicalize env a

157+ <*> canonicalize env b

158+ <*> canonicalizeTupleExtras region env cs

159+

160+ Src.Shader src tipe ->

161+ Result.ok (Can.Shader src tipe)

162+

163+

164+

165+-- CANONICALIZE TUPLE EXTRAS

166+

167+

168+canonicalizeTupleExtras :: A.Region -> Env.Env -> [Src.Expr] -> Result FreeLocals [W.Warning] (Maybe Can.Expr)

169+canonicalizeTupleExtras region env extras =

170+ case extras of

171+ [] ->

172+ Result.ok Nothing

173+

174+ [three] ->

175+ Just <$> canonicalize env three

176+

177+ _ ->

178+ Result.throw (Error.TupleLargerThanThree region)

179+

180+

181+

182+-- CANONICALIZE IF BRANCH

183+

184+

185+canonicalizeIfBranch :: Env.Env -> (Src.Expr, Src.Expr) -> Result FreeLocals [W.Warning] (Can.Expr, Can.Expr)

186+canonicalizeIfBranch env (condition, branch) =

187+ (,)

188+ <$> canonicalize env condition

189+ <*> canonicalize env branch

190+

191+

192+

193+-- CANONICALIZE CASE BRANCH

194+

195+

196+canonicalizeCaseBranch :: Env.Env -> (Src.Pattern, Src.Expr) -> Result FreeLocals [W.Warning] Can.CaseBranch

197+canonicalizeCaseBranch env (pattern, expr) =

198+ directUsage $

199+ do (cpattern, bindings) <-

200+ Pattern.verify Error.DPCaseBranch $

201+ Pattern.canonicalize env pattern

202+ newEnv <- Env.addLocals bindings env

203+

204+ (cexpr, freeLocals) <-

205+ verifyBindings W.Pattern bindings (canonicalize newEnv expr)

206+

207+ return (Can.CaseBranch cpattern cexpr, freeLocals)

208+

209+

210+

211+-- CANONICALIZE BINOPS

212+

213+

214+canonicalizeBinops :: A.Region -> Env.Env -> [(Src.Expr, A.Located Name.Name)] -> Src.Expr -> Result FreeLocals [W.Warning] Can.Expr

215+canonicalizeBinops overallRegion env ops final =

216+ let

217+ canonicalizeHelp (expr, A.At region op) =

218+ (,)

219+ <$> canonicalize env expr

220+ <*> Env.findBinop region env op

221+ in

222+ runBinopStepper overallRegion =<< (

223+ More

224+ <$> traverse canonicalizeHelp ops

225+ <*> canonicalize env final

226+ )

227+

228+

229+data Step

230+ = Done Can.Expr

231+ | More [(Can.Expr, Env.Binop)] Can.Expr

232+ | Error Env.Binop Env.Binop

233+

234+

235+runBinopStepper :: A.Region -> Step -> Result FreeLocals w Can.Expr

236+runBinopStepper overallRegion step =

237+ case step of

238+ Done expr ->

239+ Result.ok expr

240+

241+ More [] expr ->

242+ Result.ok expr

243+

244+ More ( (expr, op) : rest ) final ->

245+ runBinopStepper overallRegion $

246+ toBinopStep (toBinop op expr) op rest final

247+

248+ Error (Env.Binop op1 _ _ _ _ _) (Env.Binop op2 _ _ _ _ _) ->

249+ Result.throw (Error.Binop overallRegion op1 op2)

250+

251+

252+toBinopStep :: (Can.Expr -> Can.Expr) -> Env.Binop -> [(Can.Expr, Env.Binop)] -> Can.Expr -> Step

253+toBinopStep makeBinop rootOp@(Env.Binop _ _ _ _ rootAssociativity rootPrecedence) middle final =

254+ case middle of

255+ [] ->

256+ Done (makeBinop final)

257+

258+ ( expr, op@(Env.Binop _ _ _ _ associativity precedence) ) : rest ->

259+ if precedence < rootPrecedence then

260+

261+ More ((makeBinop expr, op) : rest) final

262+

263+ else if precedence > rootPrecedence then

264+

265+ case toBinopStep (toBinop op expr) op rest final of

266+ Done newLast ->

267+ Done (makeBinop newLast)

268+

269+ More newMiddle newLast ->

270+ toBinopStep makeBinop rootOp newMiddle newLast

271+

272+ Error a b ->

273+ Error a b

274+

275+ else

276+

277+ case (rootAssociativity, associativity) of

278+ (Binop.Left, Binop.Left) ->

279+ toBinopStep (\right -> toBinop op (makeBinop expr) right) op rest final

280+

281+ (Binop.Right, Binop.Right) ->

282+ toBinopStep (\right -> makeBinop (toBinop op expr right)) op rest final

283+

284+ (_, _) ->

285+ Error rootOp op

286+

287+

288+toBinop :: Env.Binop -> Can.Expr -> Can.Expr -> Can.Expr

289+toBinop (Env.Binop op home name annotation _ _) left right =

290+ A.merge left right (Can.Binop op home name annotation left right)

291+

292+

293+

294+-- CANONICALIZE LET

295+

296+

297+canonicalizeLet :: A.Region -> Env.Env -> [A.Located Src.Def] -> Src.Expr -> Result FreeLocals [W.Warning] Can.Expr

298+canonicalizeLet letRegion env defs body =

299+ directUsage $

300+ do bindings <-

301+ Dups.detect (Error.DuplicatePattern Error.DPLetBinding) $

302+ List.foldl' addBindings Dups.none defs

303+

304+ newEnv <- Env.addLocals bindings env

305+

306+ verifyBindings W.Def bindings $

307+ do nodes <- foldM (addDefNodes newEnv) [] defs

308+ cbody <- canonicalize newEnv body

309+ detectCycles letRegion (Graph.stronglyConnComp nodes) cbody

310+

311+

312+

313+-- ADD BINDINGS

314+

315+

316+addBindings :: Dups.Dict A.Region -> A.Located Src.Def -> Dups.Dict A.Region

317+addBindings bindings (A.At _ def) =

318+ case def of

319+ Src.Define (A.At region name) _ _ _ ->

320+ Dups.insert name region region bindings

321+

322+ Src.Destruct pattern _ ->

323+ addBindingsHelp bindings pattern

324+

325+

326+addBindingsHelp :: Dups.Dict A.Region -> Src.Pattern -> Dups.Dict A.Region

327+addBindingsHelp bindings (A.At region pattern) =

328+ case pattern of

329+ Src.PAnything ->

330+ bindings

331+

332+ Src.PVar name ->

333+ Dups.insert name region region bindings

334+

335+ Src.PRecord fields ->

336+ let

337+ addField dict (A.At fieldRegion name) =

338+ Dups.insert name fieldRegion fieldRegion dict

339+ in

340+ List.foldl' addField bindings fields

341+

342+ Src.PUnit ->

343+ bindings

344+

345+ Src.PTuple a b cs ->

346+ List.foldl' addBindingsHelp bindings (a:b:cs)

347+

348+ Src.PCtor _ _ patterns ->

349+ List.foldl' addBindingsHelp bindings patterns

350+

351+ Src.PCtorQual _ _ _ patterns ->

352+ List.foldl' addBindingsHelp bindings patterns

353+

354+ Src.PList patterns ->

355+ List.foldl' addBindingsHelp bindings patterns

356+

357+ Src.PCons hd tl ->

358+ addBindingsHelp (addBindingsHelp bindings hd) tl

359+

360+ Src.PAlias aliasPattern (A.At nameRegion name) ->

361+ Dups.insert name nameRegion nameRegion $

362+ addBindingsHelp bindings aliasPattern

363+

364+ Src.PChr _ ->

365+ bindings

366+

367+ Src.PStr _ ->

368+ bindings

369+

370+ Src.PInt _ ->

371+ bindings

372+

373+

374+

375+-- BUILD BINDINGS GRAPH

376+

377+

378+type Node =

379+ (Binding, Name.Name, [Name.Name])

380+

381+

382+data Binding

383+ = Define Can.Def

384+ | Edge (A.Located Name.Name)

385+ | Destruct Can.Pattern Can.Expr

386+

387+

388+addDefNodes :: Env.Env -> [Node] -> A.Located Src.Def -> Result FreeLocals [W.Warning] [Node]

389+addDefNodes env nodes (A.At _ def) =

390+ case def of

391+ Src.Define aname@(A.At _ name) srcArgs body maybeType ->

392+ case maybeType of

393+ Nothing ->

394+ do (args, argBindings) <-

395+ Pattern.verify (Error.DPFuncArgs name) $

396+ traverse (Pattern.canonicalize env) srcArgs

397+

398+ newEnv <-

399+ Env.addLocals argBindings env

400+

401+ (cbody, freeLocals) <-

402+ verifyBindings W.Pattern argBindings (canonicalize newEnv body)

403+

404+ let cdef = Can.Def aname args cbody

405+ let node = ( Define cdef, name, Map.keys freeLocals )

406+ logLetLocals args freeLocals (node:nodes)

407+

408+ Just tipe ->

409+ do (Can.Forall freeVars ctipe) <- Type.toAnnotation env tipe

410+ ((args, resultType), argBindings) <-

411+ Pattern.verify (Error.DPFuncArgs name) $

412+ gatherTypedArgs env name srcArgs ctipe Index.first []

413+

414+ newEnv <-

415+ Env.addLocals argBindings env

416+

417+ (cbody, freeLocals) <-

418+ verifyBindings W.Pattern argBindings (canonicalize newEnv body)

419+

420+ let cdef = Can.TypedDef aname freeVars args cbody resultType

421+ let node = ( Define cdef, name, Map.keys freeLocals )

422+ logLetLocals args freeLocals (node:nodes)

423+

424+ Src.Destruct pattern body ->

425+ do (cpattern, _bindings) <-

426+ Pattern.verify Error.DPDestruct $

427+ Pattern.canonicalize env pattern

428+

429+ Result.Result $ \fs ws bad good ->

430+ case canonicalize env body of

431+ Result.Result k ->

432+ k Map.empty ws

433+ (\freeLocals warnings errors ->

434+ bad (Map.unionWith combineUses freeLocals fs) warnings errors

435+ )

436+ (\freeLocals warnings cbody ->

437+ let

438+ names = getPatternNames [] pattern

439+ name = Name.fromManyNames (map A.toValue names)

440+ node = ( Destruct cpattern cbody, name, Map.keys freeLocals )

441+ in

442+ good

443+ (Map.unionWith combineUses fs freeLocals)

444+ warnings

445+ (List.foldl' (addEdge [name]) (node:nodes) names)

446+ )

447+

448+

449+logLetLocals :: [arg] -> FreeLocals -> value -> Result FreeLocals w value

450+logLetLocals args letLocals value =

451+ Result.Result $ \freeLocals warnings _ good ->

452+ good

453+ ( Map.unionWith combineUses freeLocals $

454+ case args of

455+ [] -> letLocals

456+ _ -> Map.map delayUse letLocals

457+ )

458+ warnings

459+ value

460+

461+

462+addEdge :: [Name.Name] -> [Node] -> A.Located Name.Name -> [Node]

463+addEdge edges nodes aname@(A.At _ name) =

464+ (Edge aname, name, edges) : nodes

465+

466+

467+getPatternNames :: [A.Located Name.Name] -> Src.Pattern -> [A.Located Name.Name]

468+getPatternNames names (A.At region pattern) =

469+ case pattern of

470+ Src.PAnything -> names

471+ Src.PVar name -> A.At region name : names

472+ Src.PRecord fields -> fields ++ names

473+ Src.PAlias ptrn name -> getPatternNames (name : names) ptrn

474+ Src.PUnit -> names

475+ Src.PTuple a b cs -> List.foldl' getPatternNames (getPatternNames (getPatternNames names a) b) cs

476+ Src.PCtor _ _ args -> List.foldl' getPatternNames names args

477+ Src.PCtorQual _ _ _ args -> List.foldl' getPatternNames names args

478+ Src.PList patterns -> List.foldl' getPatternNames names patterns

479+ Src.PCons hd tl -> getPatternNames (getPatternNames names hd) tl

480+ Src.PChr _ -> names

481+ Src.PStr _ -> names

482+ Src.PInt _ -> names

483+

484+

485+

486+-- GATHER TYPED ARGS

487+

488+

489+gatherTypedArgs

490+ :: Env.Env

491+ -> Name.Name

492+ -> [Src.Pattern]

493+ -> Can.Type

494+ -> Index.ZeroBased

495+ -> [(Can.Pattern, Can.Type)]

496+ -> Result Pattern.DupsDict w ([(Can.Pattern, Can.Type)], Can.Type)

497+gatherTypedArgs env name srcArgs tipe index revTypedArgs =

498+ case srcArgs of

499+ [] ->

500+ return (reverse revTypedArgs, tipe)

501+

502+ srcArg : otherSrcArgs ->

503+ case Type.iteratedDealias tipe of

504+ Can.TLambda argType resultType ->

505+ do arg <- Pattern.canonicalize env srcArg

506+ gatherTypedArgs env name otherSrcArgs resultType (Index.next index) $

507+ (arg, argType) : revTypedArgs

508+

509+ _ ->

510+ let (A.At start _, A.At end _) = (head srcArgs, last srcArgs) in

511+ Result.throw $

512+ Error.AnnotationTooShort (A.mergeRegions start end) name index (length srcArgs)

513+

514+

515+

516+-- DETECT CYCLES

517+

518+

519+detectCycles :: A.Region -> [Graph.SCC Binding] -> Can.Expr -> Result i w Can.Expr

520+detectCycles letRegion sccs body =

521+ case sccs of

522+ [] ->

523+ Result.ok body

524+

525+ scc : subSccs ->

526+ case scc of

527+ Graph.AcyclicSCC binding ->

528+ case binding of

529+ Define def ->

530+ A.At letRegion . Can.Let def <$> detectCycles letRegion subSccs body

531+

532+ Edge _ ->

533+ detectCycles letRegion subSccs body

534+

535+ Destruct pattern expr ->

536+ A.At letRegion . Can.LetDestruct pattern expr <$> detectCycles letRegion subSccs body

537+

538+ Graph.CyclicSCC bindings ->

539+ A.At letRegion <$>

540+ (Can.LetRec

541+ <$> checkCycle bindings []

542+ <*> detectCycles letRegion subSccs body

543+ )

544+

545+

546+checkCycle :: [Binding] -> [Can.Def] -> Result i w [Can.Def]

547+checkCycle bindings defs =

548+ case bindings of

549+ [] ->

550+ Result.ok defs

551+

552+ binding : otherBindings ->

553+ case binding of

554+ Define def@(Can.Def name args _) ->

555+ if null args then

556+ Result.throw (Error.RecursiveLet name (toNames otherBindings defs))

557+ else

558+ checkCycle otherBindings (def:defs)

559+

560+ Define def@(Can.TypedDef name _ args _ _) ->

561+ if null args then

562+ Result.throw (Error.RecursiveLet name (toNames otherBindings defs))

563+ else

564+ checkCycle otherBindings (def:defs)

565+

566+ Edge name ->

567+ Result.throw (Error.RecursiveLet name (toNames otherBindings defs))

568+

569+ Destruct _ _ ->

570+ -- a Destruct cannot appear in a cycle without any Edge values

571+ -- so we just keep going until we get to the edges

572+ checkCycle otherBindings defs

573+

574+

575+toNames :: [Binding] -> [Can.Def] -> [Name.Name]

576+toNames bindings revDefs =

577+ case bindings of

578+ [] ->

579+ reverse (map getDefName revDefs)

580+

581+ binding : otherBindings ->

582+ case binding of

583+ Define def -> getDefName def : toNames otherBindings revDefs

584+ Edge (A.At _ name) -> name : toNames otherBindings revDefs

585+ Destruct _ _ -> toNames otherBindings revDefs

586+

587+

588+getDefName :: Can.Def -> Name.Name

589+getDefName def =

590+ case def of

591+ Can.Def (A.At _ name) _ _ ->

592+ name

593+

594+ Can.TypedDef (A.At _ name) _ _ _ _ ->

595+ name

596+

597+

598+

599+-- LOG VARIABLE USES

600+

601+

602+logVar :: Name.Name -> a -> Result FreeLocals w a

603+logVar name value =

604+ Result.Result $ \freeLocals warnings _ good ->

605+ good (Map.insertWith combineUses name oneDirectUse freeLocals) warnings value

606+

607+

608+{-# NOINLINE oneDirectUse #-}

609+oneDirectUse :: Uses

610+oneDirectUse =

611+ Uses 1 0

612+

613+

614+combineUses :: Uses -> Uses -> Uses

615+combineUses (Uses a b) (Uses x y) =

616+ Uses (a + x) (b + y)

617+

618+

619+delayUse :: Uses -> Uses

620+delayUse (Uses direct delayed) =

621+ Uses 0 (direct + delayed)

622+

623+

624+

625+-- MANAGING BINDINGS

626+

627+

628+verifyBindings

629+ :: W.Context

630+ -> Pattern.Bindings

631+ -> Result FreeLocals [W.Warning] value

632+ -> Result info [W.Warning] (value, FreeLocals)

633+verifyBindings context bindings (Result.Result k) =

634+ Result.Result $ \info warnings bad good ->

635+ k Map.empty warnings

636+ (\_ warnings1 err ->

637+ bad info warnings1 err

638+ )

639+ (\freeLocals warnings1 value ->

640+ let

641+ outerFreeLocals =

642+ Map.difference freeLocals bindings

643+

644+ warnings2 =

645+ -- NOTE: Uses Map.size for O(1) lookup. This means there is

646+ -- no dictionary allocation unless a problem is detected.

647+ if Map.size bindings + Map.size outerFreeLocals == Map.size freeLocals then

648+ warnings1

649+ else

650+ Map.foldlWithKey (addUnusedWarning context) warnings1 $

651+ Map.difference bindings freeLocals

652+ in

653+ good info warnings2 (value, outerFreeLocals)

654+ )

655+

656+

657+addUnusedWarning :: W.Context -> [W.Warning] -> Name.Name -> A.Region -> [W.Warning]

658+addUnusedWarning context warnings name region =

659+ W.UnusedVariable region context name : warnings

660+

661+

662+directUsage :: Result () w (expr, FreeLocals) -> Result FreeLocals w expr

663+directUsage (Result.Result k) =

664+ Result.Result $ \freeLocals warnings bad good ->

665+ k () warnings

666+ (\() ws es -> bad freeLocals ws es)

667+ (\() ws (value, newFreeLocals) ->

668+ good (Map.unionWith combineUses freeLocals newFreeLocals) ws value

669+ )

670+

671+

672+delayedUsage :: Result () w (expr, FreeLocals) -> Result FreeLocals w expr

673+delayedUsage (Result.Result k) =

674+ Result.Result $ \freeLocals warnings bad good ->

675+ k () warnings

676+ (\() ws es -> bad freeLocals ws es)

677+ (\() ws (value, newFreeLocals) ->

678+ let delayedLocals = Map.map delayUse newFreeLocals in

679+ good (Map.unionWith combineUses freeLocals delayedLocals) ws value

680+ )

681+

682+

683+

684+-- FIND VARIABLE

685+

686+

687+findVar :: A.Region -> Env.Env -> Name.Name -> Result FreeLocals w Can.Expr_

688+findVar region (Env.Env localHome vs _ _ _ qvs _ _) name =

689+ case Map.lookup name vs of

690+ Just var ->

691+ case var of

692+ Env.Local _ ->

693+ logVar name (Can.VarLocal name)

694+

695+ Env.TopLevel _ ->

696+ logVar name (Can.VarTopLevel localHome name)

697+

698+ Env.Foreign home annotation ->

699+ Result.ok $

700+ if home == ModuleName.debug then

701+ Can.VarDebug localHome name annotation

702+ else

703+ Can.VarForeign home name annotation

704+

705+ Env.Foreigns h hs ->

706+ Result.throw (Error.AmbiguousVar region Nothing name h hs)

707+

708+ Nothing ->

709+ Result.throw (Error.NotFoundVar region Nothing name (toPossibleNames vs qvs))

710+

711+

712+findVarQual :: A.Region -> Env.Env -> Name.Name -> Name.Name -> Result FreeLocals w Can.Expr_

713+findVarQual region (Env.Env localHome vs _ _ _ qvs _ _) prefix name =

714+ case Map.lookup prefix qvs of

715+ Just qualified ->

716+ case Map.lookup name qualified of

717+ Just (Env.Specific home annotation) ->

718+ Result.ok $

719+ if home == ModuleName.debug then

720+ Can.VarDebug localHome name annotation

721+ else

722+ Can.VarForeign home name annotation

723+

724+ Just (Env.Ambiguous h hs) ->

725+ Result.throw (Error.AmbiguousVar region (Just prefix) name h hs)

726+

727+ Nothing ->

728+ Result.throw (Error.NotFoundVar region (Just prefix) name (toPossibleNames vs qvs))

729+

730+ Nothing ->

731+ if Name.isKernel prefix && Pkg.isKernel (ModuleName._package localHome) then

732+ Result.ok $ Can.VarKernel (Name.getKernel prefix) name

733+ else

734+ Result.throw (Error.NotFoundVar region (Just prefix) name (toPossibleNames vs qvs))

735+

736+

737+toPossibleNames :: Map.Map Name.Name Env.Var -> Env.Qualified Can.Annotation -> Error.PossibleNames

738+toPossibleNames exposed qualified =

739+ Error.PossibleNames (Map.keysSet exposed) (Map.map Map.keysSet qualified)

740+

741+

742+

743+-- FIND CTOR

744+

745+

746+toVarCtor :: Name.Name -> Env.Ctor -> Can.Expr_

747+toVarCtor name ctor =

748+ case ctor of

749+ Env.Ctor home typeName (Can.Union vars _ _ opts) index args ->

750+ let

751+ freeVars = Map.fromList (map (\v -> (v, ())) vars)

752+ result = Can.TType home typeName (map Can.TVar vars)

753+ tipe = foldr Can.TLambda result args

754+ in

755+ Can.VarCtor opts home name index (Can.Forall freeVars tipe)

756+

757+ Env.RecordCtor home vars tipe ->

758+ let

759+ freeVars = Map.fromList (map (\v -> (v, ())) vars)

760+ in

761+ Can.VarCtor Can.Normal home name Index.first (Can.Forall freeVars tipe)

compiler/src/Canonicalize/Module.hsnew file+296

@@ -0,0 +1,296 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module Canonicalize.Module

3+ ( canonicalize

4+ )

5+ where

6+

7+

8+import qualified Data.Graph as Graph

9+import qualified Data.Map as Map

10+import qualified Data.Name as Name

11+

12+import qualified AST.Canonical as Can

13+import qualified AST.Source as Src

14+import qualified Canonicalize.Effects as Effects

15+import qualified Canonicalize.Environment as Env

16+import qualified Canonicalize.Environment.Dups as Dups

17+import qualified Canonicalize.Environment.Foreign as Foreign

18+import qualified Canonicalize.Environment.Local as Local

19+import qualified Canonicalize.Expression as Expr

20+import qualified Canonicalize.Pattern as Pattern

21+import qualified Canonicalize.Type as Type

22+import qualified Data.Index as Index

23+import qualified Elm.Interface as I

24+import qualified Elm.ModuleName as ModuleName

25+import qualified Elm.Package as Pkg

26+import qualified Reporting.Annotation as A

27+import qualified Reporting.Error.Canonicalize as Error

28+import qualified Reporting.Result as Result

29+import qualified Reporting.Warning as W

30+

31+

32+

33+-- RESULT

34+

35+

36+type Result i w a =

37+ Result.Result i w Error.Error a

38+

39+

40+

41+-- MODULES

42+

43+

44+canonicalize :: Pkg.Name -> Map.Map ModuleName.Raw I.Interface -> Src.Module -> Result i [W.Warning] Can.Module

45+canonicalize pkg ifaces modul@(Src.Module _ exports docs imports values _ _ binops effects) =

46+ do let home = ModuleName.Canonical pkg (Src.getName modul)

47+ let cbinops = Map.fromList (map canonicalizeBinop binops)

48+

49+ (env, cunions, caliases) <-

50+ Local.add modul =<<

51+ Foreign.createInitialEnv home ifaces imports

52+

53+ cvalues <- canonicalizeValues env values

54+ ceffects <- Effects.canonicalize env values cunions effects

55+ cexports <- canonicalizeExports values cunions caliases cbinops ceffects exports

56+

57+ return $ Can.Module home cexports docs cvalues cunions caliases cbinops ceffects

58+

59+

60+

61+-- CANONICALIZE BINOP

62+

63+

64+canonicalizeBinop :: A.Located Src.Infix -> ( Name.Name, Can.Binop )

65+canonicalizeBinop (A.At _ (Src.Infix op associativity precedence func)) =

66+ ( op, Can.Binop_ associativity precedence func )

67+

68+

69+

70+-- DECLARATIONS / CYCLE DETECTION

71+--

72+-- There are two phases of cycle detection:

73+--

74+-- 1. Detect cycles using ALL dependencies => needed for type inference

75+-- 2. Detect cycles using DIRECT dependencies => nonterminating recursion

76+--

77+

78+

79+canonicalizeValues :: Env.Env -> [A.Located Src.Value] -> Result i [W.Warning] Can.Decls

80+canonicalizeValues env values =

81+ do nodes <- traverse (toNodeOne env) values

82+ detectCycles (Graph.stronglyConnComp nodes)

83+

84+

85+detectCycles :: [Graph.SCC NodeTwo] -> Result i w Can.Decls

86+detectCycles sccs =

87+ case sccs of

88+ [] ->

89+ Result.ok Can.SaveTheEnvironment

90+

91+ scc : otherSccs ->

92+ case scc of

93+ Graph.AcyclicSCC (def, _, _) ->

94+ Can.Declare def <$> detectCycles otherSccs

95+

96+ Graph.CyclicSCC subNodes ->

97+ do defs <- traverse detectBadCycles (Graph.stronglyConnComp subNodes)

98+ case defs of

99+ [] -> detectCycles otherSccs

100+ d:ds -> Can.DeclareRec d ds <$> detectCycles otherSccs

101+

102+

103+detectBadCycles :: Graph.SCC Can.Def -> Result i w Can.Def

104+detectBadCycles scc =

105+ case scc of

106+ Graph.AcyclicSCC def ->

107+ Result.ok def

108+

109+ Graph.CyclicSCC [] ->

110+ error "The definition of Data.Graph.SCC should not allow empty CyclicSCC!"

111+

112+ Graph.CyclicSCC (def:defs) ->

113+ let

114+ (A.At region name) = extractDefName def

115+ names = map (A.toValue . extractDefName) defs

116+ in

117+ Result.throw (Error.RecursiveDecl region name names)

118+

119+

120+extractDefName :: Can.Def -> A.Located Name.Name

121+extractDefName def =

122+ case def of

123+ Can.Def name _ _ -> name

124+ Can.TypedDef name _ _ _ _ -> name

125+

126+

127+

128+-- DECLARATIONS / CYCLE DETECTION SETUP

129+--

130+-- toNodeOne and toNodeTwo set up nodes for the two cycle detection phases.

131+--

132+

133+-- Phase one nodes track ALL dependencies.

134+-- This allows us to find cyclic values for type inference.

135+type NodeOne =

136+ (NodeTwo, Name.Name, [Name.Name])

137+

138+

139+-- Phase two nodes track DIRECT dependencies.

140+-- This allows us to detect cycles that definitely do not terminate.

141+type NodeTwo =

142+ (Can.Def, Name.Name, [Name.Name])

143+

144+

145+toNodeOne :: Env.Env -> A.Located Src.Value -> Result i [W.Warning] NodeOne

146+toNodeOne env (A.At _ (Src.Value aname@(A.At _ name) srcArgs body maybeType)) =

147+ case maybeType of

148+ Nothing ->

149+ do (args, argBindings) <-

150+ Pattern.verify (Error.DPFuncArgs name) $

151+ traverse (Pattern.canonicalize env) srcArgs

152+

153+ newEnv <-

154+ Env.addLocals argBindings env

155+

156+ (cbody, freeLocals) <-

157+ Expr.verifyBindings W.Pattern argBindings (Expr.canonicalize newEnv body)

158+

159+ let def = Can.Def aname args cbody

160+ return

161+ ( toNodeTwo name srcArgs def freeLocals

162+ , name

163+ , Map.keys freeLocals

164+ )

165+

166+ Just srcType ->

167+ do (Can.Forall freeVars tipe) <- Type.toAnnotation env srcType

168+

169+ ((args,resultType), argBindings) <-

170+ Pattern.verify (Error.DPFuncArgs name) $

171+ Expr.gatherTypedArgs env name srcArgs tipe Index.first []

172+

173+ newEnv <-

174+ Env.addLocals argBindings env

175+

176+ (cbody, freeLocals) <-

177+ Expr.verifyBindings W.Pattern argBindings (Expr.canonicalize newEnv body)

178+

179+ let def = Can.TypedDef aname freeVars args cbody resultType

180+ return

181+ ( toNodeTwo name srcArgs def freeLocals

182+ , name

183+ , Map.keys freeLocals

184+ )

185+

186+

187+toNodeTwo :: Name.Name -> [arg] -> Can.Def -> Expr.FreeLocals -> NodeTwo

188+toNodeTwo name args def freeLocals =

189+ case args of

190+ [] ->

191+ (def, name, Map.foldrWithKey addDirects [] freeLocals)

192+

193+ _ ->

194+ (def, name, [])

195+

196+

197+addDirects :: Name.Name -> Expr.Uses -> [Name.Name] -> [Name.Name]

198+addDirects name (Expr.Uses directUses _) directDeps =

199+ if directUses > 0 then

200+ name:directDeps

201+ else

202+ directDeps

203+

204+

205+

206+-- CANONICALIZE EXPORTS

207+

208+

209+canonicalizeExports

210+ :: [A.Located Src.Value]

211+ -> Map.Map Name.Name union

212+ -> Map.Map Name.Name alias

213+ -> Map.Map Name.Name binop

214+ -> Can.Effects

215+ -> A.Located Src.Exposing

216+ -> Result i w Can.Exports

217+canonicalizeExports values unions aliases binops effects (A.At region exposing) =

218+ case exposing of

219+ Src.Open ->

220+ Result.ok (Can.ExportEverything region)

221+

222+ Src.Explicit exposeds ->

223+ do let names = Map.fromList (map valueToName values)

224+ infos <- traverse (checkExposed names unions aliases binops effects) exposeds

225+ Can.Export <$> Dups.detect Error.ExportDuplicate (Dups.unions infos)

226+

227+

228+valueToName :: A.Located Src.Value -> ( Name.Name, () )

229+valueToName (A.At _ (Src.Value (A.At _ name) _ _ _)) =

230+ ( name, () )

231+

232+

233+checkExposed

234+ :: Map.Map Name.Name value

235+ -> Map.Map Name.Name union

236+ -> Map.Map Name.Name alias

237+ -> Map.Map Name.Name binop

238+ -> Can.Effects

239+ -> Src.Exposed

240+ -> Result i w (Dups.Dict (A.Located Can.Export))

241+checkExposed values unions aliases binops effects exposed =

242+ case exposed of

243+ Src.Lower (A.At region name) ->

244+ if Map.member name values then

245+ ok name region Can.ExportValue

246+ else

247+ case checkPorts effects name of

248+ Nothing ->

249+ ok name region Can.ExportPort

250+

251+ Just ports ->

252+ Result.throw $ Error.ExportNotFound region Error.BadVar name $

253+ ports ++ Map.keys values

254+

255+ Src.Operator region name ->

256+ if Map.member name binops then

257+ ok name region Can.ExportBinop

258+ else

259+ Result.throw $ Error.ExportNotFound region Error.BadOp name $

260+ Map.keys binops

261+

262+ Src.Upper (A.At region name) (Src.Public dotDotRegion) ->

263+ if Map.member name unions then

264+ ok name region Can.ExportUnionOpen

265+ else if Map.member name aliases then

266+ Result.throw $ Error.ExportOpenAlias dotDotRegion name

267+ else

268+ Result.throw $ Error.ExportNotFound region Error.BadType name $

269+ Map.keys unions ++ Map.keys aliases

270+

271+ Src.Upper (A.At region name) Src.Private ->

272+ if Map.member name unions then

273+ ok name region Can.ExportUnionClosed

274+ else if Map.member name aliases then

275+ ok name region Can.ExportAlias

276+ else

277+ Result.throw $ Error.ExportNotFound region Error.BadType name $

278+ Map.keys unions ++ Map.keys aliases

279+

280+

281+checkPorts :: Can.Effects -> Name.Name -> Maybe [Name.Name]

282+checkPorts effects name =

283+ case effects of

284+ Can.NoEffects ->

285+ Just []

286+

287+ Can.Ports ports ->

288+ if Map.member name ports then Nothing else Just (Map.keys ports)

289+

290+ Can.Manager _ _ _ _ ->

291+ Just []

292+

293+

294+ok :: Name.Name -> A.Region -> Can.Export -> Result i w (Dups.Dict (A.Located Can.Export))

295+ok name region export =

296+ Result.ok $ Dups.one name region (A.At region export)

compiler/src/Canonicalize/Pattern.hsnew file+181

@@ -0,0 +1,181 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module Canonicalize.Pattern

3+ ( verify

4+ , Bindings

5+ , DupsDict

6+ , canonicalize

7+ )

8+ where

9+

10+

11+import qualified Data.List as List

12+import qualified Data.Map.Strict as Map

13+import qualified Data.Name as Name

14+

15+import qualified AST.Canonical as Can

16+import qualified AST.Source as Src

17+import qualified Canonicalize.Environment as Env

18+import qualified Canonicalize.Environment.Dups as Dups

19+import qualified Data.Index as Index

20+import qualified Elm.ModuleName as ModuleName

21+import qualified Reporting.Annotation as A

22+import qualified Reporting.Error.Canonicalize as Error

23+import qualified Reporting.Result as Result

24+

25+

26+

27+-- RESULTS

28+

29+

30+type Result i w a =

31+ Result.Result i w Error.Error a

32+

33+

34+type Bindings =

35+ Map.Map Name.Name A.Region

36+

37+

38+

39+-- VERIFY

40+

41+

42+verify :: Error.DuplicatePatternContext -> Result DupsDict w a -> Result i w (a, Bindings)

43+verify context (Result.Result k) =

44+ Result.Result $ \info warnings bad good ->

45+ k Dups.none warnings

46+ (\_ warnings1 errors ->

47+ bad info warnings1 errors

48+ )

49+ (\bindings warnings1 value ->

50+ case Dups.detect (Error.DuplicatePattern context) bindings of

51+ Result.Result k1 ->

52+ k1 () ()

53+ (\() () errs -> bad info warnings1 errs)

54+ (\() () dict -> good info warnings1 (value, dict))

55+ )

56+

57+

58+

59+-- CANONICALIZE

60+

61+

62+type DupsDict =

63+ Dups.Dict A.Region

64+

65+

66+canonicalize :: Env.Env -> Src.Pattern -> Result DupsDict w Can.Pattern

67+canonicalize env (A.At region pattern) =

68+ A.At region <$>

69+ case pattern of

70+ Src.PAnything ->

71+ Result.ok Can.PAnything

72+

73+ Src.PVar name ->

74+ logVar name region (Can.PVar name)

75+

76+ Src.PRecord fields ->

77+ logFields fields (Can.PRecord (map A.toValue fields))

78+

79+ Src.PUnit ->

80+ Result.ok Can.PUnit

81+

82+ Src.PTuple a b cs ->

83+ Can.PTuple

84+ <$> canonicalize env a

85+ <*> canonicalize env b

86+ <*> canonicalizeTuple region env cs

87+

88+ Src.PCtor nameRegion name patterns ->

89+ canonicalizeCtor env region name patterns =<< Env.findCtor nameRegion env name

90+

91+ Src.PCtorQual nameRegion home name patterns ->

92+ canonicalizeCtor env region name patterns =<< Env.findCtorQual nameRegion env home name

93+

94+ Src.PList patterns ->

95+ Can.PList <$> canonicalizeList env patterns

96+

97+ Src.PCons first rest ->

98+ Can.PCons

99+ <$> canonicalize env first

100+ <*> canonicalize env rest

101+

102+ Src.PAlias ptrn (A.At reg name) ->

103+ do cpattern <- canonicalize env ptrn

104+ logVar name reg (Can.PAlias cpattern name)

105+

106+ Src.PChr chr ->

107+ Result.ok (Can.PChr chr)

108+

109+ Src.PStr str ->

110+ Result.ok (Can.PStr str)

111+

112+ Src.PInt int ->

113+ Result.ok (Can.PInt int)

114+

115+

116+canonicalizeCtor :: Env.Env -> A.Region -> Name.Name -> [Src.Pattern] -> Env.Ctor -> Result DupsDict w Can.Pattern_

117+canonicalizeCtor env region name patterns ctor =

118+ case ctor of

119+ Env.Ctor home tipe union index args ->

120+ let

121+ toCanonicalArg argIndex argPattern argTipe =

122+ Can.PatternCtorArg argIndex argTipe <$> canonicalize env argPattern

123+ in

124+ do verifiedList <- Index.indexedZipWithA toCanonicalArg patterns args

125+ case verifiedList of

126+ Index.LengthMatch cargs ->

127+ if tipe == Name.bool && home == ModuleName.basics then

128+ Result.ok (Can.PBool union (name == Name.true))

129+ else

130+ Result.ok (Can.PCtor home tipe union name index cargs)

131+

132+ Index.LengthMismatch actualLength expectedLength ->

133+ Result.throw (Error.BadArity region Error.PatternArity name expectedLength actualLength)

134+

135+ Env.RecordCtor _ _ _ ->

136+ Result.throw (Error.PatternHasRecordCtor region name)

137+

138+

139+canonicalizeTuple :: A.Region -> Env.Env -> [Src.Pattern] -> Result DupsDict w (Maybe Can.Pattern)

140+canonicalizeTuple tupleRegion env extras =

141+ case extras of

142+ [] ->

143+ Result.ok Nothing

144+

145+ [three] ->

146+ Just <$> canonicalize env three

147+

148+ _ ->

149+ Result.throw $ Error.TupleLargerThanThree tupleRegion

150+

151+

152+canonicalizeList :: Env.Env -> [Src.Pattern] -> Result DupsDict w [Can.Pattern]

153+canonicalizeList env list =

154+ case list of

155+ [] ->

156+ Result.ok []

157+

158+ pattern : otherPatterns ->

159+ (:)

160+ <$> canonicalize env pattern

161+ <*> canonicalizeList env otherPatterns

162+

163+

164+

165+-- LOG BINDINGS

166+

167+

168+logVar :: Name.Name -> A.Region -> a -> Result DupsDict w a

169+logVar name region value =

170+ Result.Result $ \bindings warnings _ ok ->

171+ ok (Dups.insert name region region bindings) warnings value

172+

173+

174+logFields :: [A.Located Name.Name] -> a -> Result DupsDict w a

175+logFields fields value =

176+ let

177+ addField dict (A.At region name) =

178+ Dups.insert name region region dict

179+ in

180+ Result.Result $ \bindings warnings _ ok ->

181+ ok (List.foldl' addField bindings fields) warnings value

compiler/src/Canonicalize/Type.hsnew file+162

@@ -0,0 +1,162 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Canonicalize.Type

4+ ( toAnnotation

5+ , canonicalize

6+ )

7+ where

8+

9+

10+import qualified Data.List as List

11+import qualified Data.Map as Map

12+import qualified Data.Name as Name

13+

14+import qualified AST.Canonical as Can

15+import qualified AST.Source as Src

16+import qualified Canonicalize.Environment as Env

17+import qualified Canonicalize.Environment.Dups as Dups

18+import qualified Reporting.Annotation as A

19+import qualified Reporting.Error.Canonicalize as Error

20+import qualified Reporting.Result as Result

21+

22+

23+

24+-- RESULT

25+

26+

27+type Result i w a =

28+ Result.Result i w Error.Error a

29+

30+

31+

32+-- TO ANNOTATION

33+

34+

35+toAnnotation :: Env.Env -> Src.Type -> Result i w Can.Annotation

36+toAnnotation env srcType =

37+ do tipe <- canonicalize env srcType

38+ Result.ok $ Can.Forall (addFreeVars Map.empty tipe) tipe

39+

40+

41+

42+-- CANONICALIZE TYPES

43+

44+

45+canonicalize :: Env.Env -> Src.Type -> Result i w Can.Type

46+canonicalize env (A.At typeRegion tipe) =

47+ case tipe of

48+ Src.TVar x ->

49+ Result.ok (Can.TVar x)

50+

51+ Src.TType region name args ->

52+ canonicalizeType env typeRegion name args =<<

53+ Env.findType region env name

54+

55+ Src.TTypeQual region home name args ->

56+ canonicalizeType env typeRegion name args =<<

57+ Env.findTypeQual region env home name

58+

59+ Src.TLambda a b ->

60+ Can.TLambda

61+ <$> canonicalize env a

62+ <*> canonicalize env b

63+

64+ Src.TRecord fields ext ->

65+ do cfields <- sequenceA =<< Dups.checkFields (canonicalizeFields env fields)

66+ return $ Can.TRecord cfields (fmap A.toValue ext)

67+

68+ Src.TUnit ->

69+ Result.ok Can.TUnit

70+

71+ Src.TTuple a b cs ->

72+ Can.TTuple

73+ <$> canonicalize env a

74+ <*> canonicalize env b

75+ <*>

76+ case cs of

77+ [] ->

78+ Result.ok Nothing

79+

80+ [c] ->

81+ Just <$> canonicalize env c

82+

83+ _ ->

84+ Result.throw $ Error.TupleLargerThanThree typeRegion

85+

86+

87+canonicalizeFields :: Env.Env -> [(A.Located Name.Name, Src.Type)] -> [(A.Located Name.Name, Result i w Can.FieldType)]

88+canonicalizeFields env fields =

89+ let

90+ len = fromIntegral (length fields)

91+ canonicalizeField index (name, srcType) =

92+ (name, Can.FieldType index <$> canonicalize env srcType)

93+ in

94+ zipWith canonicalizeField [0..len] fields

95+

96+

97+

98+-- CANONICALIZE TYPE

99+

100+

101+canonicalizeType :: Env.Env -> A.Region -> Name.Name -> [Src.Type] -> Env.Type -> Result i w Can.Type

102+canonicalizeType env region name args info =

103+ do cargs <- traverse (canonicalize env) args

104+ case info of

105+ Env.Alias arity home argNames aliasedType ->

106+ checkArity arity region name args $

107+ Can.TAlias home name (zip argNames cargs) (Can.Holey aliasedType)

108+

109+ Env.Union arity home ->

110+ checkArity arity region name args $

111+ Can.TType home name cargs

112+

113+

114+checkArity :: Int -> A.Region -> Name.Name -> [A.Located arg] -> answer -> Result i w answer

115+checkArity expected region name args answer =

116+ let actual = length args in

117+ if expected == actual then

118+ Result.ok answer

119+ else

120+ Result.throw (Error.BadArity region Error.TypeArity name expected actual)

121+

122+

123+

124+-- ADD FREE VARS

125+

126+

127+addFreeVars :: Map.Map Name.Name () -> Can.Type -> Map.Map Name.Name ()

128+addFreeVars freeVars tipe =

129+ case tipe of

130+ Can.TLambda arg result ->

131+ addFreeVars (addFreeVars freeVars result) arg

132+

133+ Can.TVar var ->

134+ Map.insert var () freeVars

135+

136+ Can.TType _ _ args ->

137+ List.foldl' addFreeVars freeVars args

138+

139+ Can.TRecord fields Nothing ->

140+ Map.foldl addFieldFreeVars freeVars fields

141+

142+ Can.TRecord fields (Just ext) ->

143+ Map.foldl addFieldFreeVars (Map.insert ext () freeVars) fields

144+

145+ Can.TUnit ->

146+ freeVars

147+

148+ Can.TTuple a b maybeC ->

149+ case maybeC of

150+ Nothing ->

151+ addFreeVars (addFreeVars freeVars a) b

152+

153+ Just c ->

154+ addFreeVars (addFreeVars (addFreeVars freeVars a) b) c

155+

156+ Can.TAlias _ _ args _ ->

157+ List.foldl' (\fvs (_,arg) -> addFreeVars fvs arg) freeVars args

158+

159+

160+addFieldFreeVars :: Map.Map Name.Name () -> Can.FieldType -> Map.Map Name.Name ()

161+addFieldFreeVars freeVars (Can.FieldType _ tipe) =

162+ addFreeVars freeVars tipe

compiler/src/Compile.hsnew file+92

@@ -0,0 +1,92 @@

1+{-# OPTIONS_GHC -Wall -fno-warn-unused-do-bind #-}

2+module Compile

3+ ( Artifacts(..)

4+ , compile

5+ )

6+ where

7+

8+

9+import qualified Data.Map as Map

10+import qualified Data.Name as Name

11+

12+import qualified AST.Source as Src

13+import qualified AST.Canonical as Can

14+import qualified AST.Optimized as Opt

15+import qualified Canonicalize.Module as Canonicalize

16+import qualified Elm.Interface as I

17+import qualified Elm.ModuleName as ModuleName

18+import qualified Elm.Package as Pkg

19+import qualified Nitpick.PatternMatches as PatternMatches

20+import qualified Optimize.Module as Optimize

21+import qualified Reporting.Error as E

22+import qualified Reporting.Result as R

23+import qualified Reporting.Render.Type.Localizer as Localizer

24+import qualified Type.Constrain.Module as Type

25+import qualified Type.Solve as Type

26+

27+import System.IO.Unsafe (unsafePerformIO)

28+

29+

30+

31+-- COMPILE

32+

33+

34+data Artifacts =

35+ Artifacts

36+ { _modul :: Can.Module

37+ , _types :: Map.Map Name.Name Can.Annotation

38+ , _graph :: Opt.LocalGraph

39+ }

40+

41+

42+compile :: Pkg.Name -> Map.Map ModuleName.Raw I.Interface -> Src.Module -> Either E.Error Artifacts

43+compile pkg ifaces modul =

44+ do canonical <- canonicalize pkg ifaces modul

45+ annotations <- typeCheck modul canonical

46+ () <- nitpick canonical

47+ objects <- optimize modul annotations canonical

48+ return (Artifacts canonical annotations objects)

49+

50+

51+

52+-- PHASES

53+

54+

55+canonicalize :: Pkg.Name -> Map.Map ModuleName.Raw I.Interface -> Src.Module -> Either E.Error Can.Module

56+canonicalize pkg ifaces modul =

57+ case snd $ R.run $ Canonicalize.canonicalize pkg ifaces modul of

58+ Right canonical ->

59+ Right canonical

60+

61+ Left errors ->

62+ Left $ E.BadNames errors

63+

64+

65+typeCheck :: Src.Module -> Can.Module -> Either E.Error (Map.Map Name.Name Can.Annotation)

66+typeCheck modul canonical =

67+ case unsafePerformIO (Type.run =<< Type.constrain canonical) of

68+ Right annotations ->

69+ Right annotations

70+

71+ Left errors ->

72+ Left (E.BadTypes (Localizer.fromModule modul) errors)

73+

74+

75+nitpick :: Can.Module -> Either E.Error ()

76+nitpick canonical =

77+ case PatternMatches.check canonical of

78+ Right () ->

79+ Right ()

80+

81+ Left errors ->

82+ Left (E.BadPatterns errors)

83+

84+

85+optimize :: Src.Module -> Map.Map Name.Name Can.Annotation -> Can.Module -> Either E.Error Opt.LocalGraph

86+optimize modul annotations canonical =

87+ case snd $ R.run $ Optimize.optimize annotations canonical of

88+ Right localGraph ->

89+ Right localGraph

90+

91+ Left errors ->

92+ Left (E.BadMains (Localizer.fromModule modul) errors)

compiler/src/Data/Bag.hsnew file+110

@@ -0,0 +1,110 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module Data.Bag

3+ ( Bag(..)

4+ , empty

5+ , one

6+ , append

7+ , map

8+ , toList

9+ , fromList

10+ )

11+ where

12+

13+

14+import Prelude hiding (map)

15+import qualified Data.List as List

16+

17+

18+

19+-- BAGS

20+

21+

22+data Bag a

23+ = Empty

24+ | One a

25+ | Two (Bag a) (Bag a)

26+

27+

28+

29+-- HELPERS

30+

31+

32+empty :: Bag a

33+empty =

34+ Empty

35+

36+

37+one :: a -> Bag a

38+one =

39+ One

40+

41+

42+append :: Bag a -> Bag a -> Bag a

43+append left right =

44+ case (left, right) of

45+ (other, Empty) ->

46+ other

47+

48+ (Empty, other) ->

49+ other

50+

51+ (_, _) ->

52+ Two left right

53+

54+

55+

56+-- MAP

57+

58+

59+map :: (a -> b) -> Bag a -> Bag b

60+map func bag =

61+ case bag of

62+ Empty ->

63+ Empty

64+

65+ One a ->

66+ One (func a)

67+

68+ Two left right ->

69+ Two (map func left) (map func right)

70+

71+

72+

73+-- TO LIST

74+

75+

76+toList :: Bag a -> [a]

77+toList bag =

78+ toListHelp bag []

79+

80+

81+toListHelp :: Bag a -> [a] -> [a]

82+toListHelp bag list =

83+ case bag of

84+ Empty ->

85+ list

86+

87+ One x ->

88+ x : list

89+

90+ Two a b ->

91+ toListHelp a (toListHelp b list)

92+

93+

94+

95+-- FROM LIST

96+

97+

98+fromList :: (a -> b) -> [a] -> Bag b

99+fromList func list =

100+ case list of

101+ [] ->

102+ Empty

103+

104+ first : rest ->

105+ List.foldl' (add func) (One (func first)) rest

106+

107+

108+add :: (a -> b) -> Bag b -> a -> Bag b

109+add func bag value =

110+ Two (One (func value)) bag

compiler/src/Data/Index.hsnew file+132

@@ -0,0 +1,132 @@

1+module Data.Index

2+ ( ZeroBased

3+ , first

4+ , second

5+ , third

6+ , next

7+ , toMachine

8+ , toHuman

9+ , indexedMap

10+ , indexedTraverse

11+ , indexedForA

12+ , VerifiedList(..)

13+ , indexedZipWith

14+ , indexedZipWithA

15+ )

16+ where

17+

18+

19+import Control.Monad (liftM)

20+import Data.Binary

21+

22+

23+

24+-- ZERO BASED

25+

26+

27+newtype ZeroBased = ZeroBased Int

28+ deriving (Eq, Ord)

29+

30+

31+first :: ZeroBased

32+first =

33+ ZeroBased 0

34+

35+

36+second :: ZeroBased

37+second =

38+ ZeroBased 1

39+

40+

41+third :: ZeroBased

42+third =

43+ ZeroBased 2

44+

45+

46+{-# INLINE next #-}

47+next :: ZeroBased -> ZeroBased

48+next (ZeroBased i) =

49+ ZeroBased (i + 1)

50+

51+

52+

53+-- DESTRUCT

54+

55+

56+toMachine :: ZeroBased -> Int

57+toMachine (ZeroBased index) =

58+ index

59+

60+

61+toHuman :: ZeroBased -> Int

62+toHuman (ZeroBased index) =

63+ index + 1

64+

65+

66+

67+-- INDEXED MAP

68+

69+

70+{-# INLINE indexedMap #-}

71+indexedMap :: (ZeroBased -> a -> b) -> [a] -> [b]

72+indexedMap func xs =

73+ zipWith func (map ZeroBased [0 .. length xs]) xs

74+

75+

76+{-# INLINE indexedTraverse #-}

77+indexedTraverse :: (Applicative f) => (ZeroBased -> a -> f b) -> [a] -> f [b]

78+indexedTraverse func xs =

79+ sequenceA (indexedMap func xs)

80+

81+

82+{-# INLINE indexedForA #-}

83+indexedForA :: (Applicative f) => [a] -> (ZeroBased -> a -> f b) -> f [b]

84+indexedForA xs func =

85+ sequenceA (indexedMap func xs)

86+

87+

88+

89+-- VERIFIED/INDEXED ZIP

90+

91+

92+data VerifiedList a

93+ = LengthMatch [a]

94+ | LengthMismatch Int Int

95+

96+

97+indexedZipWith :: (ZeroBased -> a -> b -> c) -> [a] -> [b] -> VerifiedList c

98+indexedZipWith func listX listY =

99+ indexedZipWithHelp func 0 listX listY []

100+

101+

102+indexedZipWithHelp :: (ZeroBased -> a -> b -> c) -> Int -> [a] -> [b] -> [c] -> VerifiedList c

103+indexedZipWithHelp func index listX listY revListZ =

104+ case (listX, listY) of

105+ ([], []) ->

106+ LengthMatch (reverse revListZ)

107+

108+ (x:xs, y:ys) ->

109+ indexedZipWithHelp func (index + 1) xs ys $

110+ func (ZeroBased index) x y : revListZ

111+

112+ (_, _) ->

113+ LengthMismatch (index + length listX) (index + length listY)

114+

115+

116+indexedZipWithA :: (Applicative f) => (ZeroBased -> a -> b -> f c) -> [a] -> [b] -> f (VerifiedList c)

117+indexedZipWithA func listX listY =

118+ case indexedZipWith func listX listY of

119+ LengthMatch xs ->

120+ LengthMatch <$> sequenceA xs

121+

122+ LengthMismatch x y ->

123+ pure (LengthMismatch x y)

124+

125+

126+

127+-- BINARY

128+

129+

130+instance Binary ZeroBased where

131+ get = liftM ZeroBased get

132+ put (ZeroBased n) = put n

compiler/src/Data/Map/Utils.hsnew file+43

@@ -0,0 +1,43 @@

1+module Data.Map.Utils

2+ ( fromKeys

3+ , fromKeysA

4+ , fromValues

5+ , any

6+ )

7+ where

8+

9+

10+import Prelude hiding (any)

11+import qualified Data.Map as Map

12+import Data.Map.Internal (Map(..))

13+

14+

15+

16+-- FROM KEYS

17+

18+

19+fromKeys :: (Ord k) => (k -> v) -> [k] -> Map.Map k v

20+fromKeys toValue keys =

21+ Map.fromList $ map (\k -> (k, toValue k)) keys

22+

23+

24+fromKeysA :: (Applicative f, Ord k) => (k -> f v) -> [k] -> f (Map.Map k v)

25+fromKeysA toValue keys =

26+ Map.fromList <$> traverse (\k -> (,) k <$> toValue k) keys

27+

28+

29+fromValues :: (Ord k) => (v -> k) -> [v] -> Map.Map k v

30+fromValues toKey values =

31+ Map.fromList $ map (\v -> (toKey v, v)) values

32+

33+

34+

35+-- ANY

36+

37+

38+{-# INLINE any #-}

39+any :: (v -> Bool) -> Map.Map k v -> Bool

40+any isGood = go

41+ where

42+ go Tip = False

43+ go (Bin _ _ v l r) = isGood v || go l || go r

compiler/src/Data/Name.hsnew file+610

@@ -0,0 +1,610 @@

1+{-# OPTIONS_GHC -fno-warn-name-shadowing #-}

2+{-# LANGUAGE BangPatterns, EmptyDataDecls, FlexibleInstances, MagicHash, UnboxedTuples #-}

3+module Data.Name

4+ ( Name

5+ --

6+ , toChars

7+ , toElmString

8+ , toBuilder

9+ --

10+ , fromPtr

11+ , fromChars

12+ --

13+ , getKernel

14+ , hasDot

15+ , splitDots

16+ , isKernel

17+ , isNumberType

18+ , isComparableType

19+ , isAppendableType

20+ , isCompappendType

21+ , fromVarIndex

22+ , fromWords

23+ , fromManyNames

24+ , fromTypeVariable

25+ , fromTypeVariableScheme

26+ , sepBy

27+ --

28+ , int, float, bool, char, string

29+ , maybe, result, list, array, dict, tuple, jsArray

30+ , task, router, cmd, sub, platform, virtualDom

31+ , shader, debug, debugger, bitwise, basics

32+ , utils, negate, true, false, value

33+ , node, program, _main, _Main, dollar, identity

34+ , replModule, replValueToPrint

35+ )

36+ where

37+

38+

39+import Prelude hiding (length, maybe, negate)

40+import Control.Exception (assert)

41+import qualified Data.Binary as Binary

42+import qualified Data.ByteString.Builder.Internal as B

43+import qualified Data.Coerce as Coerce

44+import qualified Data.List as List

45+import qualified Data.String as Chars

46+import qualified Data.Utf8 as Utf8

47+import GHC.Exts

48+ ( Int(I#), Ptr

49+ , MutableByteArray#

50+ , isTrue#

51+ , newByteArray#

52+ , sizeofByteArray#

53+ , unsafeFreezeByteArray#

54+ )

55+import GHC.ST (ST(ST), runST)

56+import GHC.Prim

57+import GHC.Word (Word8(W8#))

58+

59+import qualified Elm.String as ES

60+

61+

62+

63+-- NAME

64+

65+

66+type Name =

67+ Utf8.Utf8 ELM_NAME

68+

69+

70+data ELM_NAME

71+

72+

73+

74+-- INSTANCES

75+

76+

77+instance Chars.IsString (Utf8.Utf8 ELM_NAME) where

78+ fromString = Utf8.fromChars

79+

80+instance Binary.Binary (Utf8.Utf8 ELM_NAME) where

81+ get = Utf8.getUnder256

82+ put = Utf8.putUnder256

83+

84+

85+

86+-- TO

87+

88+

89+toChars :: Name -> [Char]

90+toChars =

91+ Utf8.toChars

92+

93+

94+toElmString :: Name -> ES.String

95+toElmString =

96+ Coerce.coerce

97+

98+

99+{-# INLINE toBuilder #-}

100+toBuilder :: Name -> B.Builder

101+toBuilder =

102+ Utf8.toBuilder

103+

104+

105+

106+-- FROM

107+

108+

109+fromPtr :: Ptr Word8 -> Ptr Word8 -> Name

110+fromPtr =

111+ Utf8.fromPtr

112+

113+

114+fromChars :: [Char] -> Name

115+fromChars =

116+ Utf8.fromChars

117+

118+

119+

120+-- HAS DOT

121+

122+

123+hasDot :: Name -> Bool

124+hasDot name =

125+ Utf8.contains 0x2E {- . -} name

126+

127+

128+splitDots :: Name -> [Name]

129+splitDots name =

130+ Utf8.split 0x2E {- . -} name

131+

132+

133+

134+-- GET KERNEL

135+

136+

137+getKernel :: Name -> Name

138+getKernel name@(Utf8.Utf8 ba#) =

139+ assert (isKernel name)

140+ (

141+ runST

142+ (

143+ let

144+ !size# = sizeofByteArray# ba# -# 11#

145+ in

146+ ST $ \s ->

147+ case newByteArray# size# s of

148+ (# s, mba# #) ->

149+ case copyByteArray# ba# 11# mba# 0# size# s of

150+ s ->

151+ case unsafeFreezeByteArray# mba# s of

152+ (# s, ba# #) -> (# s, Utf8.Utf8 ba# #)

153+ )

154+ )

155+

156+

157+

158+-- STARTS WITH

159+

160+

161+isKernel :: Name -> Bool

162+isKernel = Utf8.startsWith prefix_kernel

163+

164+isNumberType :: Name -> Bool

165+isNumberType = Utf8.startsWith prefix_number

166+

167+isComparableType :: Name -> Bool

168+isComparableType = Utf8.startsWith prefix_comparable

169+

170+isAppendableType :: Name -> Bool

171+isAppendableType = Utf8.startsWith prefix_appendable

172+

173+isCompappendType :: Name -> Bool

174+isCompappendType = Utf8.startsWith prefix_compappend

175+

176+{-# NOINLINE prefix_kernel #-}

177+prefix_kernel :: Name

178+prefix_kernel = fromChars "Elm.Kernel."

179+

180+{-# NOINLINE prefix_number #-}

181+prefix_number :: Name

182+prefix_number = fromChars "number"

183+

184+{-# NOINLINE prefix_comparable #-}

185+prefix_comparable :: Name

186+prefix_comparable = fromChars "comparable"

187+

188+{-# NOINLINE prefix_appendable #-}

189+prefix_appendable :: Name

190+prefix_appendable = fromChars "appendable"

191+

192+{-# NOINLINE prefix_compappend #-}

193+prefix_compappend :: Name

194+prefix_compappend = fromChars "compappend"

195+

196+

197+

198+-- FROM VAR INDEX

199+

200+

201+fromVarIndex :: Int -> Name

202+fromVarIndex n =

203+ runST

204+ (

205+ do let !size = 2 + getIndexSize n

206+ mba <- newByteArray size

207+ writeWord8 mba 0 0x5F {- _ -}

208+ writeWord8 mba 1 0x76 {- v -}

209+ writeDigitsAtEnd mba size n

210+ freeze mba

211+ )

212+

213+

214+{-# INLINE getIndexSize #-}

215+getIndexSize :: Int -> Int

216+getIndexSize n

217+ | n < 10 = 1

218+ | n < 100 = 2

219+ | True = ceiling (logBase 10 (fromIntegral n + 1) :: Float)

220+

221+

222+

223+writeDigitsAtEnd :: MBA s -> Int -> Int -> ST s ()

224+writeDigitsAtEnd !mba !oldOffset !n =

225+ do let (q,r) = quotRem n 10

226+ let !newOffset = oldOffset - 1

227+ writeWord8 mba newOffset (0x30 + fromIntegral r)

228+ if q <= 0

229+ then return ()

230+ else writeDigitsAtEnd mba newOffset q

231+

232+

233+

234+-- FROM TYPE VARIABLE

235+

236+

237+fromTypeVariable :: Name -> Int -> Name

238+fromTypeVariable name@(Utf8.Utf8 ba#) index =

239+ if index <= 0 then

240+ name

241+ else

242+ let

243+ len# = sizeofByteArray# ba#

244+ end# = indexWord8Array# ba# (len# -# 1#)

245+ in

246+ if isTrue# (leWord# 0x30## end#) && isTrue# (leWord# end# 0x39##) then

247+ runST

248+ (

249+ do let !size = I# len# + 1 + getIndexSize index

250+ mba <- newByteArray size

251+ copyToMBA name mba

252+ writeWord8 mba (I# len#) 0x5F {- _ -}

253+ writeDigitsAtEnd mba size index

254+ freeze mba

255+ )

256+ else

257+ runST

258+ (

259+ do let !size = I# len# + getIndexSize index

260+ mba <- newByteArray size

261+ copyToMBA name mba

262+ writeDigitsAtEnd mba size index

263+ freeze mba

264+ )

265+

266+

267+

268+-- FROM TYPE VARIABLE SCHEME

269+

270+

271+fromTypeVariableScheme :: Int -> Name

272+fromTypeVariableScheme scheme =

273+ runST

274+ (

275+ if scheme < 26 then

276+ do mba <- newByteArray 1

277+ writeWord8 mba 0 (0x61 + fromIntegral scheme)

278+ freeze mba

279+ else

280+ do let (extra, letter) = quotRem scheme 26

281+ let !size = 1 + getIndexSize extra

282+ mba <- newByteArray size

283+ writeWord8 mba 0 (0x61 + fromIntegral letter)

284+ writeDigitsAtEnd mba size extra

285+ freeze mba

286+ )

287+

288+

289+

290+-- FROM MANY NAMES

291+--

292+-- Creating a unique name by combining all the subnames can create names

293+-- longer than 256 bytes relatively easily. So instead, the first given name

294+-- (e.g. foo) is prefixed chars that are valid in JS but not Elm (e.g. _M$foo)

295+--

296+-- This should be a unique name since 0.19 disallows shadowing. It would not

297+-- be possible for multiple top-level cycles to include values with the same

298+-- name, so the important thing is to make the cycle name distinct from the

299+-- normal name. Same logic for destructuring patterns like (x,y)

300+

301+

302+fromManyNames :: [Name] -> Name

303+fromManyNames names =

304+ case names of

305+ [] ->

306+ blank

307+ -- NOTE: this case is needed for (let _ = Debug.log "x" x in ...)

308+ -- but maybe unused patterns should be stripped out instead

309+

310+ Utf8.Utf8 ba# : _ ->

311+ let

312+ len# = sizeofByteArray# ba#

313+ in

314+ runST

315+ (

316+ ST $ \s ->

317+ case newByteArray# (len# +# 3#) s of

318+ (# s, mba# #) ->

319+ case writeWord8Array# mba# 0# 0x5F## {-_-} s of

320+ s ->

321+ case writeWord8Array# mba# 1# 0x4D## {-M-} s of

322+ s ->

323+ case writeWord8Array# mba# 2# 0x24## {-$-} s of

324+ s ->

325+ case copyByteArray# ba# 0# mba# 3# len# s of

326+ s ->

327+ case unsafeFreezeByteArray# mba# s of

328+ (# s, ba# #) -> (# s, Utf8.Utf8 ba# #)

329+ )

330+

331+

332+{-# NOINLINE blank #-}

333+blank :: Name

334+blank =

335+ fromWords [0x5F,0x4D,0x24] {-_M$-}

336+

337+

338+

339+-- FROM WORDS

340+

341+

342+fromWords :: [Word8] -> Name

343+fromWords words =

344+ runST

345+ (

346+ do mba <- newByteArray (List.length words)

347+ writeWords mba 0 words

348+ freeze mba

349+ )

350+

351+

352+writeWords :: MBA s -> Int -> [Word8] -> ST s ()

353+writeWords !mba !i words =

354+ case words of

355+ [] ->

356+ return ()

357+

358+ w:ws ->

359+ do writeWord8 mba i w

360+ writeWords mba (i+1) ws

361+

362+

363+

364+-- SEP BY

365+

366+

367+sepBy :: Word8 -> Name -> Name -> Name

368+sepBy (W8# sep#) (Utf8.Utf8 ba1#) (Utf8.Utf8 ba2#) =

369+ let

370+ !len1# = sizeofByteArray# ba1#

371+ !len2# = sizeofByteArray# ba2#

372+ in

373+ runST

374+ (

375+ ST $ \s ->

376+ case newByteArray# (len1# +# len2# +# 1#) s of

377+ (# s, mba# #) ->

378+ case copyByteArray# ba1# 0# mba# 0# len1# s of

379+ s ->

380+ case writeWord8Array# mba# len1# sep# s of

381+ s ->

382+ case copyByteArray# ba2# 0# mba# (len1# +# 1#) len2# s of

383+ s ->

384+ case unsafeFreezeByteArray# mba# s of

385+ (# s, ba# #) -> (# s, Utf8.Utf8 ba# #)

386+ )

387+

388+

389+

390+-- PRIMITIVES

391+

392+

393+data MBA s =

394+ MBA# (MutableByteArray# s)

395+

396+

397+{-# INLINE newByteArray #-}

398+newByteArray :: Int -> ST s (MBA s)

399+newByteArray (I# len#) =

400+ ST $ \s ->

401+ case newByteArray# len# s of

402+ (# s, mba# #) -> (# s, MBA# mba# #)

403+

404+

405+{-# INLINE freeze #-}

406+freeze :: MBA s -> ST s Name

407+freeze (MBA# mba#) =

408+ ST $ \s ->

409+ case unsafeFreezeByteArray# mba# s of

410+ (# s, ba# #) -> (# s, Utf8.Utf8 ba# #)

411+

412+

413+{-# INLINE writeWord8 #-}

414+writeWord8 :: MBA s -> Int -> Word8 -> ST s ()

415+writeWord8 (MBA# mba#) (I# offset#) (W8# w#) =

416+ ST $ \s ->

417+ case writeWord8Array# mba# offset# w# s of

418+ s -> (# s, () #)

419+

420+

421+{-# INLINE copyToMBA #-}

422+copyToMBA :: Name -> MBA s -> ST s ()

423+copyToMBA (Utf8.Utf8 ba#) (MBA# mba#) =

424+ ST $ \s ->

425+ case copyByteArray# ba# 0# mba# 0# (sizeofByteArray# ba#) s of

426+ s -> (# s, () #)

427+

428+

429+

430+-- COMMON NAMES

431+

432+

433+{-# NOINLINE int #-}

434+int :: Name

435+int = fromChars "Int"

436+

437+

438+{-# NOINLINE float #-}

439+float :: Name

440+float = fromChars "Float"

441+

442+

443+{-# NOINLINE bool #-}

444+bool :: Name

445+bool = fromChars "Bool"

446+

447+

448+{-# NOINLINE char #-}

449+char :: Name

450+char = fromChars "Char"

451+

452+

453+{-# NOINLINE string #-}

454+string :: Name

455+string = fromChars "String"

456+

457+

458+{-# NOINLINE maybe #-}

459+maybe :: Name

460+maybe = fromChars "Maybe"

461+

462+

463+{-# NOINLINE result #-}

464+result :: Name

465+result = fromChars "Result"

466+

467+

468+{-# NOINLINE list #-}

469+list :: Name

470+list = fromChars "List"

471+

472+

473+{-# NOINLINE array #-}

474+array :: Name

475+array = fromChars "Array"

476+

477+

478+{-# NOINLINE dict #-}

479+dict :: Name

480+dict = fromChars "Dict"

481+

482+

483+{-# NOINLINE tuple #-}

484+tuple :: Name

485+tuple = fromChars "Tuple"

486+

487+

488+{-# NOINLINE jsArray #-}

489+jsArray :: Name

490+jsArray = fromChars "JsArray"

491+

492+

493+{-# NOINLINE task #-}

494+task :: Name

495+task = fromChars "Task"

496+

497+

498+{-# NOINLINE router #-}

499+router :: Name

500+router = fromChars "Router"

501+

502+

503+{-# NOINLINE cmd #-}

504+cmd :: Name

505+cmd = fromChars "Cmd"

506+

507+

508+{-# NOINLINE sub #-}

509+sub :: Name

510+sub = fromChars "Sub"

511+

512+

513+{-# NOINLINE platform #-}

514+platform :: Name

515+platform = fromChars "Platform"

516+

517+

518+{-# NOINLINE virtualDom #-}

519+virtualDom :: Name

520+virtualDom = fromChars "VirtualDom"

521+

522+

523+{-# NOINLINE shader #-}

524+shader :: Name

525+shader = fromChars "Shader"

526+

527+

528+{-# NOINLINE debug #-}

529+debug :: Name

530+debug = fromChars "Debug"

531+

532+

533+{-# NOINLINE debugger #-}

534+debugger :: Name

535+debugger = fromChars "Debugger"

536+

537+

538+{-# NOINLINE bitwise #-}

539+bitwise :: Name

540+bitwise = fromChars "Bitwise"

541+

542+

543+{-# NOINLINE basics #-}

544+basics :: Name

545+basics = fromChars "Basics"

546+

547+

548+{-# NOINLINE utils #-}

549+utils :: Name

550+utils = fromChars "Utils"

551+

552+

553+{-# NOINLINE negate #-}

554+negate :: Name

555+negate = fromChars "negate"

556+

557+

558+{-# NOINLINE true #-}

559+true :: Name

560+true = fromChars "True"

561+

562+

563+{-# NOINLINE false #-}

564+false :: Name

565+false = fromChars "False"

566+

567+

568+{-# NOINLINE value #-}

569+value :: Name

570+value = fromChars "Value"

571+

572+

573+{-# NOINLINE node #-}

574+node :: Name

575+node = fromChars "Node"

576+

577+

578+{-# NOINLINE program #-}

579+program :: Name

580+program = fromChars "Program"

581+

582+

583+{-# NOINLINE _main #-}

584+_main :: Name

585+_main = fromChars "main"

586+

587+

588+{-# NOINLINE _Main #-}

589+_Main :: Name

590+_Main = fromChars "Main"

591+

592+

593+{-# NOINLINE dollar #-}

594+dollar :: Name

595+dollar = fromChars "$"

596+

597+

598+{-# NOINLINE identity #-}

599+identity :: Name

600+identity = fromChars "identity"

601+

602+

603+{-# NOINLINE replModule #-}

604+replModule :: Name

605+replModule = fromChars "Elm_Repl"

606+

607+

608+{-# NOINLINE replValueToPrint #-}

609+replValueToPrint :: Name

610+replValueToPrint = fromChars "repl_input_value_"

compiler/src/Data/NonEmptyList.hsnew file+78

@@ -0,0 +1,78 @@

1+module Data.NonEmptyList

2+ ( List(..)

3+ , singleton

4+ , toList

5+ , sortBy

6+ )

7+ where

8+

9+

10+import Control.Monad (liftM2)

11+import Data.Binary (Binary, get, put)

12+import qualified Data.List as List

13+

14+

15+

16+-- LIST

17+

18+

19+data List a =

20+ List a [a]

21+

22+

23+singleton :: a -> List a

24+singleton a =

25+ List a []

26+

27+

28+toList :: List a -> [a]

29+toList (List x xs) =

30+ x:xs

31+

32+

33+

34+-- INSTANCES

35+

36+

37+instance Functor List where

38+ fmap func (List x xs) = List (func x) (map func xs)

39+

40+

41+instance Traversable List where

42+ traverse func (List x xs) = List <$> func x <*> traverse func xs

43+

44+

45+instance Foldable List where

46+ foldr step state (List x xs) = step x (foldr step state xs)

47+ foldl step state (List x xs) = foldl step (step state x) xs

48+ foldl1 step (List x xs) = foldl step x xs

49+

50+

51+

52+-- SORT BY

53+

54+

55+sortBy :: (Ord b) => (a -> b) -> List a -> List a

56+sortBy toRank (List x xs) =

57+ let

58+ comparison a b =

59+ compare (toRank a) (toRank b)

60+ in

61+ case List.sortBy comparison xs of

62+ [] ->

63+ List x []

64+

65+ y:ys ->

66+ case comparison x y of

67+ LT -> List x (y:ys)

68+ EQ -> List x (y:ys)

69+ GT -> List y (List.insertBy comparison x ys)

70+

71+

72+

73+-- BINARY

74+

75+

76+instance (Binary a) => Binary (List a) where

77+ put (List x xs) = put x >> put xs

78+ get = liftM2 List get get

compiler/src/Data/OneOrMore.hsnew file+99

This diff is too big to show here.

compiler/src/Data/Utf8.hsnew file+618

This diff is too big to show here.

compiler/src/Elm/Compiler/Imports.hsnew file+62

This diff is too big to show here.

compiler/src/Elm/Compiler/Type.hsnew file+194

This diff is too big to show here.

compiler/src/Elm/Compiler/Type/Extract.hsnew file+285

This diff is too big to show here.

compiler/src/Elm/Constraint.hsnew file+260

This diff is too big to show here.

compiler/src/Elm/Docs.hsnew file+587

This diff is too big to show here.

compiler/src/Elm/Float.hsnew file+51

This diff is too big to show here.

compiler/src/Elm/Interface.hsnew file+254

This diff is too big to show here.

compiler/src/Elm/Kernel.hsnew file+365

This diff is too big to show here.

compiler/src/Elm/Licenses.hsnew file+185

This diff is too big to show here.

compiler/src/Elm/Magnitude.hsnew file+24

This diff is too big to show here.

compiler/src/Elm/ModuleName.hsnew file+283

This diff is too big to show here.

compiler/src/Elm/Package.hsnew file+374

This diff is too big to show here.

compiler/src/Elm/String.hsnew file+133

This diff is too big to show here.

compiler/src/Elm/Version.hsnew file+196

This diff is too big to show here.

compiler/src/Generate/Html.hsnew file+54

This diff is too big to show here.

compiler/src/Generate/JavaScript.hsnew file+590

This diff is too big to show here.

compiler/src/Generate/JavaScript/Builder.hsnew file+530

This diff is too big to show here.

compiler/src/Generate/JavaScript/Expression.hsnew file+1070

This diff is too big to show here.

compiler/src/Generate/JavaScript/Functions.hsnew file+95

This diff is too big to show here.

compiler/src/Generate/JavaScript/Name.hsnew file+261

This diff is too big to show here.

compiler/src/Generate/Mode.hsnew file+63

This diff is too big to show here.

compiler/src/Json/Decode.hsnew file+799

This diff is too big to show here.

compiler/src/Json/Encode.hsnew file+310

This diff is too big to show here.

compiler/src/Json/String.hsnew file+192

This diff is too big to show here.

compiler/src/Nitpick/Debug.hsnew file+87

This diff is too big to show here.

compiler/src/Nitpick/PatternMatches.hsnew file+653

This diff is too big to show here.

compiler/src/Optimize/Case.hsnew file+161

This diff is too big to show here.

compiler/src/Optimize/DecisionTree.hsnew file+637

This diff is too big to show here.

compiler/src/Optimize/Expression.hsnew file+490

This diff is too big to show here.

compiler/src/Optimize/Module.hsnew file+369

This diff is too big to show here.

compiler/src/Optimize/Names.hsnew file+173

This diff is too big to show here.

compiler/src/Optimize/Port.hsnew file+327

This diff is too big to show here.

compiler/src/Parse/Declaration.hsnew file+266

This diff is too big to show here.

compiler/src/Parse/Expression.hsnew file+577

This diff is too big to show here.

compiler/src/Parse/Keyword.hsnew file+265

This diff is too big to show here.

compiler/src/Parse/Module.hsnew file+487

This diff is too big to show here.

compiler/src/Parse/Number.hsnew file+305

This diff is too big to show here.

compiler/src/Parse/Pattern.hsnew file+279

This diff is too big to show here.

compiler/src/Parse/Primitives.hsnew file+404

This diff is too big to show here.

compiler/src/Parse/Shader.hsnew file+181

This diff is too big to show here.

compiler/src/Parse/Space.hsnew file+273

This diff is too big to show here.

compiler/src/Parse/String.hsnew file+343

This diff is too big to show here.

compiler/src/Parse/Symbol.hsnew file+79

This diff is too big to show here.

compiler/src/Parse/Type.hsnew file+203

This diff is too big to show here.

compiler/src/Parse/Variable.hsnew file+387

This diff is too big to show here.

compiler/src/Reporting/Annotation.hsnew file+103

This diff is too big to show here.

compiler/src/Reporting/Doc.hsnew file+431

This diff is too big to show here.

compiler/src/Reporting/Error.hsnew file+210

This diff is too big to show here.

compiler/src/Reporting/Error/Canonicalize.hsnew file+1261

This diff is too big to show here.

compiler/src/Reporting/Error/Docs.hsnew file+250

This diff is too big to show here.

compiler/src/Reporting/Error/Import.hsnew file+162

This diff is too big to show here.

compiler/src/Reporting/Error/Json.hsnew file+344

This diff is too big to show here.

compiler/src/Reporting/Error/Main.hsnew file+124

This diff is too big to show here.

compiler/src/Reporting/Error/Pattern.hsnew file+195

This diff is too big to show here.

compiler/src/Reporting/Error/Syntax.hsnew file+5848

This diff is too big to show here.

compiler/src/Reporting/Error/Type.hsnew file+1613

This diff is too big to show here.

compiler/src/Reporting/Render/Code.hsnew file+288

This diff is too big to show here.

compiler/src/Reporting/Render/Type.hsnew file+257

This diff is too big to show here.

compiler/src/Reporting/Render/Type/Localizer.hsnew file+120

This diff is too big to show here.

compiler/src/Reporting/Report.hsnew file+22

This diff is too big to show here.

compiler/src/Reporting/Result.hsnew file+129

This diff is too big to show here.

compiler/src/Reporting/Suggest.hsnew file+52

This diff is too big to show here.

compiler/src/Reporting/Warning.hsnew file+104

This diff is too big to show here.

compiler/src/Type/Constrain/Expression.hsnew file+746

This diff is too big to show here.

compiler/src/Type/Constrain/Module.hsnew file+183

This diff is too big to show here.

compiler/src/Type/Constrain/Pattern.hsnew file+237

This diff is too big to show here.

compiler/src/Type/Error.hsnew file+589

This diff is too big to show here.

compiler/src/Type/Instantiate.hsnew file+77

This diff is too big to show here.

compiler/src/Type/Occurs.hsnew file+80

This diff is too big to show here.

compiler/src/Type/Solve.hsnew file+727

This diff is too big to show here.

compiler/src/Type/Type.hsnew file+726

This diff is too big to show here.

compiler/src/Type/Unify.hsnew file+695

This diff is too big to show here.

compiler/src/Type/UnionFind.hsnew file+172

This diff is too big to show here.

docs/elm.json/application.mdnew file+69

This diff is too big to show here.

docs/elm.json/package.mdnew file+93

This diff is too big to show here.

docs/upgrade-instructions/0.16.mdnew file+174

This diff is too big to show here.

docs/upgrade-instructions/0.17.mdnew file+275

This diff is too big to show here.

docs/upgrade-instructions/0.18.mdnew file+161

This diff is too big to show here.

docs/upgrade-instructions/0.19.0.mdnew file+164

This diff is too big to show here.

docs/upgrade-instructions/0.19.1.mdnew file+60

This diff is too big to show here.

changelog.md → docs/upgrade-instructions/earlier.mdrenamed+171−18

This diff is too big to show here.

elm.cabalnew file+238

This diff is too big to show here.

hints/bad-recursion.mdnew file+133

This diff is too big to show here.

hints/comparing-custom-types.mdnew file+98

This diff is too big to show here.

hints/comparing-records.mdnew file+85

This diff is too big to show here.

hints/implicit-casts.mdnew file+50

This diff is too big to show here.

hints/import-cycles.mdnew file+184

This diff is too big to show here.

hints/imports.mdnew file+126

This diff is too big to show here.

hints/infinite-type.mdnew file+42

This diff is too big to show here.

hints/init.mdnew file+55

This diff is too big to show here.

hints/missing-patterns.mdnew file+139

This diff is too big to show here.

hints/optimize.mdnew file+59

This diff is too big to show here.

hints/port-modules.mdnew file+32

This diff is too big to show here.

hints/recursive-alias.mdnew file+162

This diff is too big to show here.

hints/repl.mdnew file+73

This diff is too big to show here.

hints/shadowing.mdnew file+70

This diff is too big to show here.

hints/tuples.mdnew file+19

This diff is too big to show here.

hints/type-annotations.mdnew file+60

This diff is too big to show here.

installers/README.mdnew file+32

This diff is too big to show here.

installers/linux/Dockerfilenew file+39

This diff is too big to show here.

installers/linux/README.mdnew file+93

This diff is too big to show here.

installers/mac/Distribution.xmlnew file+33

This diff is too big to show here.

installers/mac/README.mdnew file+93

This diff is too big to show here.

installers/mac/Resources/en.lproj/conclusion.rtfnew file+16

This diff is too big to show here.

installers/mac/Resources/en.lproj/welcome.rtfnew file+12

This diff is too big to show here.

installers/mac/helper-scripts/elm-startup.shnew file+3

This diff is too big to show here.

installers/mac/helper-scripts/uninstall.shnew file+21

This diff is too big to show here.

installers/mac/make-installer.shnew file+81

This diff is too big to show here.

installers/mac/postinstallnew file+5

This diff is too big to show here.

installers/mac/preinstallnew file+18

This diff is too big to show here.

installers/npm/.gitignorenew file+1

This diff is too big to show here.

installers/npm/.npmignorenew file+3

This diff is too big to show here.

installers/npm/PUBLISHING.mdnew file+59

This diff is too big to show here.

installers/npm/README.mdnew file+45

This diff is too big to show here.

installers/npm/bin/elmnew file+54

This diff is too big to show here.

installers/npm/download.jsnew file+114

This diff is too big to show here.

installers/npm/install.jsnew file+4

This diff is too big to show here.

installers/npm/package.jsonnew file+42

This diff is too big to show here.

installers/npm/troubleshooting.mdnew file+76

This diff is too big to show here.

installers/win/CreateInternetShortcut.nshnew file+5

This diff is too big to show here.

installers/win/Nsisfile.nsinew file+264

This diff is too big to show here.

installers/win/README.mdnew file+24

This diff is too big to show here.

installers/win/inst.datnew file+6

This diff is too big to show here.

installers/win/logo.iconew file

Binary file not shown.

installers/win/make_installer.cmdnew file+18

This diff is too big to show here.

installers/win/removefrompath.vbsnew file+17

This diff is too big to show here.

installers/win/uninst.datnew file+6

This diff is too big to show here.

installers/win/updatepath.vbsnew file+14

This diff is too big to show here.

installers/win/welcome.bmpnew file

Binary file not shown.

libraries/Basics.elmdeleted−381

This diff is too big to show here.

libraries/Bitwise.elmdeleted−74

This diff is too big to show here.

libraries/Char.elmdeleted−62

This diff is too big to show here.

libraries/Color.elmdeleted−174

This diff is too big to show here.

libraries/Date.elmdeleted−76

This diff is too big to show here.

libraries/Debug.elmdeleted−19

This diff is too big to show here.

libraries/Dict.elmdeleted−353

This diff is too big to show here.

libraries/Either.elmdeleted−90

This diff is too big to show here.

libraries/Graphics/Collage.elmdeleted−261

This diff is too big to show here.

libraries/Graphics/Element.elmdeleted−315

This diff is too big to show here.

libraries/Graphics/Input.elmdeleted−178

This diff is too big to show here.

libraries/Graphics/Input/Field.elmdeleted−170

This diff is too big to show here.

libraries/Http.elmdeleted−54

This diff is too big to show here.

libraries/JavaScript.elmdeleted−74

This diff is too big to show here.

libraries/JavaScript/Experimental.elmdeleted−41

This diff is too big to show here.

libraries/Json.elmdeleted−134

This diff is too big to show here.

libraries/Keyboard.elmdeleted−75

This diff is too big to show here.

libraries/List.elmdeleted−268

This diff is too big to show here.

libraries/Maybe.elmdeleted−65

This diff is too big to show here.

libraries/Mouse.elmdeleted−36

This diff is too big to show here.

libraries/Native/Basics.jsdeleted−62

This diff is too big to show here.

libraries/Native/Bitwise.jsdeleted−25

This diff is too big to show here.

libraries/Native/Char.jsdeleted−29

This diff is too big to show here.

libraries/Native/Color.jsdeleted−76

This diff is too big to show here.

libraries/Native/Date.jsdeleted−34

This diff is too big to show here.

libraries/Native/Debug.jsdeleted−24

This diff is too big to show here.

libraries/Native/Error.jsdeleted−32

This diff is too big to show here.

libraries/Native/Function.jsdeleted−101

This diff is too big to show here.

libraries/Native/Graphics/Collage.jsdeleted−23

This diff is too big to show here.

libraries/Native/Graphics/Input.jsdeleted−407

This diff is too big to show here.

libraries/Native/JavaScript.jsdeleted−100

This diff is too big to show here.

libraries/Native/Json.jsdeleted−72

This diff is too big to show here.

libraries/Native/List.jsdeleted−335

This diff is too big to show here.

libraries/Native/Ports.jsdeleted−83

This diff is too big to show here.

libraries/Native/Regex.jsdeleted−103

This diff is too big to show here.

libraries/Native/Show.jsdeleted−113

This diff is too big to show here.

libraries/Native/Signal/Http.jsdeleted−64

This diff is too big to show here.

libraries/Native/Signal/Keyboard.jsdeleted−117

This diff is too big to show here.

libraries/Native/Signal/Mouse.jsdeleted−47

This diff is too big to show here.

libraries/Native/Signal/Random.jsdeleted−39

This diff is too big to show here.

libraries/Native/Signal/Signal.jsdeleted−226

This diff is too big to show here.

libraries/Native/Signal/Time.jsdeleted−65

This diff is too big to show here.

libraries/Native/Signal/Touch.jsdeleted−152

This diff is too big to show here.

libraries/Native/Signal/WebSocket.jsdeleted−38

This diff is too big to show here.

libraries/Native/Signal/Window.jsdeleted−56

This diff is too big to show here.

libraries/Native/String.jsdeleted−252

This diff is too big to show here.

libraries/Native/Text.jsdeleted−166

This diff is too big to show here.

libraries/Native/Trampoline.jsdeleted−24

This diff is too big to show here.

libraries/Native/Transform2D.jsdeleted−99

This diff is too big to show here.

libraries/Native/Utils.jsdeleted−229

This diff is too big to show here.

libraries/Random.elmdeleted−30

This diff is too big to show here.

libraries/Regex.elmdeleted−126

This diff is too big to show here.

libraries/Set.elmdeleted−90

This diff is too big to show here.

libraries/Signal.elmdeleted−175

This diff is too big to show here.

libraries/String.elmdeleted−338

This diff is too big to show here.

libraries/Text.elmdeleted−222

This diff is too big to show here.

libraries/Time.elmdeleted−99

This diff is too big to show here.

libraries/Touch.elmdeleted−34

This diff is too big to show here.

libraries/Trampoline.elmdeleted−49

This diff is too big to show here.

libraries/Transform2D.elmdeleted−92

This diff is too big to show here.

libraries/WebSocket.elmdeleted−22

This diff is too big to show here.

libraries/Window.elmdeleted−27

This diff is too big to show here.

libraries/elm_dependencies.jsondeleted−42

This diff is too big to show here.

reactor/assets/favicon.iconew file

Binary file not shown.

reactor/assets/source-code-pro.ttfnew file

Binary file not shown.

reactor/assets/source-sans-pro.ttfnew file

Binary file not shown.

reactor/assets/styles.cssnew file+157

This diff is too big to show here.

reactor/check.pynew file+48

This diff is too big to show here.

reactor/elm.jsonnew file+31

This diff is too big to show here.

reactor/src/Deps.elmnew file+1210

This diff is too big to show here.

reactor/src/Errors.elmnew file+207

This diff is too big to show here.

reactor/src/Index.elmnew file+280

This diff is too big to show here.

reactor/src/Index/Icon.elmnew file+111

This diff is too big to show here.

reactor/src/Index/Navigator.elmnew file+63

This diff is too big to show here.

reactor/src/Index/Skeleton.elmnew file+61

This diff is too big to show here.

reactor/src/NotFound.elmnew file+29

This diff is too big to show here.

reactor/src/mock.txtnew file+33

This diff is too big to show here.

roadmap.mdnew file+29

This diff is too big to show here.

runtime/HotSwap.jsdeleted−42

This diff is too big to show here.

runtime/Init.jsdeleted−240

This diff is too big to show here.

runtime/Render/Collage.jsdeleted−355

This diff is too big to show here.

runtime/Render/Element.jsdeleted−405

This diff is too big to show here.

runtime/Render/Utils.jsdeleted−45

This diff is too big to show here.

runtime/Utils.jsdeleted−54

This diff is too big to show here.

server/LICENSEdeleted−30

This diff is too big to show here.

server/Server.hsdeleted−127

This diff is too big to show here.

server/Setup.hsdeleted−2

This diff is too big to show here.

server/elm-server.cabaldeleted−41

This diff is too big to show here.

terminal/impl/Terminal.hsnew file+375

This diff is too big to show here.

terminal/impl/Terminal/Chomp.hsnew file+514

This diff is too big to show here.

terminal/impl/Terminal/Error.hsnew file+457

This diff is too big to show here.

terminal/impl/Terminal/Helpers.hsnew file+148

This diff is too big to show here.

terminal/impl/Terminal/Internal.hsnew file+93

This diff is too big to show here.

terminal/src/Bump.hsnew file+169

This diff is too big to show here.

terminal/src/Develop.hsnew file+256

This diff is too big to show here.

terminal/src/Develop/Generate/Help.hsnew file+65

This diff is too big to show here.

terminal/src/Develop/Generate/Index.hsnew file+213

This diff is too big to show here.

terminal/src/Develop/Socket.hsnew file+43

This diff is too big to show here.

terminal/src/Develop/StaticFiles.hsnew file+123

This diff is too big to show here.

terminal/src/Develop/StaticFiles/Build.hsnew file+73

This diff is too big to show here.

terminal/src/Diff.hsnew file+359

This diff is too big to show here.

terminal/src/Init.hsnew file+104

This diff is too big to show here.

terminal/src/Install.hsnew file+425

This diff is too big to show here.

terminal/src/Main.hsnew file+338

This diff is too big to show here.

terminal/src/Make.hsnew file+319

This diff is too big to show here.

terminal/src/Publish.hsnew file+540

This diff is too big to show here.

terminal/src/Repl.hsnew file+726

This diff is too big to show here.

tests/Main.hsdeleted−11

This diff is too big to show here.

tests/Tests/Compiler.hsdeleted−45

This diff is too big to show here.

tests/Tests/Property.hsdeleted−55

This diff is too big to show here.

tests/Tests/Property/Arbitrary.hsdeleted−128

This diff is too big to show here.

tests/test-files/bad/BBTArgsdeleted−1

This diff is too big to show here.

tests/test-files/bad/InfiniteType.elmdeleted−2

This diff is too big to show here.

tests/test-files/bad/NonElementMain.elmdeleted−2

This diff is too big to show here.

tests/test-files/bad/Strings/ExtraClose.elmdeleted−4

This diff is too big to show here.

tests/test-files/good/AliasSubstitution.elmdeleted−6

This diff is too big to show here.

tests/test-files/good/NoExpressions.elmdeleted−3

This diff is too big to show here.

tests/test-files/good/Otherwise.elmdeleted−5

This diff is too big to show here.

tests/test-files/good/Ports.elmdeleted−17

This diff is too big to show here.

tests/test-files/good/QuotesAndComments.elmdeleted−12

This diff is too big to show here.

tests/test-files/good/Soundness/Apply.elmdeleted−3

This diff is too big to show here.

tests/test-files/good/Soundness/ApplyAnnotated.elmdeleted−4

This diff is too big to show here.

tests/test-files/good/Soundness/Id.elmdeleted−3

This diff is too big to show here.

tests/test-files/good/Soundness/IdAnnotated.elmdeleted−4

This diff is too big to show here.

tests/test-files/good/Soundness/TrickyId.elmdeleted−2

This diff is too big to show here.

tests/test-files/good/Soundness/TrickyIdAnnotated.elmdeleted−3

This diff is too big to show here.

tests/test-files/good/Strings/Multiline.elmdeleted−6

This diff is too big to show here.

tests/test-files/good/Strings/MultilineNormal.elmdeleted−6

This diff is too big to show here.

tests/test-files/good/Unify/LockedVars.elmdeleted−6

This diff is too big to show here.

tests/test-files/good/Unify/NonHomogeneousRecords.elmdeleted−8

This diff is too big to show here.

worker/elm.cabalnew file+210

This diff is too big to show here.

worker/elm.jsonnew file+26

This diff is too big to show here.

worker/nginx.confnew file+22

This diff is too big to show here.

worker/outlines/compile/elm.jsonnew file+32

This diff is too big to show here.

worker/outlines/repl/elm.jsonnew file+19

This diff is too big to show here.

worker/src/Artifacts.hsnew file+155

This diff is too big to show here.

worker/src/Cors.hsnew file+48

This diff is too big to show here.

worker/src/Endpoint/Compile.hsnew file+323

This diff is too big to show here.

worker/src/Endpoint/Quotes.hsnew file+114

This diff is too big to show here.

worker/src/Endpoint/Repl.hsnew file+244

This diff is too big to show here.

worker/src/Errors.elmnew file+217

This diff is too big to show here.

worker/src/Main.hsnew file+73

This diff is too big to show here.