guillaume.bonabau
/
OOP_F1_Project
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

le code de gpt mais joli

This commit is contained in:
Guillaume BONABAU 2024-05-08 09:54:04 +02:00
parent d6b7038167
commit 83d3811a17
1 changed files with 5 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
src/backend/Table.java
View File

@ -59,9 +59,7 @@ public class Table {
//TODO-INPROGRESS : count near (xy) -> return how many cells around this cell //TODO-INPROGRESS : count near (xy) -> return how many cells around this cell
// NEED A STRONG OPTIMISATION // NEED A STRONG OPTIMISATION
public int countNear(int row, int column){ public int countNear(int row, int column){
int numRows = this.width; int count = 0;
int numColumns = this.height;
// Define the relative positions of neighboring cells (assuming 8 neighbors) // Define the relative positions of neighboring cells (assuming 8 neighbors)
int[][] neighbors = { int[][] neighbors = {
{-1, -1}, {-1, 0}, {-1, 1}, {-1, -1}, {-1, 0}, {-1, 1},
@ -69,13 +67,12 @@ public class Table {
{1, -1}, {1, 0}, {1, 1} {1, -1}, {1, 0}, {1, 1}
}; };
int count = 0;
for (int[] neighbor : neighbors) { for (int[] neighbor : neighbors) {
int newRow = row + neighbor[0]; int x = row + neighbor[0];
int newColumn = column + neighbor[1]; int y = column + neighbor[1];
// Check if the new indices are within the table boundaries // Check if the new indices are within the table boundaries
if (newRow >= 0 && newRow < numRows && newColumn >= 0 && newColumn < numColumns) { if (x >= 0 && x < this.width && y >= 0 && y < this.height) {
count+= this.getCell(newRow, newColumn).getValue(); count+= this.getCell(x, y).getValue();
} }
} }