gabo-tor / gocellular Goto Github PK

for i, c := range board {
    if i > 0 && i < SIZE-1 {
//becomes
for i := 1; i<SIZE-1;i++ {
    c := board[i]
    // same suggestion for inner loops

if Neighbour == 1 {
// extract contents of `if` to a function countNeighborsMoore?

type game struct {
    board tensor3 // tensor3 type with contiguous allocation, stride mem access if you want to needlessly optimize, if not already existing [][][]uint8 is good enough
    rules int // Moore==1, neumann==0 
}

//suggestion for tensor3
type tensor3 struct {
   data []uint8
   r, c, d int //row, column, depth
   // dynamic stride completely useless if no resizing going on
   //stride1 int 
   //stride2 int
}

// set assigns v to element at position (i,j,k) of 3D tensor
func (t tensor3) set(i, j, k int, v uint8) {
    // row major, depth minor. not sure if this is correct though
    t.data[k + j*t.d + i*t.d*t.c] = v // 🤷
}

	ticker := time.NewTicker((1000 / FRECUENCY) * time.Millisecond)
	go func() {
		for range ticker.C {
			// use close(ticker.C) to terminate this loop
			update(board)
		}
	}()