Databases
StackOverflow2013
Postsdbo
POJava Search Engine Debugging
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POJava Search Engine Debugging
    primarykey
    data
    text
    <p>I run through the entire code. I am able to enter a simple .txt file to search for a word. After it asks for a word, it returns</p> <p>Exception in thread "main" java.lang.ArrayIndexOutOfBoundsException: -48 at SearchEngine.main(SearchEngine.java:150)</p> <p>Line 150 is for (int j = 0; j</p> <p>Any help debugging?</p> <p>This is basic search engine program that should be able to search a .txt file for any word.</p> <p>Assignment link: <a href="http://cis-linux1.temple.edu/~yates/cis1068/sp12/homeworks/concordance/concordance.html" rel="nofollow">http://cis-linux1.temple.edu/~yates/cis1068/sp12/homeworks/concordance/concordance.html</a></p> <pre><code>import java.util.*; import java.io.*; public class SearchEngine { //Counts the number of words in the file public static int getNumberOfWords (File f) throws FileNotFoundException { int numWords = 0; Scanner scan = new Scanner(f); while (scan.hasNext()) { numWords++; scan.next(); } scan.close(); return numWords; } public static void readInWords (File input, String[] x) throws FileNotFoundException { Scanner scan = new Scanner(input); int i = 0; while (scan.hasNext() &amp;&amp; i &lt; x.length) { x[i] = scan.next(); i++; } scan.close(); } public static String[] getNumOfDistinctWords (String[] x) throws FileNotFoundException { HashSet&lt;String&gt; distinctWords = new HashSet&lt;String&gt;(); for(int i=0; i&lt;x.length; i++){ distinctWords.add(x[i]); } String[] distinctWordsArray = new String[distinctWords.size()]; int i = 0; for(String word : distinctWords){ distinctWordsArray[i] = word; i++; } return distinctWordsArray; } public static int getNumberOfLines (File input) throws FileNotFoundException { int numLines = 0; Scanner scan = new Scanner(input); while (scan.hasNextLine()) { numLines++; scan.nextLine(); } scan.close(); return numLines; } public static void readInLines (File input, String [] x) throws FileNotFoundException { Scanner scan = new Scanner(input); int i = 0; while (scan.hasNextLine() &amp;&amp; i&lt;x.length) { x[i] = scan.nextLine(); i++; } scan.close(); } public static void main(String [] args) { try { //gets file name System.out.println("Enter the name of the text file you wish to search"); Scanner kb = new Scanner(System.in); String fileName = kb.nextLine(); String TXT = ".txt"; if (!fileName.endsWith(TXT)) { fileName = fileName.concat(TXT); } File input = new File(fileName); //First part of creating index System.out.println("Creating vocabArray"); int NUM_WORDS = getNumberOfWords(input); //Output the number of words in the file System.out.println("Number of words is: " + NUM_WORDS); String[] allWordsArray = new String[NUM_WORDS]; readInWords(input, allWordsArray); Arrays.sort(allWordsArray); String[] distinctWordsArray = getNumOfDistinctWords(allWordsArray); //Output the number of distinct words System.out.println("Number of distinct words is: " + distinctWordsArray.length); System.out.println("Finished creating distinctWordsArray"); System.out.println("Creating concordanceArray"); int NUM_LINES = getNumberOfLines(input); String[] concordanceArray = new String[NUM_LINES]; readInLines(input, concordanceArray); System.out.println("Finished creating concordanceArray"); System.out.println("Creating invertedIndex"); int [][] invertedIndex = new int[distinctWordsArray.length][10]; int [] wordCountArray = new int[distinctWordsArray.length]; int lineNum = 0; while (lineNum &lt; concordanceArray.length) { Scanner scan = new Scanner(concordanceArray[lineNum]); while (scan.hasNext()) { //Find the position the word appears on the line, if word not found returns a number less than 0 int wordPos = Arrays.binarySearch(distinctWordsArray, scan.next()); if(wordPos &gt; -1){ wordCountArray[wordPos] += 1; } for(int i = 0; i &lt; invertedIndex.length; i++) { for(int j = 0; j &lt; invertedIndex[i].length; j++) { if (invertedIndex[i][j] == 0) { invertedIndex[i][j] = lineNum; break; } } } } lineNum++; } System.out.println("Finished creating invertedIndex"); System.out.println("Enter a word to be searched (type quit to exit program)"); Scanner keyboard = new Scanner(System.in); String searchWord = keyboard.next(); while (!searchWord.equals("quit")) { int counter = 0; int wordPos = Arrays.binarySearch(allWordsArray, searchWord); for (int j = 0; j&lt;invertedIndex[wordPos].length; j++) { if(invertedIndex[wordPos][j] != 0) { int number = invertedIndex[wordPos][j]; String printOut = concordanceArray[number]; System.out.print(number); System.out.print(" :"); System.out.println(printOut); } } } } catch (FileNotFoundException exception) { System.out.println("File Not Found"); } } //main } //class </code></pre>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USName is Nilay
    1. USuser1302023
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POJava Search Engine Debugging
      1. This table or related slice is empty.
      1. VTDownMod
    2. VO
      singulars
      1. POJava Search Engine Debugging
      1. This table or related slice is empty.
      1. VTDownMod
    1. COtry asking a question about it. what do you think ArrayIndexOutOfBoundsException means?
      singulars
      1. POJava Search Engine Debugging
      1. USJay P.
    2. COwhen will they teach unit testing in universities?
      singulars
      1. POJava Search Engine Debugging
      1. USJayan
    3. CODebuggin ? Really? - what is at line number 150 of your original code ?
      singulars
      1. POJava Search Engine Debugging
      1. USring bearer
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload