[DL-Learner SVN] SF.net SVN: dl-learner:[4085] trunk/components-core/src/main/java/org/ dllearner/algorithms/isle/index/SimpleEntityCandidatesTrie.java

[<and...@us...>]

Revision: 4085
          http://sourceforge.net/p/dl-learner/code/4085
Author:   andremelo
Date:     2013-09-05 08:42:59 +0000 (Thu, 05 Sep 2013)
Log Message:
-----------
Adding printTrie

Modified Paths:
--------------
    trunk/components-core/src/main/java/org/dllearner/algorithms/isle/index/SimpleEntityCandidatesTrie.java

Modified: trunk/components-core/src/main/java/org/dllearner/algorithms/isle/index/SimpleEntityCandidatesTrie.java
===================================================================
--- trunk/components-core/src/main/java/org/dllearner/algorithms/isle/index/SimpleEntityCandidatesTrie.java	2013-09-05 08:32:57 UTC (rev 4084)
+++ trunk/components-core/src/main/java/org/dllearner/algorithms/isle/index/SimpleEntityCandidatesTrie.java	2013-09-05 08:42:59 UTC (rev 4085)
@@ -1,6 +1,10 @@
 package org.dllearner.algorithms.isle.index;
 
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
 import java.util.HashSet;
+import java.util.List;
 import java.util.Map;
 import java.util.Set;
 
@@ -58,5 +62,18 @@
 		CharSequence match = trie.getLongestMatch(s);
 		return (match!=null) ? trie.getLongestMatch(s).toString() : null;
 	}
+	
+	public void printTrie() {
+		System.out.println("Printing tree content:");
+		Map<String,Set<Entity>> trieMap = trie.toMap();
+		List<String> termsList = new ArrayList(trieMap.keySet());
+		Collections.sort(termsList);
+		for (String key : termsList) {
+			System.out.println(key);
+			for (Entity candidate: trieMap.get(key)) {
+				System.out.println("\t"+candidate);
+			}
+		}
+	}
 
 }

This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.