working on the new search

FultonBrowne · Nov 23, 2019 · caac13d · caac13d
1 parent bb18819
commit caac13d
Show file tree

Hide file tree

Showing 2 changed files with 4 additions and 3 deletions.
diff --git a/src/main/java/com/andromeda/araserver/util/MsSql.kt b/src/main/java/com/andromeda/araserver/util/MsSql.kt
@@ -20,6 +20,7 @@ class MsSql {
         Class.forName("com.microsoft.sqlserver.jdbc.SQLServerDriver");
         var connection: Connection? = null
         val phrases = SortWords(keyWord = keyWord, mainVal = phrase).getTopics(parse = parse)
+        println(phrases.size)
         var link = "test"
         println(password)
         connection = DriverManager.getConnection(url)
@@ -30,10 +31,7 @@ class MsSql {
         {
             val dbLink = resultSet.getString("link")
             val dbWord = resultSet.getString("hotWord")
-            println(dbWord)
             for (i in phrases){
-                println("db word is $dbWord")
-                println("word is "+i.word)
                 if (i.word.startsWith(dbWord.replace(" ", ""))){
                     print("is true")
                     link = dbLink

diff --git a/src/main/java/com/andromeda/araserver/util/SortWords.kt b/src/main/java/com/andromeda/araserver/util/SortWords.kt
@@ -12,8 +12,10 @@ class SortWords(keyWord: KeyWord, mainVal: String) {
 
         var graph = key.getKeyWords(mainText,parse)?.get(0)
 
+
         var working = true
         if (graph != null) {
+            graph.show()
 
             while (working) {
                 when {
@@ -43,6 +45,7 @@ class SortWords(keyWord: KeyWord, mainVal: String) {
     private fun sortForNoun(graph: Parse): ArrayList<WordGraph> {
         val toReturn = ArrayList<WordGraph>()
         for (i in graph.children!!) {
+            print(i.coveredText+ " " + i.type)
             if (i.type == "NN" || i.type == "JJ") {
                 toReturn.add(WordGraph(i.coveredText, i.type))
             }