我正在尝试在 java 中创建一个半有效的散列 table 并最终陷入无限循环

Question

我已经安静地盯着这个东西看了一段时间了，我只是没有看到我的错误......如果有人能指出我正确的方向，我将非常感激。谢谢！

public class learningHash {

public static void main(String[] args)  throws IOException
{
    java.io.File file = new java.io.File(args[0]); //Read the data from the file
    Scanner input = new Scanner(file);
    //++++++++++++++++++++++++++++++++++++++++++++++++++++++
    int max = 13; // array size
    int j = 0;                          // index for hash keys
    String[] mainData = new String[max];     // items array
    String[] inputData = new String[max];   // temp array
    int in = 0;                              // needed variables

    long temp;
    int loc;
    //++++++++++++++++++++++++++++++++++++++++++++++++++++++

        while (input.hasNextLine()) {  // read file until none left

            inputData[in] = String.valueOf(input.hasNextLine());

            String[] breaks =  inputData[in].split(" "); // checks for space and splits

            if(breaks.length == 2) // if equal 2 store i.e "eco 32" will become "eco" and "32" therefore ==2
            {
               temp = hashing(breaks[0], max); // creating a hash key
                loc = (int)temp; // converting from long to int

                if(mainData[loc] != null)
                {
                    while(mainData[loc] != null)
                    {
                        System.out.println("Collision at [" + loc + "] with Data Item : [" + mainData[loc] + "] ");
                        loc++;
                        if(loc > max)
                        {
                            loc = 0;
                        }
                    }
                }
                mainData[loc] = (breaks[0]+" "+breaks[1]); // recombines i.e "moss space 25" and stores it in data location
                System.out.println("Data Item[" + mainData[loc] + "] Stored in index [" + loc + "] of array.");
            }
            else // i.e "eco' without "32" belongs into this criteria
            {
                temp = hashing(breaks[0], max); // creating a hash key
                loc = (int)temp; // converting from long to int               
                while((mainData[loc] != breaks[0]) && (mainData[loc] != null) )
                {
                    loc++;
                    if(loc > max)
                        loc = 0;
                }
                if(mainData[loc] == null)
                {System.out.println("ERROR Data item ["+ breaks[0] + "] was NOT found. ");}
                else
                {
                    System.out.println(" Data item [" + breaks[0]+ "] was found at location ["+ loc+"] .");
                }
            }
     }
    input.close();
}

Answer 1

我认为：

inputData[in] = String.valueOf(input.hasNextLine());

应替换为

inputData[in] = String.valueOf(input.nextLine());

然后你会读出数据，不仅会询问下一行是否可用，还会读出布尔值……而且我认为这会形成一个无限循环；）

我正在尝试在 java 中创建一个半有效的散列 table 并最终陷入无限循环

I am trying to make a semi-efficient hash table in java and am ending up in an infinite loop

java

hash

infinite-loop