Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>I've managed to be more concise and more clear but it still won't run... I just need a push over the edge and I'm home free. I've dumped so many wasted hours into this project:</p> <pre><code>public ArrayList&lt;Integer&gt; needAtLoc(int r, int c){ int bc=c/3;//the column within the SudokuBoard int blc; /*The two posibilities for the column within each SudokuBlock:*/ if(c&gt;=0 &amp;&amp; c&lt;3) { blc=c; } else { blc=c%3; } int br=r/3; //the row within the SudokuBoard int blr; /*The two possiblities for the row within each SudokuBlock:*/ if(r&gt;=0 &amp;&amp; r&lt;3) { blr=r; } else { blr=r%3; } ArrayList&lt;Integer&gt; needR = new ArrayList&lt;Integer&gt;(); needR=checkR(r);// needR.trimToSize(); System.out.println(needR);////////////// ArrayList&lt;Integer&gt; needC=new ArrayList&lt;Integer&gt;(); needC=checkC(c); needC.trimToSize(); System.out.println(needC);///////////// ArrayList&lt;Integer&gt; needBl=new ArrayList&lt;Integer&gt;(); needBl=this.board[br][bc].updateMissing(); //that method updates and returns an ArrayList needBl.trimToSize(); ArrayList&lt;Integer&gt; poss=new ArrayList&lt;Integer&gt;(); poss.clear(); for(Integer e: needBl){ if(needC.contains(e) &amp;&amp; needR.contains(e)){ poss.add(e); } } return poss; } //this method throws the StackOverflowError public void play(int r, int c){ int bc=c/3; //the column within the SudokuBoard int blc; /*The two posibilities for the column within each SudokuBlock:*/ if(c&gt;=0 &amp;&amp; c&lt;3) { blc=c; } else { blc=c%3; } int br=r/3; //the row within the SudokuBoard int blr; /*The two possiblities for the row within each SudokuBlock:*/ if(r&gt;=0 &amp;&amp; r&lt;3) { blr=r; } else { blr=r%3; } if(needAtLoc(r,c).size()==9){ int num=1+generator.nextInt(9); this.board[br][bc].setValue(blr, blc, num); if(c&lt;8){ System.out.println(this);/////////////// play(r, c+1); } else{ play(r+1, 0); } } else{ if(needAtLoc(r,c).size()==0){ //no possible moves if(c&gt;0){ bc=(c-1)/3; if(c&gt;0 &amp;&amp; c&lt;4) { blc=c-1; } else { blc = (c-1) % 3; } this.board[br][bc].setValue(blr, blc, 0); play(r, c-1); } else{ blc=0; bc=0; if(r==0){ blr=0; br=0; this.board[br][bc].setValue(blr, blc, 0); play(r,c); } else{ br=(r-1)/3; if(r&gt;0 &amp;&amp; r&lt;4) {blr=r-1;} else {blr=(r-1)%3;} this.board[br][bc].setValue(blr, blc, 0); play(r-1, 8); } } } else{//if there are possible moves int num=needAtLoc(r,c).remove(generator.nextInt(needAtLoc(r,c).size())); this.board[br][bc].setValue(blr, blc, num); System.out.println(this);////////////// if(r==8 &amp;&amp; c==8){ return; } else{ if(c&lt;8){ play(r, c+1); } else{ play(r+1, 0); } } } } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POHow do I fix this stack overflow error?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USBelphegor
    1. USuser233542
    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. This table or related slice is empty.
    1. This table or related slice is empty.
    1. COI find that sometimes you can gain alot by starting again (up to you though) I think your recursion call should only need occur once and that it would be simpler if you use a single index variable rather than two (`r` and `c`). Use one and work out the `r` and `c` from it. Recursive methods usually take the form: am I done yet? if yes then return. if not do something, recurse, possibly do something else and return. Try to make it this simple - otherwise you'll continue to get bitten.
      singulars
      1. PO
      1. USTom Duckering
    2. COthanks, you guys are really helpful, I wish I wasn't in such a stressful mood because then this would be an enjoyable enlightening experience. Maybe i'll come back when I start modeling with FORTRAN
      singulars
      1. PO
      1. USuser233542
 

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