Grid.h

#pragma once

#include <SDL.h>
#include <iostream>
#include <vector>
#include <math.h>

using namespace std;

/* one pixel on the grid
current represents what the value of the pixel is currently
sync represents what the pixel will be after a grid evaluation
in this rework we want the pixel to be as light as possible
the grid will handle these changes and drawing to reduce weight */
struct Pixel {
	bool current = 0;
	bool sync = 0;
	Pixel() {
		current = sync = 0;
	}
};

class Grid {
protected:
	int gridSize; // grid will be square 
	int pixelSize; //size of a displayed pixel of the grid

	Pixel ***pixel; // 2d array of pointers
	void freeGrid(); //deallocate pixel array

	SDL_Thread *riser;
	SDL_Thread *faller;

	int safeN(int n); //modulo math to ensure n is in the array

	//single threaded solution, smaller grids
	void planMove();//sets the sync bit
	void updateGrid();//cp sync bit to current bit
	int updateThreaded();

	//double threaded solution faster for exceptionally large grids
	static int startRiserPlan(void *self);
	static int startRiserUpdate(void *self);
	static int startFallerPlan(void *self);
	static int startFallerUpdate(void *self);

	int neighbors(int x, int y);
	bool pixelCheck(int x, int y); //check nullptrs

public:
	Grid(int gridSize = 4, int pixelSize = 2);
	Grid(const Grid &g);
	~Grid();
	void draw(SDL_Renderer *ren);
	void update(bool threaded = false);

	size_t me();
	bool isEmpty();
	int count();
	void setState(int x, int y, bool val);
	void setState(vector<pair<int, int> > sc);
	void clear();
	vector<pair<int, int> > getCoords();
	void printCoords();
	bool isAlive(int x, int y);

	bool operator==(Grid g);

};