1module Nitpick.PatternMatches (patternMatches) where
3import Control.Arrow (second)
4import qualified Data.Foldable as F
5import qualified Data.Map as Map
6import qualified Data.Maybe as Maybe
7import qualified Data.Set as Set
9import qualified AST.Expression.General as E
10import qualified AST.Expression.Canonical as Canonical
11import qualified AST.Helpers as Help
12import qualified AST.Module as Module
13import qualified AST.Module.Name as ModuleName
14import qualified AST.Pattern as Pattern
15import qualified AST.Variable as Var
16import Elm.Utils ((|>))
17import Nitpick.Pattern (Pattern(..), fromCanonicalPattern)
18import qualified Optimize.Patterns.DecisionTree as Opt
19import qualified Reporting.Annotation as A
20import qualified Reporting.Error.Pattern as Error
21import qualified Reporting.Region as Region
22import qualified Reporting.Result as Result
27 -> Module.CanonicalModule
28 -> Result.Result w Error.Error Opt.VariantDict
29patternMatches interfaces modul =
31 name = Module.name modul
32 body = Module.body modul
34 toTagDict interfaces name (Module.datatypes body)
36 const (Map.map (Map.map length) tagDict)
37 <$> checkExpression tagDict (Module.program body)
43 Map.Map Var.Home (Map.Map Tag [TagInfo])
55toTagDict :: Module.Interfaces -> ModuleName.Canonical -> Module.ADTs -> TagDict
56toTagDict interfaces localName localAdts =
64 Map.singleton Var.BuiltIn $
72 |> Map.map (toTagMapping . Module.iAdts)
73 |> Map.mapKeysMonotonic Var.Module
74 |> Map.insert (Var.Module localName) (toTagMapping localAdts)
76 Map.union builtinDict interfaceDict
79toTagMapping :: Module.ADTs -> Map.Map Tag [TagInfo]
82 toTagAndArity (_tvars, tagInfoList) =
84 info = map (\(tag, args) -> TagInfo tag (length args)) tagInfoList
86 map (second (const info)) tagInfoList
89 |> concatMap toTagAndArity
93lookupOtherTags :: Var.Canonical -> TagDict -> [TagInfo]
94lookupOtherTags (Var.Canonical home name) tagDict =
95 case Map.lookup name =<< Map.lookup home tagDict of
100 if Help.isTuple name then
101 [ TagInfo name (read (drop 6 name)) ]
104 "Since the Nitpick phase happens after canonicalization and type \
105 \inference, it is impossible that a pattern in a case cannot be \
114 -> Result.Result w Error.Error ()
115checkExpression tagDict (A.A region expression) =
118 checkExpression tagDict
124 checkPatterns tagDict region
136 E.ExplicitList listExprs ->
137 F.traverse_ go listExprs
139 E.Binop _ leftExpr rightExpr ->
140 go2 leftExpr rightExpr
142 E.Lambda pattern body ->
149 E.If branches finally ->
150 F.traverse_ (uncurry go2) branches
155 <* F.traverse_ goDef defs
157 goDef (Canonical.Definition _ pattern expr _) =
161 E.Case expr branches ->
163 <* goPattern (map fst branches)
164 <* F.traverse_ (go . snd) branches
166 E.Data _ctor exprs ->
169 E.Access record _field ->
172 E.Update record fields ->
174 <* F.traverse_ (go . snd) fields
177 F.traverse_ (go . snd) fields
199 -> [Pattern.CanonicalPattern]
200 -> Result.Result w Error.Error ()
201checkPatterns tagDict region patterns =
202 checkPatternsHelp tagDict region [Anything] patterns
209 -> [Pattern.CanonicalPattern]
210 -> Result.Result w Error.Error ()
211checkPatternsHelp tagDict region unhandled patterns =
212 case (unhandled, patterns) of
217 Result.throw region (Error.Incomplete unhandled)
219 (_, pattern@(A.A localRegion _) : remainingPatterns) ->
220 do newUnhandled <- filterPatterns tagDict localRegion pattern unhandled
221 checkPatternsHelp tagDict region newUnhandled remainingPatterns
227 -> Pattern.CanonicalPattern
229 -> Result.Result w Error.Error [Pattern]
230filterPatterns tagDict region pattern unhandled =
233 fromCanonicalPattern pattern
236 intersection pat nitPattern == Nothing
238 if all noIntersection unhandled then
239 Result.throw region Error.Redundant
242 do let complementPatterns = complement tagDict nitPattern
245 (\p -> Maybe.mapMaybe (intersection p) complementPatterns)
249-- PATTERN INTERSECTION
251intersection :: Pattern -> Pattern -> Maybe Pattern
252intersection pattern1 pattern2 =
253 case (pattern1, pattern2) of
254 (Alias _ pattern1', _) ->
255 intersection pattern1' pattern2
257 (_, Alias _ pattern2') ->
258 intersection pattern1 pattern2'
272 (Data ctor1 args1, Data ctor2 args2) ->
273 if ctor1 /= ctor2 then
276 Data ctor1 <$> sequence (zipWith intersection args1 args2)
278 (Record _, Record _) ->
281 (Literal lit1, Literal lit2) ->
287 (AnythingBut literals, Literal lit) ->
288 if Set.member lit literals then
293 (Literal lit, AnythingBut literals) ->
294 if Set.member lit literals then
299 (AnythingBut literals1, AnythingBut literals2) ->
300 Just (AnythingBut (Set.union literals1 literals2))
308complement :: TagDict -> Pattern -> [Pattern]
309complement tagDict nitPattern =
314 Alias _name pattern ->
315 complement tagDict pattern
324 [AnythingBut (Set.singleton lit)]
326 AnythingBut literals ->
327 map Literal (Set.toList literals)
329 Data ctor patterns ->
330 complementData tagDict ctor patterns
333complementData :: TagDict -> Var.Canonical -> [Pattern] -> [Pattern]
334complementData tagDict tag patterns =
337 lookupOtherTags tag tagDict
340 Maybe.mapMaybe (tagToPattern tag) otherTags
346 concat (zipWith (makeArgComplements tagDict tag arity) [0..] patterns)
348 tagComplements ++ argComplements
351tagToPattern :: Var.Canonical -> TagInfo -> Maybe Pattern
352tagToPattern (Var.Canonical home rootTag) (TagInfo tag arity) =
353 if rootTag == tag then
356 Just (Data (Var.Canonical home tag) (replicate arity Anything))
359makeArgComplements :: TagDict -> Var.Canonical -> Int -> Int -> Pattern -> [Pattern]
360makeArgComplements tagDict tag arity index argPattern =
363 complement tagDict argPattern
366 replicate index Anything
368 : replicate (arity - index - 1) Anything
370 map (Data tag . padArgs) complementList
keysesc to close
- j k
- move down, up
- enter
- open
- esc
- back, or up a level
- 1 2 3 4
- readme, files, commits, refs
- /
- filter
- y
- copy the clone command
- c
- compare the chosen commit with another (or shift-click both)
- ?
- show or hide this list