Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>You need a generic function that work for every direction. That is, to the current position you calculate the position of your neightbors by adding an <code>offsetx</code> and <code>offsety</code> that are in range <code>[-1,1]</code>. Look at this code that do pretty much what you want:</p> <pre><code>//This is your generic-direction function public static boolean check(int row, int col, String word, char[][] puzzle, int offsetx, int offsety) //start with the current position int x = row; int y = col; for (int i = 0; i &lt; word.lenth(); i++){ //Is not equal if (puzzle[x][y] != word.charAt(i)) return false; //Calculate the next position x += offsetx; y += offsety; //check the boundaries, if we go out then we didn't find the word; if (x &lt; 0 || x &gt;= puzzle.length || y &lt; 0 || y &gt;= puzzle[x].length) return false; } return true; } </code></pre> <p>And this is how we call for each direction;</p> <pre><code>//check right if(check(row, col, word, puzzle, 1, 0)) return true; //check left if(check(row, col, word, puzzle, -1, 0)) return true; //check top if(check(row, col, word, puzzle, 0, -1)) return true; ... </code></pre> <p>But an easier way is to define the offset in an array, like this</p> <pre><code>//These are the offset you add to the current position int [] movx ={-1, -1, -1, 0, 0, 1, 1, 1}; int [] movy ={-1, 0, 1, -1, 1, -1, 0, 1}; //this variable will hold if we found or not the string in the puzzle boolean found = false; //check all directions for (int i = 0; i &lt; 8; i++){ //found the string, change the flag 'found' and break if(check(row, col, word, puzzle, movx[i], movy[i])){ found = true; break; } } //string not found if (!found){ System.out.println("String not found"); } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POHow to check if counter is out of bounds
      singulars
      1. PTQuestion
    1. PTAnswer
    1. USomainegra
    1. USomainegra
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POHow to check if counter is out of bounds
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COThank you! So I was able to use what you gave me and I got it to work but there's one glitch that I just can't seem to figure out. I can't figure out where to put a print statement saying that a word cannot be found if it failed all the searches. If I put it anywhere in the loops it just repeats over and over.
      singulars
      1. PO
      1. USDrieke
    2. COHello @Drieke I update the answer check if you get it.
      singulars
      1. PO
      1. USomainegra
    3. COThanks again! I was able to implement it and make it work! Now I just have to figure out why my loop is skipping some words.
      singulars
      1. PO
      1. USDrieke
 

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