finished testing similar words

Author: Simon Flachs

src/main/java/Setup.java

@@ -81,7 +81,7 @@ public static LinkedHashMap getInstance() {
  * Adds the word as the key and the url as the value of the hashmap. Checks for duplicates inside each UrlList and only appends
  * new urls to the end.
  */
- private static void addEntryToHashMap(LinkedHashMap hashMap, String word, String url) {
+ protected static void addEntryToHashMap(LinkedHashMap hashMap, String word, String url) {
 
  HashSet<String> urlHashMap = (HashSet) hashMap.get(word);
 

tests/SimilarWordsTest.java

@@ -1,33 +1,35 @@
 import org.junit.Test;
 
 import java.lang.reflect.Method;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.LinkedHashMap;
 
 import static org.junit.Assert.*;
 
-/**
- * Created by Simon on 07/12/15.
- */
 public class SimilarWordsTest {
 
  @Test
- public void test_that_retrieves_words_with_distance_one() throws Exception {
-
+ public void it_retrieves_words_with_distance_one() throws Exception {
+ LinkedHashMap<String, HashSet> hashMap = new LinkedHashMap<String, HashSet>();
+ Setup.addEntryToHashMap(hashMap, "wordX", "testUrl");
+ HashSet<String> similarWords = SimilarWords.retrieveSimilarWords(hashMap, "word");
+ assertTrue(similarWords.contains("wordX"));
  }
 
  @Test
- public void test_that_if_no__words_with_distance_one_it_retrieves_with_distance_two() throws Exception {
-
+ public void it_retrieves_words_with_distance_two_if_no_words_with_distance_one() throws Exception {
+ LinkedHashMap<String, HashSet> hashMap = new LinkedHashMap<String, HashSet>();
+ Setup.addEntryToHashMap(hashMap, "wordXX", "testUrl");
+ HashSet<String> similarWords = SimilarWords.retrieveSimilarWords(hashMap, "word");
+ assertTrue(similarWords.contains("wordXX"));
  }
 
  @Test
  public void test_distance_algorithm() throws Exception {
  // two words that can be made identical by changing one letter will have a distance of 1
  assertTrue(SimilarWords.distance("testX", "testY") == 1);
- // two words that can be made identical by adding  or removing one letter will have a distance of 1
+ // two words that can be made identical by adding or removing one letter will have a distance of 1
  assertTrue(SimilarWords.distance("testX", "test") == 1);
  }
-
-
-
-
 }