elm 0.19 update

elm-package.json → elm.json

@@ -1,18 +1,18 @@
 {
+    "type": "package",
     "version": "1.1.1",
     "summary": "A package for calculating between-list edit distances.",
+    "name": "erwald/elm-edit-distance",
     "repository": "https://github.com/erwald/elm-edit-distance.git",
     "license": "MIT",
-    "source-directories": [
-        ".",
-        "src"
-    ],
     "exposed-modules": [
         "EditDistance"
     ],
     "dependencies": {
-        "elm-lang/core": "5.0.0 <= v < 6.0.0",
-        "elm-lang/html": "2.0.0 <= v < 3.0.0"
+        "elm/core": "1.0.0 <= v < 2.0.0"
+    },
+    "test-dependencies": {
+        "elm-explorations/test": "1.0.0 <= v < 2.0.0"
     },
-    "elm-version": "0.18.0 <= v < 0.19.0"
+    "elm-version": "0.19.0 <= v < 0.20.0"
 }

src/EditDistance.elm

@@ -130,7 +130,7 @@ doEdits costFunc source target =
                         , doEdits costFunc src_tail tgt_tail
                         ]
 
-                    edits =
+                    editsList =
                         [ Delete src_hd (List.length src_tail)
                         , Insert tgt_hd (List.length tgt_tail)
                         , Substitute tgt_hd (List.length tgt_tail)
@@ -142,7 +142,7 @@ doEdits costFunc source target =
                     getCost ( _, cost ) =
                         cost
                 in
-                    List.map2 combineResultsWithEdits results edits
+                    List.map2 combineResultsWithEdits results editsList
                         |> List.sortBy getCost
                         |> List.head
                         |> Maybe.withDefault ( [], 0 )
@@ -194,8 +194,8 @@ moveFromSteps editSteps step =
         Insert value index ->
             let
                 -- Find the corresponding deletion, if there is one.
-                isCorrespondingDelete step =
-                    case step of
+                isCorrespondingDelete s =
+                    case s of
                         Delete otherValue _ ->
                             value == otherValue
 
@@ -217,8 +217,8 @@ moveFromSteps editSteps step =
         Delete value index ->
             let
                 -- Find the corresponding insertion, if there is one.
-                isCorrespondingInsert step =
-                    case step of
+                isCorrespondingInsert s =
+                    case s of
                         Insert otherValue _ ->
                             value == otherValue
 
@@ -298,11 +298,11 @@ into another.
 levenshtein : List comparable -> List comparable -> Int
 levenshtein source target =
     case ( source, target ) of
-        ( source, [] ) ->
+        ( s, [] ) ->
             List.length source
 
-        ( [], target ) ->
-            List.length target
+        ( [], t ) ->
+            List.length t
 
         ( src_hd :: src_tail, tgt_hd :: tgt_tail ) ->
             if src_hd == tgt_hd then

tests/Tests.elm

@@ -91,7 +91,7 @@ all =
                     Expect.equal (edits abc adc)
                         [ Substitute 'd' 1
                         ]
-            , test "abc -> adc (without cost function) edit steps" <|
+            , test "abc -> adc (with cost function) edit steps" <|
                 \() ->
                     let
                         costFunc editStep =