#include <map.h>
#include <cmath>
#include <cstdlib>
#include <algorithm>

// g++ -shared anselme.cpp -o anselme.dll -I../src

extern "C" void generate(Map *mapPtr)
{
	Map &map = *mapPtr;
	int w = map.getWidth();
	int h = map.getHeight();
	int n = map.getNbTeams();
	int i,j, k;
	int r = (w/n < h ? w/n : h)/2;
	int *teamCoord = new int[n*2];
	
	for(i=0; i<n; i++)
		map.team(i) = Coord((w/(n*2))*(1+i*2), h/2);
	
	//génération de la carte
	for (i=0;i<w;i++){
		for(j=0;j<h;j++){
			if (i == 0 || j == 0 || i == w-1 || j == h-1 || n == 0){
				map[i][j].type = Pixel::BEDROCK;
			}else{
				int d = std::max(w, h);
				for(k=0; k<n; k++){
					d = std::min(d, map.team(k).dist(i, j));
					if(!d)
						break;
				}
				if(d == 0){
					map[i][j].type = Pixel::SPAWN;
					map[i][j].data.nbRes = k;
				}else{
					int l = (d-20)+(rand()%40);
					if(l > r+15) // mountain
						map[i][j].type = rand()%8 ? Pixel::ROCK : Pixel::IRON_ORE;
					else if(l < r-15) // plains
						map[i][j].type = rand()%15 ? Pixel::GRASS : Pixel::BERRIES;
					else // forest
					{
						l = rand()%10;
						map[i][j].type = l > 5 ? Pixel::TREE : l ? Pixel::GRASS : Pixel::BERRIES;
					}
				}
			}
		}
	}
}