19 this->
queue[0] = *(
new std::deque<Point>);
20 this->
queue[1] = *(
new std::deque<Point>);
30 if(p.
x >= 0 && p.
y >= 0)
32 this->
queue[0].push_back(p);
45 if(p.
x >= 0 && p.
y >= 0)
47 this->
queue[1].push_back(p);
59 for(
auto it =
queue[0].begin(); it !=
queue[0].end(); ++it)
75 for(
auto it =
queue[1].begin(); it !=
queue[1].end(); ++it)
91 *cpChange = this->
queue[0];
100 *cpChange = this->
queue[1];
void getRmQueue(std::deque< Point > *cpChange)
method to get a copy of removal array
bool addPoint(Point p)
adds Point to addition array if it fits the criteria
void initQueue()
Initializes change array, by resetting it.
bool rmPoint(Point p)
adds Point to removal array if it fits the criteria
Definitions and prototypes for Change class.
void getAddQueue(std::deque< Point > *cpChange)
method to get a copy of addition array
bool inAddQueue(Point p)
Check if Points is in the addition queue.
bool inRmQueue(Point p)
Check if the Point is in the remove queue.
std::deque< Point > queue[2]
Coordinates and style of the cell in console window.