@@ -17,13 +17,13 @@ import Control.Monad (zipWithM)
1717import Data.Function (on)
1818import qualified Data.List as List
1919import qualified Data.Map as Map
20+import qualified Data.Name as Name
2021import qualified Data.Set as Set
2122import qualified Data.Text as Text
2223
2324import qualified Elm.Compiler.Module as Module
2425import qualified Elm.Compiler.Type as Type
2526import qualified Elm.Docs as Docs
26−import qualified Elm.Name as N
2727import qualified Elm.Package as Pkg
2828
2929
@@ -41,10 +41,10 @@ data PackageChanges =
4141
4242data ModuleChanges =
4343 ModuleChanges
44− { _unions :: Changes N.Name Docs.Union
45− , _aliases :: Changes N.Name Docs.Alias
46− , _values :: Changes N.Name Docs.Value
47− , _binops :: Changes N.Name Docs.Binop
44+ { _unions :: Changes Name.Name Docs.Union
45+ , _aliases :: Changes Name.Name Docs.Alias
46+ , _values :: Changes Name.Name Docs.Value
47+ , _binops :: Changes Name.Name Docs.Binop
4848 }
4949
5050
@@ -144,7 +144,7 @@ isEquivalentBinop (Docs.Binop c1 t1 a1 p1) (Docs.Binop c2 t2 a2 p2) =
144144-- DIFF TYPES
145145
146146
147−diffType :: Type.Type -> Type.Type -> Maybe [(N.Name,N.Name)]
147+diffType :: Type.Type -> Type.Type -> Maybe [(Name.Name,Name.Name)]
148148diffType oldType newType =
149149 case (oldType, newType) of
150150 (Type.Var oldName, Type.Var newName) ->
@@ -192,11 +192,11 @@ diffType oldType newType =
192192
193193
194194-- handle very old docs that do not use qualified names
195−isSameName :: N.Name -> N.Name -> Bool
195+isSameName :: Name.Name -> Name.Name -> Bool
196196isSameName oldFullName newFullName =
197197 let
198198 dedot name =
199− reverse (Text.splitOn "." (N.toText name))
199+ reverse (Text.splitOn "." (Name.toText name))
200200 in
201201 case ( dedot oldFullName, dedot newFullName ) of
202202 (oldName:[], newName:_) ->
@@ -209,7 +209,7 @@ isSameName oldFullName newFullName =
209209 oldFullName == newFullName
210210
211211
212−diffFields :: [(N.Name, Type.Type)] -> [(N.Name, Type.Type)] -> Maybe [(N.Name,N.Name)]
212+diffFields :: [(Name.Name, Type.Type)] -> [(Name.Name, Type.Type)] -> Maybe [(Name.Name,Name.Name)]
213213diffFields oldRawFields newRawFields =
214214 let
215215 sort = List.sortBy (compare `on` fst)
@@ -230,7 +230,7 @@ diffFields oldRawFields newRawFields =
230230-- TYPE VARIABLES
231231
232232
233−isEquivalentRenaming :: [(N.Name,N.Name)] -> Bool
233+isEquivalentRenaming :: [(Name.Name,Name.Name)] -> Bool
234234isEquivalentRenaming varPairs =
235235 let
236236 renamings =
@@ -263,7 +263,7 @@ isEquivalentRenaming varPairs =
263263 allUnique (map snd verifiedRenamings)
264264
265265
266−compatibleVars :: (N.Name, N.Name) -> Bool
266+compatibleVars :: (Name.Name, Name.Name) -> Bool
267267compatibleVars (old, new) =
268268 case (categorizeVar old, categorizeVar new) of
269269 (CompAppend, CompAppend) -> True
@@ -285,13 +285,13 @@ data TypeVarCategory
285285 | Var
286286
287287
288−categorizeVar :: N.Name -> TypeVarCategory
288+categorizeVar :: Name.Name -> TypeVarCategory
289289categorizeVar name
290− | N.startsWith "compappend" name = CompAppend
291− | N.startsWith "comparable" name = Comparable
292− | N.startsWith "appendable" name = Appendable
293− | N.startsWith "number" name = Number
294− | otherwise = Var
290+ | Name.isCompappendType name = CompAppend
291+ | Name.isComparableType name = Comparable
292+ | Name.isAppendableType name = Appendable
293+ | Name.isNumberType name = Number
294+ | otherwise = Var
295295
296296
297297