Added Levenshtein tests

Author: tdebatty

src/main/java/info/debatty/java/stringsimilarity/Levenshtein.java

@@ -5,21 +5,12 @@
 /**
  * The Levenshtein distance between two words is the minimum number of 
  * single-character edits (insertions, deletions or substitutions) required to 
- * change one word into the other.
+ * change one string into the other.
  * 
  * @author Thibault Debatty
  */
 public class Levenshtein implements MetricStringDistance {
 
-    public static void main (String[] args) {
-        Levenshtein l = new Levenshtein();
-        
-        System.out.println(l.distance("My string", "My $tring"));
-        System.out.println(l.distance("My string", "M string2"));
-        System.out.println(l.distance("My string", "My $tring"));
-    }
-
-    
     /**
      * The Levenshtein distance, or edit distance, between two words is the 
      * minimum number of single-character edits (insertions, deletions or 

src/main/java/info/debatty/java/stringsimilarity/examples/Examples.java

@@ -0,0 +1,46 @@
+/*
+ * The MIT License
+ *
+ * Copyright 2015 Thibault Debatty.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+package info.debatty.java.stringsimilarity.examples;
+
+import info.debatty.java.stringsimilarity.Levenshtein;
+
+/**
+ *
+ * @author Thibault Debatty
+ */
+public class Examples {
+
+    /**
+     * @param args the command line arguments
+     */
+    public static void main(String[] args) {
+        Levenshtein levenshtein = new Levenshtein();
+        
+        System.out.println(levenshtein.distance("My string", "My $tring"));
+        System.out.println(levenshtein.distance("My string", "M string2"));
+        System.out.println(levenshtein.distance("My string", "My $tring"));
+    }
+    
+}

src/test/java/info/debatty/java/stringsimilarity/LevenshteinTest.java

@@ -0,0 +1,71 @@
+/*
+ * The MIT License
+ *
+ * Copyright 2015 Thibault Debatty.
+ *
+ * Permission is hereby granted, free of charge, to any person obtaining a copy
+ * of this software and associated documentation files (the "Software"), to deal
+ * in the Software without restriction, including without limitation the rights
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+ * copies of the Software, and to permit persons to whom the Software is
+ * furnished to do so, subject to the following conditions:
+ *
+ * The above copyright notice and this permission notice shall be included in
+ * all copies or substantial portions of the Software.
+ *
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+ * THE SOFTWARE.
+ */
+
+package info.debatty.java.stringsimilarity;
+
+import org.junit.After;
+import org.junit.AfterClass;
+import org.junit.Before;
+import org.junit.BeforeClass;
+import org.junit.Test;
+import static org.junit.Assert.*;
+
+/**
+ *
+ * @author Thibault Debatty
+ */
+public class LevenshteinTest {
+    
+    public LevenshteinTest() {
+    }
+    
+    @BeforeClass
+    public static void setUpClass() {
+    }
+    
+    @AfterClass
+    public static void tearDownClass() {
+    }
+    
+    @Before
+    public void setUp() {
+    }
+    
+    @After
+    public void tearDown() {
+    }
+
+    /**
+     * Test of distance method, of class Levenshtein.
+     */
+    @Test
+    public void testDistance() {
+        System.out.println("distance");
+        Levenshtein instance = new Levenshtein();
+        assertEquals(1.0, instance.distance("My string", "My tring"), 0.0);
+        assertEquals(2.0, instance.distance("My string", "M string2"), 0.0);
+        assertEquals(1.0, instance.distance("My string", "My $tring"), 0.0);
+    }
+    
+}