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

#include <objc/Object.h>

#include "graph.h"

int compare(const struct point* a, const struct point * b)
{
	if(a->y < b->y) {
		return -1;
	} else if(a->y > b->y) {
		return 1;
	}

	if(a->x < b->x) {
		return -1;
	} else if(a->x > b->x) {
		return 1;
	}
	return 0;
}

@implementation Graph

+ new
{
	self = [super new];
	return self;
}

- init
{
	graph = NULL;
	count = 0;
}

- free
{
	free(graph);
	return [super free];
}

- add: (int)Horiz: (int)Vert
{
	if(graph) {
		graph = realloc(graph,sizeof(graph[0]) * (count+1));
	} else {
		graph = malloc(sizeof(graph[0]));
	}

	graph[count].x = Horiz;
	graph[count].y = Vert;
	count++;
	return self;
}

/*
- draw
{
	int i;
	[self sort];
	for(i=0;i<count;i++) {
		printf("Y:%i X:%i\n",graph[i].y,graph[i].x);
	}
	return self;
}
*/

- draw
{
	int Print=0;
	int x, y, i;
	struct point p;
	[self sort];
	for(y=0;y<20;y++) {
		p.y = y;
		for(x=0;x<20;x++) {
			p.x = x;
			for(i=0;i<count;i++) {
				if(compare(&p,&graph[i])==0) {
					Print = 1;
					break;
				}
			}
			if(Print) {
				printf("X");
			} else {
				printf(" ");
			}
		}
		printf("\n");
	}
	return self;
}

- sort
{
	qsort(graph,count,sizeof(graph[0]),compare);
	return self;
}