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


i have been staring @ thing quiet time , don't see mistake... extremely grateful if point me in right direction. thanks!

public class learninghash {

public static void main(string[] args)  throws ioexception {     java.io.file file = new java.io.file(args[0]); //read data file     scanner input = new scanner(file);     //++++++++++++++++++++++++++++++++++++++++++++++++++++++     int max = 13; // array size     int j = 0;                          // index 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 space , splits              if(breaks.length == 2) // if equal 2 store i.e "eco 32" become "eco" , "32" therefore ==2             {                temp = hashing(breaks[0], max); // creating hash key                 loc = (int)temp; // converting long int                  if(maindata[loc] != null)                 {                     while(maindata[loc] != null)                     {                         system.out.println("collision @ [" + loc + "] data item : [" + maindata[loc] + "] ");                         loc++;                         if(loc > max)                         {                             loc = 0;                         }                     }                 }                 maindata[loc] = (breaks[0]+" "+breaks[1]); // recombines i.e "moss space 25" , stores in data location                 system.out.println("data item[" + maindata[loc] + "] stored in index [" + loc + "] of array.");             }             else // i.e "eco' without "32" belongs criteria             {                 temp = hashing(breaks[0], max); // creating hash key                 loc = (int)temp; // converting long 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] + "] not found. ");}                 else                 {                     system.out.println(" data item [" + breaks[0]+ "] found @ location ["+ loc+"] .");                 }             }      }     input.close(); }

i think this:

inputdata[in] = string.valueof(input.hasnextline());

should replaced with

inputdata[in] = string.valueof(input.nextline());

then read out data , not ask if next line available , read boolean out...also think makes infinite loop ;)


Comments

Post a Comment

Popular posts from this blog

html - Outlook 2010 Anchor (url/address/link) -

i'm trying link specific pdf page msoutlook'10 or msword'10, #page=... anchor particularly useful , works fine elsewhere. unfortunately when click [ctr-k] in outlook or winword, links re-formatted assuming unc path. pdf file located on shared drive. using "file:" prefix links open pdf in adobe reader (outside of browser), , "http:" open inside browser. issue seem need open in browser "file:" prefix in order anchor work. know anchors work inside browser. outlook uses windows/explorer default program (based on file extension) seems open in adobe reader neglecting anchor. is aware of solution, link specific page or bookmark of shared-pdf ms outlook and/or winword link? common references: mailermailer.com/...anchor-tags-html-emails campaignmonitor.com/...anchor-links-in-email-newsletters/ stackoverflow.com/...anchor-in-pdf-document
Read more

javascript - Why does running this loop 9 times take 100x longer than running it 8 times? -

consider code: test = function() { } t = new test(); (var = 0; < 8; i++) { result = t instanceof test; } if change number of iterations 8 9 , loop take 100 times longer complete in latest version of firefox (41.0.1). tested on 2 different pcs , magic limit 8. here jsperf test used: http://jsperf.com/instanceof-8-times-vs-9-times does have idea why might happen? seems specific instanceof . not happen if else object, example check property. note: filed bugzilla bug this. jan de mooij mozilla team has posted details in bugzilla thread . here's simplistic interpretation of highly technical answers: in i < 8 case, firefox smart enough hoist result = t instanceof test; statement out of loop (according tests, doesn't seem omit altogether). in i < 9 case, apparently doesn't optimization . why? reason not clear, related fact 9 iterations threshold above function considered "hot" enough run through jit compiler. i < 8 cas...
Read more

Getting gateway time-out Rails app with Nginx + Puma running on Digital Ocean -

following this guide setup app on digital ocean droplet, not working. site not loading , it's throwing: "gateway time-out". the puma server works, since ps aux | grep puma prints: root 15878 0.0 0.4 376832 2168 ? sl 12:50 0:00 puma 2.13.4 (unix:///var/www/myapp/shared/tmp/sockets/myapp-puma.sock) [20150930164940] root 15881 0.0 0.7 903676 3692 ? sl 12:50 0:06 puma: cluster worker 0: 15878 [20150930164940] root 24654 0.0 0.1 11748 916 pts/2 s+ 18:00 0:00 grep --color=auto puma my nginx config: user root; worker_processes 1; events { worker_connections 1024; } http { upstream puma { server unix:///var/www/myapp/shared/tmp/sockets/myapp-puma.sock; } server { listen 80; server_name myapp.com; root /var/www/myapp/current/public; access_log /var/www/myapp/current/log/access.log; error_log /...
Read more