<<<<<<< HEAD
/*
* @Author: klmp200
* @Date:   2016-12-10 01:32:50
* @Last Modified by:   klmp200
* @Last Modified time: 2016-12-10 21:08:25
*/
=======
/***
--- CellElemFunc ---
---Created by : Naej Doree ---
***/
>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84

#include <stdio.h>
#include <stdlib.h>
#include <CellElement.h>

<<<<<<< HEAD
cellElement * CreateCellElem(){
	cellElement * elem = NULL;
	elem = (cellElement*) malloc(sizeof(cellElement));
	
=======

cellElement * CreateCellElem(){
	cellElement * elem = NULL;
	elem = (cellElement*) malloc(sizeof(cellElement));

>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	if (elem == NULL){
		return NULL;
	}

	printf("---Created cellElement---\n");

	elem->value = true;
	elem->nextCol = NULL;
	elem->nextRow = NULL;

<<<<<<< HEAD
	
	return elem;	
=======

	return elem;
>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
}

void freeCellElem(cellElement * elem){
	free(elem);
	elem = NULL;
}

int AddNextCol(cellElement* tree){

	cellElement * elem = NULL;
	elem = (cellElement*) malloc(sizeof(cellElement));
<<<<<<< HEAD
	
=======

>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	if (elem == NULL){
		return -1;
	}

	printf("---insertNextCol---\n");

	elem->value = true;
	elem->nextCol = NULL;
	elem->nextRow = NULL;

	if (tree->nextCol == NULL){
		tree->nextCol = elem;
	}else{
		return -2;
	}
<<<<<<< HEAD
	
=======

>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	return 1;
}


int AddNextRow(cellElement* tree){

	cellElement * elem = NULL;
	elem = (cellElement*) malloc(sizeof(cellElement));
<<<<<<< HEAD
	
=======

>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	if (elem == NULL){
		return -1;
	}

	printf("---insertNextRow---\n");

	elem->value = true;
	elem->nextRow = NULL;
	elem->nextRow = NULL;
	if (tree->nextRow == NULL){
		tree->nextRow = elem;
	}else{
		return -2;
	}
	return 1;
}

void removeNextCol(cellElement* tree){
	printf("---removeNextCol---\n");

	if (tree->nextCol != NULL){
		cellElement * elem = tree->nextCol;
		free(elem);
		elem = NULL;
		tree->nextCol = NULL;
<<<<<<< HEAD
	
=======
>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	}

}

void removeNextRow(cellElement* tree){
	printf("---removeNextRow---\n");

	if (tree->nextRow != NULL){
		cellElement* elem = tree->nextRow;
		free(elem);
		elem =NULL;
		tree->nextRow = NULL;
<<<<<<< HEAD
	
=======
>>>>>>> 7e928547972ebd5897e1f416cb7a9a885479ed84
	}

}
void recursivePrint(cellElement * tree){
	if (tree != NULL){
		printf("Elem : x: %d  y: %d \n",tree->colIndex,tree->rowIndex);
		if (tree->nextCol != NULL){
			recursivePrint(tree->nextCol);
		}
		if (tree->nextRow != NULL){
			recursivePrint(tree->nextRow);
		}
		if (tree->nextCol == NULL && tree->nextCol == NULL){
			printf("leaf\n");
		}

	}
}

void FreeCellElement(cellElement* element) {
	if (element != NULL){
		free(element);
	}
}