4b22dbb...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+5−9

@@ -1,12 +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

7+*~

8+travis.log

.travis.ymlnew file+28

@@ -0,0 +1,28 @@

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

Contributor Agreement.docxdeleted

Binary file not shown.

Elm.cabaldeleted−212

@@ -1,212 +0,0 @@

1−Name: Elm

2−Version: 0.10.0.2

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.txt

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: Language.Elm

34− Hs-Source-Dirs: compiler

35− other-modules: SourceSyntax.Declaration,

36− SourceSyntax.Expression,

37− SourceSyntax.Everything,

38− SourceSyntax.Helpers,

39− SourceSyntax.Literal,

40− SourceSyntax.Location,

41− SourceSyntax.Module,

42− SourceSyntax.Pattern,

43− SourceSyntax.PrettyPrint,

44− SourceSyntax.Type,

45− Generate.JavaScript,

46− Generate.Noscript,

47− Generate.Markdown,

48− Generate.Html,

49− Generate.Cases,

50− Transform.Canonicalize,

51− Transform.Check,

52− Transform.SortDefinitions,

53− Transform.Substitute,

54− Transform.Optimize,

55− Metadata.Prelude,

56− Initialize,

57− Parse.Binop,

58− Parse.Declaration,

59− Parse.Expression,

60− Parse.Helpers,

61− Parse.Literal,

62− Parse.Module,

63− Parse.Parse,

64− Parse.Pattern,

65− Parse.Type,

66− Type.Alias,

67− Type.Constrain.Declaration,

68− Type.Constrain.Expression,

69− Type.Constrain.Literal,

70− Type.Constrain.Pattern,

71− Type.Environment,

72− Type.ExtraChecks,

73− Type.Fragment,

74− Type.Inference,

75− Type.PrettyPrint,

76− Type.Solve,

77− Type.State,

78− Type.Type,

79− Type.Unify,

80− Paths_Elm

81−

82− Build-depends: base >=4.2 && <5,

83− binary,

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

85− blaze-markup == 0.5.1.*,

86− bytestring,

87− cmdargs,

88− containers >= 0.3,

89− directory,

90− filepath,

91− indents,

92− language-ecmascript < 1,

93− mtl >= 2,

94− pandoc >= 1.10,

95− parsec >= 3.1.1,

96− pretty,

97− transformers >= 0.2,

98− union-find,

99− uniplate

100−

101−Executable elm

102− Main-is: Compiler.hs

103− Hs-Source-Dirs: compiler

104− other-modules: SourceSyntax.Declaration,

105− SourceSyntax.Expression,

106− SourceSyntax.Everything,

107− SourceSyntax.Helpers,

108− SourceSyntax.Literal,

109− SourceSyntax.Location,

110− SourceSyntax.Module,

111− SourceSyntax.Pattern,

112− SourceSyntax.PrettyPrint,

113− SourceSyntax.Type,

114− Generate.JavaScript,

115− Generate.Noscript,

116− Generate.Markdown,

117− Generate.Html,

118− Generate.Cases,

119− Transform.Canonicalize,

120− Transform.Check,

121− Transform.SortDefinitions,

122− Transform.Substitute,

123− Transform.Optimize,

124− Metadata.Prelude,

125− Initialize,

126− Parse.Binop,

127− Parse.Declaration,

128− Parse.Expression,

129− Parse.Helpers,

130− Parse.Literal,

131− Parse.Module,

132− Parse.Parse,

133− Parse.Pattern,

134− Parse.Type,

135− Type.Alias,

136− Type.Constrain.Declaration,

137− Type.Constrain.Expression,

138− Type.Constrain.Literal,

139− Type.Constrain.Pattern,

140− Type.Environment,

141− Type.ExtraChecks,

142− Type.Fragment,

143− Type.Inference,

144− Type.PrettyPrint,

145− Type.Solve,

146− Type.State,

147− Type.Type,

148− Type.Unify,

149− Paths_Elm

150−

151− Build-depends: base >=4.2 && <5,

152− binary,

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

154− blaze-markup == 0.5.1.*,

155− bytestring,

156− cmdargs,

157− containers >= 0.3,

158− directory,

159− filepath,

160− indents,

161− language-ecmascript < 1,

162− mtl >= 2,

163− pandoc >= 1.10,

164− parsec >= 3.1.1,

165− pretty,

166− transformers >= 0.2,

167− union-find,

168− uniplate

169−

170−Executable elm-doc

171− Main-is: Docs.hs

172− Hs-Source-Dirs: compiler

173− other-modules: SourceSyntax.Declaration,

174− SourceSyntax.Everything,

175− SourceSyntax.Expression,

176− SourceSyntax.Helpers,

177− SourceSyntax.Literal,

178− SourceSyntax.Location,

179− SourceSyntax.Module,

180− SourceSyntax.Pattern,

181− SourceSyntax.PrettyPrint,

182− SourceSyntax.Type,

183− Parse.Binop,

184− Parse.Declaration,

185− Parse.Expression,

186− Parse.Helpers,

187− Parse.Literal,

188− Parse.Module,

189− Parse.Pattern,

190− Parse.Type

191−

192− Build-depends: aeson,

193− aeson-pretty,

194− base >=4.2 && <5,

195− binary,

196− bytestring,

197− cmdargs,

198− containers >= 0.3,

199− directory,

200− filepath,

201− indents,

202− mtl >= 2,

203− pandoc >= 1.10,

204− parsec >= 3.1.1,

205− pretty,

206− text

207−

208−Test-Suite test-elm

209− Type: exitcode-stdio-1.0

210− Hs-Source-Dirs: tests

211− Main-is: Main.hs

212− build-depends: base, directory, HTF

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−41

@@ -1,52 +1,22 @@

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

1+# Elm

22

3+A delightful language for reliable webapps.

34

4−## Install

5−

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

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

8−<br/>

9−**OS X 10.9** — follow

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

11−before continuing with the platform agnostic directions below.

12−

13−**Platform Agnostic** —

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

15−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/)

166

17− cabal update

18− cabal install elm

19− cabal install elm-server

207

21−## Use

8+<br>

229

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

24−

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

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

27−which you should append to your PATH variable.

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

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

30−

31−## My First Project

10+## Install

3211

33−Now we will create a simple Elm project.

34−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) ✨

3513

36− mkdir helloElm

37− cd helloElm

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

39− elm-server

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

4015

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

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

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

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

16+<br>

4517

46−#### Final Notes

18+## Help

4719

48−The `elm` package provides support for compilation of Elm code directly in Haskell.

49−Check it out [on Hackage](http://hackage.haskell.org/package/Elm) if you are interested.

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

5021

51−If you are stuck, email [the list](https://groups.google.com/forum/?fromgroups#!forum/elm-discuss)

52−or ask a question in the [#Elm IRC channel](http://webchat.freenode.net/?channels=elm).

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

Setup.hsdeleted−179

@@ -1,179 +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' "var Elm = {}; Elm.Native = {}; Elm.Native.Graphics = {};\n\

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

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

154− mapM_ (appendTo rts') elmos

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

156−

157−buildDocs :: LocalBuildInfo -> IO ()

158−buildDocs lbi = do

159− createDirectoryIfMissing True (rtsDir lbi)

160− let docs' = docs lbi

161− writeFile docs' "[\n"

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

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

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

165− sequence_ (addCommas appends)

166− appendFile docs' "\n]"

167−

168−getFiles ext dir = do

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

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

171− dirs = filter (not . hasExtension) contents

172− filess <- mapM (getFiles ext) dirs

173− return (files ++ concat filess)

174−

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

176−appendTo destination source = do

177− str <- readFile source

178− length str `seq` return ()

179− 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/Compiler.hsdeleted−214

@@ -1,214 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module Main where

3−

4−import Control.Monad

5−import qualified Data.Map as Map

6−import qualified Data.List as List

7−import qualified Data.Binary as Binary

8−import Data.Version (showVersion)

9−import System.Console.CmdArgs hiding (program)

10−import System.Directory

11−import System.Exit

12−import System.FilePath

13−import System.IO

14−import GHC.Conc

15−

16−import Text.Blaze.Html.Renderer.Pretty (renderHtml)

17−import qualified Data.ByteString.Lazy.Char8 as BS

18−import qualified Data.ByteString.Lazy as L

19−

20−import qualified Metadata.Prelude as Prelude

21−import qualified Transform.Canonicalize as Canonical

22−import SourceSyntax.Module

23−import Parse.Module (getModuleName)

24−import Initialize (buildFromSource, getSortedDependencies)

25−import Generate.JavaScript (jsModule)

26−import Generate.Html (createHtml, JSSource(..))

27−import Paths_Elm

28−

29−import SourceSyntax.PrettyPrint (pretty, variable)

30−import Text.PrettyPrint as P

31−import qualified Type.Type as Type

32−import qualified Type.Alias as Alias

33−

34−data Flags =

35− Flags { make :: Bool

36− , files :: [FilePath]

37− , runtime :: Maybe FilePath

38− , only_js :: Bool

39− , print_types :: Bool

40− , print_program :: Bool

41− , scripts :: [FilePath]

42− , no_prelude :: Bool

43− , cache_dir :: FilePath

44− , build_dir :: FilePath

45− , src_dir :: [FilePath]

46− }

47− deriving (Data,Typeable,Show,Eq)

48−

49−flags = Flags

50− { files = def &= args &= typ "FILES"

51− , make = False

52− &= help "automatically compile dependencies."

53− , only_js = False

54− &= help "Compile only to JavaScript."

55− , no_prelude = False

56− &= help "Do not import Prelude by default, used only when compiling standard libraries."

57− , scripts = [] &= typFile

58− &= help "Load JavaScript files in generated HTML. Files will be included in the given order."

59− , runtime = Nothing &= typFile

60− &= help "Specify a custom location for Elm's runtime system."

61− , cache_dir = "cache" &= typFile

62− &= help "Directory for files cached to make builds faster. Defaults to cache/ directory."

63− , build_dir = "build" &= typFile

64− &= help "Directory for generated HTML and JS files. Defaults to build/ directory."

65− , src_dir = ["."] &= typFile

66− &= help "Additional source directories besides project root. Searched when using --make"

67− , print_types = False

68− &= help "Print out infered types of top-level definitions."

69− , print_program = False

70− &= help "Print out an internal representation of a program."

71− } &= help "Compile Elm programs to HTML, CSS, and JavaScript."

72− &= helpArg [explicit, name "help", name "h"]

73− &= versionArg [explicit, name "version", name "v", summary (showVersion version)]

74− &= summary ("The Elm Compiler " ++ showVersion version ++ ", (c) Evan Czaplicki 2011-2013")

75−

76−main :: IO ()

77−main = do setNumCapabilities =<< getNumProcessors

78− compileArgs =<< cmdArgs flags

79−

80−compileArgs :: Flags -> IO ()

81−compileArgs flags =

82− case files flags of

83− [] -> putStrLn "Usage: elm [OPTIONS] [FILES]\nFor more help: elm --help"

84− fs -> mapM_ (build flags) fs

85−

86−

87−buildPath :: Flags -> FilePath -> String -> FilePath

88−buildPath flags filePath ext = build_dir flags </> replaceExtension filePath ext

89−

90−cachePath :: Flags -> FilePath -> String -> FilePath

91−cachePath flags filePath ext = cache_dir flags </> replaceExtension filePath ext

92−

93−elmo :: Flags -> FilePath -> FilePath

94−elmo flags filePath = cachePath flags filePath "elmo"

95−

96−elmi :: Flags -> FilePath -> FilePath

97−elmi flags filePath = cachePath flags filePath "elmi"

98−

99−

100−buildFile :: Flags -> Int -> Int -> Interfaces -> FilePath -> IO (String,ModuleInterface)

101−buildFile flags moduleNum numModules interfaces filePath =

102− do compiled <- alreadyCompiled

103− case compiled of

104− False -> compile

105− True -> do

106− handle <- openBinaryFile (elmi flags filePath) ReadMode

107− bits <- L.hGetContents handle

108− let info :: (String, ModuleInterface)

109− info = Binary.decode bits

110− L.length bits `seq` hClose handle

111− return info

112− where

113− alreadyCompiled :: IO Bool

114− alreadyCompiled = do

115− existsi <- doesFileExist (elmi flags filePath)

116− existso <- doesFileExist (elmo flags filePath)

117− if not existsi || not existso

118− then return False

119− else do tsrc <- getModificationTime filePath

120− tint <- getModificationTime (elmo flags filePath)

121− return (tsrc <= tint)

122−

123− number :: String

124− number = "[" ++ show moduleNum ++ " of " ++ show numModules ++ "]"

125−

126− compile :: IO (String,ModuleInterface)

127− compile = do

128− source <- readFile filePath

129− let name = case getModuleName source of

130− Just n -> n

131− Nothing -> "Main"

132− putStrLn $ concat [ number, " Compiling ", name

133− , replicate (max 1 (20 - length name)) ' '

134− , "( " ++ filePath ++ " )" ]

135−

136− createDirectoryIfMissing True (cache_dir flags)

137− createDirectoryIfMissing True (build_dir flags)

138− metaModule <-

139− case buildFromSource (no_prelude flags) interfaces source of

140− Left errors -> do

141− mapM print (List.intersperse (P.text " ") errors)

142− exitFailure

143− Right modul -> do

144− case print_program flags of

145− False -> return ()

146− True -> print . pretty $ program modul

147− return modul

148−

149− when (print_types flags) (printTypes interfaces metaModule)

150− let interface = Canonical.interface name $ ModuleInterface {

151− iTypes = types metaModule,

152− iAdts = datatypes metaModule,

153− iAliases = aliases metaModule,

154− iFixities = fixities metaModule

155− }

156− createDirectoryIfMissing True . dropFileName $ elmi flags filePath

157− handle <- openBinaryFile (elmi flags filePath) WriteMode

158− L.hPut handle (Binary.encode (name,interface))

159− hClose handle

160− writeFile (elmo flags filePath) (jsModule metaModule)

161− return (name,interface)

162−

163−printTypes interfaces metaModule = do

164− putStrLn ""

165− let rules = Alias.rules interfaces metaModule

166− forM_ (Map.toList $ types metaModule) $ \(n,t) -> do

167− print $ variable n <+> P.text ":" <+> pretty (Alias.realias rules t)

168− putStrLn ""

169−

170−getRuntime :: Flags -> IO FilePath

171−getRuntime flags =

172− case runtime flags of

173− Just fp -> return fp

174− Nothing -> getDataFileName "elm-runtime.js"

175−

176−build :: Flags -> FilePath -> IO ()

177−build flags rootFile = do

178− let noPrelude = no_prelude flags

179− files <- if make flags then getSortedDependencies (src_dir flags) noPrelude rootFile

180− else return [rootFile]

181− let ifaces = if noPrelude then Map.empty else Prelude.interfaces

182− (moduleName, interfaces) <- buildFiles flags (length files) ifaces "" files

183− js <- foldM appendToOutput BS.empty files

184−

185− (extension, code) <- case only_js flags of

186− True -> do

187− putStr "Generating JavaScript ... "

188− return ("js", js)

189− False -> do

190− putStr "Generating HTML ... "

191− rtsPath <- getRuntime flags

192− return ("html", BS.pack . renderHtml $

193− createHtml rtsPath (takeBaseName rootFile) (sources js) moduleName "")

194−

195− let targetFile = buildPath flags rootFile extension

196− createDirectoryIfMissing True (takeDirectory targetFile)

197− BS.writeFile targetFile code

198− putStrLn "Done"

199−

200− where

201− appendToOutput :: BS.ByteString -> FilePath -> IO BS.ByteString

202− appendToOutput js filePath =

203− do src <- BS.readFile (elmo flags filePath)

204− return (BS.append src js)

205−

206− sources js = map Link (scripts flags) ++ [ Source js ]

207−

208−

209−buildFiles :: Flags -> Int -> Interfaces -> String -> [FilePath] -> IO (String, Interfaces)

210−buildFiles _ _ interfaces moduleName [] = return (moduleName, interfaces)

211−buildFiles flags numModules interfaces _ (filePath:rest) = do

212− (name,interface) <- buildFile flags (numModules - length rest) numModules interfaces filePath

213− let interfaces' = Map.insert name interface interfaces

214− buildFiles flags numModules interfaces' name rest

compiler/Docs.hsdeleted−163

@@ -1,163 +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 Data.Aeson

12−import Data.Aeson.Encode.Pretty

13−import qualified Data.List as List

14−import qualified Data.Map as Map

15−import qualified Data.ByteString.Lazy as BS

16−import qualified Data.Text as Text

17−

18−import SourceSyntax.Helpers (isSymbol)

19−import SourceSyntax.Type (Type(..))

20−import SourceSyntax.Declaration (Declaration(..), Assoc(..))

21−import SourceSyntax.Expression (Def(..))

22−

23−import Text.Parsec hiding (newline,spaces)

24−import Parse.Declaration (alias,datatype,infixDecl)

25−import Parse.Expression (typeAnnotation)

26−import Parse.Helpers

27−import Parse.Module (moduleDef)

28−

29−data Flags = Flags

30− { files :: [FilePath] }

31− deriving (Data,Typeable,Show,Eq)

32−

33−defaultFlags = Flags

34− { files = def &= args &= typ "FILES"

35− } &= help "Generate documentation for Elm"

36− &= summary ("Generate documentation for Elm, (c) Evan Czaplicki")

37−

38−main = do

39− flags <- cmdArgs defaultFlags

40− mapM parseFile (files flags)

41−

42−config = Config { confIndent = 2, confCompare = keyOrder keys }

43− where

44− keys = ["name","document","comment","raw","aliases","datatypes"

45− ,"values","typeVariables","type","constructors"]

46−

47−parseFile path = do

48− source <- readFile path

49− case iParse docs source of

50− Right json -> do

51− putStrLn $ "Documenting " ++ path

52− let docPath = "docs" </> replaceExtension path ".json"

53− createDirectoryIfMissing True (dropFileName docPath)

54− BS.writeFile docPath (encodePretty' config json)

55− Left err -> do

56− hPutStrLn stderr $ "Parse error in " ++ path ++ " at " ++ show err

57− exitFailure

58−

59−docs :: IParser Value

60−docs = do

61− (name, exports, structure) <- moduleDocs

62− things <- document

63− return $ documentToJson name exports structure things

64−

65−docComment :: IParser String

66−docComment = do

67− try (string "{-|")

68− contents <- closeComment

69− let reversed = dropWhile (`elem` " \n\r") . drop 2 $ reverse contents

70− return $ dropWhile (==' ') (reverse reversed)

71−

72−moduleDocs = do

73− optional freshLine

74− (names,exports) <- moduleDef

75− manyTill (string " " <|> newline <?> "more whitespace")

76− (lookAhead (string "{-|") <?> "module documentation comment")

77− structure <- docComment

78− return (List.intercalate "." names, exports, structure)

79−

80−document :: IParser [(String, Declaration t v, String)]

81−document = onFreshLines (\t ts -> ts ++ [t]) [] docThing

82−

83−docThing :: IParser (String, Declaration t v, String)

84−docThing = uncommentable <|> commented <|> uncommented ""

85− where

86− uncommentable = do

87− ifx <- infixDecl

88− return ("", ifx, "")

89−

90− commented = do

91− comment <- docComment

92− freshLine

93− uncommented comment

94−

95− uncommented comment = do

96− (src,def) <- withSource $ choice [ alias, datatype, Definition <$> typeAnnotation ]

97− return (comment, def, src)

98−

99−

100−documentToJson name exports structure things =

101− object $ [ "name" .= name

102− , "document" .= structure

103− , "values" .= toList values

104− , "aliases" .= toList aliases

105− , "datatypes" .= toList adts

106− ]

107− where

108− (values, aliases, adts) = collect Map.empty Map.empty Map.empty Map.empty things

109−

110− toList dict = map object . Map.elems $ filterPublics dict

111−

112− exportMap = Map.fromList (zip exports exports)

113− filterPublics dict =

114− case Map.null exportMap of

115− True -> dict

116− False -> Map.filterWithKey (\k _ -> Map.member k exportMap) dict

117−

118−collect infixes types aliases adts things =

119− case things of

120− [] -> (Map.union customOps nonCustomOps, aliases, adts)

121− where

122− nonCustomOps = Map.mapWithKey addDefaultInfix $ Map.difference types infixes

123− addDefaultInfix name pairs

124− | all isSymbol name = addInfix (L, 9 :: Int) pairs

125− | otherwise = pairs

126−

127− customOps = Map.intersectionWith addInfix infixes types

128− addInfix (assoc,prec) pairs =

129− [ "associativity" .= show assoc, "precedence" .= prec ] ++ pairs

130−

131− (comment, decl, source) : rest ->

132− case decl of

133− Fixity assoc prec name ->

134− collect (Map.insert name (assoc,prec) infixes) types aliases adts rest

135− Definition (TypeAnnotation name tipe) ->

136− collect infixes (insert name [ "type" .= tipe ] types) aliases adts rest

137− TypeAlias name vars tipe ->

138− let fields = ["typeVariables" .= vars, "type" .= tipe ]

139− in collect infixes types (insert name fields aliases) adts rest

140− Datatype name vars ctors ->

141− let tipe = Data name (map Var vars)

142− fields = ["typeVariables" .= vars, "constructors" .= map (ctorToJson tipe) ctors ]

143− in collect infixes types aliases (insert name fields adts) rest

144− where

145− insert name fields dict = Map.insert name (obj name fields) dict

146− obj name fields =

147− [ "name" .= name, "raw" .= source, "comment" .= comment ] ++ fields

148−

149−instance ToJSON Type where

150− toJSON tipe =

151− case tipe of

152− Lambda t1 t2 -> toJSON [ "->", toJSON t1, toJSON t2 ]

153− Var x -> toJSON x

154− Data name ts -> toJSON (toJSON name : map toJSON ts)

155− EmptyRecord -> object []

156− Record fields ext -> object $ map (\(n,t) -> Text.pack n .= toJSON t) fields'

157− where fields' = case ext of

158− EmptyRecord -> fields

159− _ -> ("_",ext) : fields

160−

161−ctorToJson tipe (ctor, tipes) =

162− object [ "name" .= ctor

163− , "type" .= foldr 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/Generate/Cases.hsdeleted−125

@@ -1,125 +0,0 @@

1−module Generate.Cases (toMatch, Match (..), Clause (..), matchSubst) where

2−

3−import Control.Applicative ((<$>),(<*>))

4−import Control.Arrow (first,second)

5−import Control.Monad.State

6−import Data.List (groupBy,sortBy,lookup)

7−import Data.Maybe (fromMaybe)

8−

9−import SourceSyntax.Location

10−import SourceSyntax.Literal

11−import SourceSyntax.Pattern

12−import SourceSyntax.Expression

13−import Transform.Substitute

14−

15−

16−toMatch :: [(Pattern, LExpr t v)] -> State Int (String, Match t v)

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 $ "_case" ++ show n

25−

26−data Match t v

27− = Match String [Clause t v] (Match t v)

28− | Break

29− | Fail

30− | Other (LExpr t v)

31− | Seq [Match t v]

32− deriving Show

33−

34−data Clause t v =

35− Clause (Either String Literal) [String] (Match t v)

36− deriving Show

37−

38−matchSubst :: [(String,String)] -> Match t v -> Match t v

39−matchSubst _ Break = Break

40−matchSubst _ Fail = Fail

41−matchSubst pairs (Seq ms) = Seq (map (matchSubst pairs) ms)

42−matchSubst pairs (Other (L s e)) =

43− Other . L s $ foldr ($) e $ map (\(x,y) -> subst x (Var y)) pairs

44−matchSubst pairs (Match n cs m) =

45− Match (varSubst n) (map clauseSubst cs) (matchSubst pairs m)

46− where varSubst v = fromMaybe v (lookup v pairs)

47− clauseSubst (Clause c vs m) =

48− Clause c (map varSubst vs) (matchSubst pairs m)

49−

50−isCon (p:ps, e) =

51− case p of

52− PData _ _ -> True

53− PLiteral _ -> True

54− _ -> False

55−

56−isVar p = not (isCon p)

57−

58−match :: [String] -> [([Pattern],LExpr t v)] -> Match t v -> State Int (Match t v)

59−match [] [] def = return def

60−match [] [([],e)] Fail = return $ Other e

61−match [] [([],e)] Break = return $ Other e

62−match [] cs def = return $ Seq (map (Other . snd) cs ++ [def])

63−match vs@(v:_) cs def

64− | all isVar cs' = matchVar vs cs' def

65− | all isCon cs' = matchCon vs cs' def

66− | otherwise = matchMix vs cs' def

67− where

68− cs' = map (dealias v) cs

69−

70−dealias v c@(p:ps, L s e) =

71− case p of

72− PAlias x pattern -> (pattern:ps, L s $ subst x (Var v) e)

73− _ -> c

74−

75−matchVar :: [String] -> [([Pattern],LExpr t v)] -> Match t v -> State Int (Match t v)

76−matchVar (v:vs) cs def = match vs (map subVar cs) def

77− where

78− subVar (p:ps, ce@(L s e)) = (ps, L s $ subOnePattern p e)

79− where

80− subOnePattern pattern e =

81− case pattern of

82− PVar x -> subst x (Var v) e

83− PAnything -> e

84− PRecord fs ->

85− foldr (\x -> subst x (Access (L s (Var v)) x)) e fs

86−

87−matchCon :: [String] -> [([Pattern],LExpr t v)] -> Match t v -> State Int (Match t v)

88−matchCon (v:vs) cs def = (flip (Match v) def) <$> mapM toClause css

89− where

90− css = groupBy eq (sortBy cmp cs)

91−

92− cmp (p1:_,_) (p2:_,_) =

93− case (p1,p2) of

94− (PData n1 _, PData n2 _) -> compare n1 n2

95− _ -> compare p1 p2

96−

97− eq (p1:_,_) (p2:_,_) =

98− case (p1,p2) of

99− (PData n1 _, PData n2 _) -> n1 == n2

100− _ -> p1 == p2

101−

102− toClause cs =

103− case head cs of

104− (PData name _ : _, _) -> matchClause (Left name) (v:vs) cs Break

105− (PLiteral lit : _, _) -> matchClause (Right lit) (v:vs) cs Break

106−

107−--matchClause :: Either String Literal -> [String] -> [([Pattern],LExpr t v)] -> Match t v -> State Int (Clause a)

108−matchClause c (v:vs) cs def =

109− do vs' <- getVars

110− Clause c vs' <$> match (vs' ++ vs) (map flatten cs) def

111− where

112−

113− flatten (p:ps, e) =

114− case p of

115− PData _ ps' -> (ps' ++ ps, e)

116− PLiteral _ -> (ps, e)

117−

118− getVars =

119− case head cs of

120− (PData _ ps : _, _) -> forM ps (const newVar)

121− (PLiteral _ : _, _) -> return []

122−

123−matchMix :: [String] -> [([Pattern],LExpr t v)] -> Match t v -> State Int (Match t v)

124−matchMix vs cs def = foldM (flip $ match vs) def (reverse css)

125− where css = groupBy (\p1 p2 -> isCon p1 == isCon p2) cs

compiler/Generate/Html.hsdeleted−38

@@ -1,38 +0,0 @@

1−{-# LANGUAGE OverloadedStrings #-}

2−module Generate.Html

3− (createHtml,

4− JSSource (..)

5− ) where

6−

7−import Text.Blaze (preEscapedToMarkup)

8−import qualified Text.Blaze.Html5 as H

9−import Text.Blaze.Html5 ((!))

10−import qualified Text.Blaze.Html5.Attributes as A

11−import qualified Data.ByteString.Lazy.Char8 as BS

12−

13−import Initialize (buildFromSource)

14−import Generate.JavaScript

15−import Generate.Noscript

16−

17−data JSSource = Link String | Source BS.ByteString

18−

19−makeScript :: JSSource -> H.Html

20−makeScript source =

21− case source of

22− Link src -> H.script ! A.type_ "text/javascript" ! A.src (H.toValue src) $ ""

23− Source src ->

24− H.script ! A.type_ "text/javascript" $

25− preEscapedToMarkup $ BS.unpack src

26−

27−createHtml :: FilePath -> String -> [JSSource] -> String -> String -> H.Html

28−createHtml libLoc title scripts moduleName noscript =

29− H.docTypeHtml $ do

30− H.head $ do

31− H.meta ! A.charset "UTF-8"

32− H.title . H.toHtml $ title

33− makeScript (Link libLoc)

34− mapM_ makeScript scripts

35− H.body $ do

36− H.script ! A.type_ "text/javascript" $

37− preEscapedToMarkup ("Elm.fullscreen(Elm." ++ moduleName ++ ")")

38− H.noscript $ preEscapedToMarkup noscript

compiler/Generate/JavaScript.hsdeleted−416

@@ -1,416 +0,0 @@

1−module Generate.JavaScript where

2−

3−import Control.Arrow (first,(***))

4−import Control.Applicative ((<$>),(<*>))

5−import Control.Monad.State

6−import qualified Data.List as List

7−import qualified Data.Map as Map

8−import qualified Data.Set as Set

9−

10−import qualified Generate.Cases as Case

11−import qualified Generate.Markdown as MD

12−import SourceSyntax.Everything

13−import SourceSyntax.Location

14−import qualified Transform.SortDefinitions as SD

15−import Language.ECMAScript3.Syntax

16−import Language.ECMAScript3.PrettyPrint

17−import Parse.Helpers (jsReserveds)

18−

19−makeSafe :: String -> String

20−makeSafe = List.intercalate "." . map dereserve . split . deprime

21− where

22− deprime = map (\c -> if c == '\'' then '$' else c)

23− dereserve x = case Set.member x jsReserveds of

24− False -> x

25− True -> "$" ++ x

26−

27−split = go []

28− where

29− go vars str =

30− case break (=='.') str of

31− (x,'.':rest) | isOp x -> vars ++ [x ++ '.' : rest]

32− | otherwise -> go (vars ++ [x]) rest

33− (x,[]) -> vars ++ [x]

34−

35−var name = Id () (makeSafe name)

36−ref name = VarRef () (var name)

37−prop name = PropId () (var name)

38−f <| x = CallExpr () f [x]

39−args ==> e = FuncExpr () Nothing (map var args) [ ReturnStmt () (Just e) ]

40−function args stmts = FuncExpr () Nothing (map var args) stmts

41−call = CallExpr ()

42−string = StringLit ()

43−

44−dotSep (x:xs) = foldl (DotRef ()) (ref x) (map var xs)

45−obj = dotSep . split

46−

47−varDecl x expr =

48− VarDecl () (var x) (Just expr)

49−

50−include alias moduleName =

51− varDecl alias (obj (moduleName ++ ".make") <| ref "elm")

52−

53−internalImports name =

54− VarDeclStmt ()

55− [ varDecl "N" (obj "Elm.Native")

56− , include "_N" "N.Utils"

57− , include "_L" "N.List"

58− , include "_E" "N.Error"

59− , include "_J" "N.JavaScript"

60− , varDecl "$moduleName" (string name)

61− ]

62−

63−literal lit =

64− case lit of

65− Chr c -> obj "_N.chr" <| string [c]

66− Str s -> string s

67− IntNum n -> IntLit () n

68− FloatNum n -> NumLit () n

69− Boolean b -> BoolLit () b

70−

71−expression :: LExpr () () -> State Int (Expression ())

72−expression (L span expr) =

73− case expr of

74− Var x -> return $ ref x

75− Literal lit -> return $ literal lit

76−

77− Range lo hi ->

78− do lo' <- expression lo

79− hi' <- expression hi

80− return $ obj "_L.range" `call` [lo',hi']

81−

82− Access e x ->

83− do e' <- expression e

84− return $ DotRef () e' (var x)

85−

86− Remove e x ->

87− do e' <- expression e

88− return $ obj "_N.remove" `call` [string x, e']

89−

90− Insert e x v ->

91− do v' <- expression v

92− e' <- expression e

93− return $ obj "_N.insert" `call` [string x, v', e']

94−

95− Modify e fs ->

96− do e' <- expression e

97− fs' <- forM fs $ \(f,v) -> do

98− v' <- expression v

99− return $ ArrayLit () [string f, v']

100− return $ obj "_N.replace" `call` [ArrayLit () fs', e']

101−

102− Record fields ->

103− do fields' <- forM fields $ \(f,e) -> do

104− (,) f <$> expression e

105− let fieldMap = List.foldl' combine Map.empty fields'

106− return $ ObjectLit () $ (PropId () (var "_"), hidden fieldMap) : visible fieldMap

107− where

108− combine r (k,v) = Map.insertWith (++) k [v] r

109− prop = PropId () . var

110− hidden fs = ObjectLit () . map (prop *** ArrayLit ()) .

111− Map.toList . Map.filter (not . null) $ Map.map tail fs

112− visible fs = map (first prop) . Map.toList $ Map.map head fs

113−

114− Binop op e1 e2 -> binop span op e1 e2

115−

116− Lambda p e@(L s _) ->

117− do body' <- expression body

118− return $ case length args < 2 || length args > 9 of

119− True -> foldr (==>) body' (map (:[]) args)

120− False -> ref ("F" ++ show (length args)) <| (args ==> body')

121− where

122− (args, body) = foldr depattern ([], innerBody) (zip patterns [0..])

123−

124− depattern (pattern,n) (args, body) =

125− case pattern of

126− PVar x -> (args ++ [x], body)

127− _ -> let arg = "arg" ++ show n

128− in (args ++ [arg], L s (Case (L s (Var arg)) [(pattern, body)]))

129−

130− (patterns, innerBody) = collect [p] e

131−

132− collect patterns lexpr@(L _ expr) =

133− case expr of

134− Lambda p e -> collect (p:patterns) e

135− _ -> (patterns, lexpr)

136−

137− App e1 e2 ->

138− do func' <- expression func

139− args' <- mapM expression args

140− return $ case args' of

141− [arg] -> func' <| arg

142− _ | length args' <= 9 -> ref aN `call` (func':args')

143− | otherwise -> foldl1 (<|) (func':args')

144− where

145− aN = "A" ++ show (length args)

146− (func, args) = getArgs e1 [e2]

147− getArgs func args =

148− case func of

149− (L _ (App f arg)) -> getArgs f (arg : args)

150− _ -> (func, args)

151−

152− Let defs e ->

153− do let (defs',e') = SD.flattenLets defs e

154− stmts <- concat <$> mapM definition defs'

155− exp <- expression e'

156− return $ function [] (stmts ++ [ ReturnStmt () (Just exp) ]) `call` []

157−

158− MultiIf branches ->

159− do branches' <- forM branches $ \(b,e) -> (,) <$> expression b <*> expression e

160− return $ case last branches of

161− (L _ (Var "Basics.otherwise"), e) -> ifs (init branches') (snd (last branches'))

162− _ -> ifs branches'

163− (obj "_E.If" `call` [ ref "$moduleName", string (show span) ])

164− where

165− ifs branches finally = foldr iff finally branches

166− iff (if', then') else' = CondExpr () if' then' else'

167−

168− Case e cases ->

169− do (tempVar,initialMatch) <- Case.toMatch cases

170− (revisedMatch, stmt) <-

171− case e of

172− L _ (Var x) -> return (Case.matchSubst [(tempVar,x)] initialMatch, [])

173− _ -> do e' <- expression e

174− return (initialMatch, [VarDeclStmt () [varDecl tempVar e']])

175− match' <- match span revisedMatch

176− return (function [] (stmt ++ match') `call` [])

177−

178− ExplicitList es ->

179− do es' <- mapM expression es

180− return $ obj "_J.toList" <| ArrayLit () es'

181−

182− Data name es ->

183− do es' <- mapM expression es

184− return $ ObjectLit () (ctor : fields es')

185− where

186− ctor = (prop "ctor", string (makeSafe name))

187− fields = zipWith (\n e -> (prop ("_" ++ show n), e)) [0..]

188−

189− Markdown md _ -> return $ obj "Text.text" <| string (pad ++ MD.toHtml md ++ pad)

190− where pad = "<div style=\"height:0;width:0;\"> </div>"

191−

192−definition :: Def () () -> State Int [Statement ()]

193−definition def =

194− case def of

195− TypeAnnotation _ _ -> return []

196−

197− Def pattern expr@(L span _) -> do

198− expr' <- expression expr

199− let assign x = varDecl x expr'

200− case pattern of

201− PVar x

202− | isOp x ->

203− let op = LBracket () (ref "_op") (string x) in

204− return [ ExprStmt () $ AssignExpr () OpAssign op expr' ]

205− | otherwise ->

206− return [ VarDeclStmt () [ assign x ] ]

207−

208− PRecord fields ->

209− let setField f = varDecl f (dotSep ["$",f]) in

210− return [ VarDeclStmt () (assign "$" : map setField fields) ]

211−

212− PData name patterns | vars /= Nothing ->

213− case vars of

214− Just vs -> return [ VarDeclStmt () (setup (zipWith decl vs [0..])) ]

215− where

216− vars = getVars patterns

217− getVars patterns =

218− case patterns of

219− PVar x : rest -> (x:) `fmap` getVars rest

220− [] -> Just []

221− _ -> Nothing

222−

223− decl x n = varDecl x (dotSep ["$","_" ++ show n])

224− setup vars

225− | isTuple name = assign "$" : vars

226− | otherwise = safeAssign : vars

227−

228− safeAssign = varDecl "$" (CondExpr () if' expr' exception)

229− if' = InfixExpr () OpStrictEq (obj "$.ctor") (string name)

230− exception = obj "_E.Case" `call` [ref "$moduleName", string (show span)]

231−

232− _ ->

233− do defs' <- concat <$> mapM toDef vars

234− return (VarDeclStmt () [assign "$"] : defs')

235− where

236− vars = Set.toList $ SD.boundVars pattern

237− mkVar = L span . Var

238− toDef y = definition $

239− Def (PVar y) (L span $ Case (mkVar "$") [(pattern, mkVar y)])

240−

241−match :: (Show a) => a -> Case.Match () () -> State Int [Statement ()]

242−match span mtch =

243− case mtch of

244− Case.Match name clauses mtch' ->

245− do (isChars, clauses') <- unzip <$> mapM (clause span name) clauses

246− mtch'' <- match span mtch'

247− return (SwitchStmt () (format isChars (access name)) clauses' : mtch'')

248− where

249− isLiteral p = case p of

250− Case.Clause (Right _) _ _ -> True

251− _ -> False

252− access name = if any isLiteral clauses then ref name else dotSep [name,"ctor"]

253− format isChars e

254− | or isChars = InfixExpr () OpAdd e (string "")

255− | otherwise = e

256−

257− Case.Fail ->

258− return [ ExprStmt () (obj "_E.Case" `call` [ref "$moduleName", string (show span)]) ]

259−

260− Case.Break -> return [BreakStmt () Nothing]

261− Case.Other e ->

262− do e' <- expression e

263− return [ ReturnStmt () (Just e') ]

264− Case.Seq ms -> concat <$> mapM (match span) (dropEnd [] ms)

265− where

266− dropEnd acc [] = acc

267− dropEnd acc (m:ms) =

268− case m of

269− Case.Other _ -> acc ++ [m]

270− _ -> dropEnd (acc ++ [m]) ms

271−

272−clause span variable (Case.Clause value vars mtch) =

273− (,) isChar . CaseClause () pattern <$> match span (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−

287−jsModule :: MetadataModule () () -> String

288−jsModule modul =

289− show . prettyPrint $ setup (Just "Elm") (names modul ++ ["make"]) ++

290− [ assign ("Elm" : names modul ++ ["make"]) (function ["elm"] programStmts) ]

291− where

292− thisModule = dotSep ("elm" : names modul ++ ["values"])

293− programStmts =

294− concat [ setup (Just "elm") (names modul ++ ["values"])

295− , [ IfSingleStmt () thisModule (ReturnStmt () (Just thisModule)) ]

296− , [ internalImports (List.intercalate "." (names modul)) ]

297− , concatMap jsImport (imports modul)

298− , concatMap importEvent (foreignImports modul)

299− , [ assign ["_op"] (ObjectLit () []) ]

300− , concat $ evalState (mapM definition . fst . SD.flattenLets [] $ program modul) 0

301− , map exportEvent $ foreignExports modul

302− , [ jsExports ]

303− , [ ReturnStmt () (Just thisModule) ]

304− ]

305−

306− jsExports = assign ("elm" : names modul ++ ["values"]) (ObjectLit () exs)

307− where

308− exs = map entry . filter (not . isOp) $ "_op" : exports modul

309− entry x = (PropId () (var x), ref x)

310−

311− assign path expr =

312− case path of

313− [x] -> VarDeclStmt () [ varDecl x expr ]

314− _ -> ExprStmt () $

315− AssignExpr () OpAssign (LDot () (dotSep (init path)) (last path)) expr

316−

317− jsImport (modul,_) = setup Nothing path ++ [ include ]

318− where

319− path = split modul

320− include = assign path $ dotSep ("Elm" : path ++ ["make"]) <| ref "elm"

321−

322− setup namespace path = map create paths

323− where

324− create name = assign name (InfixExpr () OpLOr (dotSep name) (ObjectLit () []))

325− paths = case namespace of

326− Nothing -> tail . init $ List.inits path

327− Just nmspc -> drop 2 . init . List.inits $ nmspc : path

328−

329− addId js = InfixExpr () OpAdd (string (js++"_")) (obj "elm.id")

330−

331− importEvent (js,base,elm,_) =

332− [ VarDeclStmt () [ varDecl elm $ obj "Signal.constant" <| evalState (expression base) 0 ]

333− , ExprStmt () $

334− obj "document.addEventListener" `call`

335− [ addId js

336− , function ["e"]

337− [ ExprStmt () $ obj "elm.notify" `call` [dotSep [elm,"id"], obj "e.value"] ]

338− ]

339− ]

340−

341− exportEvent (js,elm,_) =

342− ExprStmt () $

343− ref "A2" `call`

344− [ obj "Signal.lift"

345− , function ["v"]

346− [ VarDeclStmt () [varDecl "e" $ obj "document.createEvent" <| string "Event"]

347− , ExprStmt () $

348− obj "e.initEvent" `call` [ addId js, BoolLit () True, BoolLit () True ]

349− , ExprStmt () $ AssignExpr () OpAssign (LDot () (ref "e") "value") (ref "v")

350− , ExprStmt () $ obj "document.dispatchEvent" <| ref "e"

351− , ReturnStmt () (Just $ ref "v")

352− ]

353− , ref elm ]

354−

355−binop span op e1 e2 =

356− case op of

357− "Basics.." ->

358− do es <- mapM expression (e1 : collect [] e2)

359− return $ ["$"] ==> foldr (<|) (ref "$") es

360− "Basics.<|" ->

361− do e2' <- expression e2

362− es <- mapM expression (collect [] e1)

363− return $ foldr (<|) e2' es

364− "List.++" ->

365− do e1' <- expression e1

366− e2' <- expression e2

367− return $ obj "_L.append" `call` [e1', e2']

368− "::" -> expression (L span (Data "::" [e1,e2]))

369− _ ->

370− do e1' <- expression e1

371− e2' <- expression e2

372− return $ case Map.lookup op opDict of

373− Just f -> f e1' e2'

374− Nothing -> ref "A2" `call` [ func, e1', e2' ]

375− where

376− collect es e =

377− case e of

378− L _ (Binop op e1 e2) | op == "Basics.." -> collect (es ++ [e1]) e2

379− _ -> es ++ [e]

380−

381− js1 = expression e1

382− js2 = expression e2

383−

384− func | isOp operator = BracketRef () (dotSep (init parts ++ ["_op"])) (string operator)

385− | otherwise = dotSep parts

386− where

387− parts = split op

388− operator = last parts

389−

390− opDict = Map.fromList (infixOps ++ specialOps)

391−

392− specialOp str func = [ (str, func), ("Basics." ++ str, func) ]

393− infixOp str op = specialOp str (InfixExpr () op)

394−

395− infixOps = concat

396− [ infixOp "+" OpAdd

397− , infixOp "-" OpSub

398− , infixOp "*" OpMul

399− , infixOp "/" OpDiv

400− , infixOp "&&" OpLAnd

401− , infixOp "||" OpLOr

402− ]

403−

404− specialOps = concat

405− [ specialOp "^" $ \a b -> obj "Math.pow" `call` [a,b]

406− , specialOp "|>" $ flip (<|)

407− , specialOp "==" $ \a b -> obj "_N.eq" `call` [a,b]

408− , specialOp "/=" $ \a b -> PrefixExpr () PrefixLNot (obj "_N.eq" `call` [a,b])

409− , specialOp "<" $ cmp OpLT 0

410− , specialOp ">" $ cmp OpGT 0

411− , specialOp "<=" $ cmp OpLT 1

412− , specialOp ">=" $ cmp OpGT (-1)

413− , specialOp "div" $ \a b -> InfixExpr () OpBOr (InfixExpr () OpDiv a b) (IntLit () 0)

414− ]

415−

416− cmp op n a b = InfixExpr () op (obj "_N.cmp" `call` [a,b]) (IntLit () n)

compiler/Generate/Markdown.hsdeleted−6

@@ -1,6 +0,0 @@

1−module Generate.Markdown where

2−

3−import Text.Pandoc

4−

5−toHtml :: String -> String

6−toHtml = writeHtmlString def . readMarkdown def

compiler/Generate/Noscript.hsdeleted−65

@@ -1,65 +0,0 @@

1−module Generate.Noscript (noscript) where

2−

3−import Data.List (isInfixOf)

4−import SourceSyntax.Everything

5−import qualified Generate.Markdown as MD

6−

7−noscript :: Module t v -> String

8−noscript modul = concat (extract modul)

9−

10−class Extract a where

11− extract :: a -> [String]

12−

13−instance Extract (Module t v) where

14− extract (Module _ _ _ stmts) =

15− map (\s -> "<p>" ++ s ++ "</p>") (concatMap extract stmts)

16−

17−instance Extract (Declaration t v) where

18− extract (Definition d) = extract d

19− extract _ = []

20−

21−instance Extract (Def t v) where

22− extract (Def _ e) = extract e

23− extract _ = []

24−

25−instance Extract e => Extract (Located e) where

26− extract (L _ e) = extract e

27−

28−instance Extract (Expr t v) where

29− extract expr =

30− let f = extract in

31− case expr of

32− Literal (Str s) -> [s]

33− Binop op e1 e2 -> case (op, f e1, f e2) of

34− ("++", [s1], [s2]) -> [s1 ++ s2]

35− (_ , ss1 , ss2 ) -> ss1 ++ ss2

36− Lambda v e -> f e

37− App (L _ (App (L _ (App (L _ (Var func)) w)) h)) src

38− | "image" `isInfixOf` func -> extractImage src

39− App (L _ (App (L _ (Var func)) src)) txt

40− | "link" `isInfixOf` func -> extractLink src txt

41− App (L _ (Var func)) e

42− | "header" `isInfixOf` func -> tag "h1" e

43− | "bold" `isInfixOf` func -> tag "b" e

44− | "italic" `isInfixOf` func -> tag "i" e

45− | "monospace" `isInfixOf` func -> tag "code" e

46− App e1 e2 -> f e1 ++ f e2

47− Let defs e -> concatMap extract defs ++ f e

48− Var _ -> []

49− Case e cases -> concatMap (f . snd) cases

50− Data _ es -> concatMap f es

51− MultiIf es -> concatMap (f . snd) es

52− Markdown md _ -> [ MD.toHtml md ]

53− _ -> []

54−

55−extractLink src txt =

56− case (extract src, extract txt) of

57− ([s1],[s2]) -> [ "<a href=\"" ++ s1 ++ "\">" ++ s2 ++ "</a>" ]

58− ( ss1, ss2) -> ss1 ++ ss2

59−

60−extractImage src =

61− case extract src of

62− [s] -> ["<img src=\"" ++ s ++ "\">"]

63− ss -> ss

64−

65−tag t e = map (\s -> concat [ "<", t, ">", s, "</", t, ">" ]) (extract e)

compiler/Initialize.hsdeleted−124

@@ -1,124 +0,0 @@

1−module Initialize (buildFromSource, getSortedDependencies) where

2−

3−import Data.Data

4−import Control.Monad.State

5−import qualified Data.Graph as Graph

6−import qualified Data.List as List

7−import qualified Data.Map as Map

8−import qualified Data.Set as Set

9−import System.Directory

10−import System.Exit

11−import System.FilePath as FP

12−import Text.PrettyPrint (Doc)

13−

14−import SourceSyntax.Everything

15−import qualified SourceSyntax.Type as Type

16−import qualified Parse.Parse as Parse

17−import qualified Metadata.Prelude as Prelude

18−import qualified Transform.Check as Check

19−import qualified Transform.SortDefinitions as SD

20−import qualified Type.Inference as TI

21−import qualified Type.Constrain.Declaration as TcDecl

22−import qualified Transform.Canonicalize as Canonical

23−

24−buildFromSource :: Bool -> Interfaces -> String -> Either [Doc] (MetadataModule () ())

25−buildFromSource noPrelude interfaces source =

26− do let add = if noPrelude then id else Prelude.add

27− infixes = Map.fromList . map (\(assoc,lvl,op) -> (op,(lvl,assoc)))

28− . concatMap iFixities $ Map.elems interfaces

29−

30− modul@(Module _ _ _ decls') <- add `fmap` Parse.program infixes source

31−

32− -- check for structural errors

33− Module names exs ims decls <-

34− case Check.mistakes decls' of

35− [] -> return modul

36− ms -> Left ms

37−

38− let exports'

39− | null exs =

40− let get = Set.toList . SD.boundVars in

41− concat [ get pattern | Definition (Def pattern _) <- decls ] ++

42− concat [ map fst ctors | Datatype _ _ ctors <- decls ] ++

43− [ name | TypeAlias name _ (Type.Record _ _) <- decls ]

44− | otherwise = exs

45−

46− metaModule <- Canonical.metadataModule interfaces $ MetadataModule {

47− names = names,

48− path = FP.joinPath names,

49− exports = exports',

50− imports = ims,

51− -- reorder AST into strongly connected components

52− program = SD.sortDefs . dummyLet $ TcDecl.toExpr decls,

53− types = Map.empty,

54− datatypes = [ (name,vars,ctors) | Datatype name vars ctors <- decls ],

55− fixities = [ (assoc,level,op) | Fixity assoc level op <- decls ],

56− aliases = [ (name,tvs,tipe) | TypeAlias name tvs tipe <- decls ],

57− foreignImports = [ (evt,v,name,typ) | ImportEvent evt v name typ <- decls ],

58− foreignExports = [ (evt,name,typ) | ExportEvent evt name typ <- decls ]

59− }

60−

61− types <- TI.infer interfaces metaModule

62−

63− return $ metaModule { types = types }

64−

65−

66−getSortedDependencies :: [FilePath] -> Bool -> FilePath -> IO [String]

67−getSortedDependencies srcDirs noPrelude root =

68− sortDeps =<< readDeps srcDirs noPrelude root

69−

70−type Deps = (FilePath, String, [String])

71−

72−sortDeps :: [Deps] -> IO [String]

73−sortDeps depends =

74− if null mistakes

75− then return (concat sccs)

76− else print msg >> mapM print mistakes >> exitFailure

77− where

78− sccs = map Graph.flattenSCC $ Graph.stronglyConnComp depends

79−

80− mistakes = filter (\scc -> length scc > 1) sccs

81− msg = "A cyclical module dependency or was detected in: "

82−

83−readDeps :: [FilePath] -> Bool -> FilePath -> IO [Deps]

84−readDeps srcDirs noPrelude root = evalStateT (go root) Set.empty

85− where

86− builtIns = if noPrelude then Set.empty

87− else Set.fromList (Map.keys Prelude.interfaces)

88−

89− go :: FilePath -> StateT (Set.Set String) IO [Deps]

90− go root = do

91− (root', txt) <- liftIO $ getFile srcDirs root

92− case Parse.dependencies txt of

93− Left err -> liftIO (putStrLn msg >> print err >> exitFailure)

94− where msg = "Error resolving dependencies in " ++ root' ++ ":"

95−

96− Right (name,deps) ->

97− do seen <- get

98− let realDeps = Set.difference (Set.fromList deps) builtIns

99− newDeps = Set.difference (Set.filter (not . isNative) realDeps) seen

100− put (Set.insert name (Set.union newDeps seen))

101− rest <- mapM (go . toFilePath) (Set.toList newDeps)

102− return ((makeRelative "." root', name, Set.toList realDeps) : concat rest)

103−

104−getFile :: [FilePath] -> FilePath -> IO (FilePath,String)

105−getFile [] path = do

106− putStrLn $ unlines [ "Could not find file: " ++ path

107− , " If it is not in the root directory of your project, use"

108− , " --src-dir to declare additional locations for source files." ]

109− exitFailure

110−

111−getFile (dir:dirs) path = do

112− let path' = dir </> path

113− exists <- doesFileExist path'

114− case exists of

115− True -> (,) path' `fmap` readFile path'

116− False -> getFile dirs path

117−

118−isNative name = List.isPrefixOf "Native." name

119−

120−toFilePath :: String -> FilePath

121−toFilePath name = map swapDots name ++ ext

122− where swapDots '.' = '/'

123− swapDots c = c

124− ext = if isNative name then ".js" else ".elm"

compiler/Language/Elm.hsdeleted−40

@@ -1,40 +0,0 @@

1−{- | This module exports the functions necessary for compiling Elm to JS,

2− and some utilities for making it easier to find some Elm-related files.

3−

4− The documentation for the Elm language is available at

5− <http://elm-lang.org/Documentation.elm>, and many interactive examples are

6− available at <http://elm-lang.org/Examples.elm>

7−-}

8−module Language.Elm (compile, moduleName, runtime, docs) where

9−

10−import qualified Data.List as List

11−import qualified Data.Map as Map

12−import Data.Version (showVersion)

13−import Generate.JavaScript (jsModule)

14−import Initialize (buildFromSource)

15−import Parse.Module (getModuleName)

16−import SourceSyntax.Module

17−import Text.Blaze.Html (Html)

18−import qualified Text.PrettyPrint as P

19−import qualified Metadata.Prelude as Prelude

20−import Paths_Elm

21−

22−-- |This function compiles Elm code to JavaScript. It will return either

23−-- an error message or the compiled JS code.

24−compile :: String -> Either String String

25−compile source =

26− case buildFromSource False Prelude.interfaces source of

27− Left docs -> Left . unlines . List.intersperse "" $ map P.render docs

28− Right modul -> Right $ jsModule (modul :: MetadataModule () ())

29−

30−-- |This function extracts the module name of a given source program.

31−moduleName :: String -> Maybe String

32−moduleName = getModuleName

33−

34−-- |The absolute path to Elm's runtime system.

35−runtime :: IO FilePath

36−runtime = getDataFileName "elm-runtime.js"

37−

38−-- |The absolute path to Elm's core library documentation.

39−docs :: IO FilePath

40−docs = getDataFileName "docs.json"

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−module Metadata.Prelude (interfaces, add) where

2−

3−import qualified Data.Map as Map

4−import qualified Control.Exception as E

5−import qualified Paths_Elm as Path

6−import System.Directory

7−import System.Exit

8−import System.FilePath

9−import System.IO

10−import System.IO.Unsafe (unsafePerformIO)

11−import SourceSyntax.Module

12−import qualified Data.Binary as Binary

13−import qualified Data.ByteString.Lazy as BS

14−

15−

16−add :: Module t v -> Module t v

17−add (Module name exs ims stmts) = Module name exs (customIms ++ ims) stmts

18− where

19− customIms = concatMap addModule prelude

20−

21− addModule (n, method) = case lookup n ims of

22− Nothing -> [(n, method)]

23− Just (As m) -> [(n, method)]

24− Just _ -> []

25−

26−prelude :: [(String, ImportMethod)]

27−prelude = text ++ map (\n -> (n, Hiding [])) modules

28− where

29− text = map ((,) "Text") [ As "Text", Hiding ["link", "color", "height"] ]

30− modules = [ "Basics", "Signal", "List", "Maybe", "Time", "Prelude"

31− , "Graphics.Element", "Color", "Graphics.Collage" ]

32−

33−{-# NOINLINE interfaces #-}

34−interfaces :: Interfaces

35−interfaces =

36− unsafePerformIO (safeReadDocs =<< Path.getDataFileName "interfaces.data")

37−

38−safeReadDocs :: FilePath -> IO Interfaces

39−safeReadDocs name =

40− E.catch (readDocs name) $ \err -> do

41− let _ = err :: IOError

42− putStrLn $ unlines [ "Error reading types for standard library!"

43− , " The file should be at " ++ name

44− , " If you are using a stable version of Elm,"

45− , " please report an issue at github.com/evancz/Elm"

46− , " and specify your versions of Elm and your OS" ]

47− exitFailure

48−

49−readDocs :: FilePath -> IO Interfaces

50−readDocs name = do

51− exists <- doesFileExist name

52− case exists of

53− False -> ioError . userError $ "File Not Found"

54− True -> do

55− handle <- openBinaryFile name ReadMode

56− bits <- BS.hGetContents handle

57− let ifaces = Map.fromList (Binary.decode bits)

58− BS.length bits `seq` hClose handle

59− return ifaces

compiler/Parse/Binop.hsdeleted−84

@@ -1,84 +0,0 @@

1−module Parse.Binop (binops, OpTable) where

2−

3−import Control.Applicative ((<$>))

4−import Control.Monad.Error

5−import Data.List (intercalate)

6−import qualified Data.Map as Map

7−

8−import SourceSyntax.Location (merge)

9−import SourceSyntax.Expression (LExpr, Expr(Binop))

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, LExpr t v) -> Bool

21−hasLevel table n (op,_) = opLevel table op == n

22−

23−binops :: IParser (LExpr t v)

24− -> IParser (LExpr t v)

25− -> IParser String

26− -> IParser (LExpr t v)

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− -> LExpr t v

43− -> [(String, LExpr t v)]

44− -> IParser (LExpr t v)

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 -> LExpr t v -> [(String, LExpr t v)]

54− -> [IParser (LExpr t v)]

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 :: [LExpr t v] -> [String] -> IParser (LExpr t v)

62−joinL [e] [] = return e

63−joinL (a:b:es) (op:ops) = joinL (merge a b (Binop op a b) : es) ops

64−joinL _ _ = failure "Ill-formed binary expression. Report a compiler bug."

65−

66−joinR :: [LExpr t v] -> [String] -> IParser (LExpr t v)

67−joinR [e] [] = return e

68−joinR (a:b:es) (op:ops) = do e <- joinR (b:es) ops

69− return (merge a e (Binop op a e))

70−joinR _ _ = failure "Ill-formed binary expression. Report a compiler bug."

71−

72−getAssoc :: OpTable -> Int -> [(String,LExpr t v)] -> 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− , intercalate ", " (map fst eops), "). "

84− , "Consider adding parentheses to disambiguate." ]

compiler/Parse/Declaration.hsdeleted−119

@@ -1,119 +0,0 @@

1−

2−module Parse.Declaration where

3−

4−import Control.Applicative ((<$>), (<*>))

5−import qualified Data.List as List

6−import qualified Data.Set as Set

7−import Text.Parsec hiding (newline,spaces)

8−import Text.Parsec.Indent

9−

10−import Parse.Helpers

11−import qualified Parse.Expression as Expr

12−import qualified SourceSyntax.Type as T

13−import qualified Parse.Type as Type

14−import SourceSyntax.Declaration (Declaration(..), Assoc(..))

15−

16−

17−declaration :: IParser (Declaration t v)

18−declaration = alias <|> datatype <|> infixDecl <|> foreignDef <|> definition

19−

20−definition :: IParser (Declaration t v)

21−definition = Definition <$> Expr.def

22−

23−alias :: IParser (Declaration t v)

24−alias = do

25− reserved "type" <?> "type alias (type Point = {x:Int, y:Int})"

26− forcedWS

27− alias <- capVar

28− args <- spacePrefix lowVar

29− whitespace ; string "=" ; whitespace

30− tipe <- Type.expr

31− return (TypeAlias alias args tipe)

32−

33−datatype :: IParser (Declaration t v)

34−datatype = do

35− reserved "data" <?> "datatype definition (data T = A | B | ...)"

36− forcedWS

37− name <- capVar <?> "name of data-type"

38− args <- spacePrefix lowVar

39− whitespace ; string "=" ; whitespace

40− tcs <- pipeSep1 Type.constructor

41− return $ Datatype name args tcs

42−

43−

44−infixDecl :: IParser (Declaration t v)

45−infixDecl = do

46− assoc <- choice [ reserved "infixl" >> return L

47− , reserved "infix" >> return N

48− , reserved "infixr" >> return R ]

49− whitespace

50− n <- digit

51− forcedWS

52− Fixity assoc (read [n]) <$> anyOp

53−

54−

55−foreignDef :: IParser (Declaration t v)

56−foreignDef = do

57− try (reserved "foreign")

58− whitespace

59− importEvent <|> exportEvent

60−

61−exportEvent :: IParser (Declaration t v)

62−exportEvent = do

63− try (reserved "export") >> whitespace >> reserved "jsevent" >> whitespace

64− eventName <- jsVar

65− whitespace

66− elmVar <- lowVar

67− whitespace ; hasType ; whitespace

68− tipe <- Type.expr

69− case tipe of

70− T.Data "Signal" [t] ->

71− case isExportable t of

72− Nothing -> return (ExportEvent eventName elmVar tipe)

73− Just err -> fail err

74− _ -> fail "When importing foreign events, the imported value must have type Signal."

75−

76−importEvent :: IParser (Declaration t v)

77−importEvent = do

78− try (reserved "import") >> whitespace >> reserved "jsevent" >> whitespace

79− eventName <- jsVar

80− whitespace

81− baseValue <- Expr.term <?> "Base case for imported signal (signals cannot be undefined)"

82− whitespace

83− elmVar <- lowVar <?> "Name of imported signal"

84− whitespace ; hasType ; whitespace

85− tipe <- Type.expr

86− case tipe of

87− T.Data "Signal" [t] ->

88− case isExportable t of

89− Nothing -> return (ImportEvent eventName baseValue elmVar tipe)

90− Just err -> fail err

91− _ -> fail "When importing foreign events, the imported value must have type Signal."

92−

93−jsVar :: IParser String

94−jsVar = betwixt '"' '"' $ do

95− v <- (:) <$> (letter <|> char '_') <*> many (alphaNum <|> char '_')

96− if Set.notMember v jsReserveds then return v else

97− fail $ "'" ++ v ++

98− "' is not a good name for a importing or exporting JS values."

99−

100−isExportable tipe =

101− case tipe of

102− T.Lambda _ _ ->

103− Just $ "Elm's JavaScript event interface does not yet handle functions. " ++

104− "Only simple values can be imported and exported in this release."

105−

106− T.Data "JSArray" [t] -> isExportable t

107−

108− T.Data name []

109− | any (`List.isSuffixOf` name) jsTypes -> Nothing

110− | otherwise -> Just $ "'" ++ name ++ "' is not an exportable type." ++ msg

111−

112− T.Data name _ ->

113− Just $ "'" ++ name ++ "' is not an exportable type " ++

114− "constructor. Only 'JSArray' is an exportable container."

115−

116− T.Var _ -> Just $ "Cannot export type variables." ++ msg

117− where

118− msg = " The following types are exportable: " ++ List.intercalate ", " jsTypes

119− jsTypes = ["JSString","JSNumber","JSDomNode","JSBool","JSObject"]

compiler/Parse/Expression.hsdeleted−241

@@ -1,241 +0,0 @@

1−module Parse.Expression (def,term,typeAnnotation) where

2−

3−import Control.Arrow ((***))

4−import Control.Applicative ((<$>), (<*>))

5−import Data.List (foldl')

6−import Text.Parsec hiding (newline,spaces)

7−import Text.Parsec.Indent

8−

9−import Parse.Helpers

10−import qualified Parse.Pattern as Pattern

11−import qualified Parse.Type as Type

12−import Parse.Binop

13−import Parse.Literal

14−

15−import SourceSyntax.Location as Location

16−import SourceSyntax.Pattern hiding (tuple,list)

17−import qualified SourceSyntax.Literal as Literal

18−import SourceSyntax.Expression

19−import SourceSyntax.Declaration (Declaration(Definition))

20−

21−

22−-------- Basic Terms --------

23−

24−varTerm :: IParser (Expr t v)

25−varTerm = toVar <$> var <?> "variable"

26−

27−toVar :: String -> Expr t v

28−toVar v = case v of "True" -> Literal (Literal.Boolean True)

29− "False" -> Literal (Literal.Boolean False)

30− _ -> Var v

31−

32−accessor :: IParser (Expr t v)

33−accessor = do

34− (start, lbl, end) <- located (try (string "." >> rLabel))

35− let loc e = Location.at start end e

36− return (Lambda (PVar "_") (loc $ Access (loc $ Var "_") lbl))

37−

38−negative :: IParser (Expr t v)

39−negative = do

40− (start, nTerm, end) <-

41− located (try (char '-' >> notFollowedBy (char '.' <|> char '-')) >> term)

42− let loc e = Location.at start end e

43− return (Binop "-" (loc $ Literal (Literal.IntNum 0)) nTerm)

44−

45−

46−-------- Complex Terms --------

47−

48−listTerm :: IParser (Expr t v)

49−listTerm = markdown' <|> braces (try range <|> ExplicitList <$> commaSep expr)

50− where

51− range = do

52− lo <- expr

53− whitespace >> string ".." >> whitespace

54− Range lo <$> expr

55−

56− markdown' = do

57− (rawText, exprs) <- markdown interpolation

58− return (Markdown (filter (/='\r') rawText) exprs)

59−

60− span xs = "<span id=\"md" ++ show (length xs) ++

61− "\" style=\"font-family:monospace;\">{{ ... }}</span>"

62−

63− interpolation md exprs = do

64− try (string "{{")

65− whitespace

66− e <- expr

67− whitespace

68− string "}}"

69− return (md ++ span exprs, exprs ++ [e])

70−

71−parensTerm :: IParser (LExpr t v)

72−parensTerm = try (parens opFn) <|> parens (tupleFn <|> parened)

73− where

74− opFn = do

75− (start, op, end) <- located anyOp

76− let loc = Location.at start end

77− return . loc . Lambda (PVar "x") . loc . Lambda (PVar "y") . loc $

78− Binop op (loc $ Var "x") (loc $ Var "y")

79−

80− tupleFn = do

81− let comma = char ',' <?> "comma ','"

82− (start, commas, end) <- located (comma >> many (whitespace >> comma))

83− let vars = map (('v':) . show) [ 0 .. length commas + 1 ]

84− loc = Location.at start end

85− return $ foldr (\x e -> loc $ Lambda x e)

86− (loc . tuple $ map (loc . Var) vars) (map PVar vars)

87−

88− parened = do

89− (start, es, end) <- located (commaSep expr)

90− return $ case es of

91− [e] -> e

92− _ -> Location.at start end (tuple es)

93−

94−recordTerm :: IParser (LExpr t v)

95−recordTerm = brackets $ choice [ misc, addLocation record ]

96− where field = do

97− label <- rLabel

98− patterns <- spacePrefix Pattern.term

99− whitespace >> string "=" >> whitespace

100− body <- expr

101− return (label, makeFunction patterns body)

102−

103− record = Record <$> commaSep field

104−

105− change = do

106− lbl <- rLabel

107− whitespace >> string "<-" >> whitespace

108− (,) lbl <$> expr

109−

110− remove r = addLocation (string "-" >> whitespace >> Remove r <$> rLabel)

111−

112− insert r = addLocation $ do

113− string "|" >> whitespace

114− Insert r <$> rLabel <*>

115− (whitespace >> string "=" >> whitespace >> expr)

116−

117− modify r = addLocation

118− (string "|" >> whitespace >> Modify r <$> commaSep1 change)

119−

120− misc = try $ do

121− record <- addLocation (Var <$> rLabel)

122− whitespace

123− opt <- optionMaybe (remove record)

124− whitespace

125− case opt of

126− Just e -> try (insert e) <|> return e

127− Nothing -> try (insert record) <|> try (modify record)

128−

129−

130−term :: IParser (LExpr t v)

131−term = addLocation (choice [ Literal <$> literal, listTerm, accessor, negative ])

132− <|> accessible (addLocation varTerm <|> parensTerm <|> recordTerm)

133− <?> "basic term (4, x, 'c', etc.)"

134−

135−-------- Applications --------

136−

137−appExpr :: IParser (LExpr t v)

138−appExpr = do

139− t <- term

140− ts <- constrainedSpacePrefix term $ \str ->

141− if null str then notFollowedBy (char '-') else return ()

142− return $ case ts of

143− [] -> t

144− _ -> foldl' (\f x -> Location.merge f x $ App f x) t ts

145−

146−-------- Normal Expressions --------

147−

148−binaryExpr :: IParser (LExpr t v)

149−binaryExpr = binops appExpr lastExpr anyOp

150− where lastExpr = addLocation (choice [ ifExpr, letExpr, caseExpr ])

151− <|> lambdaExpr

152−

153−ifExpr :: IParser (Expr t v)

154−ifExpr = reserved "if" >> whitespace >> (normal <|> multiIf)

155− where

156− normal = do

157− bool <- expr

158− whitespace ; reserved "then" ; whitespace

159− thenBranch <- expr

160− whitespace <?> "an 'else' branch" ; reserved "else" <?> "an 'else' branch" ; whitespace

161− elseBranch <- expr

162− return $ MultiIf [(bool, thenBranch),

163− (Location.sameAs elseBranch (Var "otherwise"), elseBranch)]

164− multiIf = MultiIf <$> spaceSep1 iff

165− where iff = do string "|" ; whitespace

166− b <- expr ; whitespace ; string "->" ; whitespace

167− (,) b <$> expr

168−

169−lambdaExpr :: IParser (LExpr t v)

170−lambdaExpr = do char '\\' <|> char '\x03BB' <?> "anonymous function"

171− whitespace

172− args <- spaceSep1 Pattern.term

173− whitespace ; arrow ; whitespace

174− body <- expr

175− return (makeFunction args body)

176−

177−defSet :: IParser [Def t v]

178−defSet = block (do d <- def ; whitespace ; return d)

179−

180−letExpr :: IParser (Expr t v)

181−letExpr = do

182− reserved "let" ; whitespace

183− defs <- defSet

184− whitespace ; reserved "in" ; whitespace

185− Let defs <$> expr

186−

187−caseExpr :: IParser (Expr t v)

188−caseExpr = do

189− reserved "case"; whitespace; e <- expr; whitespace; reserved "of"; whitespace

190− Case e <$> (with <|> without)

191− where case_ = do p <- Pattern.expr; whitespace; arrow; whitespace

192− (,) p <$> expr

193− with = brackets (semiSep1 (case_ <?> "cases { x -> ... }"))

194− without = block (do c <- case_ ; whitespace ; return c)

195−

196−expr = addLocation (choice [ ifExpr, letExpr, caseExpr ])

197− <|> lambdaExpr

198− <|> binaryExpr

199− <?> "an expression"

200−

201−defStart :: IParser [Pattern]

202−defStart =

203− choice [ do p1 <- try Pattern.term

204− infics p1 <|> func p1

205− , func =<< (PVar <$> parens symOp)

206− , (:[]) <$> Pattern.expr

207− ] <?> "the definition of a variable (x = ...)"

208− where

209− func pattern =

210− case pattern of

211− PVar v -> (pattern:) <$> spacePrefix Pattern.term

212− _ -> do try (lookAhead (whitespace >> string "="))

213− return [pattern]

214−

215− infics p1 = do

216− o:p <- try (whitespace >> anyOp)

217− p2 <- (whitespace >> Pattern.term)

218− return $ if o == '`' then [ PVar $ takeWhile (/='`') p, p1, p2 ]

219− else [ PVar (o:p), p1, p2 ]

220−

221−makeFunction :: [Pattern] -> LExpr t v -> LExpr t v

222−makeFunction args body@(L s _) =

223− foldr (\arg body' -> L s $ Lambda arg body') body args

224−

225−definition :: IParser (Def t v)

226−definition = withPos $ do

227− (name:args) <- defStart

228− whitespace >> string "=" >> whitespace

229− body <- expr

230− return . Def name $ makeFunction args body

231−

232−typeAnnotation :: IParser (Def t v)

233−typeAnnotation = TypeAnnotation <$> try start <*> Type.expr

234− where

235− start = do

236− v <- lowVar <|> parens symOp

237− whitespace ; hasType ; whitespace

238− return v

239−

240−def :: IParser (Def t v)

241−def = typeAnnotation <|> definition

compiler/Parse/Helpers.hsdeleted−298

@@ -1,298 +0,0 @@

1−module Parse.Helpers where

2−

3−import Prelude hiding (until)

4−import Control.Applicative ((<$>),(<*>))

5−import Control.Monad

6−import Control.Monad.State

7−import Data.Char (isUpper)

8−import qualified Data.Set as Set

9−import qualified Data.Map as Map

10−import SourceSyntax.Helpers as Help

11−import SourceSyntax.Location as Location

12−import SourceSyntax.Expression

13−import SourceSyntax.PrettyPrint

14−import SourceSyntax.Declaration (Assoc)

15−import Text.Parsec hiding (newline,spaces,State)

16−import Text.Parsec.Indent

17−

18−reserveds = [ "if", "then", "else"

19− , "case", "of"

20− , "let", "in"

21− , "data", "type"

22− , "module", "where"

23− , "import", "as", "hiding", "open"

24− , "export", "foreign" ]

25−

26−jsReserveds :: Set.Set String

27−jsReserveds = Set.fromList

28− [ "null", "undefined", "Nan", "Infinity", "true", "false", "eval"

29− , "arguments", "int", "byte", "char", "goto", "long", "final", "float"

30− , "short", "double", "native", "throws", "boolean", "abstract", "volatile"

31− , "transient", "synchronized", "function", "break", "case", "catch"

32− , "continue", "debugger", "default", "delete", "do", "else", "finally"

33− , "for", "function", "if", "in", "instanceof", "new", "return", "switch"

34− , "this", "throw", "try", "typeof", "var", "void", "while", "with", "class"

35− , "const", "enum", "export", "extends", "import", "super", "implements"

36− , "interface", "let", "package", "private", "protected", "public"

37− , "static", "yield"

38− ]

39−

40−expecting = flip (<?>)

41−

42−type OpTable = Map.Map String (Int, Assoc)

43−type IParser a = ParsecT String OpTable (State SourcePos) a

44−

45−iParse :: IParser a -> String -> Either ParseError a

46−iParse = iParseWithTable "" Map.empty

47−

48−iParseWithTable :: SourceName -> OpTable -> IParser a -> String -> Either ParseError a

49−iParseWithTable sourceName table aParser input =

50− runIndent sourceName $ runParserT aParser table sourceName input

51−

52−backslashed :: IParser Char

53−backslashed = do { char '\\'; c <- anyChar

54− ; return . read $ ['\'','\\',c,'\''] }

55−

56−var :: IParser String

57−var = makeVar (letter <|> char '_' <?> "variable")

58−

59−lowVar :: IParser String

60−lowVar = makeVar (lower <?> "lower case variable")

61−capVar :: IParser String

62−capVar = makeVar (upper <?> "upper case variable")

63−

64−qualifiedVar :: IParser String

65−qualifiedVar = do

66− vars <- many ((++) <$> capVar <*> string ".")

67− (++) (concat vars) <$> lowVar

68−

69−rLabel :: IParser String

70−rLabel = lowVar

71−

72−innerVarChar :: IParser Char

73−innerVarChar = alphaNum <|> char '_' <|> char '\'' <?> ""

74−

75−makeVar :: IParser Char -> IParser String

76−makeVar p = do v <- (:) <$> p <*> many innerVarChar

77− guard (v `notElem` reserveds)

78− return v

79−

80−reserved :: String -> IParser String

81−reserved word =

82− try (string word >> notFollowedBy innerVarChar) >> return word

83− <?> "reserved word '" ++ word ++ "'"

84−

85−anyOp :: IParser String

86−anyOp = betwixt '`' '`' qualifiedVar <|> symOp <?> "infix operator (e.g. +, *, ||)"

87−

88−symOp :: IParser String

89−symOp = do op <- many1 (satisfy Help.isSymbol)

90− guard (op `notElem` [ "=", "..", "->", "--", "|", "\8594", ":" ])

91− case op of

92− "." -> notFollowedBy lower >> return op

93− "\8728" -> return "."

94− _ -> return op

95−

96−arrow :: IParser String

97−arrow = string "->" <|> string "\8594" <?> "arrow (->)"

98−

99−hasType :: IParser String

100−hasType = string ":" <?> "':' (a type annotation)'"

101−

102−

103−commitIf check p = commit <|> try p

104− where commit = do (try $ lookAhead check) >> p

105−

106−spaceySepBy1 :: IParser b -> IParser a -> IParser [a]

107−spaceySepBy1 sep p = do

108− a <- p

109− (a:) <$> many (commitIf (whitespace >> sep) (whitespace >> sep >> whitespace >> p))

110−

111−

112−commaSep1 :: IParser a -> IParser [a]

113−commaSep1 = spaceySepBy1 (char ',' <?> "comma ','")

114−

115−commaSep :: IParser a -> IParser [a]

116−commaSep = option [] . commaSep1

117−

118−semiSep1 :: IParser a -> IParser [a]

119−semiSep1 = spaceySepBy1 (char ';' <?> "semicolon ';'")

120−

121−pipeSep1 :: IParser a -> IParser [a]

122−pipeSep1 = spaceySepBy1 (char '|' <?> "type divider '|'")

123−

124−consSep1 :: IParser a -> IParser [a]

125−consSep1 = spaceySepBy1 (string "::" <?> "cons operator '::'")

126−

127−dotSep1 :: IParser a -> IParser [a]

128−dotSep1 p = (:) <$> p <*> many (try (char '.') >> p)

129−

130−spaceSep1 :: IParser a -> IParser [a]

131−spaceSep1 p = (:) <$> p <*> spacePrefix p

132−

133−spacePrefix p = constrainedSpacePrefix p (\_ -> return ())

134−

135−constrainedSpacePrefix p constraint =

136− many $ choice [ try (spacing >> lookAhead (oneOf "[({")) >> p

137− , try (spacing >> p)

138− ]

139− where

140− spacing = do

141− n <- whitespace

142− constraint n

143− indented

144−

145−failure msg = do

146− inp <- getInput

147− setInput ('x':inp)

148− anyToken

149− fail msg

150−

151−followedBy a b = do x <- a ; b ; return x

152−

153−betwixt a b c = do char a ; out <- c

154− char b <?> "closing '" ++ [b] ++ "'" ; return out

155−

156−surround a z name p = do

157− char a ; whitespace ; v <- p ; whitespace

158− char z <?> unwords ["closing", name, show z]

159− return v

160−

161−braces :: IParser a -> IParser a

162−braces = surround '[' ']' "brace"

163−

164−parens :: IParser a -> IParser a

165−parens = surround '(' ')' "paren"

166−

167−brackets :: IParser a -> IParser a

168−brackets = surround '{' '}' "bracket"

169−

170−addLocation :: (Pretty a) => IParser a -> IParser (Location.Located a)

171−addLocation expr = do

172− (start, e, end) <- located expr

173− return (Location.at start end e)

174−

175−located :: IParser a -> IParser (SourcePos, a, SourcePos)

176−located p = do

177− start <- getPosition

178− e <- p

179− end <- getPosition

180− return (start, e, end)

181−

182−accessible :: IParser (LExpr t v) -> IParser (LExpr t v)

183−accessible expr = do

184− start <- getPosition

185− ce@(L _ e) <- expr

186− let rest f = do

187− let dot = char '.' >> notFollowedBy (char '.')

188− access <- optionMaybe (try dot <?> "field access (e.g. List.map)")

189− case access of

190− Nothing -> return ce

191− Just _ -> accessible $ do

192− v <- var <?> "field access (e.g. List.map)"

193− end <- getPosition

194− return (Location.at start end (f v))

195− case e of Var (c:cs) | isUpper c -> rest (\v -> Var (c:cs ++ '.':v))

196− | otherwise -> rest (Access ce)

197− _ -> rest (Access ce)

198−

199−

200−spaces :: IParser String

201−spaces = concat <$> many1 (multiComment <|> string " ") <?> "spaces"

202−

203−forcedWS :: IParser String

204−forcedWS = choice [ try $ (++) <$> spaces <*> (concat <$> many nl_space)

205− , try $ concat <$> many1 nl_space ]

206− where nl_space = try ((++) <$> (concat <$> many1 newline) <*> spaces)

207−

208−-- Just eats whitespace until the next meaningful character.

209−dumbWhitespace :: IParser String

210−dumbWhitespace = concat <$> many (spaces <|> newline)

211−

212−whitespace :: IParser String

213−whitespace = option "" forcedWS <?> "whitespace"

214−

215−freshLine :: IParser [[String]]

216−freshLine = try (many1 newline >> many space_nl) <|> try (many1 space_nl) <?> ""

217− where space_nl = try $ spaces >> many1 newline

218−

219−newline :: IParser String

220−newline = simpleNewline <|> lineComment <?> "newline"

221−

222−simpleNewline :: IParser String

223−simpleNewline = try (string "\r\n") <|> string "\n"

224−

225−lineComment :: IParser String

226−lineComment = do

227− try (string "--")

228− comment <- anyUntil $ simpleNewline <|> (eof >> return "\n")

229− return ("--" ++ comment)

230−

231−multiComment :: IParser String

232−multiComment = (++) <$> try (string "{-") <*> closeComment

233−

234−closeComment :: IParser String

235−closeComment =

236− anyUntil . choice $

237− [ try (string "-}") <?> "close comment"

238− , concat <$> sequence [ try (string "{-"), closeComment, closeComment ]

239− ]

240−

241−until :: IParser a -> IParser b -> IParser b

242−until p end = go

243− where

244− go = end <|> (p >> go)

245−

246−anyUntil :: IParser String -> IParser String

247−anyUntil end = go

248− where

249− go = end <|> (:) <$> anyChar <*> go

250−

251−ignoreUntil :: IParser a -> IParser (Maybe a)

252−ignoreUntil end = go

253− where

254− ignore p = const () <$> p

255− filler = choice [ ignore multiComment

256− , ignore (markdown (\_ _ -> mzero))

257− , ignore anyChar

258− ]

259− go = choice [ Just <$> end

260− , filler `until` choice [ const Nothing <$> eof, newline >> go ]

261− ]

262−

263−onFreshLines :: (a -> b -> b) -> b -> IParser a -> IParser b

264−onFreshLines insert init thing = go init

265− where

266− go values = do

267− optionValue <- ignoreUntil thing

268− case optionValue of

269− Nothing -> return values

270− Just v -> go (insert v values)

271−

272−withSource :: IParser a -> IParser (String, a)

273−withSource p = do

274− start <- getParserState

275− result <- p

276− endPos <- getPosition

277− setParserState start

278− raw <- anyUntilPos endPos

279− return (raw, result)

280−

281−anyUntilPos :: SourcePos -> IParser String

282−anyUntilPos pos = go

283− where

284− go = do currentPos <- getPosition

285− case currentPos == pos of

286− True -> return []

287− False -> (:) <$> anyChar <*> go

288−

289−markdown :: (String -> [a] -> IParser (String, [a])) -> IParser (String, [a])

290−markdown interpolation = try (string "[markdown|") >> closeMarkdown "" []

291− where

292− closeMarkdown md stuff =

293− choice [ do try (string "|]")

294− return (md, stuff)

295− , uncurry closeMarkdown =<< interpolation md stuff

296− , do c <- anyChar

297− closeMarkdown (md ++ [c]) stuff

298− ]

compiler/Parse/Literal.hsdeleted−46

@@ -1,46 +0,0 @@

1−module Parse.Literal (literal) where

2−

3−import Control.Applicative ((<$>), (<*>))

4−import Control.Monad

5−import Text.Parsec hiding (newline,spaces)

6−import Text.Parsec.Indent

7−

8−import Parse.Helpers

9−import SourceSyntax.Literal

10−

11−literal = num <|> str <|> chr

12−

13−num :: IParser Literal

14−num = fmap toLit (preNum <?> "number")

15− where toLit n | '.' `elem` n = FloatNum (read n)

16− | otherwise = IntNum (read n)

17− preNum = concat <$> sequence [ option "" minus, many1 digit, option "" postNum ]

18− postNum = do try $ lookAhead (string "." >> digit)

19− string "."

20− ('.':) <$> many1 digit

21− minus = try $ do string "-"

22− lookAhead digit

23− return "-"

24−

25−chr :: IParser Literal

26−chr = Chr <$> betwixt '\'' '\'' (backslashed <|> satisfy (/='\''))

27− <?> "character"

28−

29−str :: IParser Literal

30−str = choice [ quote >> str <$> manyTill (backslashed <|> anyChar) quote

31− , liftM Str . expecting "string" . betwixt '"' '"' . many $

32− backslashed <|> satisfy (/='"')

33− ]

34− where

35− quote = try (string "\"\"\"")

36− str = Str . dewindows

37−

38− -- Remove \r from strings to fix generated JavaScript

39− dewindows [] = []

40− dewindows cs =

41− let (pre, suf) = break (`elem` ['\r','\n']) cs

42− in pre ++ case suf of

43− ('\r':'\n':rest) -> '\n' : dewindows rest

44− ('\n':rest) -> '\n' : dewindows rest

45− ('\r':rest) -> '\n' : dewindows rest

46− _ -> []

compiler/Parse/Module.hsdeleted−55

@@ -1,55 +0,0 @@

1−

2−module Parse.Module (moduleDef, getModuleName, imports) where

3−

4−import Control.Applicative ((<$>), (<*>))

5−import Data.List (intercalate)

6−import Text.Parsec hiding (newline,spaces)

7−

8−import Parse.Helpers

9−import SourceSyntax.Module (Module(..), ImportMethod(..), Imports)

10−

11−varList :: IParser [String]

12−varList = parens $ commaSep1 (var <|> parens symOp)

13−

14−getModuleName :: String -> Maybe String

15−getModuleName source =

16− case iParse getModuleName source of

17− Right name -> Just name

18− Left _ -> Nothing

19− where

20− getModuleName = do

21− optional freshLine

22− (names, _) <- moduleDef

23− return (intercalate "." names)

24−

25−moduleDef :: IParser ([String], [String])

26−moduleDef = do

27− try (reserved "module")

28− whitespace

29− names <- dotSep1 capVar <?> "name of module"

30− whitespace

31− exports <- option [] varList

32− whitespace <?> "reserved word 'where'"

33− reserved "where"

34− return (names, exports)

35−

36−imports :: IParser Imports

37−imports = option [] ((:) <$> import' <*> many (try (freshLine >> import')))

38−

39−import' :: IParser (String, ImportMethod)

40−import' =

41− do reserved "import"

42− whitespace

43− open <- optionMaybe (reserved "open")

44− whitespace

45− name <- intercalate "." <$> dotSep1 capVar

46− case open of

47− Just _ -> return (name, Hiding [])

48− Nothing -> let how = try (whitespace >> (as' <|> importing'))

49− in (,) name <$> option (As name) how

50− where

51− as' :: IParser ImportMethod

52− as' = reserved "as" >> whitespace >> As <$> capVar <?> "alias for module"

53−

54− importing' :: IParser ImportMethod

55− importing' = Importing <$> varList <?> "listing of imported values (x,y,z)"

compiler/Parse/Parse.hsdeleted−70

@@ -1,70 +0,0 @@

1−module Parse.Parse (program, dependencies) where

2−

3−import Control.Applicative ((<$>), (<*>))

4−import Control.Monad

5−import Data.Char (isSymbol, isDigit)

6−import Data.List (foldl',intercalate)

7−import qualified Data.Map as Map

8−import Text.Parsec hiding (newline,spaces)

9−import qualified Text.PrettyPrint as P

10−

11−import qualified SourceSyntax.Module as S

12−import SourceSyntax.Declaration (Declaration(Fixity))

13−import Parse.Helpers

14−import Parse.Binop (OpTable)

15−import Parse.Expression

16−import Parse.Declaration (infixDecl)

17−import Parse.Type

18−import Parse.Module

19−import qualified Parse.Declaration as Decl

20−

21−freshDef = commitIf (freshLine >> (letter <|> char '_')) $ do

22− freshLine

23− Decl.declaration <?> "another datatype or variable definition"

24−

25−decls = do d <- Decl.declaration <?> "at least one datatype or variable definition"

26− (d:) <$> many freshDef

27−

28−program :: OpTable -> String -> Either [P.Doc] (S.Module t v)

29−program table = setupParserWithTable table $ do

30− optional freshLine

31− (names,exports) <- option (["Main"],[]) (moduleDef `followedBy` freshLine)

32− is <- (do try (lookAhead $ reserved "import")

33− imports `followedBy` freshLine) <|> return []

34− declarations <- decls

35− optional freshLine ; optional spaces ; eof

36− return $ S.Module names exports is declarations

37−

38−dependencies :: String -> Either [P.Doc] (String, [String])

39−dependencies =

40− let getName = intercalate "." . fst in

41− setupParser $ do

42− optional freshLine

43− (,) <$> option "Main" (getName <$> moduleDef `followedBy` freshLine)

44− <*> option [] (map fst <$> imports `followedBy` freshLine)

45−

46−setupParserWithTable :: OpTable -> IParser a -> String -> Either [P.Doc] a

47−setupParserWithTable table p source =

48− do localTable <- setupParser parseFixities source

49− case Map.intersection table localTable of

50− overlap | not (Map.null overlap) -> Left [ msg overlap ]

51− | otherwise ->

52− flip setupParser source $ do

53− putState (Map.union table localTable)

54− p

55− where

56− msg overlap =

57− P.vcat [ P.text "Parse error:"

58− , P.text $ "Overlapping definitions for infix operators: " ++

59− intercalate " " (Map.keys overlap)

60− ]

61−

62−parseFixities = do

63− decls <- onFreshLines (:) [] infixDecl

64− return $ Map.fromList [ (op,(lvl,assoc)) | Fixity assoc lvl op <- decls ]

65−

66−setupParser :: IParser a -> String -> Either [P.Doc] a

67−setupParser p source =

68− case iParse p source of

69− Right result -> Right result

70− Left err -> Left [ P.text $ "Parse error at " ++ show err ]

compiler/Parse/Pattern.hsdeleted−61

@@ -1,61 +0,0 @@

1−

2−module Parse.Pattern (term, expr) where

3−

4−import Control.Applicative ((<$>),(<*>),pure)

5−import Control.Monad

6−import Control.Monad.State

7−import Data.Char (isUpper)

8−import Data.List (intercalate)

9−import Text.Parsec hiding (newline,spaces,State)

10−import Text.Parsec.Indent

11−

12−import Parse.Helpers

13−import Parse.Literal

14−import qualified SourceSyntax.Pattern as Pattern

15−import SourceSyntax.Everything hiding (tuple)

16−

17−

18−basic :: IParser Pattern

19−basic = choice

20− [ char '_' >> return PAnything

21− , do v <- var

22− return $ case v of

23− "True" -> PLiteral (Boolean True)

24− "False" -> PLiteral (Boolean False)

25− c : _ -> if isUpper c then PData v [] else PVar v

26− , PLiteral <$> literal

27− ]

28−

29−asPattern :: Pattern -> IParser Pattern

30−asPattern pattern = do

31− var <- optionMaybe (try (whitespace >> reserved "as" >> whitespace >> lowVar))

32− return $ case var of

33− Just v -> PAlias v pattern

34− Nothing -> pattern

35−

36−record :: IParser Pattern

37−record = PRecord <$> brackets (commaSep1 lowVar)

38−

39−tuple :: IParser Pattern

40−tuple = do ps <- parens (commaSep expr)

41− return $ case ps of { [p] -> p; _ -> Pattern.tuple ps }

42−

43−list :: IParser Pattern

44−list = Pattern.list <$> braces (commaSep expr)

45−

46−term :: IParser Pattern

47−term =

48− (choice [ record, tuple, list, basic ]) <?> "pattern"

49−

50−patternConstructor :: IParser Pattern

51−patternConstructor = do

52− v <- intercalate "." <$> dotSep1 capVar

53− case v of

54− "True" -> return $ PLiteral (Boolean True)

55− "False" -> return $ PLiteral (Boolean False)

56− _ -> PData v <$> spacePrefix term

57−

58−expr :: IParser Pattern

59−expr = do

60− patterns <- consSep1 (patternConstructor <|> term)

61− asPattern (foldr1 Pattern.cons patterns) <?> "pattern"

compiler/Parse/Type.hsdeleted−75

@@ -1,75 +0,0 @@

1−module Parse.Type where

2−

3−import Control.Applicative ((<$>),(<*>))

4−import Control.Monad (liftM,mapM)

5−import Data.Char (isLower)

6−import Data.List (lookup,intercalate)

7−import Text.Parsec

8−import Text.Parsec.Indent

9−

10−import SourceSyntax.Type as T

11−import Parse.Helpers

12−

13−tvar :: IParser T.Type

14−tvar = T.Var <$> lowVar <?> "type variable"

15−

16−list :: IParser T.Type

17−list = listOf <$> braces expr

18−

19−tuple :: IParser T.Type

20−tuple = do ts <- parens (commaSep expr)

21− return $ case ts of

22− [t] -> t

23− _ -> tupleOf ts

24−

25−record :: IParser T.Type

26−record =

27− do char '{' ; whitespace

28− (ext,fs) <- extended <|> normal

29− dumbWhitespace ; char '}'

30− return (T.Record fs ext)

31− where

32− normal = (,) T.EmptyRecord <$> commaSep fields

33−

34− -- extended record types require at least one field

35− extended = do

36− ext <- try (const <$> tvar <*> (whitespace >> string "|"))

37− whitespace

38− (,) ext <$> commaSep1 fields

39−

40− fields = do

41− lbl <- rLabel

42− whitespace >> hasType >> whitespace

43− (,) lbl <$> expr

44−

45−capTypeVar = intercalate "." <$> dotSep1 capVar

46−

47−constructor0 :: IParser T.Type

48−constructor0 =

49− do name <- capTypeVar

50− return (T.Data name [])

51−

52−term :: IParser T.Type

53−term = list <|> tuple <|> record <|> tvar <|> constructor0

54−

55−app :: IParser T.Type

56−app =

57− do name <- capTypeVar <|> try tupleCtor <?> "type constructor"

58− args <- spacePrefix term

59− return (T.Data name args)

60− where

61− tupleCtor = do

62− n <- length <$> parens (many (char ','))

63− return $ "_Tuple" ++ show (if n == 0 then 0 else n+1)

64−

65−expr :: IParser T.Type

66−expr =

67− do t1 <- app <|> term

68− arr <- optionMaybe $ try (whitespace >> arrow)

69− case arr of

70− Just _ -> T.Lambda t1 <$> (whitespace >> expr)

71− Nothing -> return t1

72−

73−constructor :: IParser (String, [T.Type])

74−constructor = (,) <$> (capTypeVar <?> "another type constructor")

75− <*> spacePrefix term

compiler/Paths_El.hsdeleted−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/Declaration.hsdeleted−48

@@ -1,48 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Declaration where

3−

4−import Data.Data

5−import qualified SourceSyntax.Expression as Expr

6−import SourceSyntax.Type

7−import SourceSyntax.PrettyPrint

8−import Text.PrettyPrint as P

9−

10−data Declaration tipe var

11− = Definition (Expr.Def tipe var)

12− | Datatype String [String] [(String,[Type])]

13− | TypeAlias String [String] Type

14− | ImportEvent String (Expr.LExpr tipe var) String Type

15− | ExportEvent String String Type

16− | Fixity Assoc Int String

17− deriving (Eq, Show)

18−

19−data Assoc = L | N | R

20− deriving (Eq)

21−

22−instance Show Assoc where

23− show assoc =

24− case assoc of

25− L -> "left"

26− N -> "non"

27− R -> "right"

28−

29−instance Pretty (Declaration t v) where

30− pretty decl =

31− case decl of

32− Definition def -> pretty def

33−

34− Datatype tipe tvars ctors ->

35− P.hang (P.text "data" <+> P.text tipe <+> P.hsep (map P.text tvars)) 4

36− (P.sep $ zipWith join ("=" : repeat "|") ctors)

37− where

38− join c ctor = P.text c <+> prettyCtor ctor

39− prettyCtor (name, tipes) =

40− P.hang (P.text name) 2 (P.sep (map prettyParens tipes))

41−

42− TypeAlias name tvars tipe ->

43− let alias = P.text name <+> P.hsep (map P.text tvars) in

44− P.hang (P.text "type" <+> alias <+> P.equals) 4 (pretty tipe)

45−

46− -- TODO: actually write out the other cases. They are currently unused, but

47− -- this is probably going to be a bug someday.

48− _ -> P.text (show decl)

compiler/SourceSyntax/Everything.hsdeleted−17

@@ -1,17 +0,0 @@

1−module SourceSyntax.Everything

2− (module SourceSyntax.Helpers,

3− module SourceSyntax.Location,

4− module SourceSyntax.Literal,

5− module SourceSyntax.Pattern,

6− module SourceSyntax.Expression,

7− module SourceSyntax.Declaration,

8− module SourceSyntax.Module

9− ) where

10−

11−import SourceSyntax.Helpers

12−import SourceSyntax.Location

13−import SourceSyntax.Literal

14−import SourceSyntax.Pattern hiding (tuple, list, cons, nil, prettyParens)

15−import SourceSyntax.Expression

16−import SourceSyntax.Declaration hiding (Assoc(..))

17−import SourceSyntax.Module

compiler/SourceSyntax/Expression.hsdeleted−131

@@ -1,131 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Expression where

3−

4−import Data.Data

5−import Data.List (intercalate)

6−import SourceSyntax.PrettyPrint

7−import Text.PrettyPrint as P

8−import qualified SourceSyntax.Helpers as Help

9−import qualified SourceSyntax.Location as Location

10−import qualified SourceSyntax.Pattern as Pattern

11−import qualified SourceSyntax.Type as Type

12−import qualified SourceSyntax.Literal as Literal

13−

14−type LExpr tipe var = Location.Located (Expr tipe var)

15−data Expr t v

16− = Literal Literal.Literal

17− | Var String

18− | Range (LExpr t v) (LExpr t v)

19− | ExplicitList [LExpr t v]

20− | Binop String (LExpr t v) (LExpr t v)

21− | Lambda Pattern.Pattern (LExpr t v)

22− | App (LExpr t v) (LExpr t v)

23− | MultiIf [(LExpr t v,LExpr t v)]

24− | Let [Def t v] (LExpr t v)

25− | Case (LExpr t v) [(Pattern.Pattern, LExpr t v)]

26− | Data String [LExpr t v]

27− | Access (LExpr t v) String

28− | Remove (LExpr t v) String

29− | Insert (LExpr t v) String (LExpr t v)

30− | Modify (LExpr t v) [(String, LExpr t v)]

31− | Record [(String, LExpr t v)]

32− | Markdown String [LExpr t v]

33− deriving (Eq, Show, Data, Typeable)

34−

35−data Def tipe var

36− = Def Pattern.Pattern (LExpr tipe var)

37− | TypeAnnotation String Type.Type

38− deriving (Eq, Show, Data, Typeable)

39−

40−tuple es = Data ("_Tuple" ++ show (length es)) es

41−

42−delist (Location.L _ (Data "::" [h,t])) = h : delist t

43−delist _ = []

44−

45−saveEnvName = "_save_the_environment!!!"

46−

47−dummyLet defs =

48− Location.none $ Let defs (Location.none $ Var saveEnvName)

49−

50−instance Pretty (Expr t v) where

51− pretty expr =

52− case expr of

53− Literal lit -> pretty lit

54− Var x -> variable x

55− Range e1 e2 -> P.brackets (pretty e1 <> P.text ".." <> pretty e2)

56− ExplicitList es -> P.brackets (commaCat (map pretty es))

57− Binop "-" (Location.L _ (Literal (Literal.IntNum 0))) e ->

58− P.text "-" <> prettyParens e

59− Binop op e1 e2 -> P.sep [ prettyParens e1 <+> P.text op', prettyParens e2 ]

60− where op' = if Help.isOp op then op else "`" ++ op ++ "`"

61− Lambda p e -> let (ps,body) = collectLambdas (Location.none $ Lambda p e)

62− in P.text "\\" <> P.sep ps <+> P.text "->" <+> pretty body

63− App _ _ -> P.hang func 2 (P.sep args)

64− where func:args = map prettyParens (collectApps (Location.none expr))

65− MultiIf branches -> P.text "if" $$ nest 3 (vcat $ map iff branches)

66− where

67− iff (b,e) = P.text "|" <+> P.hang (pretty b <+> P.text "->") 2 (pretty e)

68− Let defs e ->

69− P.sep [ P.hang (P.text "let") 4 (P.vcat (map pretty defs))

70− , P.text "in" <+> pretty e ]

71− Case e pats ->

72− P.hang pexpr 2 (P.vcat (map pretty' pats))

73− where

74− pexpr = P.sep [ P.text "case" <+> pretty e, P.text "of" ]

75− pretty' (p,e) = pretty p <+> P.text "->" <+> pretty e

76− Data "::" [hd,tl] -> pretty hd <+> P.text "::" <+> pretty tl

77− Data "[]" [] -> P.text "[]"

78− Data name es -> P.hang (P.text name) 2 (P.sep (map prettyParens es))

79− Access e x -> prettyParens e <> P.text "." <> variable x

80− Remove e x -> P.braces (pretty e <+> P.text "-" <+> variable x)

81− Insert (Location.L _ (Remove e y)) x v ->

82− P.braces (pretty e <+> P.text "-" <+> variable y <+> P.text "|" <+> variable x <+> P.text "=" <+> pretty v)

83− Insert e x v ->

84− P.braces (pretty e <+> P.text "|" <+> variable x <+> P.text "=" <+> pretty v)

85−

86− Modify e fs ->

87− P.braces $ P.hang (pretty e <+> P.text "|")

88− 4

89− (commaSep $ map field fs)

90− where

91− field (x,e) = variable x <+> P.text "<-" <+> pretty e

92−

93− Record fs ->

94− P.braces $ P.nest 2 (commaSep $ map field fs)

95− where

96− field (x,e) = variable x <+> P.text "=" <+> pretty e

97−

98− Markdown _ _ -> P.text "[markdown| ... |]"

99−

100−instance Pretty (Def t v) where

101− pretty def =

102− case def of

103− TypeAnnotation name tipe ->

104− variable name <+> P.text ":" <+> pretty tipe

105− Def pattern expr ->

106− pretty pattern <+> P.text "=" <+> pretty expr

107−

108−collectApps lexpr@(Location.L _ expr) =

109− case expr of

110− App a b -> collectApps a ++ [b]

111− _ -> [lexpr]

112−

113−collectLambdas lexpr@(Location.L _ expr) =

114− case expr of

115− Lambda pattern body ->

116− let (ps, body') = collectLambdas body

117− in (pretty pattern : ps, body')

118− _ -> ([], lexpr)

119−

120−prettyParens (Location.L _ expr) = parensIf needed (pretty expr)

121− where

122− needed =

123− case expr of

124− Binop _ _ _ -> True

125− Lambda _ _ -> True

126− App _ _ -> True

127− MultiIf _ -> True

128− Let _ _ -> True

129− Case _ _ -> True

130− Data name (x:xs) -> name /= "::"

131− _ -> False

compiler/SourceSyntax/Helpers.hsdeleted−18

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

1−

2−module SourceSyntax.Helpers where

3−

4−import qualified Data.Char as Char

5−

6−brkt :: String -> String

7−brkt s = "{ " ++ s ++ " }"

8−

9−isTuple :: String -> Bool

10−isTuple name =

11− take 6 name == "_Tuple" && all Char.isDigit (drop 6 name)

12−

13−isOp :: String -> Bool

14−isOp = all isSymbol

15−

16−isSymbol :: Char -> Bool

17−isSymbol c =

18− Char.isSymbol c || elem c "+-/*=.$<>:&|^?%#@~!"

compiler/SourceSyntax/Literal.hsdeleted−22

@@ -1,22 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Literal where

3−

4−import Data.Data

5−import SourceSyntax.PrettyPrint

6−import qualified Text.PrettyPrint as PP

7−

8−data Literal = IntNum Int

9− | FloatNum Double

10− | Chr Char

11− | Str String

12− | Boolean Bool

13− deriving (Eq, Ord, Data, Typeable, Show)

14−

15−instance Pretty Literal where

16− pretty literal =

17− case literal of

18− IntNum n -> PP.int n

19− FloatNum n -> PP.double n

20− Chr c -> PP.quotes (PP.char c)

21− Str s -> PP.text (show s)

22− Boolean bool -> PP.text (show bool)

compiler/SourceSyntax/Location.hsdeleted−60

@@ -1,60 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Location where

3−

4−import Data.Data

5−import Text.PrettyPrint

6−import SourceSyntax.PrettyPrint

7−import qualified Text.Parsec.Pos as Parsec

8−

9−data SrcPos = Pos { line :: Int, column :: Int }

10− deriving (Eq, Ord, Data, Typeable)

11−

12−data SrcSpan = Span SrcPos SrcPos String | NoSpan String

13− deriving (Eq, Ord, Data, Typeable)

14−

15−data Located e = L SrcSpan e

16− deriving (Eq, Ord, Data, Typeable)

17−

18−none e = L (NoSpan (render $ pretty e)) e

19−noneNoDocs = L (NoSpan "")

20−

21−at start end e = L (Span (Pos (Parsec.sourceLine start) (Parsec.sourceColumn start))

22− (Pos (Parsec.sourceLine end ) (Parsec.sourceColumn end ))

23− (render $ pretty e)) e

24−

25−merge (L s1 _) (L s2 _) e = L (span (render $ pretty e)) e

26− where span = case (s1,s2) of

27− (Span start _ _, Span _ end _) -> Span start end

28− (Span start end _, _) -> Span start end

29− (_, Span start end _) -> Span start end

30− (_, _) -> NoSpan

31−

32−mergeOldDocs (L s1 _) (L s2 _) e = L span e

33− where span = case (s1,s2) of

34− (Span start _ d1, Span _ end d2) -> Span start end (d1 ++ "\n\n" ++ d2)

35− (Span _ _ _, _) -> s1

36− (_, Span _ _ _) -> s2

37− (_, _) -> NoSpan ""

38−

39−sameAs (L s _) = L s

40−

41−

42−instance Show SrcPos where

43− show (Pos r c) = show r ++ "," ++ show c

44−

45−instance Show SrcSpan where

46− show span =

47− case span of

48− NoSpan _ -> ""

49− Span start end _ ->

50− case line start == line end of

51− False -> "between lines " ++ show (line start) ++ " and " ++ show (line end)

52− True -> "on line " ++ show (line end) ++ ", column " ++

53− show (column start) ++ " to " ++ show (column end)

54−

55−instance Show e => Show (Located e) where

56− show (L s e) = "L (" ++ show s ++ ") (" ++ show e ++ ")"

57−

58−instance Pretty a => Pretty (Located a) where

59− pretty (L _ e) = pretty e

60−

compiler/SourceSyntax/Module.hsdeleted−63

@@ -1,63 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Module where

3−

4−import Data.Data

5−import Data.Binary

6−import Data.List (intercalate)

7−import qualified Data.Map as Map

8−import Control.Applicative ((<$>), (<*>))

9−import Control.Arrow (second)

10−

11−import SourceSyntax.Expression (LExpr)

12−import SourceSyntax.Declaration

13−import SourceSyntax.Type

14−import System.FilePath (joinPath)

15−

16−data Module tipe var =

17− Module [String] Exports Imports [Declaration tipe var]

18− deriving (Show)

19−

20−type Exports = [String]

21−

22−type Imports = [(String, ImportMethod)]

23−data ImportMethod = As String | Importing [String] | Hiding [String]

24− deriving (Eq, Ord, Show, Data, Typeable)

25−

26−data MetadataModule t v = MetadataModule {

27− names :: [String],

28− path :: FilePath,

29− exports :: [String],

30− imports :: [(String, ImportMethod)],

31− program :: LExpr t v,

32− types :: Map.Map String Type,

33− fixities :: [(Assoc, Int, String)],

34− aliases :: [(String, [String], Type)],

35− datatypes :: [ (String, [String], [(String,[Type])]) ],

36− foreignImports :: [(String, LExpr t v, String, Type)],

37− foreignExports :: [(String, String, Type)]

38−}

39−

40−type Interfaces = Map.Map String ModuleInterface

41−type ADT = (String, [String], [(String,[Type])])

42−

43−data ModuleInterface = ModuleInterface {

44− iTypes :: Map.Map String Type,

45− iAdts :: [ADT],

46− iAliases :: [(String, [String], Type)],

47− iFixities :: [(Assoc, Int, String)]

48−} deriving Show

49−

50−instance Binary ModuleInterface where

51− get = ModuleInterface <$> get <*> get <*> get <*> get

52− put modul = do

53− put (iTypes modul)

54− put (iAdts modul)

55− put (iAliases modul)

56− put (iFixities modul)

57−

58−

59−instance Binary Assoc where

60− get = do n <- getWord8

61− return $ case n of { 0 -> L ; 1 -> N ; 2 -> R }

62−

63− put assoc = putWord8 $ case assoc of { L -> 0 ; N -> 1 ; R -> 2 }

compiler/SourceSyntax/Pattern.hsdeleted−48

@@ -1,48 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Pattern where

3−

4−import Data.List (intercalate)

5−import Data.Data

6−import SourceSyntax.Helpers as Help

7−import SourceSyntax.PrettyPrint

8−import Text.PrettyPrint as PP

9−import SourceSyntax.Literal as Literal

10−

11−data Pattern = PData String [Pattern]

12− | PRecord [String]

13− | PAlias String Pattern

14− | PVar String

15− | PAnything

16− | PLiteral Literal.Literal

17− deriving (Eq, Ord, Data, Typeable, Show)

18−

19−cons h t = PData "::" [h,t]

20−nil = PData "[]" []

21−list = foldr cons nil

22−tuple es = PData ("_Tuple" ++ show (length es)) es

23−

24−

25−instance Pretty Pattern where

26− pretty pattern =

27− case pattern of

28− PVar x -> variable x

29− PLiteral lit -> pretty lit

30− PRecord fs -> PP.braces (commaCat $ map variable fs)

31− PAlias x p -> prettyParens p <+> PP.text "as" <+> variable x

32− PAnything -> PP.text "_"

33− PData "::" [hd,tl] -> parensIf isCons (pretty hd) <+> PP.text "::" <+> pretty tl

34− where isCons = case hd of

35− PData "::" _ -> True

36− _ -> False

37− PData name ps ->

38− if isTuple name then

39− PP.parens . commaCat $ map pretty ps

40− else sep (PP.text name : map prettyParens ps)

41−

42−prettyParens pattern = parensIf needsThem (pretty pattern)

43− where

44− needsThem =

45− case pattern of

46− PData name (_:_) | not (isTuple name) -> True

47− PAlias _ _ -> True

48− _ -> False

compiler/SourceSyntax/PrettyPrint.hsdeleted−34

@@ -1,34 +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−commaCat docs = cat (punctuate comma docs)

14−commaSep docs = sep (punctuate comma docs)

15−

16−parensIf bool doc = if bool then parens doc else doc

17−

18−variable x =

19− if Help.isOp x then parens (text x)

20− else text (reprime x)

21−

22−reprime :: String -> String

23−reprime = map (\c -> if c == '$' then '\'' else c)

24−

25−eightyCharLines :: Int -> String -> String

26−eightyCharLines indent message = answer

27− where

28− (answer,_,_) = foldl step (spaces, indent-1, "") chunks

29−

30− chunks = map (\w -> (w, length w)) (words message)

31− spaces = replicate indent ' '

32− step (sentence, slen, space) (word, wlen)

33− | slen + wlen > 79 = (sentence ++ "\n" ++ spaces ++ word, indent + wlen, " ")

34− | otherwise = (sentence ++ space ++ word, slen + wlen + length space, " ")

compiler/SourceSyntax/Type.hsdeleted−96

@@ -1,96 +0,0 @@

1−{-# LANGUAGE DeriveDataTypeable #-}

2−module SourceSyntax.Type where

3−

4−import Data.Binary

5−import Data.Data

6−import qualified Data.Map as Map

7−import qualified SourceSyntax.Helpers as Help

8−import Control.Applicative ((<$>), (<*>))

9−import SourceSyntax.PrettyPrint

10−import Text.PrettyPrint as P

11−

12−data Type = Lambda Type Type

13− | Var String

14− | Data String [Type]

15− | EmptyRecord

16− | Record [(String,Type)] Type

17− deriving (Eq, Show, Data, Typeable)

18−

19−fieldMap :: [(String,a)] -> Map.Map String [a]

20−fieldMap fields =

21− foldl (\r (x,t) -> Map.insertWith (++) x [t] r) Map.empty fields

22−

23−recordOf :: [(String,Type)] -> Type

24−recordOf fields = Record fields EmptyRecord

25−

26−listOf :: Type -> Type

27−listOf t = Data "_List" [t]

28−

29−tupleOf :: [Type] -> Type

30−tupleOf ts = Data ("_Tuple" ++ show (length ts)) ts

31−

32−

33−instance Pretty Type where

34− pretty tipe =

35− case tipe of

36− Lambda t1 t2 -> P.sep [ t, P.sep (map (P.text "->" <+>) ts) ]

37− where t:ts = collectLambdas tipe

38− Var x -> P.text x

39− Data "_List" [t] -> P.brackets (pretty t)

40− Data name tipes

41− | Help.isTuple name -> P.parens . P.sep . P.punctuate P.comma $ map pretty tipes

42− | otherwise -> P.hang (P.text name) 2 (P.sep $ map prettyParens tipes)

43− EmptyRecord -> P.braces P.empty

44− Record _ _ -> P.braces $ case ext of

45− EmptyRecord -> prettyFields

46− _ -> P.hang (pretty ext <+> P.text "|") 4 prettyFields

47− where

48− (fields, ext) = collectRecords tipe

49− prettyField (f,t) = P.text f <+> P.text ":" <+> pretty t

50− prettyFields = commaSep . map prettyField $ fields

51−

52−collectLambdas tipe =

53− case tipe of

54− Lambda arg@(Lambda _ _) body -> P.parens (pretty arg) : collectLambdas body

55− Lambda arg body -> pretty arg : collectLambdas body

56− _ -> [pretty tipe]

57−

58−collectRecords = go []

59− where

60− go fields tipe =

61− case tipe of

62− Record fs ext -> go (fs ++ fields) ext

63− _ -> (fields, tipe)

64−

65−prettyParens tipe = parensIf needed (pretty tipe)

66− where

67− needed =

68− case tipe of

69− Lambda _ _ -> True

70− Data "_List" [_] -> False

71− Data _ [] -> False

72− Data _ _ -> True

73− _ -> False

74−

75−instance Binary Type where

76− put tipe =

77− case tipe of

78− Lambda t1 t2 ->

79− putWord8 0 >> put t1 >> put t2

80− Var x ->

81− putWord8 1 >> put x

82− Data ctor tipes ->

83− putWord8 2 >> put ctor >> put tipes

84− EmptyRecord ->

85− putWord8 3

86− Record fs ext ->

87− putWord8 4 >> put fs >> put ext

88−

89− get = do

90− n <- getWord8

91− case n of

92− 0 -> Lambda <$> get <*> get

93− 1 -> Var <$> get

94− 2 -> Data <$> get <*> get

95− 3 -> return EmptyRecord

96− 4 -> Record <$> get <*> get

compiler/SourceSyntax/Variable.hsdeleted−2

@@ -1,2 +0,0 @@

1−module SourceSyntax.Variable where

2−

compiler/Transform/Canonicalize.hsdeleted−188

@@ -1,188 +0,0 @@

1−module Transform.Canonicalize (interface, metadataModule) where

2−

3−import Control.Arrow ((***))

4−import Control.Monad.Identity

5−import qualified Data.Map as Map

6−import qualified Data.Set as Set

7−import qualified Data.List as List

8−import qualified Data.Either as Either

9−import SourceSyntax.Module

10−import SourceSyntax.Expression

11−import SourceSyntax.Location as Loc

12−import SourceSyntax.Pattern

13−import SourceSyntax.Helpers (isOp)

14−import qualified SourceSyntax.Type as Type

15−import qualified Transform.SortDefinitions as SD

16−import Text.PrettyPrint as P

17−

18−

19−interface :: String -> ModuleInterface -> ModuleInterface

20−interface moduleName iface =

21− ModuleInterface

22− { iTypes = Map.mapKeys prefix (Map.map renameType' (iTypes iface))

23− , iAdts = map (both prefix renameCtors) (iAdts iface)

24− , iAliases = map (both prefix renameType') (iAliases iface)

25− , iFixities = iFixities iface -- cannot have canonicalized operators while parsing

26− }

27− where

28− both f g (a,b,c) = (f a, b, g c)

29− prefix name = moduleName ++ "." ++ name

30−

31− pair name = (name, moduleName ++ "." ++ name)

32− canon (name,_,_) = pair name

33− canons = Map.fromList $ concat

34− [ map canon (iAdts iface), map canon (iAliases iface) ]

35−

36− renameCtors ctors =

37− map (prefix *** map renameType') ctors

38− renameType' =

39− runIdentity . renameType (\name -> return $ Map.findWithDefault name name canons)

40−

41−renameType :: (Monad m) => (String -> m String) -> Type.Type -> m Type.Type

42−renameType rename tipe =

43− let rnm = renameType rename in

44− case tipe of

45− Type.Lambda a b -> Type.Lambda `liftM` rnm a `ap` rnm b

46− Type.Var x -> return tipe

47− Type.Data name ts -> Type.Data `liftM` rename name `ap` mapM rnm ts

48− Type.EmptyRecord -> return tipe

49− Type.Record fields ext -> Type.Record `liftM` mapM rnm' fields `ap` rnm ext

50− where rnm' (f,t) = (,) f `liftM` rnm t

51−

52−metadataModule :: Interfaces -> MetadataModule t v -> Either [Doc] (MetadataModule t v)

53−metadataModule ifaces modul =

54− do _ <- case filter (\m -> Map.notMember m ifaces) (map fst realImports) of

55− [] -> Right ()

56− missings -> Left [ P.text $ "The following imports were not found: " ++ List.intercalate ", " missings ]

57− program' <- rename initialEnv (program modul)

58− aliases' <- mapM (third renameType') (aliases modul)

59− datatypes' <- mapM (third (mapM (second (mapM renameType')))) (datatypes modul)

60− exports' <- mapM (third renameType') (foreignExports modul)

61− imports' <- mapM (twoAndFour (rename initialEnv) renameType') (foreignImports modul)

62− return $ modul { program = program'

63− , aliases = aliases'

64− , datatypes = datatypes'

65− , foreignExports = exports'

66− , foreignImports = imports' }

67− where

68− second f (a,b) = (,) a `fmap` f b

69− third f (a,b,c) = (,,) a b `fmap` f c

70− twoAndFour f g (a,b,c,d) = do b' <- f b

71− d' <- g d

72− return (a,b',c,d')

73− renameType' =

74− Either.either (\err -> Left [P.text err]) return . renameType (replace "type" initialEnv)

75−

76− get1 (a,_,_) = a

77− canon (name, importMethod) =

78− let pair pre var = (pre ++ drop (length name + 1) var, var)

79− iface = ifaces Map.! name

80− allNames = concat [ Map.keys (iTypes iface)

81− , map get1 (iAliases iface)

82− , concat [ n : map fst ctors | (n,_,ctors) <- iAdts iface ] ]

83− in case importMethod of

84− As alias -> map (pair (alias ++ ".")) allNames

85− Hiding vars -> map (pair "") $ filter (flip Set.notMember vs) allNames

86− where vs = Set.fromList vars

87− Importing vars -> map (pair "") $ filter (flip Set.member vs) allNames

88− where vs = Set.fromList $ map (\v -> name ++ "." ++ v) vars

89−

90− pair n = (n,n)

91− localEnv = map pair (map get1 (aliases modul) ++ map get1 (datatypes modul))

92− globalEnv = map pair $ ["_List",saveEnvName,"::","[]","Int","Float","Char","Bool","String"] ++

93− map (\n -> "_Tuple" ++ show n) [0..9]

94− realImports = filter (not . List.isPrefixOf "Native." . fst) (imports modul)

95− initialEnv = Map.fromList (concatMap canon realImports ++ localEnv ++ globalEnv)

96−

97−

98−type Env = Map.Map String String

99−

100−extend :: Env -> Pattern -> Env

101−extend env pattern = Map.union (Map.fromList (zip xs xs)) env

102− where xs = Set.toList (SD.boundVars pattern)

103−

104−

105−replace :: String -> Env -> String -> Either String String

106−replace variable env v =

107− if List.isPrefixOf "Native." v then return v else

108− case Map.lookup v env of

109− Just v' -> return v'

110− Nothing -> Left $ "Could not find " ++ variable ++ " '" ++ v ++ "'." ++ msg

111− where

112− matches = filter (List.isInfixOf v) (Map.keys env)

113− msg = if null matches then "" else

114− "\nClose matches include: " ++ List.intercalate ", " matches

115−

116−rename :: Env -> LExpr t v -> Either [Doc] (LExpr t v)

117−rename env lexpr@(L s expr) =

118− let rnm = rename env

119− throw err = Left [ P.text $ "Error " ++ show s ++ "\n" ++ err ]

120− format = Either.either throw return

121− in

122− L s `liftM`

123− case expr of

124− Literal lit -> return expr

125−

126− Range e1 e2 -> Range `liftM` rnm e1 `ap` rnm e2

127−

128− Access e x -> Access `liftM` rnm e `ap` return x

129−

130− Remove e x -> flip Remove x `liftM` rnm e

131−

132− Insert e x v -> flip Insert x `liftM` rnm e `ap` rnm v

133−

134− Modify e fs ->

135− Modify `liftM` rnm e `ap` mapM (\(x,e) -> (,) x `liftM` rnm e) fs

136−

137− Record fs -> Record `liftM` mapM frnm fs

138− where

139− frnm (f,e) = (,) f `liftM` rename env e

140−

141− Binop op e1 e2 ->

142− do op' <- format (replace "variable" env op)

143− Binop op' `liftM` rnm e1 `ap` rnm e2

144−

145− Lambda pattern e ->

146− let env' = extend env pattern in

147− Lambda `liftM` format (renamePattern env' pattern) `ap` rename env' e

148−

149− App e1 e2 -> App `liftM` rnm e1 `ap` rnm e2

150−

151− MultiIf ps -> MultiIf `liftM` mapM grnm ps

152− where grnm (b,e) = (,) `liftM` rnm b `ap` rnm e

153−

154− Let defs e -> Let `liftM` mapM rename' defs `ap` rename env' e

155− where

156− env' = foldl extend env [ pattern | Def pattern _ <- defs ]

157− rename' def =

158− case def of

159− Def p exp ->

160− Def `liftM` format (renamePattern env' p) `ap` rename env' exp

161− TypeAnnotation name tipe ->

162− TypeAnnotation name `liftM`

163− renameType (format . replace "variable" env') tipe

164−

165− Var x -> Var `liftM` format (replace "variable" env x)

166−

167− Data name es -> Data name `liftM` mapM rnm es

168−

169− ExplicitList es -> ExplicitList `liftM` mapM rnm es

170−

171− Case e cases -> Case `liftM` rnm e `ap` mapM branch cases

172− where

173− branch (pattern,e) = (,) `liftM` format (renamePattern env pattern)

174− `ap` rename (extend env pattern) e

175−

176− Markdown md es -> Markdown md `liftM` mapM rnm es

177−

178−

179−renamePattern :: Env -> Pattern -> Either String Pattern

180−renamePattern env pattern =

181− case pattern of

182− PVar _ -> return pattern

183− PLiteral _ -> return pattern

184− PRecord _ -> return pattern

185− PAnything -> return pattern

186− PAlias x p -> PAlias x `liftM` renamePattern env p

187− PData name ps -> PData `liftM` replace "pattern" env name

188− `ap` mapM (renamePattern env) ps

compiler/Transform/Check.hsdeleted−142

@@ -1,142 +0,0 @@

1−module Transform.Check (mistakes) where

2−

3−import Transform.SortDefinitions (boundVars)

4−import SourceSyntax.Everything

5−import SourceSyntax.PrettyPrint

6−import qualified SourceSyntax.Type as T

7−import Data.List as List

8−import qualified Data.Map as Map

9−import qualified Data.Maybe as Maybe

10−import qualified Data.Set as Set

11−import Data.Data

12−import Data.Generics.Uniplate.Data

13−import Text.PrettyPrint as P

14−

15−

16−mistakes :: (Data t, Data v) => [Declaration t v] -> [Doc]

17−mistakes decls =

18− concat [ infiniteTypeAliases decls

19− , illFormedTypes decls

20− , map P.text (concatMap findErrors (getLets decls)) ]

21− where

22− findErrors defs = duplicates defs ++ badOrder defs

23−

24−

25−getLets :: (Data t, Data v) => [Declaration t v] -> [[Def t v]]

26−getLets decls = defs : concatMap getSubLets defs

27− where

28− defs = concatMap (\d -> case d of Definition d -> [d] ; _ -> []) decls

29−

30− getSubLets def =

31− case def of

32− Def pattern expr -> [ defs | Let defs _ <- universeBi expr ]

33− TypeAnnotation _ _ -> []

34−

35−

36−duplicates :: [Def t v] -> [String]

37−duplicates defs =

38− map defMsg (dups definitions) ++ map annMsg (dups annotations)

39− where

40− annotations = List.sort [ name | TypeAnnotation name _ <- defs ]

41− definitions = List.sort $ concatMap Set.toList [ boundVars pattern | Def pattern _ <- defs ]

42−

43− dups = map head . filter ((>1) . length) . List.group

44−

45− msg = "Syntax Error: There can only be one "

46− defMsg x = msg ++ "definition of '" ++ x ++ "'."

47− annMsg x = msg ++ "type annotation for '" ++ x ++ "'."

48−

49−

50−badOrder :: [Def t v] -> [String]

51−badOrder defs = go defs

52− where

53− msg x = "Syntax Error: The type annotation for '" ++ x ++

54− "' must be directly above its definition."

55−

56− go defs =

57− case defs of

58− TypeAnnotation name _ : Def (PVar name') _ : rest

59− | name == name' -> go rest

60−

61− TypeAnnotation name _ : rest -> [msg name] ++ go rest

62−

63− _ : rest -> go rest

64−

65− _ -> []

66−

67−illFormedTypes :: [Declaration t v] -> [Doc]

68−illFormedTypes decls = map report (Maybe.mapMaybe isIllFormed (aliases ++ adts))

69− where

70− aliases = [ (decl, tvars, [tipe]) | decl@(TypeAlias _ tvars tipe) <- decls ]

71− adts = [ (decl, tvars, concatMap snd ctors) | decl@(Datatype _ tvars ctors) <- decls ]

72−

73− freeVars tipe =

74− case tipe of

75− T.Lambda t1 t2 -> Set.union (freeVars t1) (freeVars t2)

76− T.Var x -> Set.singleton x

77− T.Data _ ts -> Set.unions (map freeVars ts)

78− T.EmptyRecord -> Set.empty

79− T.Record fields ext -> Set.unions (freeVars ext : map (freeVars . snd) fields)

80−

81− undeclared tvars tipes = Set.difference used declared

82− where

83− used = Set.unions (map freeVars tipes)

84− declared = Set.fromList tvars

85−

86− isIllFormed (decl, tvars, tipes) =

87− let unbound = undeclared tvars tipes in

88− if Set.null unbound then Nothing

89− else Just (decl, Set.toList unbound)

90−

91− report (decl, tvars) =

92− P.vcat [ P.text $ "Error: type variable" ++ listing ++ " unbound in:"

93− , P.text "\n"

94− , nest 4 (pretty decl) ]

95− where

96− listing =

97− case tvars of

98− [tvar] -> " " ++ quote tvar ++ " is"

99− _ -> "s" ++ addCommas (map ((++) " ") (addAnd (map quote tvars))) ++ " are"

100−

101− addCommas xs

102− | length xs < 3 = concat xs

103− | otherwise = intercalate "," xs

104−

105− addAnd xs

106− | length xs < 2 = xs

107− | otherwise = zipWith (++) (replicate (length xs - 1) "" ++ ["and "]) xs

108−

109− quote tvar = "'" ++ tvar ++ "'"

110−

111−

112−infiniteTypeAliases :: [Declaration t v] -> [Doc]

113−infiniteTypeAliases decls =

114− [ report decl | decl@(TypeAlias name _ tipe) <- decls, isInfinite name tipe ]

115− where

116− isInfinite name tipe =

117− let infinite = isInfinite name in

118− case tipe of

119− T.Lambda a b -> infinite a || infinite b

120− T.Var _ -> False

121− T.Data name' ts -> name == name' || any infinite ts

122− T.EmptyRecord -> False

123− T.Record fields ext -> infinite ext || any (infinite . snd) fields

124−

125− report decl@(TypeAlias name args tipe) =

126− P.vcat [ P.text $ eightyCharLines 0 msg1

127− , indented decl

128− , P.text $ eightyCharLines 0 msg2

129− , indented (Datatype name args [(name,[tipe])])

130− , P.text $ eightyCharLines 0 msg3 ++ "\n"

131− ]

132− where

133− indented decl = P.text "\n " <> pretty decl <> P.text "\n"

134−

135− msg1 = "Type alias '" ++ name ++ "' is an infinite type. " ++

136− "Notice that it appears in its own definition, so when \

137− \you expand it, it just keeps getting bigger:"

138− msg2 = "Try this instead:"

139− msg3 = "It looks very similar, but an algebraic data type (ADT) \

140− \actually creates a new type. Unlike with a type alias, this \

141− \freshly created type is meaningful on its own, so an ADT \

142− \does not need to be expanded."

compiler/Transform/Optimize.hsdeleted−132

@@ -1,132 +0,0 @@

1−module Transform.Optimize (optimize) where

2−

3−import SourceSyntax.Everything

4−import Control.Arrow (second, (***))

5−import Data.Char (isAlpha)

6−

7−optimize (Module name ims exs stmts) =

8− Module name ims exs (map optimizeStmt stmts)

9−

10−optimizeStmt stmt = if stmt == stmt' then stmt' else optimizeStmt stmt'

11− where stmt' = simp stmt

12−

13−class Simplify a where

14− simp :: a -> a

15−

16−instance Simplify (Declaration t v) where

17− simp (Definition def) = Definition (simp def)

18− simp (ImportEvent js b elm t) = ImportEvent js (simp b) elm t

19− simp stmt = stmt

20−

21−instance Simplify (Def t v) where

22− simp (Def name e) = Def name (simp e)

23− simp x = x

24−

25−instance Simplify e => Simplify (Located e) where

26− simp (L s e) = L s (simp e)

27−

28−instance Simplify (Expr t v) where

29− simp expr =

30− let f = simp in

31− case expr of

32− Range e1 e2 -> Range (f e1) (f e2)

33− Binop op e1 e2 -> binop op (f e1) (f e2)

34− Lambda x e -> Lambda x (f e)

35− Record fs -> Record (map (second simp) fs)

36− App e1 e2 -> App (f e1) (f e2)

37− Let defs e -> Let (map simp defs) (f e)

38− Data name es -> Data name (map f es)

39− MultiIf es -> MultiIf . clipBranches $ map (f *** f) es

40− Case e cases -> Case (f e) (map (second f) cases)

41− _ -> expr

42−

43−

44−clipBranches [] = []

45−clipBranches (e:es) =

46− case e of

47− (L _ (Literal (Boolean True)), _) -> [e]

48− _ -> e : clipBranches es

49−

50−

51−isValue e =

52− case e of

53− Literal _ -> True

54− Var _ -> True

55− Data _ _ -> True

56− _ -> False

57−

58−

59−binop op ce1@(L s1 e1) ce2@(L s2 e2) =

60− let c1 = L s1

61− c2 = L s2

62− int = Literal . IntNum

63− str = Literal . Str

64− bool = Literal . Boolean

65− in

66− case (op, e1, e2) of

67− (_, Literal (IntNum n), Literal (IntNum m)) ->

68− case op of

69− { "+" -> int $ (+) n m

70− ; "-" -> int $ (-) n m

71− ; "*" -> int $ (*) n m

72− ; "^" -> int $ n ^ m

73− ; "div" -> int $ div n m

74− ; "mod" -> int $ mod n m

75− ; "rem" -> int $ rem n m

76− ; "<" -> bool $ n < m

77− ; ">" -> bool $ n > m

78− ; "<=" -> bool $ n <= m

79− ; ">=" -> bool $ n >= m

80− ; "==" -> bool $ n == m

81− ; "/=" -> bool $ n /= m

82− ; _ -> Binop op ce1 ce2 }

83− {--

84− -- flip order to move lone integers to the left

85− ("+", _, IntNum n) -> binop "+" ce2 ce1

86− ("*", _, IntNum n) -> binop "*" ce2 ce1

87−

88− ("+", IntNum 0, _) -> e2

89− ("+", IntNum n, Binop "+" (L _ (IntNum m)) ce) ->

90− binop "+" (c1 $ IntNum (n+m)) ce

91− ("+", Binop "+" (L _ (IntNum n)) ce1'

92− , Binop "+" (L _ (IntNum m)) ce2') ->

93− binop "+" (none $ IntNum (n+m)) (none $ Binop "+" ce1' ce2')

94−

95− ("*", IntNum 0, _) -> e1

96− ("*", IntNum 1, _) -> e2

97− ("*", IntNum n, Binop "*" (L _ (IntNum m)) ce) ->

98− binop "*" (none $ IntNum (n*m)) ce

99− ("*", Binop "*" (L _ (IntNum n)) ce1'

100− , Binop "*" (L _ (IntNum m)) ce2') ->

101− binop "*" (none $ IntNum (n*m)) (none $ Binop "*" ce1' ce2')

102−

103− ("-", _, IntNum 0) -> e1

104− ("/", _, IntNum 1) -> e1

105− ("div", _, IntNum 1) -> e1

106−--}

107− (_, Literal (Boolean n), Literal (Boolean m)) ->

108− case op of

109− "&&" -> bool $ n && m

110− "||" -> bool $ n || m

111− _ -> Binop op ce1 ce2

112−

113− ("&&", Literal (Boolean True), _) -> e2

114− ("&&", Literal (Boolean False), _) -> bool False

115− ("||", Literal (Boolean True), _) -> bool True

116− ("||", Literal (Boolean False), _) -> e2

117−

118− ("::", _, _) -> Data "::" [ce1, ce2]

119−

120− ("++", Literal (Str s1), Literal (Str s2)) -> str $ s1 ++ s2

121− ("++", Literal (Str s1), Binop "++" (L _ (Literal (Str s2))) ce) ->

122− Binop "++" (c1 . str $ s1 ++ s2) ce

123− ("++", Binop "++" e (L _ (Literal (Str s1))), Literal (Str s2)) ->

124− Binop "++" e (c1 . str $ s1 ++ s2)

125−

126− ("++", Data "[]" [], _) -> e2

127− ("++", _, Data "[]" []) -> e1

128− ("++", Data "::" [h,t], _) -> Data "::" [h, none $ binop "++" t ce2]

129−

130− _ | isAlpha (head op) || '_' == head op ->

131− App (none $ App (none $ Var op) ce1) ce2

132− | otherwise -> Binop op ce1 ce2

compiler/Transform/SortDefinitions.hsdeleted−198

@@ -1,198 +0,0 @@

1−

2−module Transform.SortDefinitions (sortDefs, boundVars, flattenLets) where

3−

4−import Control.Monad.State

5−import Control.Applicative ((<$>))

6−import qualified Data.Set as Set

7−import qualified Data.Map as Map

8−import qualified SourceSyntax.Type as ST

9−import SourceSyntax.Everything

10−import qualified Data.Graph as Graph

11−import qualified Data.Map as Map

12−import qualified Data.Maybe as Maybe

13−

14−boundVars :: Pattern -> Set.Set String

15−boundVars pattern =

16− case pattern of

17− PVar x -> Set.singleton x

18− PAlias x p -> Set.insert x (boundVars p)

19− PData _ ps -> Set.unions (map boundVars ps)

20− PRecord fields -> Set.fromList fields

21− PAnything -> Set.empty

22− PLiteral _ -> Set.empty

23−

24−ctors :: Pattern -> [String]

25−ctors pattern =

26− case pattern of

27− PVar x -> []

28− PAlias x p -> ctors p

29− PData ctor ps -> ctor : concatMap ctors ps

30− PRecord fields -> []

31− PAnything -> []

32− PLiteral _ -> []

33−

34−free :: String -> State (Set.Set String) ()

35−free x = modify (Set.insert x)

36−

37−bound :: Set.Set String -> State (Set.Set String) ()

38−bound boundVars = modify (\freeVars -> Set.difference freeVars boundVars)

39−

40−sortDefs :: LExpr t v -> LExpr t v

41−sortDefs expr = evalState (reorder expr) Set.empty

42−

43−flattenLets defs lexpr@(L _ expr) =

44− case expr of

45− Let ds body -> flattenLets (defs ++ ds) body

46− _ -> (defs, lexpr)

47−

48−

49−reorder :: LExpr t v -> State (Set.Set String) (LExpr t v)

50−reorder lexpr@(L s expr) =

51− L s `liftM`

52− case expr of

53− -- Be careful adding and restricting freeVars

54− Var x -> free x >> return expr

55−

56− Lambda p e ->

57− uncurry Lambda `liftM` bindingReorder (p,e)

58−

59− Binop op e1 e2 ->

60− do free op

61− Binop op `liftM` reorder e1 `ap` reorder e2

62−

63− Case e cases ->

64− Case `liftM` reorder e `ap` mapM bindingReorder cases

65−

66− Data name es ->

67− do free name

68− Data name `liftM` mapM reorder es

69−

70− -- Just pipe the reorder though

71− Literal _ -> return expr

72−

73− Range e1 e2 ->

74− Range `liftM` reorder e1 `ap` reorder e2

75−

76− ExplicitList es ->

77− ExplicitList `liftM` mapM reorder es

78−

79− App e1 e2 ->

80− App `liftM` reorder e1 `ap` reorder e2

81−

82− MultiIf branches ->

83− MultiIf `liftM` mapM reorderPair branches

84−

85− Access e lbl ->

86− Access `liftM` reorder e `ap` return lbl

87−

88− Remove e lbl ->

89− Remove `liftM` reorder e `ap` return lbl

90−

91− Insert e lbl v ->

92− Insert `liftM` reorder e `ap` return lbl `ap` reorder v

93−

94− Modify e fields ->

95− Modify `liftM` reorder e `ap` mapM reorderField fields

96−

97− Record fields ->

98− Record `liftM` mapM reorderField fields

99−

100− Markdown md es -> Markdown md <$> mapM reorder es

101−

102− -- Actually do some reordering

103− Let defs body ->

104− do body' <- reorder body

105−

106− -- Sort defs into strongly connected components.This

107− -- allows the programmer to write definitions in whatever

108− -- order they please, we can still define things in order

109− -- and generalize polymorphic functions when appropriate.

110− sccs <- Graph.stronglyConnComp <$> buildDefDict defs

111− let defss = map Graph.flattenSCC sccs

112−

113− -- remove let-bound variables from the context

114− let getPatterns def =

115− case def of

116− Def pattern _ -> pattern

117− TypeAnnotation name _ -> PVar name

118− forM (map getPatterns defs) $ \pattern -> do

119− bound (boundVars pattern)

120− mapM free (ctors pattern)

121−

122− let addDefs ds bod = L s (Let (concatMap toDefs ds) bod)

123− where

124− toDefs (pattern, expr, Nothing) = [ Def pattern expr ]

125− toDefs (PVar name, expr, Just tipe) =

126− [ TypeAnnotation name tipe, Def (PVar name) expr ]

127−

128− L _ let' = foldr addDefs body' defss

129−

130− return let'

131−

132−

133−reorderField (label, expr) =

134− (,) label `liftM` reorder expr

135−

136−reorderPair (e1,e2) =

137− (,) `liftM` reorder e1 `ap` reorder e2

138−

139−bindingReorder :: (Pattern, LExpr t v) -> State (Set.Set String) (Pattern, LExpr t v)

140−bindingReorder (pattern,expr) =

141− do expr' <- reorder expr

142− bound (boundVars pattern)

143− mapM free (ctors pattern)

144− return (pattern, expr')

145−

146−

147−type PDef t v = (Pattern, LExpr t v, Maybe ST.Type)

148−

149−reorderAndGetDependencies :: PDef t v -> State (Set.Set String) (PDef t v, [String])

150−reorderAndGetDependencies (pattern, expr, mType) =

151− do globalFrees <- get

152− -- work in a fresh environment

153− put Set.empty

154− expr' <- reorder expr

155− localFrees <- get

156− -- merge with global frees

157− modify (Set.union globalFrees)

158− return ((pattern, expr', mType), Set.toList localFrees)

159−

160−

161−-- This also reorders the all of the sub-expressions in the Def list.

162−buildDefDict :: [Def t v] -> State (Set.Set String) [(PDef t v, Int, [Int])]

163−buildDefDict defs =

164− do pdefsDeps <- mapM reorderAndGetDependencies (getPDefs defs)

165− return $ realDeps (addKey pdefsDeps)

166−

167− where

168− getPDefs :: [Def t v] -> [PDef t v]

169− getPDefs defs = map (\(p,(e,t)) -> (p,e,t)) $

170− Map.toList $ go defs Map.empty Map.empty

171− where

172− go [] ds ts =

173− Map.unions [ Map.difference ds ts

174− , Map.intersectionWith (\(e,_) t -> (e,Just t)) ds ts ]

175−

176− go (def:defs) ds ts =

177− case def of

178− Def p e -> go defs (Map.insert p (e, Nothing) ds) ts

179− TypeAnnotation name tipe -> go defs ds (Map.insert (PVar name) tipe ts)

180−

181− addKey :: [(PDef t v, [String])] -> [(PDef t v, Int, [String])]

182− addKey = zipWith (\n (pdef,deps) -> (pdef,n,deps)) [0..]

183−

184− variableToKey :: (PDef t v, Int, [String]) -> [(String, Int)]

185− variableToKey ((pattern, _, _), key, _) =

186− [ (var, key) | var <- Set.toList (boundVars pattern) ]

187−

188− variableToKeyMap :: [(PDef t v, Int, [String])] -> Map.Map String Int

189− variableToKeyMap pdefsDeps =

190− Map.fromList (concatMap variableToKey pdefsDeps)

191−

192− realDeps :: [(PDef t v, Int, [String])] -> [(PDef t v, Int, [Int])]

193− realDeps pdefsDeps = map convert pdefsDeps

194− where

195− varDict = variableToKeyMap pdefsDeps

196− convert (pdef, key, deps) =

197− (pdef, key, Maybe.mapMaybe (flip Map.lookup varDict) deps)

198−

compiler/Transform/Substitute.hsdeleted−43

@@ -1,43 +0,0 @@

1−{-# OPTIONS_GHC -Wall #-}

2−module Transform.Substitute (subst) where

3−

4−import Control.Arrow (second, (***))

5−import SourceSyntax.Expression

6−import SourceSyntax.Location

7−import qualified Data.Set as Set

8−import qualified Transform.SortDefinitions as SD

9−

10−subst :: String -> Expr t v -> Expr t v -> Expr t v

11−subst old new expr =

12− let f (L s e) = L s (subst old new e) in

13− case expr of

14− Range e1 e2 -> Range (f e1) (f e2)

15− ExplicitList es -> ExplicitList (map f es)

16− Binop op e1 e2 -> Binop op (f e1) (f e2)

17− Lambda p e

18− | Set.member old (SD.boundVars p) -> expr

19− | otherwise -> Lambda p (f e)

20− App e1 e2 -> App (f e1) (f e2)

21− MultiIf ps -> MultiIf (map (f *** f) ps)

22−

23− Let defs body

24− | anyShadow -> expr

25− | otherwise -> Let (map substDef defs) (f body)

26− where

27− anyShadow =

28− any (Set.member old . SD.boundVars) [ p | Def p _ <- defs ]

29− substDef def =

30− case def of

31− TypeAnnotation _ _ -> def

32− Def p e -> Def p (f e)

33−

34− Var x -> if x == old then new else expr

35− Case e cases -> Case (f e) $ map (second f) cases

36− Data name es -> Data name (map f es)

37− Access e x -> Access (f e) x

38− Remove e x -> Remove (f e) x

39− Insert e x v -> Insert (f e) x (f v)

40− Modify r fs -> Modify (f r) (map (second f) fs)

41− Record fs -> Record (map (second f) fs)

42− Literal _ -> expr

43− Markdown md es -> Markdown md (map f es)

compiler/Type/Alias.hsdeleted−135

@@ -1,135 +0,0 @@

1−module Type.Alias (realias, rules, canonicalRealias, Rules) where

2−

3−import Control.Applicative ((<$>),(<*>))

4−import Control.Monad

5−import Control.Arrow (second)

6−import Data.Map ((!))

7−import qualified Data.Map as Map

8−import qualified Data.List as List

9−import SourceSyntax.Type

10−import SourceSyntax.Module

11−

12−type Rules = ([(String,[String],Type)], Type -> Type)

13−

14−rules interfaces metaModule = (collect interfaces metaModule, localizer metaModule)

15−

16−collect interfaces metaModule = filter (not . isPrimitive) rawAliases

17− where

18− rawAliases = aliases metaModule ++ concatMap iAliases (Map.elems interfaces)

19−

20− isPrimitive (_,_,tipe) =

21− case tipe of

22− Data _ [] -> True

23− _ -> False

24−

25−localizer metaModule = go

26− where

27− go tipe =

28− case tipe of

29− Var _ -> tipe

30− EmptyRecord -> tipe

31− Lambda t1 t2 -> Lambda (go t1) (go t2)

32− Data name ts -> Data (localize name) (map go ts)

33− Record fs ext -> Record (map (second go) fs) (go ext)

34−

35− byMethod = foldr (\(n,m) d -> Map.insertWith (++) n [m] d) Map.empty (imports metaModule)

36−

37− separate name =

38− case List.elemIndices '.' name of

39− [] -> ("",name)

40− is -> let i = last is in

41− (take i name, drop (i+1) name)

42−

43− shortest = List.minimumBy (\a b -> compare (length a) (length b))

44−

45− localize name = shortest (name : concatMap (localize' value) methods)

46− where (modul, value) = separate name

47− methods = Map.findWithDefault [] modul byMethod

48−

49− localize' name method =

50− case method of

51− As modul -> [modul ++ "." ++ name]

52− Hiding xs | name `notElem` xs -> [name]

53− Importing xs | name `elem` xs -> [name]

54− _ -> []

55−

56−realias :: Rules -> Type -> Type

57−realias (aliases,localize) tipe = localize (canonicalRealias aliases tipe)

58−

59−-- Realias using canonical aliases, so results will have aliases

60−-- that are fully qualified and possible to compare.

61−canonicalRealias :: [(String,[String],Type)] -> Type -> Type

62−canonicalRealias aliases tipe =

63− case concatMap tryRealias aliases of

64− [] -> if tipe == tipe' then tipe else f tipe'

65− tipes -> f (bestType tipes)

66− where

67− tryRealias (name, args, aliasTipe) =

68− case diff aliasTipe tipe of

69− Nothing -> []

70− Just kvs ->

71− let holes = collectFields kvs

72− hasArgs = List.sort args == Map.keys holes

73− isConsistent = all allEqual (Map.elems holes)

74− in case hasArgs && isConsistent of

75− False -> []

76− True -> [Data name $ map (\arg -> head (holes ! arg)) args]

77−

78− f = canonicalRealias aliases

79− tipe' =

80− case tipe of

81− Var _ -> tipe

82− EmptyRecord -> tipe

83− Lambda t1 t2 -> Lambda (f t1) (f t2)

84− Data name ts -> Data name (map f ts)

85− Record fs ext -> Record (map (second f) fs) (f ext)

86−

87−allEqual [] = True

88−allEqual (x:xs) = all (==x) xs

89−

90−bestType tipes = fst $ List.minimumBy (\a b -> compare (snd a) (snd b)) pairs

91− where

92− pairs :: [(Type,Int)]

93− pairs = zip tipes (map numFields tipes)

94−

95− numFields :: Type -> Int

96− numFields tipe =

97− case tipe of

98− Lambda t1 t2 -> numFields t1 + numFields t2

99− Var _ -> 0

100− Data _ ts -> sum (map numFields ts)

101− EmptyRecord -> 0

102− Record fields ext -> length fields + sum (map (numFields . snd) fields) + numFields ext

103−

104−diff :: Type -> Type -> Maybe [(String,Type)]

105−diff general specific =

106− case (general, specific) of

107− (Lambda g1 g2, Lambda s1 s2) -> (++) <$> diff g1 s1 <*> diff g2 s2

108− (Var x, t) -> Just [(x,t)]

109− (Data gname gts, Data sname sts)

110− | gname == sname && length gts == length sts ->

111− concat <$> zipWithM diff gts sts

112− (EmptyRecord, EmptyRecord) -> Just []

113− (Record _ _, Record _ _) ->

114− let (gfs,gext) = collectRecords general

115− (sfs,sext) = collectRecords specific

116− gfields = collectFields gfs

117− sfields = collectFields sfs

118−

119− overlap = Map.intersectionWith (\gs ss -> length gs == length ss) sfields gfields

120− isAligned = Map.size gfields == Map.size overlap && and (Map.elems overlap)

121− in

122− case isAligned of

123− False -> Nothing

124− True -> let remaining = Map.difference sfields gfields

125− sext' = if Map.null remaining then sext else

126− Record (flattenFields remaining) sext

127− matchMap = Map.intersectionWith (zipWith diff) gfields sfields

128− in concat <$> sequence (diff gext sext' : concat (Map.elems matchMap))

129− (_,_) -> Nothing

130−

131−collectFields fields =

132− foldr (\(f,t) fs -> Map.insertWith (++) f [t] fs) Map.empty fields

133−

134−flattenFields fields =

135− concatMap (\(f,ts) -> map ((,) f) ts) (Map.toList fields)

compiler/Type/Constrain/Declaration.hsdeleted−68

@@ -1,68 +0,0 @@

1−module Type.Constrain.Declaration where

2−

3−import Control.Monad

4−import Control.Applicative ((<$>))

5−

6−import qualified Data.Map as Map

7−

8−import qualified Type.Constrain.Expression as TcExpr

9−import qualified Type.Environment as Env

10−

11−import SourceSyntax.Declaration

12−import qualified SourceSyntax.Everything as Src

13−import qualified SourceSyntax.Type as Type

14−

15−toExpr :: [Declaration t v] -> [Src.Def t v]

16−toExpr = concatMap toDefs

17−

18−toDefs :: Declaration t v -> [Src.Def t v]

19−toDefs decl =

20− case decl of

21− Definition def -> [def]

22−

23− Datatype name tvars constructors -> concatMap toDefs constructors

24− where

25− toDefs (ctor, tipes) =

26− let vars = take (length tipes) arguments

27− tbody = Type.Data name $ map Type.Var tvars

28− body = Src.none . Src.Data ctor $ map (Src.none . Src.Var) vars

29− in [ Src.TypeAnnotation ctor $ foldr Type.Lambda tbody tipes

30− , Src.Def (Src.PVar ctor) $ buildFunction body vars

31− ]

32−

33− TypeAlias name tvars tipe@(Type.Record fields ext) ->

34− [ Src.TypeAnnotation name $ foldr Type.Lambda tipe args

35− , Src.Def (Src.PVar name) $ buildFunction record vars ]

36− where

37− args = case ext of

38− Type.EmptyRecord -> map snd fields

39− _ -> map snd fields ++ [ext]

40−

41− var = Src.none . Src.Var

42− vars = take (length args) arguments

43−

44− efields = zip (map fst fields) (map var vars)

45− record = case ext of

46− Type.EmptyRecord -> Src.none $ Src.Record efields

47− _ -> foldl (\r (f,v) -> Src.none $ Src.Insert r f v) (var $ last vars) efields

48−

49− -- Type aliases must be added to an extended equality dictionary,

50− -- but they do not require any basic constraints.

51− TypeAlias _ _ _ -> []

52−

53− ImportEvent _ expr@(Src.L s _) name tipe ->

54− [ Src.TypeAnnotation name tipe

55− , Src.Def (Src.PVar name) (Src.L s $ Src.App (Src.L s $ Src.Var "constant") expr) ]

56−

57− ExportEvent _ name tipe ->

58− [ Src.TypeAnnotation name tipe ]

59−

60− -- no constraints are needed for fixity declarations

61− Fixity _ _ _ -> []

62−

63−

64−arguments :: [String]

65−arguments = map (:[]) ['a'..'z'] ++ map (\n -> "_" ++ show n) [1..]

66−

67−buildFunction body@(Src.L s _) vars =

68− foldr (\p e -> Src.L s (Src.Lambda p e)) body (map Src.PVar vars)

compiler/Type/Constrain/Expression.hsdeleted−224

@@ -1,224 +0,0 @@

1−module Type.Constrain.Expression where

2−

3−import qualified Data.List as List

4−import qualified Data.Map as Map

5−import qualified Data.Set as Set

6−import Control.Arrow (second)

7−import Control.Applicative ((<$>),(<*>))

8−import qualified Control.Monad as Monad

9−import Control.Monad.Error

10−import Control.Monad.State

11−import Data.Traversable (traverse)

12−import qualified Text.PrettyPrint as PP

13−

14−import SourceSyntax.Location as Loc

15−import SourceSyntax.Pattern (Pattern(PVar))

16−import SourceSyntax.Expression

17−import qualified SourceSyntax.Type as SrcT

18−import Type.Type hiding (Descriptor(..))

19−import Type.Fragment

20−import qualified Type.Environment as Env

21−import qualified Type.Constrain.Literal as Literal

22−import qualified Type.Constrain.Pattern as Pattern

23−import qualified Transform.SortDefinitions as SD

24−

25−

26−constrain :: Env.Environment -> LExpr a b -> Type -> ErrorT [PP.Doc] IO TypeConstraint

27−constrain env (L span expr) tipe =

28− let list t = Env.get env Env.types "_List" <| t

29− and = L span . CAnd

30− true = L span CTrue

31− t1 === t2 = L span (CEqual t1 t2)

32− x <? t = L span (CInstance x t)

33− clet schemes c = L span (CLet schemes c)

34− in

35− case expr of

36− Literal lit -> liftIO $ Literal.constrain env span lit tipe

37−

38− Var name | name == saveEnvName -> return (L span CSaveEnv)

39− | otherwise -> return (name <? tipe)

40−

41− Range lo hi ->

42− exists $ \x -> do

43− clo <- constrain env lo x

44− chi <- constrain env hi x

45− return $ and [clo, chi, list x === tipe]

46−

47− ExplicitList exprs ->

48− exists $ \x -> do

49− cs <- mapM (\e -> constrain env e x) exprs

50− return . and $ list x === tipe : cs

51−

52− Binop op e1 e2 ->

53− exists $ \t1 ->

54− exists $ \t2 -> do

55− c1 <- constrain env e1 t1

56− c2 <- constrain env e2 t2

57− return $ and [ c1, c2, op <? (t1 ==> t2 ==> tipe) ]

58−

59− Lambda p e ->

60− exists $ \t1 ->

61− exists $ \t2 -> do

62− fragment <- try span $ Pattern.constrain env p t1

63− c2 <- constrain env e t2

64− let c = ex (vars fragment) (clet [monoscheme (typeEnv fragment)]

65− (typeConstraint fragment /\ c2 ))

66− return $ c /\ tipe === (t1 ==> t2)

67−

68− App e1 e2 ->

69− exists $ \t -> do

70− c1 <- constrain env e1 (t ==> tipe)

71− c2 <- constrain env e2 t

72− return $ c1 /\ c2

73−

74− MultiIf branches -> and <$> mapM constrain' branches

75− where

76− bool = Env.get env Env.types "Bool"

77− constrain' (b,e) = do

78− cb <- constrain env b bool

79− ce <- constrain env e tipe

80− return (cb /\ ce)

81−

82− Case exp branches ->

83− exists $ \t -> do

84− ce <- constrain env exp t

85− let branch (p,e) = do

86− fragment <- try span $ Pattern.constrain env p t

87− clet [toScheme fragment] <$> constrain env e tipe

88− and . (:) ce <$> mapM branch branches

89−

90− Data name exprs ->

91− do vars <- forM exprs $ \_ -> liftIO (var Flexible)

92− let pairs = zip exprs (map VarN vars)

93− (ctipe, cs) <- Monad.foldM step (tipe,true) (reverse pairs)

94− return $ ex vars (cs /\ name <? ctipe)

95− where

96− step (t,c) (e,x) = do

97− c' <- constrain env e x

98− return (x ==> t, c /\ c')

99−

100− Access e label ->

101− exists $ \t ->

102− constrain env e (record (Map.singleton label [tipe]) t)

103−

104− Remove e label ->

105− exists $ \t ->

106− constrain env e (record (Map.singleton label [t]) tipe)

107−

108− Insert e label value ->

109− exists $ \tVal ->

110− exists $ \tRec -> do

111− cVal <- constrain env value tVal

112− cRec <- constrain env e tRec

113− let c = tipe === record (Map.singleton label [tVal]) tRec

114− return (and [cVal, cRec, c])

115−

116− Modify e fields ->

117− exists $ \t -> do

118− oldVars <- forM fields $ \_ -> liftIO (var Flexible)

119− let oldFields = SrcT.fieldMap (zip (map fst fields) (map VarN oldVars))

120− cOld <- ex oldVars <$> constrain env e (record oldFields t)

121−

122− newVars <- forM fields $ \_ -> liftIO (var Flexible)

123− let newFields = SrcT.fieldMap (zip (map fst fields) (map VarN newVars))

124− let cNew = tipe === record newFields t

125−

126− cs <- zipWithM (constrain env) (map snd fields) (map VarN newVars)

127−

128− return $ cOld /\ ex newVars (and (cNew : cs))

129−

130− Record fields ->

131− do vars <- forM fields $ \_ -> liftIO (var Flexible)

132− cs <- zipWithM (constrain env) (map snd fields) (map VarN vars)

133− let fields' = SrcT.fieldMap (zip (map fst fields) (map VarN vars))

134− recordType = record fields' (TermN EmptyRecord1)

135− return . ex vars . and $ tipe === recordType : cs

136−

137− Markdown _ es ->

138− do vars <- forM es $ \_ -> liftIO (var Flexible)

139− let tvars = map VarN vars

140− cs <- zipWithM (constrain env) es tvars

141− return . ex vars $ and ("Text.markdown" <? tipe : cs)

142−

143− Let defs body ->

144− do c <- constrain env body tipe

145− (schemes, rqs, fqs, header, c2, c1) <-

146− Monad.foldM (constrainDef env)

147− ([], [], [], Map.empty, true, true)

148− (collapseDefs defs)

149− return $ clet schemes

150− (clet [Scheme rqs fqs (clet [monoscheme header] c2) header ]

151− (c1 /\ c))

152−

153−

154−constrainDef env info (pattern, expr, maybeTipe) =

155− let qs = [] -- should come from the def, but I'm not sure what would live there...

156− (schemes, rigidQuantifiers, flexibleQuantifiers, headers, c2, c1) = info

157− in

158− do rigidVars <- forM qs (\_ -> liftIO $ var Rigid) -- Some mistake may be happening here.

159− -- Currently, qs is always [].

160− case (pattern, maybeTipe) of

161− (PVar name, Just tipe) -> do

162− flexiVars <- forM qs (\_ -> liftIO $ var Flexible)

163− let inserts = zipWith (\arg typ -> Map.insert arg (VarN typ)) qs flexiVars

164− env' = env { Env.value = List.foldl' (\x f -> f x) (Env.value env) inserts }

165− (vars, typ) <- Env.instantiateType env tipe Map.empty

166− let scheme = Scheme { rigidQuantifiers = [],

167− flexibleQuantifiers = flexiVars ++ vars,

168− constraint = Loc.noneNoDocs CTrue,

169− header = Map.singleton name typ }

170− c <- constrain env' expr typ

171− return ( scheme : schemes

172− , rigidQuantifiers

173− , flexibleQuantifiers

174− , headers

175− , c2

176− , fl rigidVars c /\ c1 )

177−

178− (PVar name, Nothing) -> do

179− v <- liftIO $ var Flexible

180− let tipe = VarN v

181− inserts = zipWith (\arg typ -> Map.insert arg (VarN typ)) qs rigidVars

182− env' = env { Env.value = List.foldl' (\x f -> f x) (Env.value env) inserts }

183− c <- constrain env' expr tipe

184− return ( schemes

185− , rigidVars ++ rigidQuantifiers

186− , v : flexibleQuantifiers

187− , Map.insert name tipe headers

188− , c /\ c2

189− , c1 )

190−

191−expandPattern :: (Pattern, LExpr t v, Maybe SrcT.Type)

192− -> [(Pattern, LExpr t v, Maybe SrcT.Type)]

193−expandPattern triple@(pattern, lexpr@(L s _), maybeType) =

194− case pattern of

195− PVar _ -> [triple]

196− _ -> (PVar x, lexpr, maybeType) : map toDef vars

197− where

198− vars = Set.toList $ SD.boundVars pattern

199− x = "$" ++ concat vars

200− var = L s . Var

201− toDef y = (PVar y, L s $ Case (var x) [(pattern, var y)], Nothing)

202−

203−collapseDefs :: [Def t v] -> [(Pattern, LExpr t v, Maybe SrcT.Type)]

204−collapseDefs = concatMap expandPattern . go [] Map.empty Map.empty

205− where

206− go output defs typs [] =

207− output ++ concatMap Map.elems [

208− Map.intersectionWithKey (\k v t -> (PVar k, v, Just t)) defs typs,

209− Map.mapWithKey (\k v -> (PVar k, v, Nothing)) (Map.difference defs typs) ]

210− go output defs typs (d:ds) =

211− case d of

212− Def (PVar name) body ->

213− go output (Map.insert name body defs) typs ds

214− Def pattern body ->

215− go ((pattern, body, Nothing) : output) defs typs ds

216− TypeAnnotation name typ ->

217− go output defs (Map.insert name typ typs) ds

218−

219−try :: SrcSpan -> ErrorT (SrcSpan -> PP.Doc) IO a -> ErrorT [PP.Doc] IO a

220−try span computation = do

221− result <- liftIO $ runErrorT computation

222− case result of

223− Left err -> throwError [err span]

224− Right value -> return value

compiler/Type/Constrain/Literal.hsdeleted−21

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

1−module Type.Constrain.Literal where

2−

3−import SourceSyntax.Literal

4−import SourceSyntax.Location

5−import Type.Type

6−import Type.Environment as Env

7−

8−constrain :: Environment -> SrcSpan -> Literal -> Type -> IO TypeConstraint

9−constrain env span literal tipe =

10− do tipe' <- litType

11− return . L span $ CEqual tipe tipe'

12− where

13− prim name = return (Env.get env Env.types name)

14−

15− litType =

16− case literal of

17− IntNum _ -> VarN `fmap` var (Is Number)

18− FloatNum _ -> prim "Float"

19− Chr _ -> prim "Char"

20− Str _ -> prim "String"

21− Boolean _ -> prim "Bool"

compiler/Type/Constrain/Pattern.hsdeleted−82

@@ -1,82 +0,0 @@

1−{-# LANGUAGE FlexibleInstances #-}

2−module Type.Constrain.Pattern where

3−

4−import Control.Arrow (second)

5−import Control.Applicative ((<$>))

6−import qualified Control.Monad as Monad

7−import Control.Monad.Error

8−import qualified Data.List as List

9−import qualified Data.Maybe as Maybe

10−import qualified Data.Map as Map

11−import qualified Text.PrettyPrint as PP

12−

13−import SourceSyntax.Pattern

14−import SourceSyntax.Location

15−import SourceSyntax.PrettyPrint

16−import Text.PrettyPrint (render)

17−import qualified SourceSyntax.Location as Loc

18−import Type.Type

19−import Type.Fragment

20−import Type.Environment as Env

21−import qualified Type.Constrain.Literal as Literal

22−

23−

24−constrain :: Environment -> Pattern -> Type -> ErrorT (SrcSpan -> PP.Doc) IO Fragment

25−constrain env pattern tipe =

26− let span = Loc.NoSpan (render $ pretty pattern)

27− t1 === t2 = Loc.L span (CEqual t1 t2)

28− x <? t = Loc.L span (CInstance x t)

29− in

30− case pattern of

31− PAnything -> return emptyFragment

32−

33− PLiteral lit -> do

34− c <- liftIO $ Literal.constrain env span lit tipe

35− return $ emptyFragment { typeConstraint = c }

36−

37− PVar name -> do

38− v <- liftIO $ var Flexible

39− return $ Fragment {

40− typeEnv = Map.singleton name (VarN v),

41− vars = [v],

42− typeConstraint = VarN v === tipe

43− }

44−

45− PAlias name p -> do

46− fragment <- constrain env p tipe

47− return $ fragment {

48− typeEnv = Map.insert name tipe (typeEnv fragment),

49− typeConstraint = name <? tipe /\ typeConstraint fragment

50− }

51−

52− PData name patterns -> do

53− (kind, cvars, args, result) <- liftIO $ freshDataScheme env name

54− let msg = concat [ "Constructor '", name, "' expects ", show kind

55− , " argument", if kind == 1 then "" else "s"

56− , " but was given ", show (length patterns), "." ]

57− err span = PP.vcat [ PP.text $ "Type error " ++ show span

58− , PP.text msg ]

59− case length patterns == kind of

60− False -> throwError err

61− True -> do

62− fragment <- Monad.liftM joinFragments (Monad.zipWithM (constrain env) patterns args)

63− return $ fragment {

64− typeConstraint = typeConstraint fragment /\ tipe === result,

65− vars = cvars ++ vars fragment

66− }

67−

68− PRecord fields -> do

69− pairs <- liftIO $ mapM (\name -> (,) name <$> var Flexible) fields

70− let tenv = Map.fromList (map (second VarN) pairs)

71− c <- exists $ \t -> return (tipe === record (Map.map (:[]) tenv) t)

72− return $ Fragment {

73− typeEnv = tenv,

74− vars = map snd pairs,

75− typeConstraint = c

76− }

77−

78−instance Error (SrcSpan -> PP.Doc) where

79− noMsg _ = PP.empty

80− strMsg str span =

81− PP.vcat [ PP.text $ "Type error " ++ show span

82− , PP.text str ]

compiler/Type/Environment.hsdeleted−168

@@ -1,168 +0,0 @@

1−module Type.Environment where

2−

3−import Control.Applicative ((<$>), (<*>))

4−import Control.Exception (try, SomeException)

5−import Control.Monad

6−import Control.Monad.Trans.Error (ErrorList(..))

7−import Control.Monad.Error (ErrorT, throwError, liftIO)

8−import qualified Control.Monad.State as State

9−import qualified Data.Traversable as Traverse

10−import qualified Data.Map as Map

11−import Data.List (isPrefixOf)

12−import qualified Data.UnionFind.IO as UF

13−import qualified Text.PrettyPrint as PP

14−

15−import qualified SourceSyntax.Type as Src

16−import SourceSyntax.Module (ADT)

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] -> [(String, [String], Src.Type)] -> 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, kind) = 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 (ctor, 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.EmptyRecord -> return (TermN EmptyRecord1)

166−

167− Src.Record fields ext ->

168− TermN <$> (Record1 <$> Traverse.traverse (mapM go) (Src.fieldMap fields) <*> go ext)

compiler/Type/ExtraChecks.hsdeleted−73

@@ -1,73 +0,0 @@

1−-- This module contains checks to be run *after* type inference has

2−-- completed successfully. At that point we still need to do occurs

3−-- checks and ensure that `main` has an acceptable type.

4−module Type.ExtraChecks (extraChecks, occursCheck) where

5−

6−import Control.Applicative ((<$>),(<*>))

7−import Control.Monad.State

8−import qualified Data.Map as Map

9−import qualified Data.UnionFind.IO as UF

10−import Type.Type ( Variable, structure, Term1(..), toSrcType )

11−import qualified Type.State as TS

12−import qualified Type.Alias as Alias

13−import Text.PrettyPrint as P

14−import SourceSyntax.PrettyPrint (pretty)

15−import SourceSyntax.Type (Type)

16−import qualified SourceSyntax.Location as Location

17−import qualified SourceSyntax.Expression as Expr

18−import qualified Data.Traversable as Traverse

19−

20−extraChecks :: Alias.Rules -> TS.Env -> IO (Either [P.Doc] (Map.Map String Type))

21−extraChecks rules env =

22− mainCheck rules <$> Traverse.traverse toSrcType env

23−

24−mainCheck :: Alias.Rules -> (Map.Map String Type) -> Either [P.Doc] (Map.Map String Type)

25−mainCheck rules env =

26− let acceptable = ["Graphics.Element.Element","Signal.Signal Graphics.Element.Element"] in

27− case Map.lookup "main" env of

28− Nothing -> Right env

29− Just tipe

30− | P.render (pretty (Alias.canonicalRealias (fst rules) tipe)) `elem` acceptable ->

31− Right env

32− | otherwise ->

33− Left [ P.vcat [ P.text "Type Error:"

34− , P.text "Bad type for 'main'. It must have type Element or a (Signal Element)"

35− , P.text "Instead 'main' has type:\n"

36− , P.nest 4 . pretty $ Alias.realias rules tipe

37− , P.text " " ]

38− ]

39−

40−occursCheck :: (String, Variable) -> StateT TS.SolverState IO ()

41−occursCheck (name, variable) =

42− do vars <- liftIO $ infiniteVars [] variable

43− case vars of

44− [] -> return ()

45− var:_ -> do

46− desc <- liftIO $ UF.descriptor var

47− case structure desc of

48− Nothing ->

49− modify $ \state -> state { TS.sErrors = fallback : TS.sErrors state }

50− Just struct ->

51− do liftIO $ UF.setDescriptor var (desc { structure = Nothing })

52− var' <- liftIO $ UF.fresh desc

53− TS.addError (Location.NoSpan name) (Just msg) var var'

54− where

55− msg = "Infinite types are not allowed"

56− fallback _ = return $ P.text msg

57−

58− infiniteVars :: [Variable] -> Variable -> IO [Variable]

59− infiniteVars seen var =

60− let go = infiniteVars (var:seen) in

61− if var `elem` seen

62− then return [var]

63− else do

64− desc <- UF.descriptor var

65− case structure desc of

66− Nothing -> return []

67− Just struct ->

68− case struct of

69− App1 a b -> (++) <$> go a <*> go b

70− Fun1 a b -> (++) <$> go a <*> go b

71− Var1 a -> go a

72− EmptyRecord1 -> return []

73− Record1 fields ext -> concat <$> mapM go (ext : concat (Map.elems fields))

compiler/Type/Fragment.hsdeleted−28

@@ -1,28 +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.Location (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−

27−toScheme fragment =

28− Scheme [] (vars fragment) (typeConstraint fragment) (typeEnv fragment)

compiler/Type/Inference.hsdeleted−58

@@ -1,58 +0,0 @@

1−module Type.Inference where

2−

3−import qualified Data.Map as Map

4−

5−import qualified Type.Type as T

6−import qualified Type.Environment as Env

7−import qualified Type.Constrain.Expression as TcExpr

8−import qualified Type.Constrain.Declaration as TcDecl

9−import qualified Type.Solve as Solve

10−

11−import SourceSyntax.Module as Module

12−import qualified SourceSyntax.Expression as Expr

13−import SourceSyntax.Location (Located, noneNoDocs)

14−import SourceSyntax.PrettyPrint

15−import SourceSyntax.Type (Type)

16−import Text.PrettyPrint

17−import qualified Type.State as TS

18−import Type.ExtraChecks (extraChecks)

19−import Control.Monad.State (execStateT, forM)

20−import Control.Monad.Error (runErrorT, liftIO)

21−import Control.Arrow (second)

22−import qualified Type.Alias as Alias

23−

24−import System.IO.Unsafe -- Possible to switch over to the ST monad instead of

25− -- the IO monad. I don't think that'd be worthwhile.

26−

27−

28−infer :: Interfaces -> MetadataModule t v -> Either [Doc] (Map.Map String Type)

29−infer interfaces modul = unsafePerformIO $ do

30− env <- Env.initialEnvironment

31− (datatypes modul ++ concatMap iAdts (Map.elems interfaces))

32− (aliases modul ++ concatMap iAliases (Map.elems interfaces))

33− ctors <- forM (Map.keys (Env.constructor env)) $ \name ->

34− do (_, vars, args, result) <- Env.freshDataScheme env name

35− return (name, (vars, foldr (T.==>) result args))

36−

37− attemptConstraint <- runErrorT $ do

38− importedVars <-

39− forM (concatMap (Map.toList . iTypes) $ Map.elems interfaces) $ \(name,tipe) ->

40− (,) name `fmap` Env.instantiateType env tipe Map.empty

41−

42− let allTypes = ctors ++ importedVars

43− vars = concatMap (fst . snd) allTypes

44− header = Map.map snd (Map.fromList allTypes)

45− environ = noneNoDocs . T.CLet [ T.Scheme vars [] (noneNoDocs T.CTrue) header ]

46−

47− fvar <- liftIO $ T.var T.Flexible

48− c <- TcExpr.constrain env (program modul) (T.VarN fvar)

49− return (header, environ c)

50−

51− case attemptConstraint of

52− Left err -> return $ Left err

53− Right (header, constraint) -> do

54− state <- execStateT (Solve.solve constraint) TS.initialState

55− let rules = Alias.rules interfaces modul

56− case TS.sErrors state of

57− errors@(_:_) -> Left `fmap` sequence (map ($ rules) (reverse errors))

58− [] -> extraChecks rules (Map.difference (TS.sSavedEnv state) header)

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−194

@@ -1,194 +0,0 @@

1−module Type.Solve (solve) where

2−

3−import Control.Monad

4−import Control.Monad.State

5−import qualified Data.UnionFind.IO as UF

6−import qualified Data.Map as Map

7−import qualified Data.Traversable as Traversable

8−import qualified Data.Maybe as Maybe

9−import qualified Data.List as List

10−import Type.Type

11−import Type.Unify

12−import qualified Type.ExtraChecks as EC

13−import qualified Type.Environment as Env

14−import qualified Type.State as TS

15−import qualified Text.PrettyPrint as P

16−import SourceSyntax.Location (Located(L), SrcSpan)

17−

18−

19−-- | Every variable has rank less than or equal to the maxRank of the pool.

20−-- This sorts variables into the young and old pools accordingly.

21−generalize :: TS.Pool -> StateT TS.SolverState IO ()

22−generalize youngPool = do

23− youngMark <- TS.uniqueMark

24− let youngRank = TS.maxRank youngPool

25− insert dict var = do

26− desc <- liftIO $ UF.descriptor var

27− liftIO $ UF.modifyDescriptor var (\desc -> desc { mark = youngMark })

28− return $ Map.insertWith (++) (rank desc) [var] dict

29−

30− -- Sort the youngPool variables by rank.

31− rankDict <- foldM insert Map.empty (TS.inhabitants youngPool)

32−

33− -- get the ranks right for each entry.

34− -- start at low ranks so that we only have to pass

35− -- over the information once.

36− visitedMark <- TS.uniqueMark

37− mapM (\(poolRank, vars) -> mapM (adjustRank youngMark visitedMark poolRank) vars) (Map.toList rankDict)

38−

39− -- For variables that have rank lowerer than youngRank, register them in

40− -- the old pool if they are not redundant.

41− let registerIfNotRedundant var = do

42− isRedundant <- liftIO $ UF.redundant var

43− if isRedundant then return var else TS.register var

44−

45− let rankDict' = Map.delete youngRank rankDict

46− Traversable.traverse (mapM registerIfNotRedundant) rankDict'

47−

48− -- For variables with rank youngRank

49− -- If rank < youngRank: register in oldPool

50− -- otherwise generalize

51− let registerIfLowerRank var = do

52− isRedundant <- liftIO $ UF.redundant var

53− case isRedundant of

54− True -> return ()

55− False -> do

56− desc <- liftIO $ UF.descriptor var

57− case rank desc < youngRank of

58− True -> TS.register var >> return ()

59− False -> do

60− let flex' = case flex desc of { Flexible -> Rigid ; other -> other }

61− liftIO $ UF.setDescriptor var (desc { rank = noRank, flex = flex' })

62−

63− mapM_ registerIfLowerRank (Map.findWithDefault [] youngRank rankDict)

64−

65−

66−-- adjust the ranks of variables such that ranks never increase as you

67−-- move deeper into a variable.

68−adjustRank :: Int -> Int -> Int -> Variable -> StateT TS.SolverState IO Int

69−adjustRank youngMark visitedMark groupRank variable =

70− let adjust = adjustRank youngMark visitedMark groupRank in

71− do desc <- liftIO $ UF.descriptor variable

72− case () of

73− () | mark desc == youngMark ->

74− do -- Set the variable as marked first because it may be cyclic.

75− liftIO $ UF.modifyDescriptor variable $ \desc -> desc { mark = visitedMark }

76− rank' <- case structure desc of

77− Nothing -> return groupRank

78− Just term ->

79− case term of

80− App1 a b -> max `liftM` adjust a `ap` adjust b

81− Fun1 a b -> max `liftM` adjust a `ap` adjust b

82− Var1 x -> adjust x

83− EmptyRecord1 -> return outermostRank

84− Record1 fields extension ->

85− do ranks <- mapM adjust (concat (Map.elems fields))

86− rnk <- adjust extension

87− return . maximum $ rnk : ranks

88− liftIO $ UF.modifyDescriptor variable $ \desc -> desc { rank = rank' }

89− return rank'

90−

91− | mark desc /= visitedMark ->

92− do let rank' = min groupRank (rank desc)

93− liftIO $ UF.setDescriptor variable (desc { mark = visitedMark, rank = rank' })

94− return rank'

95−

96− | otherwise -> return (rank desc)

97−

98−

99−

100−solve :: TypeConstraint -> StateT TS.SolverState IO ()

101−solve (L span constraint) =

102− case constraint of

103− CTrue -> return ()

104−

105− CSaveEnv -> TS.saveLocalEnv

106−

107− CEqual term1 term2 -> do

108− t1 <- TS.flatten term1

109− t2 <- TS.flatten term2

110− unify span t1 t2

111−

112− CAnd cs -> mapM_ solve cs

113−

114− CLet [Scheme [] fqs constraint' _] (L _ CTrue) -> do

115− oldEnv <- TS.getEnv

116− mapM TS.introduce fqs

117− solve constraint'

118− TS.modifyEnv (\_ -> oldEnv)

119−

120− CLet schemes constraint' -> do

121− oldEnv <- TS.getEnv

122− headers <- Map.unions `fmap` mapM (solveScheme span) schemes

123− TS.modifyEnv $ \env -> Map.union headers env

124− solve constraint'

125− mapM EC.occursCheck $ Map.toList headers

126− TS.modifyEnv (\_ -> oldEnv)

127−

128− CInstance name term -> do

129− env <- TS.getEnv

130− freshCopy <-

131− case Map.lookup name env of

132− Just tipe -> TS.makeInstance tipe

133− Nothing

134− | List.isPrefixOf "Native." name -> liftIO (var Flexible)

135− | otherwise ->

136− error ("Could not find '" ++ name ++ "' when solving type constraints.")

137−

138− t <- TS.flatten term

139− unify span freshCopy t

140−

141−solveScheme :: SrcSpan -> TypeScheme -> StateT TS.SolverState IO (Map.Map String Variable)

142−solveScheme span scheme =

143− case scheme of

144− Scheme [] [] constraint header -> do

145− solve constraint

146− Traversable.traverse TS.flatten header

147−

148− Scheme rigidQuantifiers flexibleQuantifiers constraint header -> do

149− let quantifiers = rigidQuantifiers ++ flexibleQuantifiers

150− oldPool <- TS.getPool

151−

152− -- fill in a new pool when working on this scheme's constraints

153− freshPool <- TS.nextRankPool

154− TS.switchToPool freshPool

155− mapM TS.introduce quantifiers

156− header' <- Traversable.traverse TS.flatten header

157− solve constraint

158−

159− allDistinct span rigidQuantifiers

160− youngPool <- TS.getPool

161− TS.switchToPool oldPool

162− generalize youngPool

163− mapM (isGeneric span) rigidQuantifiers

164− return header'

165−

166−

167−-- Checks that all of the given variables belong to distinct equivalence classes.

168−-- Also checks that their structure is Nothing, so they represent a variable, not

169−-- a more complex term.

170−allDistinct :: SrcSpan -> [Variable] -> StateT TS.SolverState IO ()

171−allDistinct span vars = do

172− seen <- TS.uniqueMark

173− let check var = do

174− desc <- liftIO $ UF.descriptor var

175− case structure desc of

176− Just _ -> TS.addError span (Just msg) var var

177− where msg = "Cannot generalize something that is not a type variable"

178−

179− Nothing -> do

180− if mark desc == seen

181− then let msg = "Duplicate variable during generalization"

182− in TS.addError span (Just msg) var var

183− else return ()

184− liftIO $ UF.setDescriptor var (desc { mark = seen })

185− mapM_ check vars

186−

187−-- Check that a variable has rank == noRank, meaning that it can be generalized.

188−isGeneric :: SrcSpan -> Variable -> StateT TS.SolverState IO ()

189−isGeneric span var = do

190− desc <- liftIO $ UF.descriptor var

191− if rank desc == noRank

192− then return ()

193− else let msg = "Unable to generalize a type variable. It is not unranked"

194− in TS.addError span (Just msg) var var

compiler/Type/State.hsdeleted−211

@@ -1,211 +0,0 @@

1−module Type.State where

2−

3−import Type.Type

4−import qualified Data.Map as Map

5−import qualified Data.List as List

6−import qualified Type.Environment as Env

7−import qualified Data.UnionFind.IO as UF

8−import Control.Monad.State

9−import Control.Applicative ((<$>),(<*>), Applicative)

10−import qualified Data.Traversable as Traversable

11−import Text.PrettyPrint as P

12−import SourceSyntax.PrettyPrint

13−import SourceSyntax.Location

14−import qualified SourceSyntax.Type as Src

15−import qualified Type.Alias as Alias

16−

17−-- Pool

18−-- Holds a bunch of variables

19−-- The rank of each variable is less than or equal to the pool's "maxRank"

20−-- The young pool exists to make it possible to identify these vars in constant time.

21−

22−data Pool = Pool {

23− maxRank :: Int,

24− inhabitants :: [Variable]

25−} deriving Show

26−

27−emptyPool = Pool { maxRank = outermostRank, inhabitants = [] }

28−

29−type Env = Map.Map String Variable

30−

31−-- Keeps track of the environment, type variable pool, and a list of errors

32−data SolverState = SS {

33− sEnv :: Env,

34− sSavedEnv :: Env,

35− sPool :: Pool,

36− sMark :: Int,

37− sErrors :: [Alias.Rules -> IO P.Doc]

38−}

39−

40−initialState = SS {

41− sEnv = Map.empty,

42− sSavedEnv = Map.empty,

43− sPool = emptyPool,

44− sMark = noMark + 1, -- The mark must never be equal to noMark!

45− sErrors = []

46−}

47−

48−modifyEnv f = modify $ \state -> state { sEnv = f (sEnv state) }

49−modifyPool f = modify $ \state -> state { sPool = f (sPool state) }

50−

51−addError span hint t1 t2 =

52− modify $ \state -> state { sErrors = makeError : sErrors state }

53− where

54− makeError rules = do

55− let prettiest = pretty . Alias.realias rules

56− t1' <- prettiest <$> toSrcType t1

57− t2' <- prettiest <$> toSrcType t2

58− return . P.vcat $

59− [ display $ case span of { NoSpan msg -> msg ; Span _ _ msg -> msg }

60− , case hint of

61− Nothing -> P.text " Could not match the following types:"

62− Just msg -> P.text $ eightyCharLines 2 $

63− msg ++ ", so I could not match the following types:"

64− , P.text " " <> t1'

65− , P.text " " <> t2'

66− ]

67−

68− location = case span of

69− NoSpan msg -> ""

70− Span p1 p2 msg ->

71− if line p1 == line p2 then " on line " ++ show (line p1)

72− else " between lines " ++ show (line p1) ++ " and " ++ show (line p2)

73−

74− display msg =

75− case lines msg of

76− [] -> P.text $ "Type error" ++ location ++ ":"

77− lines' ->

78− P.vcat [ P.text $ "Type error" ++ location ++ ", in or near this expression:"

79− , P.text $ " " ++ List.intercalate "\n " lines' ]

80−

81−

82−switchToPool pool = modifyPool (\_ -> pool)

83−

84−getPool :: StateT SolverState IO Pool

85−getPool = sPool <$> get

86−

87−getEnv :: StateT SolverState IO Env

88−getEnv = sEnv <$> get

89−

90−saveLocalEnv :: StateT SolverState IO ()

91−saveLocalEnv = do

92− env <- sEnv <$> get

93− modify $ \state -> state { sSavedEnv = env }

94−

95−uniqueMark :: StateT SolverState IO Int

96−uniqueMark = do

97− state <- get

98− let mark = sMark state

99− put $ state { sMark = mark + 1 }

100− return mark

101−

102−nextRankPool :: StateT SolverState IO Pool

103−nextRankPool = do

104− pool <- getPool

105− return $ Pool { maxRank = maxRank pool + 1, inhabitants = [] }

106−

107−register :: Variable -> StateT SolverState IO Variable

108−register variable = do

109− modifyPool $ \pool -> pool { inhabitants = variable : inhabitants pool }

110− return variable

111−

112−introduce :: Variable -> StateT SolverState IO Variable

113−introduce variable = do

114− pool <- getPool

115− liftIO $ UF.modifyDescriptor variable (\desc -> desc { rank = maxRank pool })

116− register variable

117−

118−flatten :: Type -> StateT SolverState IO Variable

119−flatten term =

120− case term of

121− VarN v -> return v

122− TermN t -> do

123− flatStructure <- traverseTerm flatten t

124− pool <- getPool

125− var <- liftIO . UF.fresh $ Descriptor {

126− structure = Just flatStructure,

127− rank = maxRank pool,

128− flex = Flexible,

129− name = Nothing,

130− copy = Nothing,

131− mark = noMark

132− }

133− register var

134−

135−makeInstance :: Variable -> StateT SolverState IO Variable

136−makeInstance var = do

137− alreadyCopied <- uniqueMark

138− freshVar <- makeCopy alreadyCopied var

139− restore alreadyCopied var

140− return freshVar

141−

142−makeCopy :: Int -> Variable -> StateT SolverState IO Variable

143−makeCopy alreadyCopied variable = do

144− desc <- liftIO $ UF.descriptor variable

145− case () of

146− () | mark desc == alreadyCopied ->

147− case copy desc of

148− Just v -> return v

149− Nothing -> error $ "Error copying type variable. This should be impossible." ++

150− " Please report an error to the github repo!"

151−

152− | rank desc /= noRank || flex desc == Constant ->

153− return variable

154−

155− | otherwise -> do

156− pool <- getPool

157− newVar <- liftIO $ UF.fresh $ Descriptor {

158− structure = Nothing,

159− rank = maxRank pool,

160− mark = noMark,

161− flex = case flex desc of

162− Is s -> Is s

163− _ -> Flexible,

164− copy = Nothing,

165− name = case flex desc of

166− Rigid -> Nothing

167− _ -> name desc

168− }

169− register newVar

170−

171− -- Link the original variable to the new variable. This lets us

172− -- avoid making multiple copies of the variable we are instantiating.

173− --

174− -- Need to do this before recursively copying the structure of

175− -- the variable to avoid looping on cyclic terms.

176− liftIO $ UF.modifyDescriptor variable $ \desc ->

177− desc { mark = alreadyCopied, copy = Just newVar }

178−

179− -- Now we recursively copy the structure of the variable.

180− -- We have already marked the variable as copied, so we

181− -- will not repeat this work or crawl this variable again.

182− case structure desc of

183− Nothing -> return newVar

184− Just term -> do

185− newTerm <- traverseTerm (makeCopy alreadyCopied) term

186− liftIO $ UF.modifyDescriptor newVar $ \desc ->

187− desc { structure = Just newTerm }

188− return newVar

189−

190−restore :: Int -> Variable -> StateT SolverState IO Variable

191−restore alreadyCopied variable = do

192− desc <- liftIO $ UF.descriptor variable

193− if mark desc /= alreadyCopied

194− then return variable

195− else do

196− restoredStructure <-

197− Traversable.traverse (traverseTerm (restore alreadyCopied)) (structure desc)

198− liftIO $ UF.modifyDescriptor variable $ \desc ->

199− desc { mark = noMark, rank = noRank, structure = restoredStructure }

200− return variable

201−

202−traverseTerm :: (Monad f, Applicative f) => (a -> f b) -> Term1 a -> f (Term1 b)

203−traverseTerm f term =

204− case term of

205− App1 a b -> App1 <$> f a <*> f b

206− Fun1 a b -> Fun1 <$> f a <*> f b

207− Var1 x -> Var1 <$> f x

208− EmptyRecord1 -> return EmptyRecord1

209− Record1 fields ext ->

210− Record1 <$> Traversable.traverse (mapM f) fields <*> f ext

211−

compiler/Type/Type.hsdeleted−396

@@ -1,396 +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.Location

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@(L s1 c1) /\ b@(L s2 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 name = UF.fresh $ Descriptor {

99− structure = Nothing,

100− rank = noRank,

101− flex = flex,

102− name = Just name,

103− copy = Nothing,

104− mark = noMark

105− }

106−

107−var flex = UF.fresh $ Descriptor {

108− structure = Nothing,

109− rank = noRank,

110− flex = flex,

111− name = Nothing,

112− copy = Nothing,

113− mark = noMark

114− }

115−

116−structuredVar structure = UF.fresh $ Descriptor {

117− structure = Just structure,

118− rank = noRank,

119− flex = Flexible,

120− name = Nothing,

121− copy = Nothing,

122− mark = noMark

123− }

124−

125−

126−-- ex qs constraint == exists qs. constraint

127−ex :: [Variable] -> TypeConstraint -> TypeConstraint

128−ex fqs constraint@(L s _) = L s $ CLet [Scheme [] fqs constraint Map.empty] (L s CTrue)

129−

130−-- fl qs constraint == forall qs. constraint

131−fl :: [Variable] -> TypeConstraint -> TypeConstraint

132−fl rqs constraint@(L s _) = L s $ CLet [Scheme rqs [] constraint Map.empty] (L s CTrue)

133−

134−exists :: Error e => (Type -> ErrorT e IO TypeConstraint) -> ErrorT e IO TypeConstraint

135−exists f = do

136− v <- liftIO $ var Flexible

137− ex [v] <$> f (VarN v)

138−

139−

140−instance Show a => Show (UF.Point a) where

141− show point = unsafePerformIO $ fmap show (UF.descriptor point)

142−

143−

144−instance PrettyType a => PrettyType (UF.Point a) where

145− pretty when point = unsafePerformIO $ fmap (pretty when) (UF.descriptor point)

146−

147−

148−instance PrettyType a => PrettyType (Located a) where

149− pretty when (L _ e) = pretty when e

150−

151−

152−instance PrettyType a => PrettyType (Term1 a) where

153− pretty when term =

154− let prty = pretty Never in

155− case term of

156− App1 f x | P.render px == "_List" -> P.brackets (pretty Never x)

157− | otherwise -> parensIf needed (px <+> pretty App x)

158− where

159− px = prty f

160− needed = case when of

161− App -> True

162− _ -> False

163−

164− Fun1 arg body ->

165− parensIf needed (pretty Fn arg <+> P.text "->" <+> prty body)

166− where

167− needed = case when of

168− Never -> False

169− _ -> True

170−

171− Var1 x -> prty x

172−

173− EmptyRecord1 -> P.braces P.empty

174−

175− Record1 fields ext -> P.braces (extend <+> commaSep prettyFields)

176− where

177− prettyExt = prty ext

178− extend | P.render prettyExt == "{}" = P.empty

179− | otherwise = prettyExt <+> P.text "|"

180− mkPretty f t = P.text (reprime f) <+> P.text ":" <+> prty t

181− prettyFields = concatMap (\(f,ts) -> map (mkPretty f) ts) (Map.toList fields)

182−

183−

184−instance PrettyType a => PrettyType (TermN a) where

185− pretty when term =

186− case term of

187− VarN x -> pretty when x

188− TermN t1 -> pretty when t1

189−

190−

191−instance PrettyType Descriptor where

192− pretty when desc =

193− case (structure desc, name desc) of

194− (Just term, _) -> pretty when term

195− (_, Just name) -> if not (isTuple name) then P.text (reprime name) else

196− P.parens . P.text $ replicate (read (drop 6 name) - 1) ','

197− _ -> P.text "?"

198−

199−

200−instance (PrettyType a, PrettyType b) => PrettyType (BasicConstraint a b) where

201− pretty _ constraint =

202− let prty = pretty Never in

203− case constraint of

204− CTrue -> P.text "True"

205− CSaveEnv -> P.text "SaveTheEnvironment!!!"

206− CEqual a b -> prty a <+> P.text "=" <+> prty b

207− CAnd [] -> P.text "True"

208−

209− CAnd cs ->

210− P.parens . P.sep $ P.punctuate (P.text " and") (map (pretty Never) cs)

211−

212− CLet [Scheme [] fqs constraint header] (L _ CTrue) | Map.null header ->

213− P.sep [ binder, pretty Never c ]

214− where

215− mergeExists vs (L _ c) =

216− case c of

217− CLet [Scheme [] fqs' c' _] (L _ CTrue) -> mergeExists (vs ++ fqs') c'

218− _ -> (vs, c)

219−

220− (fqs', c) = mergeExists fqs constraint

221−

222− binder = if null fqs' then P.empty else

223− P.text "\x2203" <+> P.hsep (map (pretty Never) fqs') <> P.text "."

224−

225− CLet schemes constraint ->

226− P.fsep [ P.hang (P.text "let") 4 (P.brackets . commaSep $ map (pretty Never) schemes)

227− , P.text "in", pretty Never constraint ]

228−

229− CInstance name tipe ->

230− P.text name <+> P.text "<" <+> prty tipe

231−

232−instance (PrettyType a, PrettyType b) => PrettyType (Scheme a b) where

233− pretty _ (Scheme rqs fqs (L _ constraint) headers) =

234− P.sep [ forall, cs, headers' ]

235− where

236− prty = pretty Never

237−

238− forall = if null rqs && null fqs then P.empty else

239− P.text "\x2200" <+> frees <+> rigids

240−

241− frees = P.hsep $ map prty fqs

242− rigids = if null rqs then P.empty else P.braces . P.hsep $ map prty rqs

243−

244− cs = case constraint of

245− CTrue -> P.empty

246− CAnd [] -> P.empty

247− _ -> P.brackets (pretty Never constraint)

248−

249− headers' = if Map.size headers > 0 then dict else P.empty

250− dict = P.parens . commaSep . map prettyPair $ Map.toList headers

251− prettyPair (n,t) = P.text n <+> P.text ":" <+> pretty Never t

252−

253−

254−extraPretty :: (PrettyType t, Crawl t) => t -> IO Doc

255−extraPretty t = pretty Never <$> addNames t

256−

257−addNames :: (Crawl t) => t -> IO t

258−addNames value = do

259− (rawVars, _, _, _) <- execStateT (crawl getNames value) ([], 0, 0, 0)

260− let vars = map head . List.group $ List.sort rawVars

261− suffix s = map (++s) (map (:[]) ['a'..'z'])

262− allVars = concatMap suffix $ ["","'","_"] ++ map show [0..]

263− okayVars = filter (`notElem` vars) allVars

264− runStateT (crawl rename value) (okayVars, 0, 0, 0)

265− return value

266− where

267− getNames desc state@(vars, a, b, c) =

268− let name' = name desc in

269− case name' of

270− Just var -> (name', (var:vars, a, b, c))

271− Nothing -> (name', state)

272−

273− rename desc state@(vars, a, b, c) =

274− case name desc of

275− Just var -> (Just var, state)

276− Nothing ->

277− case flex desc of

278− Is Number -> (Just $ "number" ++ replicate a '\'', (vars, a+1, b, c))

279− Is Comparable -> (Just $ "comparable" ++ replicate b '\'', (vars, a, b+1, c))

280− Is Appendable -> (Just $ "appendable" ++ replicate c '\'', (vars, a, b, c+1))

281− other -> (Just $ head vars, (tail vars, a, b, c))

282− where mark = case other of

283− Flexible -> ""

284− Rigid -> "!"

285− Constant -> "#"

286−

287−

288−type CrawlState = ([String], Int, Int, Int)

289−

290−-- Code for traversing all the type data-structures and giving

291−-- names to the variables embedded deep in there.

292−class Crawl t where

293− crawl :: (Descriptor -> CrawlState -> (Maybe TypeName, CrawlState))

294− -> t

295− -> StateT CrawlState IO t

296−

297−instance Crawl a => Crawl (Located a) where

298− crawl nextState (L s e) = L s <$> crawl nextState e

299−

300−instance (Crawl t, Crawl v) => Crawl (BasicConstraint t v) where

301− crawl nextState constraint =

302− let rnm = crawl nextState in

303− case constraint of

304− CTrue -> return CTrue

305− CSaveEnv -> return CSaveEnv

306− CEqual a b -> CEqual <$> rnm a <*> rnm b

307− CAnd cs -> CAnd <$> crawl nextState cs

308− CLet schemes c -> CLet <$> crawl nextState schemes <*> crawl nextState c

309− CInstance name tipe -> CInstance name <$> rnm tipe

310−

311−instance Crawl a => Crawl [a] where

312− crawl nextState list = mapM (crawl nextState) list

313−

314−instance (Crawl t, Crawl v) => Crawl (Scheme t v) where

315− crawl nextState (Scheme rqs fqs c headers) =

316− let rnm = crawl nextState in

317− Scheme <$> rnm rqs <*> rnm fqs <*> crawl nextState c <*> return headers

318−

319−instance Crawl t => Crawl (TermN t) where

320− crawl nextState tipe =

321− case tipe of

322− VarN x -> VarN <$> crawl nextState x

323− TermN term -> TermN <$> crawl nextState term

324−

325−instance Crawl t => Crawl (Term1 t) where

326− crawl nextState term =

327− let rnm = crawl nextState in

328− case term of

329− App1 a b -> App1 <$> rnm a <*> rnm b

330− Fun1 a b -> Fun1 <$> rnm a <*> rnm b

331− Var1 a -> Var1 <$> rnm a

332− EmptyRecord1 -> return EmptyRecord1

333− Record1 fields ext ->

334− Record1 <$> traverse (mapM rnm) fields <*> rnm ext

335−

336−instance Crawl a => Crawl (UF.Point a) where

337− crawl nextState point = do

338− desc <- liftIO $ UF.descriptor point

339− desc' <- crawl nextState desc

340− liftIO $ UF.setDescriptor point desc'

341− return point

342−

343−instance Crawl Descriptor where

344− crawl nextState desc = do

345− state <- get

346− let (name', state') = nextState desc state

347− structure' <- traverse (crawl nextState) (structure desc)

348− put state'

349− return $ desc { name = name', structure = structure' }

350−

351−

352−toSrcType :: Variable -> IO Src.Type

353−toSrcType variable = do

354− desc <- UF.descriptor =<< addNames variable

355− case structure desc of

356− Just term ->

357− case term of

358− App1 a b -> do

359− Src.Data name ts <- toSrcType a

360− b' <- toSrcType b

361− return (Src.Data name (ts ++ [b']))

362− Fun1 a b -> Src.Lambda <$> toSrcType a <*> toSrcType b

363− Var1 a -> toSrcType a

364− EmptyRecord1 -> return Src.EmptyRecord

365− Record1 fs ext -> do

366− fs' <- traverse (mapM toSrcType) fs

367− let fs'' = concat [ map ((,) name) ts | (name,ts) <- Map.toList fs' ]

368− Src.Record fs'' <$> toSrcType ext

369− Nothing ->

370− case name desc of

371− Just x@(c:cs) | Char.isLower c -> return (Src.Var x)

372− | otherwise -> return (Src.Data x [])

373− Nothing ->

374− error $ concat

375− [ "Problem converting the following type "

376− , "from a type-checker type to a source-syntax type:"

377− , P.render (pretty Never variable) ]

378−

379−

380−data AppStructure = List Variable | Tuple [Variable] | Other

381−

382−collectApps :: Variable -> IO AppStructure

383−collectApps variable = go [] variable

384− where

385− go vars variable = do

386− desc <- UF.descriptor variable

387− case (structure desc, vars) of

388− (Nothing, [v] ) -> case name desc of

389− Just "_List" -> return (List v)

390− _ -> return Other

391− (Nothing, vs ) -> case name desc of

392− Just ctor | isTuple ctor -> return (Tuple vs)

393− _ -> return Other

394− (Just term, vs) -> case term of

395− App1 a b -> go (vars ++ [b]) a

396− _ -> return Other

compiler/Type/Unify.hsdeleted−198

@@ -1,198 +0,0 @@

1−module Type.Unify (unify) where

2−

3−import Type.Type

4−import qualified Data.UnionFind.IO as UF

5−import qualified Data.Map as Map

6−import qualified Data.Maybe as Maybe

7−import qualified Type.State as TS

8−import Control.Arrow (first,second)

9−import Control.Monad.State

10−import SourceSyntax.Location

11−import Type.PrettyPrint

12−import Text.PrettyPrint (render)

13−

14−unify :: SrcSpan -> Variable -> Variable -> StateT TS.SolverState IO ()

15−unify span variable1 variable2 = do

16− equivalent <- liftIO $ UF.equivalent variable1 variable2

17− if equivalent then return ()

18− else actuallyUnify span variable1 variable2

19−

20−actuallyUnify :: SrcSpan -> Variable -> Variable -> StateT TS.SolverState IO ()

21−actuallyUnify span variable1 variable2 = do

22− desc1 <- liftIO $ UF.descriptor variable1

23− desc2 <- liftIO $ UF.descriptor variable2

24− let unify' = unify span

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 span (Just hint) variable1 variable2

83− where hint = "A number must be an Int or Float"

84−

85− comparableError maybe =

86− TS.addError span (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 span (Just hint) variable1 variable2

114− where hint = "There is a problem with the '" ++

115− render (pretty Never variable) ++

116− "' in the type signature. It currently is not possible to unify type variables that appear in top-level declarations and again in subexpressions"

117−

118− superUnify =

119− case (flex desc1, flex desc2, name desc1, name desc2) of

120− (Is super1, Is super2, _, _)

121− | super1 == super2 -> merge

122− (Is Number, Is Comparable, _, _) -> merge1

123− (Is Comparable, Is Number, _, _) -> merge2

124−

125− (Is Number, _, _, Just name) -> unifyNumber variable1 name

126− (_, Is Number, Just name, _) -> unifyNumber variable2 name

127−

128− (Is Comparable, _, _, Just name) -> unifyComparable variable1 name

129− (_, Is Comparable, Just name, _) -> unifyComparable variable2 name

130− (Is Comparable, _, _, _) -> unifyComparableStructure variable1 variable2

131− (_, Is Comparable, _, _) -> unifyComparableStructure variable2 variable1

132−

133− (Is Appendable, _, _, Just ctor)

134− | ctor `elem` ["Text.Text","String"] -> flexAndUnify variable1

135− (_, Is Appendable, Just ctor, _)

136− | ctor `elem` ["Text.Text","String"] -> flexAndUnify variable2

137− (Is Appendable, _, _, _) -> unifyAppendable variable1 variable2

138− (_, Is Appendable, _, _) -> unifyAppendable variable2 variable1

139−

140− (Rigid, _, _, _) -> rigidError variable1

141− (_, Rigid, _, _) -> rigidError variable2

142− _ -> TS.addError span Nothing variable1 variable2

143−

144− case (structure desc1, structure desc2) of

145− (Nothing, Nothing) | flex desc1 == Flexible && flex desc1 == Flexible -> merge

146− (Nothing, _) | flex desc1 == Flexible -> merge2

147− (_, Nothing) | flex desc2 == Flexible -> merge1

148−

149− (Just (Var1 v), _) -> unify' v variable2

150− (_, Just (Var1 v)) -> unify' v variable1

151−

152− (Nothing, _) -> superUnify

153− (_, Nothing) -> superUnify

154−

155− (Just type1, Just type2) ->

156− case (type1,type2) of

157− (App1 term1 term2, App1 term1' term2') ->

158− do merge

159− unify' term1 term1'

160− unify' term2 term2'

161− (Fun1 term1 term2, Fun1 term1' term2') ->

162− do merge

163− unify' term1 term1'

164− unify' term2 term2'

165−

166− (EmptyRecord1, EmptyRecord1) ->

167− return ()

168−

169− (Record1 fields ext, EmptyRecord1) | Map.null fields -> unify' ext variable2

170− (EmptyRecord1, Record1 fields ext) | Map.null fields -> unify' ext variable1

171−

172− (Record1 fields1 ext1, Record1 fields2 ext2) ->

173− do sequence . concat . Map.elems $ Map.intersectionWith (zipWith unify') fields1 fields2

174− let mkRecord fs ext = fresh . Just $ Record1 fs ext

175− case (Map.null fields1', Map.null fields2') of

176− (True , True ) -> unify' ext1 ext2

177− (True , False) -> do

178− record2' <- mkRecord fields2' ext2

179− unify' ext1 record2'

180− (False, True ) -> do

181− record1' <- mkRecord fields1' ext1

182− unify' record1' ext2

183− (False, False) -> do

184− record1' <- mkRecord fields1' =<< fresh Nothing

185− record2' <- mkRecord fields2' =<< fresh Nothing

186− unify' record1' ext2

187− unify' ext1 record2'

188− where

189− fields1' = unmerged fields1 fields2

190− fields2' = unmerged fields2 fields1

191−

192− unmerged a b = Map.filter (not . null) $ Map.union (Map.intersectionWith eat a b) a

193−

194− eat (x:xs) (y:ys) = eat xs ys

195− eat xs ys = xs

196−

197− _ -> TS.addError span Nothing variable1 variable2

198−

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

@@ -0,0 +1,99 @@

1+{-# OPTIONS_GHC -Wall #-}

2+module Data.OneOrMore

3+ ( OneOrMore(..)

4+ , one

5+ , more

6+ , map

7+ , destruct

8+ , getFirstTwo

9+ )

10+ where

11+

12+

13+import Prelude hiding (map)

14+

15+

16+

17+-- ONE OR MORE

18+

19+

20+data OneOrMore a

21+ = One a

22+ | More (OneOrMore a) (OneOrMore a)

23+

24+

25+one :: a -> OneOrMore a

26+one =

27+ One

28+

29+

30+more :: OneOrMore a -> OneOrMore a -> OneOrMore a

31+more =

32+ More

33+

34+

35+

36+-- MAP

37+

38+

39+map :: (a -> b) -> OneOrMore a -> OneOrMore b

40+map func oneOrMore =

41+ case oneOrMore of

42+ One value ->

43+ One (func value)

44+

45+ More left right ->

46+ More (map func left) (map func right)

47+

48+

49+

50+-- DESTRUCT

51+

52+

53+destruct :: (a -> [a] -> b) -> OneOrMore a -> b

54+destruct func oneOrMore =

55+ destructLeft func oneOrMore []

56+

57+

58+destructLeft :: (a -> [a] -> b) -> OneOrMore a -> [a] -> b

59+destructLeft func oneOrMore xs =

60+ case oneOrMore of

61+ One x ->

62+ func x xs

63+

64+ More a b ->

65+ destructLeft func a (destructRight b xs)

66+

67+

68+destructRight :: OneOrMore a -> [a] -> [a]

69+destructRight oneOrMore xs =

70+ case oneOrMore of

71+ One x ->

72+ x : xs

73+

74+ More a b ->

75+ destructRight a (destructRight b xs)

76+

77+

78+

79+-- GET FIRST TWO

80+

81+

82+getFirstTwo :: OneOrMore a -> OneOrMore a -> (a,a)

83+getFirstTwo left right =

84+ case left of

85+ One x ->

86+ (x, getFirstOne right)

87+

88+ More lleft lright ->

89+ getFirstTwo lleft lright

90+

91+

92+getFirstOne :: OneOrMore a -> a

93+getFirstOne oneOrMore =

94+ case oneOrMore of

95+ One x ->

96+ x

97+

98+ More left _ ->

99+ getFirstOne left

compiler/src/Data/Utf8.hsnew file+618

@@ -0,0 +1,618 @@

1+{-# OPTIONS_GHC -fno-warn-name-shadowing #-}

2+{-# LANGUAGE BangPatterns, FlexibleInstances, MagicHash, UnboxedTuples #-}

3+module Data.Utf8

4+ ( Utf8(..)

5+ , isEmpty

6+ , empty

7+ , size

8+ , contains

9+ , startsWith

10+ , startsWithChar

11+ , endsWithWord8

12+ , split

13+ , join

14+ --

15+ , getUnder256

16+ , putUnder256

17+ --

18+ , getVeryLong

19+ , putVeryLong

20+ --

21+ , toChars

22+ , toBuilder

23+ , toEscapedBuilder

24+ --

25+ , fromPtr

26+ , fromSnippet

27+ , fromChars

28+ --

29+ , MBA

30+ , newByteArray

31+ , copyFromPtr

32+ , writeWord8

33+ , freeze

34+ )

35+ where

36+

37+

38+import Prelude hiding (String, all, any, concat)

39+import Data.Binary (Get, get, getWord8, Put, put, putWord8)

40+import Data.Binary.Put (putBuilder)

41+import Data.Binary.Get.Internal (readN)

42+import Data.Bits ((.&.), shiftR)

43+import qualified Data.ByteString.Internal as B

44+import qualified Data.ByteString.Builder.Internal as B

45+import qualified Data.Char as Char

46+import qualified Data.List as List

47+import Foreign.ForeignPtr (touchForeignPtr)

48+import Foreign.ForeignPtr.Unsafe (unsafeForeignPtrToPtr)

49+import Foreign.Ptr (minusPtr, plusPtr)

50+import GHC.Exts

51+ ( Int(I#), Ptr(Ptr), Char(C#)

52+ , RealWorld

53+ , ByteArray#, MutableByteArray#

54+ , isTrue#

55+ , newByteArray#

56+ , unsafeFreezeByteArray#

57+ , sizeofByteArray#

58+ , copyByteArray#

59+ , copyAddrToByteArray#

60+ , copyByteArrayToAddr#

61+ , writeWord8Array#

62+ )

63+import GHC.IO

64+import GHC.ST (ST(ST), runST)

65+import GHC.Prim

66+import GHC.Word (Word8(W8#))

67+

68+import qualified Parse.Primitives as P

69+

70+

71+

72+-- UTF-8

73+

74+

75+data Utf8 tipe =

76+ Utf8 ByteArray#

77+

78+

79+

80+-- EMPTY

81+

82+

83+{-# NOINLINE empty #-}

84+empty :: Utf8 t

85+empty =

86+ runST (freeze =<< newByteArray 0)

87+

88+

89+isEmpty :: Utf8 t -> Bool

90+isEmpty (Utf8 ba#) =

91+ isTrue# (sizeofByteArray# ba# ==# 0#)

92+

93+

94+

95+-- SIZE

96+

97+

98+size :: Utf8 t -> Int

99+size (Utf8 ba#) =

100+ I# (sizeofByteArray# ba#)

101+

102+

103+

104+-- CONTAINS

105+

106+

107+contains :: Word8 -> Utf8 t -> Bool

108+contains (W8# word#) (Utf8 ba#) =

109+ containsHelp word# ba# 0# (sizeofByteArray# ba#)

110+

111+

112+containsHelp :: Word# -> ByteArray# -> Int# -> Int# -> Bool

113+containsHelp word# ba# !offset# len# =

114+ if isTrue# (offset# <# len#) then

115+ if isTrue# (eqWord# word# (indexWord8Array# ba# offset#))

116+ then True

117+ else containsHelp word# ba# (offset# +# 1#) len#

118+ else

119+ False

120+

121+

122+

123+-- STARTS WITH

124+

125+

126+{-# INLINE startsWith #-}

127+startsWith :: Utf8 t -> Utf8 t -> Bool

128+startsWith (Utf8 ba1#) (Utf8 ba2#) =

129+ let

130+ !len1# = sizeofByteArray# ba1#

131+ !len2# = sizeofByteArray# ba2#

132+ in

133+ isTrue# (len1# <=# len2#)

134+ &&

135+ isTrue# (0# ==# compareByteArrays# ba1# 0# ba2# 0# len1#)

136+

137+

138+

139+-- STARTS WITH CHAR

140+

141+

142+startsWithChar :: (Char -> Bool) -> Utf8 t -> Bool

143+startsWithChar isGood bytes@(Utf8 ba#) =

144+ if isEmpty bytes then

145+ False

146+ else

147+ let

148+ !w# = indexWord8Array# ba# 0#

149+ !char

150+ | isTrue# (ltWord# w# 0xC0##) = C# (chr# (word2Int# w#))

151+ | isTrue# (ltWord# w# 0xE0##) = chr2 ba# 0# w#

152+ | isTrue# (ltWord# w# 0xF0##) = chr3 ba# 0# w#

153+ | True = chr4 ba# 0# w#

154+ in

155+ isGood char

156+

157+

158+

159+-- ENDS WITH WORD

160+

161+

162+endsWithWord8 :: Word8 -> Utf8 t -> Bool

163+endsWithWord8 (W8# w#) (Utf8 ba#) =

164+ let len# = sizeofByteArray# ba# in

165+ isTrue# (len# ># 0#)

166+ &&

167+ isTrue# (eqWord# w# (indexWord8Array# ba# (len# -# 1#)))

168+

169+

170+

171+-- SPLIT

172+

173+

174+split :: Word8 -> Utf8 t -> [Utf8 t]

175+split (W8# divider#) str@(Utf8 ba#) =

176+ splitHelp str 0 (findDividers divider# ba# 0# (sizeofByteArray# ba#) [])

177+

178+

179+splitHelp :: Utf8 t -> Int -> [Int] -> [Utf8 t]

180+splitHelp str start offsets =

181+ case offsets of

182+ [] ->

183+ [ unsafeSlice str start (size str) ]

184+

185+ offset : offsets ->

186+ unsafeSlice str start offset : splitHelp str (offset + 1) offsets

187+

188+

189+findDividers :: Word# -> ByteArray# -> Int# -> Int# -> [Int] -> [Int]

190+findDividers divider# ba# !offset# len# revOffsets =

191+ if isTrue# (offset# <# len#) then

192+ findDividers divider# ba# (offset# +# 1#) len# $

193+ if isTrue# (eqWord# divider# (indexWord8Array# ba# offset#))

194+ then I# offset# : revOffsets

195+ else revOffsets

196+ else

197+ reverse revOffsets

198+

199+

200+unsafeSlice :: Utf8 t -> Int -> Int -> Utf8 t

201+unsafeSlice str start end =

202+ let !len = end - start in

203+ if len == 0 then

204+ empty

205+ else

206+ runST $

207+ do mba <- newByteArray len

208+ copy str start mba 0 len

209+ freeze mba

210+

211+

212+

213+-- JOIN

214+

215+

216+join :: Word8 -> [Utf8 t] -> Utf8 t

217+join sep strings =

218+ case strings of

219+ [] ->

220+ empty

221+

222+ str:strs ->

223+ runST $

224+ do let !len = List.foldl' (\w s -> w + 1 + size s) (size str) strs

225+ mba <- newByteArray len

226+ joinHelp sep mba 0 str strs

227+ freeze mba

228+

229+

230+joinHelp :: Word8 -> MBA s -> Int -> Utf8 t -> [Utf8 t] -> ST s ()

231+joinHelp sep mba offset str strings =

232+ let

233+ !len = size str

234+ in

235+ case strings of

236+ [] ->

237+ copy str 0 mba offset len

238+

239+ s:ss ->

240+ do copy str 0 mba offset len

241+ let !dotOffset = offset + len

242+ writeWord8 mba dotOffset sep

243+ let !newOffset = dotOffset + 1

244+ joinHelp sep mba newOffset s ss

245+

246+

247+

248+-- EQUAL

249+

250+

251+instance Eq (Utf8 t) where

252+ (==) (Utf8 ba1#) (Utf8 ba2#) =

253+ let

254+ !len1# = sizeofByteArray# ba1#

255+ !len2# = sizeofByteArray# ba2#

256+ in

257+ isTrue# (len1# ==# len2#)

258+ &&

259+ isTrue# (0# ==# compareByteArrays# ba1# 0# ba2# 0# len1#)

260+

261+

262+

263+-- COMPARE

264+--

265+-- TODO: is it fine to sort by length and only compare bytes on length ties?

266+--

267+

268+instance Ord (Utf8 t) where

269+ compare (Utf8 ba1#) (Utf8 ba2#) =

270+ let

271+ !len1# = sizeofByteArray# ba1#

272+ !len2# = sizeofByteArray# ba2#

273+ !len# = if isTrue# (len1# <# len2#) then len1# else len2#

274+ !cmp# = compareByteArrays# ba1# 0# ba2# 0# len#

275+ in

276+ case () of

277+ _ | isTrue# (cmp# <# 0#) -> LT

278+ | isTrue# (cmp# ># 0#) -> GT

279+ | isTrue# (len1# <# len2#) -> LT

280+ | isTrue# (len1# ># len2#) -> GT

281+ | True -> EQ

282+

283+

284+

285+-- FROM STRING

286+

287+

288+fromChars :: [Char] -> Utf8 t

289+fromChars chars =

290+ runST

291+ (

292+ do mba <- newByteArray (sum (map getWidth chars))

293+ writeChars mba 0 chars

294+ )

295+

296+

297+writeChars :: MBA s -> Int -> [Char] -> ST s (Utf8 t)

298+writeChars !mba !offset chars =

299+ case chars of

300+ [] ->

301+ freeze mba

302+

303+ char : chars

304+ | n < 0x80 ->

305+ do writeWord8 mba (offset ) (fromIntegral n)

306+ writeChars mba (offset + 1) chars

307+

308+ | n < 0x800 ->

309+ do writeWord8 mba (offset ) (fromIntegral ((shiftR n 6 ) + 0xC0))

310+ writeWord8 mba (offset + 1) (fromIntegral (( n .&. 0x3F) + 0x80))

311+ writeChars mba (offset + 2) chars

312+

313+ | n < 0x10000 ->

314+ do writeWord8 mba (offset ) (fromIntegral ((shiftR n 12 ) + 0xE0))

315+ writeWord8 mba (offset + 1) (fromIntegral ((shiftR n 6 .&. 0x3F) + 0x80))

316+ writeWord8 mba (offset + 2) (fromIntegral (( n .&. 0x3F) + 0x80))

317+ writeChars mba (offset + 3) chars

318+

319+ | otherwise ->

320+ do writeWord8 mba (offset ) (fromIntegral ((shiftR n 18 ) + 0xF0))

321+ writeWord8 mba (offset + 1) (fromIntegral ((shiftR n 12 .&. 0x3F) + 0x80))

322+ writeWord8 mba (offset + 2) (fromIntegral ((shiftR n 6 .&. 0x3F) + 0x80))

323+ writeWord8 mba (offset + 3) (fromIntegral (( n .&. 0x3F) + 0x80))

324+ writeChars mba (offset + 4) chars

325+

326+ where

327+ n = Char.ord char

328+

329+

330+{-# INLINE getWidth #-}

331+getWidth :: Char -> Int

332+getWidth char

333+ | code < 0x80 = 1

334+ | code < 0x800 = 2

335+ | code < 0x10000 = 3

336+ | otherwise = 4

337+ where

338+ code = Char.ord char

339+

340+

341+

342+-- TO CHARS

343+

344+

345+toChars :: Utf8 t -> [Char]

346+toChars (Utf8 ba#) =

347+ toCharsHelp ba# 0# (sizeofByteArray# ba#)

348+

349+

350+toCharsHelp :: ByteArray# -> Int# -> Int# -> [Char]

351+toCharsHelp ba# offset# len# =

352+ if isTrue# (offset# >=# len#) then

353+ []

354+ else

355+ let

356+ !w# = indexWord8Array# ba# offset#

357+ !(# char, width# #)

358+ | isTrue# (ltWord# w# 0xC0##) = (# C# (chr# (word2Int# w#)), 1# #)

359+ | isTrue# (ltWord# w# 0xE0##) = (# chr2 ba# offset# w#, 2# #)

360+ | isTrue# (ltWord# w# 0xF0##) = (# chr3 ba# offset# w#, 3# #)

361+ | True = (# chr4 ba# offset# w#, 4# #)

362+

363+ !newOffset# = offset# +# width#

364+ in

365+ char : toCharsHelp ba# newOffset# len#

366+

367+

368+{-# INLINE chr2 #-}

369+chr2 :: ByteArray# -> Int# -> Word# -> Char

370+chr2 ba# offset# firstWord# =

371+ let

372+ !i1# = word2Int# firstWord#

373+ !i2# = word2Int# (indexWord8Array# ba# (offset# +# 1#))

374+ !c1# = uncheckedIShiftL# (i1# -# 0xC0#) 6#

375+ !c2# = i2# -# 0x80#

376+ in

377+ C# (chr# (c1# +# c2#))

378+

379+

380+{-# INLINE chr3 #-}

381+chr3 :: ByteArray# -> Int# -> Word# -> Char

382+chr3 ba# offset# firstWord# =

383+ let

384+ !i1# = word2Int# firstWord#

385+ !i2# = word2Int# (indexWord8Array# ba# (offset# +# 1#))

386+ !i3# = word2Int# (indexWord8Array# ba# (offset# +# 2#))

387+ !c1# = uncheckedIShiftL# (i1# -# 0xE0#) 12#

388+ !c2# = uncheckedIShiftL# (i2# -# 0x80#) 6#

389+ !c3# = i3# -# 0x80#

390+ in

391+ C# (chr# (c1# +# c2# +# c3#))

392+

393+

394+{-# INLINE chr4 #-}

395+chr4 :: ByteArray# -> Int# -> Word# -> Char

396+chr4 ba# offset# firstWord# =

397+ let

398+ !i1# = word2Int# firstWord#

399+ !i2# = word2Int# (indexWord8Array# ba# (offset# +# 1#))

400+ !i3# = word2Int# (indexWord8Array# ba# (offset# +# 2#))

401+ !i4# = word2Int# (indexWord8Array# ba# (offset# +# 3#))

402+ !c1# = uncheckedIShiftL# (i1# -# 0xF0#) 18#

403+ !c2# = uncheckedIShiftL# (i2# -# 0x80#) 12#

404+ !c3# = uncheckedIShiftL# (i3# -# 0x80#) 6#

405+ !c4# = i4# -# 0x80#

406+ in

407+ C# (chr# (c1# +# c2# +# c3# +# c4#))

408+

409+

410+

411+-- TO BUILDER

412+

413+

414+{-# INLINE toBuilder #-}

415+toBuilder :: Utf8 t -> B.Builder

416+toBuilder =

417+ \bytes -> B.builder (toBuilderHelp bytes)

418+

419+

420+{-# INLINE toBuilderHelp #-}

421+toBuilderHelp :: Utf8 t -> B.BuildStep a -> B.BuildStep a

422+toBuilderHelp !bytes@(Utf8 ba#) k =

423+ go 0 (I# (sizeofByteArray# ba#))

424+ where

425+ go !offset !end !(B.BufferRange bOffset bEnd) =

426+ let

427+ !bLen = minusPtr bEnd bOffset

428+ !len = end - offset

429+ in

430+ if len <= bLen then

431+ do copyToPtr bytes offset bOffset len

432+ let !br' = B.BufferRange (plusPtr bOffset len) bEnd

433+ k br'

434+ else

435+ do copyToPtr bytes offset bOffset bLen

436+ let !offset' = offset + bLen

437+ return $ B.bufferFull 1 bEnd (go offset' end)

438+

439+

440+

441+-- TO ESCAPED BUILDER

442+

443+

444+{-# INLINE toEscapedBuilder #-}

445+toEscapedBuilder :: Word8 -> Word8 -> Utf8 t -> B.Builder

446+toEscapedBuilder before after =

447+ \name -> B.builder (toEscapedBuilderHelp before after name)

448+

449+

450+{-# INLINE toEscapedBuilderHelp #-}

451+toEscapedBuilderHelp :: Word8 -> Word8 -> Utf8 t -> B.BuildStep a -> B.BuildStep a

452+toEscapedBuilderHelp before after !name@(Utf8 ba#) k =

453+ go 0 (I# (sizeofByteArray# ba#))

454+ where

455+ go !offset !len !(B.BufferRange bOffset bEnd) =

456+ let

457+ !bLen = minusPtr bEnd bOffset

458+ in

459+ if len <= bLen then

460+ do -- PERF test if writing word-by-word is faster

461+ copyToPtr name offset bOffset len

462+ escape before after bOffset name offset len 0

463+ let !newBufferRange = B.BufferRange (plusPtr bOffset len) bEnd

464+ k newBufferRange

465+ else

466+ do copyToPtr name offset bOffset bLen

467+ escape before after bOffset name offset bLen 0

468+ let !newOffset = offset + bLen

469+ let !newLength = len - bLen

470+ return $ B.bufferFull 1 bEnd (go newOffset newLength)

471+

472+

473+escape :: Word8 -> Word8 -> Ptr a -> Utf8 t -> Int -> Int -> Int -> IO ()

474+escape before@(W8# before#) after ptr name@(Utf8 ba#) offset@(I# offset#) len@(I# len#) i@(I# i#) =

475+ if isTrue# (i# <# len#) then

476+ if isTrue# (eqWord# before# (indexWord8Array# ba# (offset# +# i#)))

477+ then

478+ do writeWordToPtr ptr i after

479+ escape before after ptr name offset len (i + 1)

480+ else

481+ do escape before after ptr name offset len (i + 1)

482+

483+ else

484+ return ()

485+

486+

487+

488+-- FROM PTR

489+

490+

491+fromPtr :: Ptr Word8 -> Ptr Word8 -> Utf8 t

492+fromPtr pos end =

493+ unsafeDupablePerformIO (stToIO (

494+ do let !len = minusPtr end pos

495+ mba <- newByteArray len

496+ copyFromPtr pos mba 0 len

497+ freeze mba

498+ ))

499+

500+

501+

502+-- FROM SNIPPET

503+

504+

505+fromSnippet :: P.Snippet -> Utf8 t

506+fromSnippet (P.Snippet fptr off len _ _) =

507+ unsafeDupablePerformIO (stToIO (

508+ do mba <- newByteArray len

509+ let !pos = plusPtr (unsafeForeignPtrToPtr fptr) off

510+ copyFromPtr pos mba 0 len

511+ freeze mba

512+ ))

513+

514+

515+

516+-- BINARY

517+

518+

519+putUnder256 :: Utf8 t -> Put

520+putUnder256 bytes =

521+ do putWord8 (fromIntegral (size bytes))

522+ putBuilder (toBuilder bytes)

523+

524+

525+getUnder256 :: Get (Utf8 t)

526+getUnder256 =

527+ do word <- getWord8

528+ let !n = fromIntegral word

529+ readN n (copyFromByteString n)

530+

531+

532+putVeryLong :: Utf8 t -> Put

533+putVeryLong bytes =

534+ do put (size bytes)

535+ putBuilder (toBuilder bytes)

536+

537+

538+getVeryLong :: Get (Utf8 t)

539+getVeryLong =

540+ do n <- get

541+ if n > 0

542+ then readN n (copyFromByteString n)

543+ else return empty

544+

545+

546+

547+-- COPY FROM BYTESTRING

548+

549+

550+{-# INLINE copyFromByteString #-}

551+copyFromByteString :: Int -> B.ByteString -> Utf8 t

552+copyFromByteString len (B.PS fptr offset _) =

553+ unsafeDupablePerformIO

554+ (

555+ do mba <- stToIO (newByteArray len)

556+ stToIO (copyFromPtr (unsafeForeignPtrToPtr fptr `plusPtr` offset) mba 0 len)

557+ touchForeignPtr fptr

558+ stToIO (freeze mba)

559+ )

560+

561+

562+

563+-- PRIMITIVES

564+

565+

566+data MBA s =

567+ MBA# (MutableByteArray# s)

568+

569+

570+newByteArray :: Int -> ST s (MBA s) -- PERF see if newPinnedByteArray for len > 256 is positive

571+newByteArray (I# len#) =

572+ ST $ \s ->

573+ case newByteArray# len# s of

574+ (# s, mba# #) -> (# s, MBA# mba# #)

575+

576+

577+freeze :: MBA s -> ST s (Utf8 t)

578+freeze (MBA# mba#) =

579+ ST $ \s ->

580+ case unsafeFreezeByteArray# mba# s of

581+ (# s, ba# #) -> (# s, Utf8 ba# #)

582+

583+

584+copy :: Utf8 t -> Int -> MBA s -> Int -> Int -> ST s ()

585+copy (Utf8 ba#) (I# offset#) (MBA# mba#) (I# i#) (I# len#) =

586+ ST $ \s ->

587+ case copyByteArray# ba# offset# mba# i# len# s of

588+ s -> (# s, () #)

589+

590+

591+copyFromPtr :: Ptr a -> MBA RealWorld -> Int -> Int -> ST RealWorld ()

592+copyFromPtr (Ptr src#) (MBA# mba#) (I# offset#) (I# len#) =

593+ ST $ \s ->

594+ case copyAddrToByteArray# src# mba# offset# len# s of

595+ s -> (# s, () #)

596+

597+

598+copyToPtr :: Utf8 t -> Int -> Ptr a -> Int -> IO ()

599+copyToPtr (Utf8 ba#) (I# offset#) (Ptr mba#) (I# len#) =

600+ IO $ \s ->

601+ case copyByteArrayToAddr# ba# offset# mba# len# s of

602+ s -> (# s, () #)

603+

604+

605+{-# INLINE writeWord8 #-}

606+writeWord8 :: MBA s -> Int -> Word8 -> ST s ()

607+writeWord8 (MBA# mba#) (I# offset#) (W8# w#) =

608+ ST $ \s ->

609+ case writeWord8Array# mba# offset# w# s of

610+ s -> (# s, () #)

611+

612+

613+{-# INLINE writeWordToPtr #-}

614+writeWordToPtr :: Ptr a -> Int -> Word8 -> IO ()

615+writeWordToPtr (Ptr addr#) (I# offset#) (W8# word#) =

616+ IO $ \s ->

617+ case writeWord8OffAddr# addr# offset# word# s of

618+ s -> (# s, () #)

compiler/src/Elm/Compiler/Imports.hsnew file+62

@@ -0,0 +1,62 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Elm.Compiler.Imports

4+ ( defaults

5+ )

6+ where

7+

8+

9+import qualified Data.Name as Name

10+

11+import qualified AST.Source as Src

12+import qualified Elm.ModuleName as ModuleName

13+import qualified Reporting.Annotation as A

14+

15+

16+

17+-- DEFAULTS

18+

19+

20+defaults :: [Src.Import]

21+defaults =

22+ [ import_ ModuleName.basics Nothing Src.Open

23+ , import_ ModuleName.debug Nothing closed

24+ , import_ ModuleName.list Nothing (operator "::")

25+ , import_ ModuleName.maybe Nothing (typeOpen Name.maybe)

26+ , import_ ModuleName.result Nothing (typeOpen Name.result)

27+ , import_ ModuleName.string Nothing (typeClosed Name.string)

28+ , import_ ModuleName.char Nothing (typeClosed Name.char)

29+ , import_ ModuleName.tuple Nothing closed

30+ , import_ ModuleName.platform Nothing (typeClosed Name.program)

31+ , import_ ModuleName.cmd (Just Name.cmd) (typeClosed Name.cmd)

32+ , import_ ModuleName.sub (Just Name.sub) (typeClosed Name.sub)

33+ ]

34+

35+

36+import_ :: ModuleName.Canonical -> Maybe Name.Name -> Src.Exposing -> Src.Import

37+import_ (ModuleName.Canonical _ name) maybeAlias exposing =

38+ Src.Import (A.At A.zero name) maybeAlias exposing

39+

40+

41+

42+-- EXPOSING

43+

44+

45+closed :: Src.Exposing

46+closed =

47+ Src.Explicit []

48+

49+

50+typeOpen :: Name.Name -> Src.Exposing

51+typeOpen name =

52+ Src.Explicit [ Src.Upper (A.At A.zero name) (Src.Public A.zero) ]

53+

54+

55+typeClosed :: Name.Name -> Src.Exposing

56+typeClosed name =

57+ Src.Explicit [ Src.Upper (A.At A.zero name) Src.Private ]

58+

59+

60+operator :: Name.Name -> Src.Exposing

61+operator op =

62+ Src.Explicit [ Src.Operator A.zero op ]

compiler/src/Elm/Compiler/Type.hsnew file+194

@@ -0,0 +1,194 @@

1+{-# OPTIONS_GHC -Wall #-}

2+{-# LANGUAGE OverloadedStrings #-}

3+module Elm.Compiler.Type

4+ ( Type(..)

5+ , RT.Context(..)

6+ , toDoc

7+ , DebugMetadata(..)

8+ , Alias(..)

9+ , Union(..)

10+ , encode

11+ , decoder

12+ , encodeMetadata

13+ )

14+ where

15+

16+

17+import qualified Data.Name as Name

18+

19+import qualified AST.Source as Src

20+import qualified Json.Decode as D

21+import qualified Json.Encode as E

22+import Json.Encode ((==>))

23+import qualified Json.String as Json

24+import qualified Parse.Primitives as P

25+import qualified Parse.Type as Type

26+import qualified Reporting.Annotation as A

27+import qualified Reporting.Doc as D

28+import qualified Reporting.Render.Type as RT

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

30+

31+

32+

33+-- TYPES

34+

35+

36+data Type

37+ = Lambda Type Type

38+ | Var Name.Name

39+ | Type Name.Name [Type]

40+ | Record [(Name.Name, Type)] (Maybe Name.Name)

41+ | Unit

42+ | Tuple Type Type [Type]

43+

44+

45+data DebugMetadata =

46+ DebugMetadata

47+ { _message :: Type

48+ , _aliases :: [Alias]

49+ , _unions :: [Union]

50+ }

51+

52+

53+data Alias = Alias Name.Name [Name.Name] Type

54+data Union = Union Name.Name [Name.Name] [(Name.Name, [Type])]

55+

56+

57+

58+-- TO DOC

59+

60+

61+toDoc :: L.Localizer -> RT.Context -> Type -> D.Doc

62+toDoc localizer context tipe =

63+ case tipe of

64+ Lambda _ _ ->

65+ let

66+ a:b:cs =

67+ map (toDoc localizer RT.Func) (collectLambdas tipe)

68+ in

69+ RT.lambda context a b cs

70+

71+ Var name ->

72+ D.fromName name

73+

74+ Unit ->

75+ "()"

76+

77+ Tuple a b cs ->

78+ RT.tuple

79+ (toDoc localizer RT.None a)

80+ (toDoc localizer RT.None b)

81+ (map (toDoc localizer RT.None) cs)

82+

83+ Type name args ->

84+ RT.apply

85+ context

86+ (D.fromName name)

87+ (map (toDoc localizer RT.App) args)

88+

89+ Record fields ext ->

90+ RT.record

91+ (map (entryToDoc localizer) fields)

92+ (fmap D.fromName ext)

93+

94+

95+entryToDoc :: L.Localizer -> (Name.Name, Type) -> (D.Doc, D.Doc)

96+entryToDoc localizer (field, fieldType) =

97+ ( D.fromName field, toDoc localizer RT.None fieldType )

98+

99+

100+collectLambdas :: Type -> [Type]

101+collectLambdas tipe =

102+ case tipe of

103+ Lambda arg body ->

104+ arg : collectLambdas body

105+

106+ _ ->

107+ [tipe]

108+

109+

110+

111+-- JSON for TYPE

112+

113+

114+encode :: Type -> E.Value

115+encode tipe =

116+ E.chars $ D.toLine (toDoc L.empty RT.None tipe)

117+

118+

119+decoder :: D.Decoder () Type

120+decoder =

121+ let

122+ parser =

123+ P.specialize (\_ _ _ -> ()) (fromRawType . fst <$> Type.expression)

124+ in

125+ D.customString parser (\_ _ -> ())

126+

127+

128+fromRawType :: Src.Type -> Type

129+fromRawType (A.At _ astType) =

130+ case astType of

131+ Src.TLambda t1 t2 ->

132+ Lambda (fromRawType t1) (fromRawType t2)

133+

134+ Src.TVar x ->

135+ Var x

136+

137+ Src.TUnit ->

138+ Unit

139+

140+ Src.TTuple a b cs ->

141+ Tuple

142+ (fromRawType a)

143+ (fromRawType b)

144+ (map fromRawType cs)

145+

146+ Src.TType _ name args ->

147+ Type name (map fromRawType args)

148+

149+ Src.TTypeQual _ _ name args ->

150+ Type name (map fromRawType args)

151+

152+ Src.TRecord fields ext ->

153+ let fromField (A.At _ field, tipe) = (field, fromRawType tipe) in

154+ Record

155+ (map fromField fields)

156+ (fmap A.toValue ext)

157+

158+

159+

160+-- JSON for PROGRAM

161+

162+

163+encodeMetadata :: DebugMetadata -> E.Value

164+encodeMetadata (DebugMetadata msg aliases unions) =

165+ E.object

166+ [ "message" ==> encode msg

167+ , "aliases" ==> E.object (map toTypeAliasField aliases)

168+ , "unions" ==> E.object (map toCustomTypeField unions)

169+ ]

170+

171+

172+toTypeAliasField :: Alias -> ( Json.String, E.Value )

173+toTypeAliasField (Alias name args tipe) =

174+ ( Json.fromName name

175+ , E.object

176+ [ "args" ==> E.list E.name args

177+ , "type" ==> encode tipe

178+ ]

179+ )

180+

181+

182+toCustomTypeField :: Union -> ( Json.String, E.Value )

183+toCustomTypeField (Union name args constructors) =

184+ ( Json.fromName name

185+ , E.object

186+ [ "args" ==> E.list E.name args

187+ , "tags" ==> E.object (map toVariantObject constructors)

188+ ]

189+ )

190+

191+

192+toVariantObject :: (Name.Name, [Type]) -> ( Json.String, E.Value )

193+toVariantObject (name, args) =

194+ ( Json.fromName name, E.list encode args )

compiler/src/Elm/Compiler/Type/Extract.hsnew file+285

@@ -0,0 +1,285 @@

1+{-# OPTIONS_GHC -Wall #-}

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

3+module Elm.Compiler.Type.Extract

4+ ( fromAnnotation

5+ , fromType

6+ , Types(..)

7+ , mergeMany

8+ , merge

9+ , fromInterface

10+ , fromDependencyInterface

11+ , fromMsg

12+ )

13+ where

14+

15+

16+import Data.Map ((!))

17+import qualified Data.Map as Map

18+import qualified Data.Maybe as Maybe

19+import qualified Data.Name as Name

20+import qualified Data.Set as Set

21+

22+import qualified AST.Canonical as Can

23+import qualified AST.Optimized as Opt

24+import qualified AST.Utils.Type as Type

25+import qualified Elm.Compiler.Type as T

26+import qualified Elm.Interface as I

27+import qualified Elm.ModuleName as ModuleName

28+

29+

30+

31+-- EXTRACTION

32+

33+

34+fromAnnotation :: Can.Annotation -> T.Type

35+fromAnnotation (Can.Forall _ astType) =

36+ fromType astType

37+

38+

39+fromType :: Can.Type -> T.Type

40+fromType astType =

41+ snd (run (extract astType))

42+

43+

44+extract :: Can.Type -> Extractor T.Type

45+extract astType =

46+ case astType of

47+ Can.TLambda arg result ->

48+ T.Lambda

49+ <$> extract arg

50+ <*> extract result

51+

52+ Can.TVar x ->

53+ pure (T.Var x)

54+

55+ Can.TType home name args ->

56+ addUnion (Opt.Global home name) (T.Type (toPublicName home name))

57+ <*> traverse extract args

58+

59+ Can.TRecord fields ext ->

60+ do efields <- traverse (traverse extract) (Can.fieldsToList fields)

61+ pure (T.Record efields ext)

62+

63+ Can.TUnit ->

64+ pure T.Unit

65+

66+ Can.TTuple a b maybeC ->

67+ T.Tuple

68+ <$> extract a

69+ <*> extract b

70+ <*> traverse extract (Maybe.maybeToList maybeC)

71+

72+ Can.TAlias home name args aliasType ->

73+ do addAlias (Opt.Global home name) ()

74+ _ <- extract (Type.dealias args aliasType)

75+ T.Type (toPublicName home name)

76+ <$> traverse (extract . snd) args

77+

78+

79+toPublicName :: ModuleName.Canonical -> Name.Name -> Name.Name

80+toPublicName (ModuleName.Canonical _ home) name =

81+ Name.sepBy 0x2E {- . -} home name

82+

83+

84+

85+-- TRANSITIVELY AVAILABLE TYPES

86+

87+

88+newtype Types =

89+ Types (Map.Map ModuleName.Canonical Types_)

90+ -- PERF profile Opt.Global representation

91+ -- current representation needs less allocation

92+ -- but maybe the lookup is much worse

93+

94+

95+data Types_ =

96+ Types_

97+ { _union_info :: Map.Map Name.Name Can.Union

98+ , _alias_info :: Map.Map Name.Name Can.Alias

99+ }

100+

101+

102+mergeMany :: [Types] -> Types

103+mergeMany listOfTypes =

104+ case listOfTypes of

105+ [] -> Types Map.empty

106+ t:ts -> foldr merge t ts

107+

108+

109+merge :: Types -> Types -> Types

110+merge (Types types1) (Types types2) =

111+ Types (Map.union types1 types2)

112+

113+

114+fromInterface :: ModuleName.Raw -> I.Interface -> Types

115+fromInterface name (I.Interface pkg _ unions aliases _) =

116+ Types $ Map.singleton (ModuleName.Canonical pkg name) $

117+ Types_ (Map.map I.extractUnion unions) (Map.map I.extractAlias aliases)

118+

119+

120+fromDependencyInterface :: ModuleName.Canonical -> I.DependencyInterface -> Types

121+fromDependencyInterface home di =

122+ Types $ Map.singleton home $

123+ case di of

124+ I.Public (I.Interface _ _ unions aliases _) ->

125+ Types_ (Map.map I.extractUnion unions) (Map.map I.extractAlias aliases)

126+

127+ I.Private _ unions aliases ->

128+ Types_ unions aliases

129+

130+

131+

132+-- EXTRACT MODEL, MSG, AND ANY TRANSITIVE DEPENDENCIES

133+

134+

135+fromMsg :: Types -> Can.Type -> T.DebugMetadata

136+fromMsg types message =

137+ let

138+ (msgDeps, msgType) =

139+ run (extract message)

140+

141+ (aliases, unions) =

142+ extractTransitive types noDeps msgDeps

143+ in

144+ T.DebugMetadata msgType aliases unions

145+

146+

147+extractTransitive :: Types -> Deps -> Deps -> ( [T.Alias], [T.Union] )

148+extractTransitive types (Deps seenAliases seenUnions) (Deps nextAliases nextUnions) =

149+ let

150+ aliases = Set.difference nextAliases seenAliases

151+ unions = Set.difference nextUnions seenUnions

152+ in

153+ if Set.null aliases && Set.null unions then

154+ ( [], [] )

155+

156+ else

157+ let

158+ (newDeps, result) =

159+ run $

160+ (,)

161+ <$> traverse (extractAlias types) (Set.toList aliases)

162+ <*> traverse (extractUnion types) (Set.toList unions)

163+

164+ oldDeps =

165+ Deps (Set.union seenAliases nextAliases) (Set.union seenUnions nextUnions)

166+

167+ remainingResult =

168+ extractTransitive types oldDeps newDeps

169+ in

170+ mappend result remainingResult

171+

172+

173+extractAlias :: Types -> Opt.Global -> Extractor T.Alias

174+extractAlias (Types dict) (Opt.Global home name) =

175+ let

176+ (Can.Alias args aliasType) = _alias_info (dict ! home) ! name

177+ in

178+ T.Alias (toPublicName home name) args <$> extract aliasType

179+

180+

181+extractUnion :: Types -> Opt.Global -> Extractor T.Union

182+extractUnion (Types dict) (Opt.Global home name) =

183+ if name == Name.list && home == ModuleName.list

184+ then return $ T.Union (toPublicName home name) ["a"] []

185+ else

186+ let

187+ pname = toPublicName home name

188+ (Can.Union vars ctors _ _) = _union_info (dict ! home) ! name

189+ in

190+ T.Union pname vars <$> traverse extractCtor ctors

191+

192+

193+extractCtor :: Can.Ctor -> Extractor (Name.Name, [T.Type])

194+extractCtor (Can.Ctor ctor _ _ args) =

195+ (,) ctor <$> traverse extract args

196+

197+

198+

199+-- DEPS

200+

201+

202+data Deps =

203+ Deps

204+ { _aliases :: Set.Set Opt.Global

205+ , _unions :: Set.Set Opt.Global

206+ }

207+

208+

209+{-# NOINLINE noDeps #-}

210+noDeps :: Deps

211+noDeps =

212+ Deps Set.empty Set.empty

213+

214+

215+

216+-- EXTRACTOR

217+

218+

219+newtype Extractor a =

220+ Extractor (

221+ forall result.

222+ Set.Set Opt.Global

223+ -> Set.Set Opt.Global

224+ -> (Set.Set Opt.Global -> Set.Set Opt.Global -> a -> result)

225+ -> result

226+ )

227+

228+

229+run :: Extractor a -> (Deps, a)

230+run (Extractor k) =

231+ k Set.empty Set.empty $ \aliases unions value ->

232+ ( Deps aliases unions, value )

233+

234+

235+addAlias :: Opt.Global -> a -> Extractor a

236+addAlias alias value =

237+ Extractor $ \aliases unions ok ->

238+ ok (Set.insert alias aliases) unions value

239+

240+

241+addUnion :: Opt.Global -> a -> Extractor a

242+addUnion union value =

243+ Extractor $ \aliases unions ok ->

244+ ok aliases (Set.insert union unions) value

245+

246+

247+instance Functor Extractor where

248+ fmap func (Extractor k) =

249+ Extractor $ \aliases unions ok ->

250+ let

251+ ok1 a1 u1 value =

252+ ok a1 u1 (func value)

253+ in

254+ k aliases unions ok1

255+

256+

257+instance Applicative Extractor where

258+ pure value =

259+ Extractor $ \aliases unions ok ->

260+ ok aliases unions value

261+

262+ (<*>) (Extractor kf) (Extractor kv) =

263+ Extractor $ \aliases unions ok ->

264+ let

265+ ok1 a1 u1 func =

266+ let

267+ ok2 a2 u2 value =

268+ ok a2 u2 (func value)

269+ in

270+ kv a1 u1 ok2

271+ in

272+ kf aliases unions ok1

273+

274+

275+instance Monad Extractor where

276+ return = pure

277+

278+ (>>=) (Extractor ka) callback =

279+ Extractor $ \aliases unions ok ->

280+ let

281+ ok1 a1 u1 value =

282+ case callback value of

283+ Extractor kb -> kb a1 u1 ok

284+ in

285+ ka aliases unions ok1

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.txt → docs/upgrade-instructions/earlier.mdrenamed+217−20

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/Automaton.elmdeleted−123

This diff is too big to show here.

libraries/AutomatonV2.elm.hiddendeleted−149

This diff is too big to show here.

libraries/Basics.elmdeleted−334

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−72

This diff is too big to show here.

libraries/Dict.elmdeleted−348

This diff is too big to show here.

libraries/Either.elmdeleted−68

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−305

This diff is too big to show here.

libraries/Graphics/Input.elmdeleted−199

This diff is too big to show here.

libraries/Http.elmdeleted−56

This diff is too big to show here.

libraries/JavaScript.elmdeleted−70

This diff is too big to show here.

libraries/JavaScript/Experimental.elmdeleted−41

This diff is too big to show here.

libraries/Json.elmdeleted−131

This diff is too big to show here.

libraries/Keyboard.elmdeleted−77

This diff is too big to show here.

libraries/List.elmdeleted−226

This diff is too big to show here.

libraries/Maybe.elmdeleted−47

This diff is too big to show here.

libraries/Mouse.elmdeleted−41

This diff is too big to show here.

libraries/Native/Basics.jsdeleted−69

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−69

This diff is too big to show here.

libraries/Native/Date.jsdeleted−33

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−304

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−310

This diff is too big to show here.

libraries/Native/Prelude.jsdeleted−52

This diff is too big to show here.

libraries/Native/Show.jsdeleted−116

This diff is too big to show here.

libraries/Native/Signal/Http.jsdeleted−61

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−51

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−235

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−251

This diff is too big to show here.

libraries/Native/Text.jsdeleted−136

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−183

This diff is too big to show here.

libraries/Prelude.elmdeleted−19

This diff is too big to show here.

libraries/Random.elmdeleted−30

This diff is too big to show here.

libraries/Set.elmdeleted−90

This diff is too big to show here.

libraries/Signal.elmdeleted−167

This diff is too big to show here.

libraries/String.elmdeleted−311

This diff is too big to show here.

libraries/Text.elmdeleted−114

This diff is too big to show here.

libraries/Time.elmdeleted−95

This diff is too big to show here.

libraries/Touch.elmdeleted−34

This diff is too big to show here.

libraries/Transform2D.elmdeleted−90

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.

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−183

This diff is too big to show here.

runtime/Render/Collage.jsdeleted−367

This diff is too big to show here.

runtime/Render/Element.jsdeleted−272

This diff is too big to show here.

runtime/Render/Utils.jsdeleted−48

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−116

This diff is too big to show here.

server/Setup.hsdeleted−2

This diff is too big to show here.

server/elm-server.cabaldeleted−40

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−22

This diff is too big to show here.

tests/bad/BBTArgsdeleted−1

This diff is too big to show here.

tests/bad/InfiniteType.elmdeleted−2

This diff is too big to show here.

tests/bad/NonElementMain.elmdeleted−2

This diff is too big to show here.

tests/good/AliasSubstitution.elmdeleted−6

This diff is too big to show here.

tests/good/NoExpressions.elmdeleted−3

This diff is too big to show here.

tests/good/Soundness/Apply.elmdeleted−3

This diff is too big to show here.

tests/good/Soundness/ApplyAnnotated.elmdeleted−4

This diff is too big to show here.

tests/good/Soundness/Id.elmdeleted−3

This diff is too big to show here.

tests/good/Soundness/IdAnnotated.elmdeleted−4

This diff is too big to show here.

tests/good/Soundness/TrickyId.elmdeleted−2

This diff is too big to show here.

tests/good/Soundness/TrickyIdAnnotated.elmdeleted−3

This diff is too big to show here.

tests/good/Unify/LockedVars.elmdeleted−6

This diff is too big to show here.

tests/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.